結果
| 問題 |
No.3332 Consecutive Power Sum (Small)
|
| コンテスト | |
| ユーザー |
 Moss_Local
|
| 提出日時 | 2025-11-02 22:32:23 |
| 言語 | Rust (1.83.0 + proconio) |
| 結果 |
AC
|
| 実行時間 | 82 ms / 2,025 ms |
| コード長 | 5,818 bytes |
| コンパイル時間 | 12,011 ms |
| コンパイル使用メモリ | 400,000 KB |
| 実行使用メモリ | 17,636 KB |
| 最終ジャッジ日時 | 2025-11-02 22:32:39 |
| 合計ジャッジ時間 | 15,572 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 52 |
コンパイルメッセージ
warning: unnecessary parentheses around `if` condition
--> src/main.rs:216:20
|
216 | if (t >= (m - 1)) {
| ^ ^
|
= note: `#[warn(unused_parens)]` on by default
help: remove these parentheses
|
216 - if (t >= (m - 1)) {
216 + if t >= (m - 1) {
|
warning: variable does not need to be mutable
--> src/main.rs:119:9
|
119 | let mut vec: Vec<i64> = read_vec();
| ----^^^
| |
| help: remove this `mut`
|
= note: `#[warn(unused_mut)]` on by default
warning: variable does not need to be mutable
--> src/main.rs:125:9
|
125 | let mut vec: Vec<i64> = read_vec();
| ----^^^
| |
| help: remove this `mut`
warning: variable does not need to be mutable
--> src/main.rs:130:9
|
130 | let mut vec: Vec<usize> = read_vec();
| ----^^^
| |
| help: remove this `mut`
warning: variable does not need to be mutable
--> src/main.rs:136:9
|
136 | let mut vec: Vec<f64> = read_vec();
| ----^^^
| |
| help: remove this `mut`
warning: variable does not need to be mutable
--> src/main.rs:141:9
|
141 | let mut vec: Vec<char> = read_vec();
| ----^^^
| |
| help: remove this `mut`
warning: variable does not need to be mutable
--> src/main.rs:146:9
|
146 | let mut vec: Vec<usize> = read_vec();
| ----^^^
| |
| help: remove this `mut`
warning: variable does not need to be mutable
--> src/main.rs:152:9
|
152 | let mut vec: Vec<i64> = read_vec();
| ----^^^
| |
| help: remove this `mut`
ソースコード
// -*- coding:utf-8-unix -*-
// #![feature(map_first_last)]
#![allow(dead_code)]
#![allow(unused_imports)]
#![allow(unused_macros)]
// use core::num;
use std::cmp::*;
use std::fmt::*;
use std::hash::*;
use std::io::*;
use std::iter::FromIterator;
use std::*;
use std::{cmp, collections, fmt, io, iter, ops, str};
const INF: i64 = 1223372036854775807;
const UINF: usize = INF as usize;
const LINF: i64 = 2147483647;
const INF128: i128 = 1223372036854775807000000000000;
const MOD1: i64 = 1000000007;
const MOD9: i64 = 998244353;
const MOD: i64 = MOD9;
// const MOD: i64 = MOD2;
const UMOD: usize = MOD as usize;
const M_PI: f64 = 3.14159265358979323846;
const NINF: i64 = -(1i64 << 60);
// use proconio::input;
// const MOD: i64 = INF;
use cmp::Ordering::*;
use std::collections::*;
use std::io::stdin;
use std::io::Write;
macro_rules! p {
($x:expr) => {
//if expr
println!("{}", $x);
};
}
macro_rules! vp {
// vector print separate with space
($x:expr) => {
println!(
"{}",
$x.iter()
.map(|x| x.to_string())
.collect::<Vec<_>>()
.join(" ")
);
};
}
macro_rules! d {
($x:expr) => {
eprintln!("debug:{:?}", $x);
};
}
macro_rules! yn {
($val:expr) => {
if $val {
println!("Yes");
} else {
println!("No");
}
};
}
macro_rules! map{
// declear btreemap
($($key:expr => $val:expr),*) => {
{
let mut map = ::std::collections::BTreeMap::new();
$(
map.insert($key, $val);
)*
map
}
};
}
macro_rules! set{
// declear btreemap
($($key:expr),*) => {
{
let mut set = ::std::collections::BTreeSet::new();
$(
set.insert($key);
)*
set
}
};
}
//input maskput
#[allow(dead_code)]
fn read<T: std::str::FromStr>() -> T {
let mut s = String::new();
std::io::stdin().read_line(&mut s).ok();
s.trim().parse().ok().unwrap()
}
#[allow(dead_code)]
fn read_vec<T: std::str::FromStr>() -> Vec<T> {
read::<String>()
.split_whitespace()
.map(|e| e.parse().ok().unwrap())
.collect()
}
#[allow(dead_code)]
fn read_mat<T: std::str::FromStr>(n: u32) -> Vec<Vec<T>> {
(0..n).map(|_| read_vec()).collect()
}
#[allow(dead_code)]
fn readii() -> (i64, i64) {
let mut vec: Vec<i64> = read_vec();
(vec[0], vec[1])
}
#[allow(dead_code)]
fn readiii() -> (i64, i64, i64) {
let mut vec: Vec<i64> = read_vec();
(vec[0], vec[1], vec[2])
}
#[allow(dead_code)]
fn readuu() -> (usize, usize) {
let mut vec: Vec<usize> = read_vec();
(vec[0], vec[1])
}
#[allow(dead_code)]
fn readff() -> (f64, f64) {
let mut vec: Vec<f64> = read_vec();
(vec[0], vec[1])
}
fn readcc() -> (char, char) {
let mut vec: Vec<char> = read_vec();
(vec[0], vec[1])
}
fn readuuu() -> (usize, usize, usize) {
let mut vec: Vec<usize> = read_vec();
(vec[0], vec[1], vec[2])
}
#[allow(dead_code)]
fn readiiii() -> (i64, i64, i64, i64) {
let mut vec: Vec<i64> = read_vec();
(vec[0], vec[1], vec[2], vec[3])
}
#[derive(Clone, Copy, Eq, PartialEq, Ord, PartialOrd)]
struct Tpl {
e: i64,
l: i64,
r: i64,
}
fn pow_leq(mut b: u128, mut e: i32, lim: u128) -> u128 {
let mut res: u128 = 1;
while e > 0 {
if e & 1 == 1 {
res = res.saturating_mul(b);
if res > lim {
return lim + 1;
}
}
e >>= 1;
if e > 0 {
b = b.saturating_mul(b);
if b > lim {
return lim + 1;
}
}
}
res
}
fn floor_nth_root(n: u128, e: i32) -> u128 {
if e == 1 {
return n;
}
let mut lo: u128 = 1;
let mut hi: u128 = std::cmp::min(n, 1_000_000_000_000u128);
while lo < hi {
let mid = (lo + hi + 1) >> 1;
if pow_leq(mid, e, n) <= n {
lo = mid;
} else {
hi = mid - 1;
}
}
lo
}
fn main() {
let n: u128 = read();
let mut ans: Vec<Tpl> = Vec::new();
let two = n * 2;
let mut m = 1u128;
loop {
let ssum = m * (m + 1) / 2;
if ssum > n {
break;
}
if two % m == 0 {
let t = two / m;
// d!((m, t));
if (t + (m - 1)) % 2 == 0 {
if (t >= (m - 1)) {
let l = ((t - (m - 1)) / 2) as i128;
// d!((m, t, l));
if l >= 1 {
let r = l + (m as i128) - 1;
ans.push(Tpl {
e: 1,
l: l as i64,
r: r as i64,
});
}
}
}
}
m += 1;
}
for e in 2..=60 {
let k = floor_nth_root(n, e);
if k == 0 {
continue;
}
let mut pref = vec![0u128; (k + 1) as usize];
for i in 1..=k {
pref[i as usize] = pref[(i - 1) as usize] + pow_leq(i, e, n);
}
let mut l = 1usize;
for r in 1..=(k as usize) {
while l <= r {
let cur = pref[r] - pref[l - 1];
if cur < n {
break;
}
if cur == n {
ans.push(Tpl {
e: e as i64,
l: l as i64,
r: r as i64,
});
}
l += 1;
}
}
}
ans.sort();
p!(ans.len());
for tpl in ans {
println!("{} {} {}", tpl.e, tpl.l, tpl.r);
}
}