제출 #92939

#제출 시각아이디문제언어결과실행 시간메모리
92939MakhsudChessboard (IZhO18_chessboard)C++17
0 / 100
74 ms380 KiB
#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 + 1 ) / del ) / 2 ); } } return ans; } int main() { cin >> n >> k; for ( int i = 1; i <= k; i ++ ) { cin >> x >> y >> xx >> yy; } for ( int i = 1; i < n; i ++ ) { if ( n % i == 0 ) { mn = min ( mn, ch(i) ); } } cout << mn; }
#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...