/ SeriousOJ /

Record Detail

Time Exceeded


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 532.0 KiB
#2 Time Exceeded ≥1099ms ≥928.0 KiB
#3 Time Exceeded ≥1100ms ≥800.0 KiB

Code

# pragma GCC target("avx2")
# pragma GCC optimize("O3")
# pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

void solve();

int main() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    int tc; cin >> tc;
    for (int tt = 0; tt < tc; tt++) solve();
    return 0;
}

void solve() {
    int n; cin >> n;
    ll ans = -n;
    int den = 1;
    while (den <= n) {
        int val = n / den, ub = n / val;
        ans += (ll)val * (ub - den + 1);
        den = ub + 1;
    }
    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 16:57:30
Judged At
2025-07-14 16:57:30
Judged By
Score
0
Total Time
≥1100ms
Peak Memory
≥928.0 KiB