oj.uz

답안 #824163

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
824163 2023-08-13T16:15:24 Z ajay Savrsen (COCI17_savrsen) C++14
120 / 120
 864 ms 78548 KB 
/* 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'

void solve()
{
    int a, b;
    cin >> a >> b;
    const int N = b + 1;
    vector<ll> sum(N + 1);
    rep(i, 1, N + 1)
    {
        sum[i] = i;
    }
    for (int i = 1; i <= N / 2; i++)
    {
        for (ll j = 2 * i; j <= N; j += i)
        {
            sum[j] -= i;
        }
    }

    for (int i = 1; i <= N; i++)
    {
        sum[i] = abs(sum[i]);
        sum[i] += sum[i - 1];
    }

    cout << sum[b] - sum[a - 1] << endl;
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    // cin>>t;
    while (t--)
    {
        solve();
    }
    return 0;
}

Subtask #1
120.0 / 120.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 2 ms 1108 KB Output is correct
4 Correct 862 ms 78548 KB Output is correct
5 Correct 844 ms 78548 KB Output is correct
6 Correct 864 ms 78548 KB Output is correct
7 Correct 807 ms 72428 KB Output is correct
8 Correct 167 ms 20180 KB Output is correct