/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 532.0 KiB
#2 Accepted 3ms 344.0 KiB
#3 Accepted 102ms 564.0 KiB
#4 Accepted 100ms 568.0 KiB
#5 Accepted 101ms 572.0 KiB
#6 Accepted 38ms 572.0 KiB
#7 Accepted 100ms 572.0 KiB

Code

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

#define fastio() ios_base::sync_with_stdio(false);cin.tie(nullptr);

int n ;
long long ans ;
int sq ;
int i ;

void solve() {
       
     
      cin >> n ;
      ans = 0 ;
      sq = 1 ;
      while((sq + 1) * (sq + 1) <= n) sq ++ ;
      
      for(i = 1 ; i <= sq ; i ++) ans += n / i ;
      cout << (2 * ans - sq * sq - n) << endl ;
}









int32_t main() {

    fastio();
    int t = 1;
    cin >> t;
    while (t--) solve();
}

Information

Submit By
Type
Submission
Problem
P1207 D2. GCD equal Absolute Value (Hard Version)
Contest
Educational Round 1
Language
C++17 (G++ 13.2.0)
Submit At
2025-07-14 17:09:13
Judged At
2025-07-14 17:09:13
Judged By
Score
100
Total Time
102ms
Peak Memory
572.0 KiB