# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
92945 | Makhsud | Chessboard (IZhO18_chessboard) | C++17 | 107 ms | 2424 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll n, k, x, y, xx, yy;
ll d, mn = INT_MAX;
ll ch ( ll del ) {
ll ans = 0;
if ( del == 1 ) {
return (n*n)/2;
}
for ( int i = 1; i <= (n/del); i ++ ) {
if ( i % 2 == 1 ) {
ans += (del*del) * ( (n/del) / 2 );
}
else {
ans += (del*del) * ( ( ( n/del )+1) / 2 );
}
}
return ans;
}
ll a[5][5];
void subt2()
{
for ( int i = 1; i <= k; i ++ ) {
cin >> x >> y >> xx >> yy;
a[x%2][y%2]++;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |