/ SeriousOJ /

Record Detail

Time Exceeded


  
# Status Time Cost Memory Cost
#1 Accepted 3ms 324.0 KiB
#2 Time Exceeded ≥1099ms ≥712.0 KiB
#3 Time Exceeded ≥1099ms ≥648.0 KiB

Code

use std::io::{self, BufRead, BufWriter, Write};

fn harmonious_pairs(n: usize) -> i64 {
    let mut ans: i64 = 0;
    let mut d = 1;
    while d < n {
        let v = n / d;
        let next_d = std::cmp::min(n - 1, n / v);
        let count = (next_d - d + 1) as i64;
        ans += (v as i64 - 1) * count;
        d = next_d + 1;
    }
    ans
}

fn main() {
    let stdin = io::stdin();
    let stdout = io::stdout();
    let mut writer = BufWriter::new(stdout.lock());
    let mut lines = stdin.lock().lines();

    let t: usize = lines.next().unwrap().unwrap().trim().parse().unwrap();

    for _ in 0..t {
        let n: usize = lines.next().unwrap().unwrap().trim().parse().unwrap();
        writeln!(writer, "{}", harmonious_pairs(n)).unwrap();
    }
}

Information

Submit By
Type
Submission
Problem
P1206 D1. GCD equal Absolute Value (Easy Version)
Contest
Educational Round 1
Language
Rust 2021 (Rust 1.75.0)
Submit At
2025-07-14 16:14:35
Judged At
2025-07-14 16:14:35
Judged By
Score
0
Total Time
≥1099ms
Peak Memory
≥712.0 KiB