/ SeriousOJ /

Record Detail

Time Exceeded


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 764.0 KiB
#2 Time Exceeded ≥1099ms ≥716.0 KiB
#3 Time Exceeded ≥1099ms ≥716.0 KiB

Code

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

long long sumFloor(long long n) {
    long long res = 0;
    long long i = 1;
    while (i <= n) {
        long long val = n / i;
        long long j = n / val;
        if (j > n) j = n;
        res += val * (j - i + 1);
        i = j + 1;
    }
    return res;
}

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

    int T; cin >> T;
    while (T--) {
        long long N; cin >> N;
        long long result = sumFloor(N) - N;  // چون sumFloor شامل d=N هم هست و ما فقط تا N-1 می‌خواهیم، اما تفاوت کم است.
        cout << result << "\n";
    }

    return 0;
}

Information

Submit By
Type
Submission
Problem
P1206 D1. GCD equal Absolute Value (Easy Version)
Contest
Educational Round 1
Language
C++11 (G++ 13.2.0)
Submit At
2025-07-14 16:10:25
Judged At
2025-07-14 16:10:25
Judged By
Score
0
Total Time
≥1099ms
Peak Memory
≥764.0 KiB