use std::collections::HashSet; use proconio::input; fn main () { input! { t: usize, } let squared = (0..32).into_iter() .map(|v| v*v) .collect::>(); let check = squared.iter() .cloned() .collect::>(); for _ in 0..t { input! { n: i32, } if check.contains(&n) { println!("P"); } else { println!("K"); } } }