#include <bits/stdc++.h>
#define gc getchar
#define rep(i, a, b) for(int i=a;i<=b;i++)
#define rep2(i, a, b) for(int i=a;i>=b;--i)
#define wipe(a, b) memset(a, b, sizeof a);
#define pb push_back
#define ff first
#define ss second
using namespace std;
typedef pair<int, int> pii;
inline int scan(){
int n=0, x=gc(), s=1;
for(;x<'0'||x>'9';x=gc()) if(x=='-') s=-1;
for(;x>='0'&&x<='9';x=gc()) n = 10*n + x - '0';
return n*s;
}
int gcd(int a, int b){
return (b?gcd(b, a%b):a);
}
int main(){
ios::sync_with_stdio(false), cin.tie(0);
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
2 ms |
256 KB |
Output isn't correct |
2 |
Incorrect |
2 ms |
500 KB |
Output isn't correct |
3 |
Incorrect |
2 ms |
500 KB |
Output isn't correct |
4 |
Incorrect |
2 ms |
500 KB |
Output isn't correct |
5 |
Incorrect |
2 ms |
500 KB |
Output isn't correct |
6 |
Incorrect |
2 ms |
528 KB |
Output isn't correct |
7 |
Incorrect |
2 ms |
528 KB |
Output isn't correct |
8 |
Incorrect |
2 ms |
528 KB |
Output isn't correct |
9 |
Incorrect |
2 ms |
528 KB |
Output isn't correct |
10 |
Incorrect |
2 ms |
544 KB |
Output isn't correct |
11 |
Incorrect |
2 ms |
544 KB |
Output isn't correct |
12 |
Incorrect |
2 ms |
672 KB |
Output isn't correct |
13 |
Incorrect |
4 ms |
672 KB |
Output isn't correct |
14 |
Incorrect |
2 ms |
672 KB |
Output isn't correct |
15 |
Incorrect |
2 ms |
672 KB |
Output isn't correct |
16 |
Incorrect |
2 ms |
672 KB |
Output isn't correct |
17 |
Incorrect |
2 ms |
672 KB |
Output isn't correct |
18 |
Incorrect |
2 ms |
672 KB |
Output isn't correct |
19 |
Incorrect |
2 ms |
672 KB |
Output isn't correct |
20 |
Incorrect |
2 ms |
672 KB |
Output isn't correct |