Submission #1032603

# Submission time Handle Problem Language Result Execution time Memory
1032603 2024-07-24T03:42:01 Z Khanhcsp2 Savrsen (COCI17_savrsen) C++14
120 / 120
568 ms 78932 KB
#include<bits/stdc++.h>
#define el '\n'
#define fi first
#define sc second
#define int ll
#define pii pair<int, int>
#define all(v) v.begin(), v.end()
using namespace std;
using ll=long long;
using ull=unsigned long long;
using ld=long double;
const int mod=1e9+7;
const int N=1e7+11;
int f[N], a, b;
void sol()
{
    cin >> a >> b;
    for(int i=1;i<=b;i++) f[i]=i;
    for(int i=1;i<=b;i++)
    {
        for(int j=i*2;j<=b;j+=i) f[j]-=i;
    }
    int ans=0;
    for(int i=a;i<=b;i++) ans+=abs(f[i]);
    cout << ans;
}
signed main()
{
//    freopen("divisor.INP", "r", stdin);
//    freopen("divisor.OUT", "w", stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t=1;
    //cin >> t;
    while(t--)
    {
        sol();
    }
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 2 ms 1120 KB Output is correct
4 Correct 568 ms 78676 KB Output is correct
5 Correct 567 ms 78932 KB Output is correct
6 Correct 560 ms 78680 KB Output is correct
7 Correct 527 ms 72532 KB Output is correct
8 Correct 73 ms 20312 KB Output is correct