/ SeriousOJ /

Record Detail

Time Exceeded


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 532.0 KiB
#2 Time Exceeded ≥1099ms ≥744.0 KiB
#3 Time Exceeded ≥1001ms ≥712.0 KiB

Code

/**
*    In the name of Allah
*    We are nothing and you're everything
*    Ya Muhammad!
**/
#include <bits/stdc++.h>
 
using namespace std;
using ll = long long;
using ull = uint64_t;
 
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define int long long
 
const char nl = '\n';
const int N = 1e5+5;
const ll inf = 0x3f3f3f3f3f3f3f3fll;

long long sum_n_div_i(int n) {
    long long total = 0;
    int i = 1;
    while (i <= n) {
        int v = n / i;
        int next_i = n / v + 1;
        int count = next_i - i;
        total += 1LL * v * count;
        i = next_i;
    }
    return total;
}

void solve() {
	int n; cin >> n;
	int res = sum_n_div_i(n);
	cout << res-n << nl;
}

int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t; cin >> t;
    while(t--)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:08:22
Judged At
2025-07-14 17:08:22
Judged By
Score
0
Total Time
≥1099ms
Peak Memory
≥744.0 KiB