/* Ajay Jadhav */
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <deque>
#include <vector>
#include <cstdlib>
#include <iomanip>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <stack>
#include <ctime>
#include <string.h>
#include <climits>
#include <cstring>
using namespace std;
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define all(a) (a).begin(), (a).end()
#define x first
#define y second
#define sz(x) (int)x.size()
#define hell 1000000007
#define rep(i, a, b) for (int i = a; i < b; i++)
#define endl '\n'
int f(int n)
{
int sum = n;
for (ll i = 1; i <= n / 2; i++)
{
if (n % i == 0)
{
sum -= i;
}
}
return abs(sum);
}
void solve()
{
int a, b;
cin >> a >> b;
ll ans = 0;
rep(i, a, b + 1)
{
ans += f(i);
}
cout << ans << endl;
}
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t = 1;
// cin>>t;
while (t--)
{
solve();
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
2 ms |
212 KB |
Output is correct |
3 |
Execution timed out |
3077 ms |
212 KB |
Time limit exceeded |
4 |
Execution timed out |
3084 ms |
212 KB |
Time limit exceeded |
5 |
Execution timed out |
3077 ms |
212 KB |
Time limit exceeded |
6 |
Execution timed out |
3083 ms |
212 KB |
Time limit exceeded |
7 |
Execution timed out |
3023 ms |
212 KB |
Time limit exceeded |
8 |
Execution timed out |
3078 ms |
212 KB |
Time limit exceeded |