// turmak-_-
#include<bits/stdc++.h>
#define all(v) v.begin(),v.end()
#define sz(a) a.size()
#define nl "\n"
#define IOI return 0;
#define pb push_back
#define ppb pop_back()
#define ll long long
#define ull unsigned long long
#define ld long double
#define IOS ios_base :: sync_with_stdio(NULL); cin.tie(0); cout.tie(0);
#define pii pair<int,int>
#define X first
#define Y second
using namespace std;
const int N = (int)1e5 + 7 ;
const ll MOD = (ll)998244353;
const ll INF = (ll)1e18 + 7;
const int inf = (int)1e9 + 7;
pii dx[] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
void solve() {
int n,m,k;
cin>>n>>m>>k;
for(int i=1; i<=k; ++i) {
int x,y;
cin>>x>>y;
}
int h = n*(n+1)/2;
cout<<rand() % h;
}
int main() {
IOS
srand(time(0));
//freopen("cinema.in", "r", stdin);
//freopen("cinema.out", "w", stdout);
int tt=1;
//cin>>tt;
while(tt--) {
solve();
}
IOI
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
2 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
3 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
4 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
5 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
6 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
7 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
8 |
Incorrect |
0 ms |
364 KB |
Output isn't correct |
9 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
10 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
11 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
12 |
Incorrect |
1 ms |
308 KB |
Output isn't correct |
13 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
14 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
15 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
16 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
17 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
18 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
19 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
20 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
21 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
22 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
23 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
24 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
25 |
Incorrect |
2 ms |
364 KB |
Output isn't correct |
26 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
27 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
28 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
29 |
Incorrect |
2 ms |
364 KB |
Output isn't correct |
30 |
Incorrect |
2 ms |
364 KB |
Output isn't correct |
31 |
Incorrect |
8 ms |
392 KB |
Output isn't correct |
32 |
Incorrect |
2 ms |
364 KB |
Output isn't correct |
33 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
34 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
35 |
Incorrect |
17 ms |
364 KB |
Output isn't correct |
36 |
Incorrect |
14 ms |
364 KB |
Output isn't correct |
37 |
Incorrect |
12 ms |
364 KB |
Output isn't correct |
38 |
Incorrect |
16 ms |
268 KB |
Output isn't correct |
39 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |
40 |
Incorrect |
2 ms |
364 KB |
Output isn't correct |
41 |
Incorrect |
5 ms |
364 KB |
Output isn't correct |
42 |
Incorrect |
7 ms |
364 KB |
Output isn't correct |
43 |
Incorrect |
10 ms |
364 KB |
Output isn't correct |
44 |
Incorrect |
16 ms |
364 KB |
Output isn't correct |
45 |
Incorrect |
6 ms |
492 KB |
Output isn't correct |
46 |
Incorrect |
20 ms |
364 KB |
Output isn't correct |
47 |
Incorrect |
23 ms |
364 KB |
Output isn't correct |
48 |
Incorrect |
16 ms |
364 KB |
Output isn't correct |
49 |
Incorrect |
24 ms |
392 KB |
Output isn't correct |
50 |
Incorrect |
1 ms |
364 KB |
Output isn't correct |