# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
706596 | 2023-03-07T06:26:22 Z | YugiHacker | Savrsen (COCI17_savrsen) | C++14 | 712 ms | 39444 KB |
#include<bits/stdc++.h> #define el cout<<"\n" #define f0(i,n) for(int i=0;i<n;++i) #define f1(i,n) for(int i=1;i<=n;++i) #define maxn 10000007 using namespace std; int d[maxn]; main() { ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); int a, b; cin >> a >> b; d[1] = 1; for (int i=2; i*i <= b; i++) { for (int j=i*i; j<=b; j+=i) { d[j] += i; if (j != i*i) d[j] += j/i; } } long long ans = 0; for (int i=a; i<=b; i++) ans += abs(d[i]+1-i); cout << ans; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Correct | 4 ms | 724 KB | Output is correct |
4 | Correct | 689 ms | 39408 KB | Output is correct |
5 | Correct | 712 ms | 39440 KB | Output is correct |
6 | Correct | 711 ms | 39444 KB | Output is correct |
7 | Correct | 645 ms | 36376 KB | Output is correct |
8 | Correct | 125 ms | 10196 KB | Output is correct |