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;
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 {
if ( n % 2 == 1 ) {
cout << ( d*d ) * ((n/d)+1);
}
else {
cout << (d*d) * (n/d);
}
}
}
# | 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... |