結果
問題 | No.3127 Multiple of Twin Prime |
ユーザー |
![]() |
提出日時 | 2025-04-25 21:45:19 |
言語 | Rust (1.83.0 + proconio) |
結果 |
AC
|
実行時間 | 226 ms / 2,500 ms |
コード長 | 4,902 bytes |
コンパイル時間 | 13,178 ms |
コンパイル使用メモリ | 387,704 KB |
実行使用メモリ | 18,920 KB |
最終ジャッジ日時 | 2025-04-25 21:45:48 |
合計ジャッジ時間 | 16,987 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 12 |
コンパイルメッセージ
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:151:9 | 151 | let mut vec: Vec<i64> = read_vec(); | ----^^^ | | | help: remove this `mut` warning: variable does not need to be mutable --> src/main.rs:157:9 | 157 | let mut vec: Vec<usize> = read_vec(); | ----^^^ | | | help: remove this `mut` warning: unused variable: `i` --> src/main.rs:211:9 | 211 | for i in 0..t { | ^ help: if this is intentional, prefix it with an underscore: `_i` | = note: `#[warn(unused_variables)]` on by default warning: comparison is useless due to type limits --> src/main.rs:165:8 | 165 | if n >= 0 { |
ソースコード
// -*- 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::BufRead; 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; // use proconio::input; // const MOD: i64 = INF; use cmp::Ordering::*; use std::collections::*; use std::io::stdin; use std::io::stdout; 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!("{:?}", $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 output #[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]) } #[allow(dead_code)] fn readuuuu() -> (usize, usize, usize, usize) { let mut vec: Vec<usize> = read_vec(); (vec[0], vec[1], vec[2], vec[3]) } fn prime_table(n: usize) -> Vec<usize> { let mut is_prime = vec![true; n + 1]; let mut res = vec![0 as usize; 0]; if n >= 0 { is_prime[0] = false; } if n >= 1 { is_prime[1] = false; } let mut i = 2 as usize; while i * i <= n { if !is_prime[i] { i += 1; continue; } // println!("{:?}", "call"); let mut j = i + i as usize; while j <= n { is_prime[j] = false; j += i; } i += 1; } for i in 0..n { if is_prime[i] == true { res.push(i); } } return res; } fn main() { let pt = prime_table(10000001); let mut vec = vec![]; for i in 0..pt.len() - 1 { let p1 = pt[i]; let p2 = pt[i + 1]; if p2 - p1 == 2 { vec.push((p1 * p2, p1, p2)); } } // d!((vec[0])); // d!((vec[1])); // d!((vec[2])); vec.sort(); // d!(vec); vec.insert(0, (0, 0, 0)); let t: usize = read(); for i in 0..t { let n: usize = read(); //bin serch let mut l = 0; let mut r = vec.len() - 1; while l < r { let m = (l + r) / 2; if vec[m].0 < n { l = m + 1; } else { r = m; } } if vec[l].0 > n { l -= 1; } if vec[l] == (0, 0, 0) { p!(-1); continue; } println!("{}", vec[l].1 * vec[l].2); } }