제출 #137826

#제출 시각아이디문제언어결과실행 시간메모리
137826vardan__02Chessboard (IZhO18_chessboard)C++14
8 / 100
4 ms504 KiB
#include <iostream> #include <fstream> #include <algorithm> #include <cstring> #include <string> #include <vector> #include <cstdio> #include <queue> #include <deque> #include <stack> #include <cmath> #include <list> #include <set> #include <map> using namespace std; typedef long long ll; #define MP make_pair #define PB push_back ll n,k,p,x=1,u,ans,color[105],i,j,qanak[105]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin>>n>>k; x=n; for(i=2;i<=n;i++) { if(n%i==0) { while(n%i==0) { qanak[i]++; n/=i; } } } for(i=x;i>=2;i--) { if(qanak[i]!=0) { u=i; break; } } x/=u; ans=u*u/2; ans=ans*x*x; x*=u; for(i=2;i<=x;i++) { if(qanak[i]!=0) { n=i; break; } } x/=n; n=n*n/2; ans=min(ans,n*x*x); cout<<ans<<endl; 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...