/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 532.0 KiB
#2 Accepted 2ms 532.0 KiB
#3 Accepted 298ms 532.0 KiB
#4 Accepted 298ms 532.0 KiB
#5 Accepted 298ms 564.0 KiB
#6 Accepted 96ms 568.0 KiB
#7 Accepted 304ms 568.0 KiB

Code

#include <bits/stdc++.h>
#define ll long long
using namespace std;

ll sum_floor(ll N) {
    ll s = (int)sqrt(N);
    while (s * s > N) --s;
    ll acc = 0;
    for (ll i = 1; i <= s; ++i) acc += N / i;
    return acc * 2 - s * s;
}



int main() {
    // fast io
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int T;
    cin>>T;
    for(int t=1;t<=T;t++) {
        ll N;
        cin>>N;
        ll ans = sum_floor(N)-N;
        cout << ans << "\n";
    }
}

Information

Submit By
Type
Submission
Problem
P1207 D2. GCD equal Absolute Value (Hard Version)
Contest
Educational Round 1
Language
C++17 (G++ 13.2.0)
Submit At
2025-07-14 17:31:01
Judged At
2025-07-14 17:31:01
Judged By
Score
100
Total Time
304ms
Peak Memory
568.0 KiB