Submission #92883

#TimeUsernameProblemLanguageResultExecution timeMemory
92883MakhsudChessboard (IZhO18_chessboard)C++17
0 / 100
73 ms376 KiB
#include <bits/stdc++.h> #define ll long long using namespace std; ll n, k, x; ll xx1, yy1, xx2, yy2; vector <ll> d; void fil() { } int main() { cin >> n >> k; for ( int i = 1; i <= k; i ++ ) { cin >> xx1 >> yy1 >> xx2 >> yy2; } for ( int i = n-1; i >= 1; i -- ){ if ( n % i == 0 ) { x = i; break; } } if ( x == 1 ) cout << ( n * n ) / 2; else cout << (x*x) * ( (x*x) / 2 ); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...