/ SeriousOJ /

Record Detail

Time Exceeded


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

Code

#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 rsrt(v) sort(v.rbegin(),v.rend())
#define rep(i, a, b) for(ll i = (a); i < (b); i++)
#define trace(x) cout<<#x<<": "<<x<<endl;
#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=1e6+10;
ll arr[N];
void solve(){
    ll n;cin>>n;
    ll ans = 0;
    rep(i,1,n+1){
        ll ki = n-i;
        ki/=i;
        ans += ki;
    }
    cout<<ans<<endl;
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t=1;cin>>t;
    for(int i =1;i<=t;i++){
        solve();
    }
    return 0;
}

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:21:29
Judged At
2025-07-14 17:21:29
Judged By
Score
0
Total Time
≥1100ms
Peak Memory
≥532.0 KiB