/ SeriousOJ /

Record Detail

Time Exceeded


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 532.0 KiB
#2 Accepted 681ms 1.133 MiB
#3 Time Exceeded ≥1034ms ≥1.234 MiB
#4 Accepted 223ms 1.066 MiB
#5 Accepted 990ms 1.211 MiB

Code

#include <iostream>
#include <vector>
#include <algorithm>
#define ll long long
using namespace std;

ll sum_floor(ll N) {
    ll s = 0;
    while ((s + 1) * (s + 1) <= N) ++s; 
    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
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:29:26
Judged At
2025-07-14 17:29:26
Judged By
Score
80
Total Time
≥1034ms
Peak Memory
≥1.234 MiB