結果
| 問題 | No.2972 確率的素数判定 |
| ユーザー |
 Moss_Local
|
| 提出日時 | 2023-08-28 23:00:02 |
| 言語 | Rust (1.83.0 + proconio) |
| 結果 |
AC
|
| 実行時間 | 167 ms / 2,000 ms |
| コード長 | 6,212 bytes |
| コンパイル時間 | 18,545 ms |
| コンパイル使用メモリ | 378,872 KB |
| 実行使用メモリ | 5,248 KB |
| 最終ジャッジ日時 | 2024-12-30 13:31:37 |
| 合計ジャッジ時間 | 22,792 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 20 |
コンパイルメッセージ
warning: unused variable: `i`
--> src/main.rs:248:9
|
248 | for i in 0..n {
| ^ 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:208:8
|
208 | if n >= 0 {
| ^^^^^^
|
= note: `#[warn(unused_comparisons)]` on by default
ソースコード
// -*- coding:utf-8-unix -*-// #![feature(map_first_last)]#![allow(dead_code)]#![allow(unused_imports)]#![allow(unused_macros)]use std::arch::x86_64::_MM_FROUND_NEARBYINT;// use core::num;use std::cmp::*;use std::fmt::*;use std::hash::*;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 exprprintln!("{}", $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) => {println!("{:?}", $x);};}macro_rules! yn {($val:expr) => {if $val {println!("Yes");} else {println!("No");}};}fn main() {solve();}// use str::Chars;#[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 readi() -> i64 {let mut str = String::new();let _ = stdin().read_line(&mut str).unwrap();let mut iter = str.split_whitespace();iter.next().unwrap().parse::<i64>().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 str = String::new();let _ = stdin().read_line(&mut str).unwrap();let mut iter = str.split_whitespace();(iter.next().unwrap().parse::<i64>().unwrap(),iter.next().unwrap().parse::<i64>().unwrap(),)}#[allow(dead_code)]fn readiii() -> (i64, i64, i64) {let mut str = String::new();let _ = stdin().read_line(&mut str).unwrap();let mut iter = str.split_whitespace();(iter.next().unwrap().parse::<i64>().unwrap(),iter.next().unwrap().parse::<i64>().unwrap(),iter.next().unwrap().parse::<i64>().unwrap(),)}#[allow(dead_code)]fn readuu() -> (usize, usize) {let mut str = String::new();let _ = stdin().read_line(&mut str).unwrap();let mut iter = str.split_whitespace();(iter.next().unwrap().parse::<usize>().unwrap(),iter.next().unwrap().parse::<usize>().unwrap(),)}#[allow(dead_code)]fn readff() -> (f64, f64) {let mut str = String::new();let _ = stdin().read_line(&mut str).unwrap();let mut iter = str.split_whitespace();(iter.next().unwrap().parse::<f64>().unwrap(),iter.next().unwrap().parse::<f64>().unwrap(),)}fn readcc() -> (char, char) {let mut str = String::new();let _ = stdin().read_line(&mut str).unwrap();let mut iter = str.split_whitespace();(iter.next().unwrap().parse::<char>().unwrap(),iter.next().unwrap().parse::<char>().unwrap(),)}fn readuuu() -> (usize, usize, usize) {let mut str = String::new();let _ = stdin().read_line(&mut str).unwrap();let mut iter = str.split_whitespace();(iter.next().unwrap().parse::<usize>().unwrap(),iter.next().unwrap().parse::<usize>().unwrap(),iter.next().unwrap().parse::<usize>().unwrap(),)}#[allow(dead_code)]fn readiiii() -> (i64, i64, i64, i64) {let mut str = String::new();let _ = stdin().read_line(&mut str).unwrap();let mut iter = str.split_whitespace();(iter.next().unwrap().parse::<i64>().unwrap(),iter.next().unwrap().parse::<i64>().unwrap(),iter.next().unwrap().parse::<i64>().unwrap(),iter.next().unwrap().parse::<i64>().unwrap(),)}#[allow(dead_code)]fn readuuuu() -> (usize, usize, usize, usize) {let mut str = String::new();let _ = stdin().read_line(&mut str).unwrap();let mut iter = str.split_whitespace();(iter.next().unwrap().parse::<usize>().unwrap(),iter.next().unwrap().parse::<usize>().unwrap(),iter.next().unwrap().parse::<usize>().unwrap(),iter.next().unwrap().parse::<usize>().unwrap(),)}fn solve_part(pt_cnt: &Vec<usize>) {let (n, p, q) = readuuu();let cnt = pt_cnt[n];let n = n as f64;let p = p as f64 / 100.0;let q = q as f64 / 100.0;let n_prob = cnt as f64 / (n) as f64;let res = (p) * (n_prob) / (p * n_prob + (1.0 - q) * (1.0 - n_prob));// d!((res, n_prob, cnt, n, p, q));println!("{}", res);return;}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 solve() {let n: usize = read();let pt = prime_table(101010);let mut pt_cnt = vec![0; 101010];for p in pt {pt_cnt[p] += 1;}for i in 0..101000 {pt_cnt[i + 1] += pt_cnt[i];}for i in 0..n {solve_part(&pt_cnt);}return;}