# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
167767 | abil | Chessboard (IZhO18_chessboard) | C++14 | 2 ms | 376 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 fr first
#define sc second
#define pb push_back
#define mk make_pair
#define all(s) s.begin(),s.end()
//#define int long long
using namespace std;
const int N = (1e6 + 12);
const int mod = (1e9 + 7);
const int INF = (0x3f3f3f3f);
int ans = 1e9;
int n, k;
void calc(int div){
int x = n / div, cnt = 0;
if(x & 1){
cnt += div * div * ((x + 1) / 2) * ((x + 1) / 2);
cnt += div * div * (x / 2) * (x / 2);
}
else{
cnt += div * div * (x / 2) * x;
}
ans = min({ans, cnt, n * n - cnt});
}
main()
{
cin >> n >> k;
ans = n * n / 2;
for(int i = 2;i < n; i++){
if(n % i == 0){
calc(i);
}
}
cout << ans;
}
Compilation message (stderr)
# | 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... |