oj.uz

답안 #603501

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
603501 2022-07-24T07:39:45 Z hieupham1103 Savrsen (COCI17_savrsen) C++17
120 / 120
 1387 ms 78580 KB 
#include<bits/stdc++.h>
#define ii pair <int,int>
#define fi first
#define se second
#define int long long
using namespace std;

const int maxN = 1e7 + 10;

int divSum[maxN + 1];
// vector <int> listDiv[maxN + 1];

void Eras(){
    for (int i = 2; i < maxN; i++){
        divSum[i] += 1;
        // listDiv[i].push_back(1);
    }
    for (int i = 2; i <= maxN; i++){
        for (int j = 2; i * j <= maxN; j++){
            divSum[i * j] += i;
            // listDiv[i * j].push_back(i);
        }
    }

}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    Eras();
    int a, b;
    cin >> a >> b;
    int ans = 0;
    for (int i = a; i <= b; i++){
        // cout << divSum[i] << ' ';
        ans += abs(i - divSum[i]);
    }

    // for (int i = 1; i <= 100; i++){
    //     cout << i << ": " << abs(i - divSum[i]) << " " << divSum[i] << endl;
    //     for (auto j: listDiv[i]){
    //         cout << j << " ";
    //     }
    //     cout << endl;
    // }
    cout << ans;
    return 0;
}

Subtask #1
120.0 / 120.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1105 ms 78580 KB Output is correct
2 Correct 1206 ms 78580 KB Output is correct
3 Correct 1275 ms 78576 KB Output is correct
4 Correct 1193 ms 78580 KB Output is correct
5 Correct 1387 ms 78572 KB Output is correct
6 Correct 1136 ms 78572 KB Output is correct
7 Correct 1237 ms 78572 KB Output is correct
8 Correct 1122 ms 78572 KB Output is correct