Submission #490787

#TimeUsernameProblemLanguageResultExecution timeMemory
490787infertechno2Chessboard (IZhO18_chessboard)C++17
8 / 100
22 ms3708 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; const ll Size=1e5+1; class point2d{ public: ll x,y; }; point2d top[Size],bot[Size]; void solve(){ ll n,k; cin>>n>>k; for(ll i=0;i<k;i++){ cin>>top[i].y>>top[i].x>>bot[i].y>>bot[i].x; } for(ll i=n/2;i>=1;i--){ if(n%i==0 and (n/i)%2==1){ cout<<((n/i/2)*(n/i/2+1)*i*i)*2<<endl; return; } } cout<<(n*n)/2<<endl; } int main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); ll t=1; while(t--){ solve(); } return 0; }
#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...