/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 532.0 KiB
#2 Accepted 2ms 320.0 KiB
#3 Accepted 306ms 568.0 KiB
#4 Accepted 308ms 532.0 KiB
#5 Accepted 310ms 572.0 KiB
#6 Accepted 100ms 568.0 KiB
#7 Accepted 305ms 768.0 KiB

Code

// CK 
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define endl '\n'
#define ll long long
#define ld long double
#define vi vector<ll>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define srt(v) sort(v.begin(),v.end())
#define rep(i, a, b) for(ll i = (a); i < (b); i++)
#define print(v) for(auto e:v) cout<<e<<" "; cout<<endl;
#define printp(v) for(auto e:v) cout<<e.first<<" "<<e.second<<endl;
const int N=5e5+10;
long long Pow(ll a,ll b){
    ll ans = 1;
    while(b>0){
        if(b&1) ans*=a;
        b>>=1;
        a*=a;
    }
    return ans;
}
void solve(){
    ll n;cin>>n;
    ll sum = 0;
    ll k = sqrt(n);
    for(int i = 1;i<=k;i++){
        sum +=floor(n/i);
    }
    sum *=2;
    sum -= Pow(k,2);
    sum -=n;
    cout<<sum<<endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t=1;cin>>t;
    for(int i = 0;i<t;i++){
        solve();
    }
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1207 D2. GCD equal Absolute Value (Hard Version)
Language
C++17 (G++ 13.2.0)
Submit At
2025-07-14 20:29:04
Judged At
2025-07-14 20:29:04
Judged By
Score
100
Total Time
310ms
Peak Memory
768.0 KiB