# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
37353 | 2017-12-24T14:46:22 Z | IvanC | Savrsen (COCI17_savrsen) | C++14 | 2223 ms | 50844 KB |
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e7 + 2; bool primo[MAXN]; int vetor[MAXN]; int main(){ int A,B; scanf("%d %d",&A,&B); for(int i = 1;i<=B;i++) vetor[i] = i; long long resposta = 0; for(int i = 1;i<=B;i++){ if(i >= A) resposta += abs(vetor[i]); for(int j = 2*i;j<=B;j+=i){ vetor[j] -= i; } } printf("%lld\n",resposta); return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 50844 KB | Output is correct |
2 | Correct | 0 ms | 50844 KB | Output is correct |
3 | Correct | 3 ms | 50844 KB | Output is correct |
4 | Correct | 2216 ms | 50844 KB | Output is correct |
5 | Correct | 2223 ms | 50844 KB | Output is correct |
6 | Correct | 2189 ms | 50844 KB | Output is correct |
7 | Correct | 1879 ms | 50844 KB | Output is correct |
8 | Correct | 179 ms | 50844 KB | Output is correct |