/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 29ms 4.27 MiB
#2 Accepted 47ms 5.02 MiB
#3 Accepted 45ms 5.125 MiB
#4 Accepted 45ms 4.867 MiB
#5 Accepted 46ms 5.02 MiB

Code

#include <bits/stdc++.h>
using namespace std;
using namespace chrono;

int divs[1'000'001];

void solve() {
    int n; cin >> n;
    cout << divs[n] << '\n';
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    for (int i = 1; i <= 1e6; i++) {
        divs[i] += divs[i-1];
        for (int j = i*2; j <= 1e6; j += i)
            divs[j]++;
    }
    int t; cin >> t; while (t--)
        solve();
}

Information

Submit By
Type
Submission
Problem
P1206 D1. GCD equal Absolute Value (Easy Version)
Contest
Educational Round 1
Language
C++17 (G++ 13.2.0)
Submit At
2025-07-14 17:32:31
Judged At
2025-07-14 17:32:31
Judged By
Score
100
Total Time
47ms
Peak Memory
5.125 MiB