#[allow(unused_imports)] use num::integer::*; #[allow(unused_imports)] use proconio::input; #[allow(unused_imports)] use std::collections::*; #[allow(dead_code)] const INF64: i64 = 4_000_000_000_000_000_000; fn main() { input!(x: i32, y: i32); println!("{}", x / gcd(x, y) * y); } #[allow(unused_macros)] macro_rules! min { ($a:expr) => ($a); ($a:expr, $b:expr) => (std::cmp::min($a, $b)); ($a:expr, $($b:expr),+) => (std::cmp::min($a, min!($($b),+))); } #[allow(unused_macros)] macro_rules! max { ($a:expr) => ($a); ($a:expr, $b:expr) => (std::cmp::max($a, $b)); ($a:expr, $($b:expr),+) => (std::cmp::max($a, max!($($b),+))); } #[allow(unused_macros)] macro_rules! chmin { ($base:expr, $($list:expr),+) => ({ let min = min!($($list),+); if $base > min { $base = min; true } else { false } }); } #[allow(unused_macros)] macro_rules! chmax { ($base:expr, $($list:expr),+) => ({ let max = max!($($list),+); if $base < max { $base = max; true } else { false } }); } #[allow(dead_code)] fn ordering_res<'a, T>(ex: std::cmp::Ordering, less: &'a T, equal: &'a T, greater: &'a T) -> &'a T { match ex { std::cmp::Ordering::Less => less, std::cmp::Ordering::Equal => equal, std::cmp::Ordering::Greater => greater, } } pub trait BinarySearch { fn lower_bound(&self, x: &T) -> usize; fn upper_bound(&self, x: &T) -> usize; } impl BinarySearch for [T] { fn lower_bound(&self, x: &T) -> usize { let mut low = 0; let mut high = self.len(); while low != high { let mid = (low + high) / 2; match self[mid].cmp(x) { std::cmp::Ordering::Less => { low = mid + 1; } std::cmp::Ordering::Equal | std::cmp::Ordering::Greater => { high = mid; } } } low } fn upper_bound(&self, x: &T) -> usize { let mut low = 0; let mut high = self.len(); while low != high { let mid = (low + high) / 2; match self[mid].cmp(x) { std::cmp::Ordering::Less | std::cmp::Ordering::Equal => { low = mid + 1; } std::cmp::Ordering::Greater => { high = mid; } } } low } } trait MyInteger: num::traits::PrimInt + std::hash::Hash + std::ops::AddAssign + std::ops::SubAssign + std::ops::MulAssign + std::ops::DivAssign + std::ops::RemAssign + std::convert::TryInto + Sized { } impl MyInteger for isize {} impl MyInteger for i8 {} impl MyInteger for i16 {} impl MyInteger for i32 {} impl MyInteger for i64 {} impl MyInteger for i128 {} impl MyInteger for usize {} impl MyInteger for u8 {} impl MyInteger for u16 {} impl MyInteger for u32 {} impl MyInteger for u64 {} impl MyInteger for u128 {} trait Divisors: MyInteger { fn divisors(self) -> Vec; } impl Divisors for T { #[allow(dead_code)] fn divisors(self) -> Vec { assert!(self > T::zero()); let mut ans = Vec::new(); let mut i = T::one(); while i * i <= self { if self % i == T::zero() { ans.push(i); if self / i != i { ans.push(self / i); } } i = i + T::one(); } ans.sort(); ans } }

提出日時	2021/04/01 22:23:44
問題	A: Happiness Number
ユーザ	kowerkoint
言語	Rust (1.48.0)
得点
結果	IE

セット名	得点 / 配点	テストケース名
結果		テストケース名
sample	0 / 0

all	100 / 100

セットごとの結果