Submission #342612

#TimeUsernameProblemLanguageResultExecution timeMemory
342612koketsuChessboard (IZhO18_chessboard)C++14
8 / 100
1 ms492 KiB
#include <bits/stdc++.h> #define pb push_back #define LL long long #define Kultivator ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); using namespace std; const LL Mxn = 1e6 + 7; const LL Mod = 1e9 + 7; const LL Inf = 1e14 + 7; int Get(int N){ int Ans = Mxn; for(int i = 1; i < N; i++){ if(N % i == 0){ Ans = min(Ans, (N * N) / (2 * i * i) * (i * i)); } } return Ans; } int main(){ Kultivator; int N, K; cin >> N >> K; int T = Get(N); cout << T; }
#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...