# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
86364 | 2018-11-26T08:16:49 Z | Azamat_Murat | Savrsen (COCI17_savrsen) | C++14 | 3000 ms | 608 KB |
#include <bits/stdc++.h> #define mp make_pair #define pb push_back #define f first #define s second #define all(x) x.begin(), x.end() #define ll long long //#define int long long using namespace std; void boost() { ios_base::sync_with_stdio(false); cin.tie(NULL); } void free() { freopen("A.in", "r", stdin); freopen("A.out", "w", stdout); } //vector <int> v; main() { //free(); boost(); int a, b; cin >> a >> b; ll ans = 0; for(int x = a; x <= b; x++) { int n = x; ll sum = 0; if(x == 1) { ans++; continue; } for(int i = 2; i * i <= x; i++) { if(n % i == 0 && n / i != i) { int k = n / i; sum += (k), sum += (i); } else if(n % i == 0) sum += i; } //if(x > 1) v.pb(1); sum++; //for(int i = 0; i < v.size(); i++) //cout << v[i] << " ",; //for(int i = 0; i < v.size(); i++) //sum += v[i]; //cout << endl; //v.clear(); //cout << sum << " "; ans += abs(x - sum); //cout << abs(x - sum) << ' '; } //cout << endl; cout << ans, exit(0); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 99 ms | 488 KB | Output is correct |
4 | Correct | 14 ms | 608 KB | Output is correct |
5 | Execution timed out | 3041 ms | 608 KB | Time limit exceeded |
6 | Execution timed out | 3064 ms | 608 KB | Time limit exceeded |
7 | Execution timed out | 3030 ms | 608 KB | Time limit exceeded |
8 | Execution timed out | 3057 ms | 608 KB | Time limit exceeded |