結果

問題 No.3156 Count That Day's N
ユーザー ArcAki
提出日時 2025-05-23 19:51:25
言語 Rust
(1.83.0 + proconio)
結果
AC  
実行時間 2,525 ms / 3,000 ms
コード長 4,907 bytes
コンパイル時間 12,530 ms
コンパイル使用メモリ 400,056 KB
実行使用メモリ 444,396 KB
最終ジャッジ日時 2025-05-23 19:51:54
合計ジャッジ時間 17,413 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 32
権限があれば一括ダウンロードができます

ソースコード

diff # 

/*
     ><>   魚fishに癒されたい(><)  ><>
        >><>   ><>          ><>     ><>
    ><>         ><>     >>><>><><<>    ><>><>
         ><>   ><>   ><>    ><>     >><<<>>>    ><>   ><>
            ><>   >><>    ^<>   v   ><>    ><>  ><>
     ><>     >><>>    ><> ><>   ^      ><>
        >><><>      ><>   ><>   v   ><>         ><>
     <>><<    <><   ><>   >>>>><<<<<<>>>>>>>
         ><      >><<>>> ><>  ><>  >><>> <><  ><> ><>  ><>   >>
     > <>  ><>   ><>      >>><<<>>>>>>   ><>   ><> ><>   ><   ><>
       ><>      ><><><>>>>><><>>>>   >><>  ><>   ><>
   ><>     <<>   <><  >><>>  ><>    ><> ><>
     ><>   ><> ><   (>< ><) ><>   ><>>  ^ <>   ><>   <><  ><>
  ><>    ><>    <<<><>   ><>   <><  ><> v ><>  <>< ><>　><> ><> ><>
     ><>    ><>  ><><>  ><>   ><>    >><<><>><>>><>  ><>>  >><>>
 */
pub trait SortD{
    fn sort_d(&mut self);
}

impl<T: Ord> SortD for Vec<T>{
    fn sort_d(&mut self) {
        self.sort_by(|u, v| v.cmp(&u));
    }
}
pub struct F64Ord(f64);
impl PartialEq<Self> for F64Ord {
    fn eq(&self, other: &Self) -> bool {
        self.0==other.0
    }
}
impl Eq for F64Ord{}
impl Ord for F64Ord{
    fn cmp(&self, other: &Self) -> Ordering {
        self.0.total_cmp(&other.0)
    }
}
impl PartialOrd for F64Ord{
    fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
        Some(self.cmp(&other))
    }
}
pub trait Mx{
    fn max(&self, rhs: Self)->Self;
}
impl Mx for f64{
    fn max(&self, rhs: Self)->Self{
        if *self < rhs{
            rhs
        } else {
            *self
        }
    }
}
pub trait Mi{
    fn min(&self, rhs: Self)->Self;
}
impl Mi for f64{
    fn min(&self, rhs: Self)->Self{
        if *self < rhs{
            rhs
        } else {
            *self
        }
    }
}
pub fn chmax<T: PartialOrd+Clone>(a: &mut T, b: &T){
    if *a < *b{
        *a = b.clone();
    }
}
pub fn chmin<T: PartialOrd+Clone>(a: &mut T, b: &T){
    if *a > *b{
        *a = b.clone();
    }
}
pub fn gcd(mut a: i64, mut b: i64)->i64{
    if b==0{return a;}
    while b!=0{
        let c = a;
        a = b;
        b = c%b;
    }
    a
}
pub fn floor(a:i64, b:i64)->i64{let res=(a%b+b)%b;(a-res)/b}
pub fn extended_gcd(a:i64,b:i64)->(i64,i64,i64)
{if b==0{(a,1,0)}else{let(g,x,y)=extended_gcd(b,a%b);(g,y,x-floor(a,b)*y)}}
pub fn mod_inverse(a:i64,m:i64)->i64{let(_,x,_) =extended_gcd(a,m);(x%m+m)%m}
pub fn comb(a: i64, b: i64, f: &Vec<(i64, i64)>)->i64{
    if a<b{return 0;}if b==0 || a==b{ return 1; }
    else{let x=f[a as usize].0;
        let y=f[(a-b) as usize].1;let z=f[b as usize].1;return((x*y)%MOD)*z%MOD;}}
pub fn factorial(x: i64)->Vec<(i64, i64)>{
    let mut f=vec![(1i64,1i64),(1, 1)];let mut z = 1i64;
    let mut inv = vec![0; x as usize+10];inv[1] = 1;
    for i in 2..x+1{z=(z*i)%MOD;
        let w=(MOD-inv[(MOD%i)as usize]*(MOD/i)%MOD)%MOD;
        inv[i as usize] = w;
        f.push((z, (f[i as usize-1].1*w)%MOD));}return f;}
pub fn fast_mod_pow(x: i64,p: usize, m: i64)->i64{
    let mut res=1;let mut t=x;let mut z=p;while z > 0{
        if z%2==1{res = (res*t)%m;}t = (t*t)%m;z /= 2; }res}
#[allow(unused_imports)]
use std::{
    convert::{Infallible, TryFrom, TryInto as _}, fmt::{self, Debug, Display, Formatter,},
    fs::{File}, hash::{Hash, Hasher}, iter::{Product, Sum}, marker::PhantomData,
    ops::{Add, AddAssign, Sub, SubAssign, Div, DivAssign, Mul, MulAssign, Neg, RangeBounds},
    str::FromStr, sync::{atomic::{self, AtomicU32, AtomicU64}, Once},
    collections::{*, btree_set::Range, btree_map::Range as BTreeRange}, mem::{swap},
    cmp::{self, Reverse, Ordering, Eq, PartialEq, PartialOrd},
    thread::LocalKey, f64::consts::PI, time::Instant, cell::RefCell,
    io::{self, stdin, Read, read_to_string, BufWriter, BufReader, stdout, Write},
};
#[allow(unused_imports)]
use proconio::{input, input_interactive, marker::{*}};
#[allow(unused_imports)]
//use rand::{thread_rng, Rng, seq::SliceRandom};
#[allow(unused_imports)]
//use ac_library::{*, ModInt1000000007 as mint};
#[allow(dead_code)]
//type MI = StaticModInt<Mod1000000007>;

#[allow(dead_code)]
const INF: i64 = 1<<60;
#[allow(dead_code)]
const MOD: i64 = 998244353;
#[allow(dead_code)]
const D: [(usize, usize); 4] = [(1, 0), (0, 1), (!0, 0), (0, !0)];
#[allow(dead_code)]
const D2: [(usize, usize); 8] = [(1, 0), (1, 1), (0, 1), (!0, 1), (!0, 0), (!0, !0), (0, !0), (1, !0)];

//use proconio::fastout;
//#[fastout]
fn main() {
    input! {
        k: usize, n: usize,
    }
    let mut sq = HashSet::new();
    let mut i = 1;
    while i*i*k <= n{
        sq.insert(i*i*k);
        i += 1;
    }
    let mut i = 1;
    let mut t = HashSet::new();
    while i*i*i*i*i*i <= n{
        let mut j = 1;
        while i*i*i*i*i*i+j*j*j*j <= n{
            let x = i*i*i*i*i*i+j*j*j*j;
            if sq.contains(&x){
                t.insert(x);
            }
            j += 1;
        }
        i += 1;
    }
    println!("{}", t.len());
}
0