#include <bits/stdc++.h>
#define ll long long
ll n, k, x, y, xx, yy;
ll d;
using namespace std;
int main()
{
cin >> n >> k;
for ( int i = 1; i <= k; i ++ )
cin >> x >> y >> xx >> yy;
for ( int i = n-1; i >= 1; i -- ) {
if ( n % i == 0 ) {
d = i;
break;
}
}
if ( d == 1 ) {
cout << (n*n) / 2;
}
else {
ll cnt = 0;
bool ch = false;
for ( int i = 1; i <= n; i += d ) {
ch = !ch;
if ( ch ) {
cnt += ( n / d ) / 2;
}
else {
cnt += ( n / d + 1 ) / 2;
}
}
cout << cnt * (d*d);
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
256 KB |
Output is correct |
2 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
74 ms |
376 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
292 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
2 ms |
292 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
74 ms |
376 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
256 KB |
Output is correct |
2 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |