QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #383701 | #6747. Permutation | Teiosama# | TL | 0ms | 0kb | C++17 | 153b | 2024-04-09 16:51:59 | 2024-04-09 16:51:59 |
answer
#include<bits/stdc++.h>
#include<unordered_map>
#include<list>
using namespace std;
int main()
{for(int i = 1;i<1e10;i++)
printf("wwr\n");
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Time Limit Exceeded
input:
3
output:
wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr wwr ...