# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
226274 | quocnguyen1012 | Savrsen (COCI17_savrsen) | C++14 | 116 ms | 392 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define ar array
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
const int maxn = 1e6 + 5, inf = 1e9;
int Ceil(int a, int b)
{
if(a % b == 0) return a / b;
return a / b + 1;
}
signed main(void)
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifdef LOCAL
freopen("A.INP", "r", stdin);
freopen("A.OUT", "w", stdout);
#endif // LOCAL
int a, b;
cin >> a >> b;
ll res = 0;
for(int i = a; i <= b; ++i)
res += i;
res *= 2;
for(int d = 1; d <= b; ++d){
int le = Ceil(a, d);
int ri = b / d;
//cerr << d << ' ' << le << ' ' << ri << '\n';
res -= 1ll * d * (ri - le + 1);
}
cout << res;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |