제출 #342591

#제출 시각아이디문제언어결과실행 시간메모리
342591koketsuChessboard (IZhO18_chessboard)C++14
0 / 100
1 ms376 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 = 1; for(int i = 2; i <= sqrt(N); i++){ if(N % i == 0){ Ans = max(Ans, i); if(N / i != i){ Ans = max(Ans, N / i); } } } return Ans; } int main(){ Kultivator; int N, K; cin >> N >> K; int Del = Get(N); if(N == 2){ cout << 2; } else if(Del > 1){ cout << (N / Del) * N; } else { cout << ((N - 1) / 2 * (N / 2 + 1)) + ((N + 1) / 2 * (N / 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...