結果

問題 No.1217 せしすせそ
ユーザー Konton7
提出日時 2020-09-04 21:27:48
言語 Rust
(1.83.0 + proconio)
結果
AC  
実行時間 1 ms / 2,000 ms
コード長 1,997 bytes
コンパイル時間 11,662 ms
コンパイル使用メモリ 402,136 KB
実行使用メモリ 6,820 KB
最終ジャッジ日時 2024-11-26 11:52:06
合計ジャッジ時間 12,686 ms
ジャッジサーバーID
(参考情報)
judge4 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 10
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: fields `mark`, `y`, and `x` are never read
  --> src/main.rs:59:5
   |
58 | struct Piece {
   |        ----- fields in this struct
59 |     mark: char,
   |     ^^^^
60 |     y: i32,
   |     ^
61 |     x: i32,
   |     ^
   |
   = note: `Piece` has a derived impl for the trait `Debug`, but this is intentionally ignored during dead code analysis
   = note: `#[warn(dead_code)]` on by default

ソースコード

diff #
プレゼンテーションモードにする

#[allow(unused_imports)]
use std::cmp;
#[allow(unused_imports)]
use std::collections::BTreeSet;
#[allow(unused_imports)]
use std::collections::HashMap;
#[allow(unused_imports)]
use std::collections::HashSet;
use std::fmt::Display;
use std::fs::File;
use std::io::Read;
#[allow(unused_imports)]
use std::mem;
#[allow(dead_code)]
fn pow_speedy_with_mod(mut p: i64, mut q: i64, m: i64) -> i64 {
p %= m;
let mut r = p;
let mut ret: i64 = 1;
while q > 0 {
ret *= if q % 2 == 1 { r } else { 1 };
r *= r;
r %= m;
q /= 2;
ret %= m;
}
return ret;
}
#[allow(dead_code)]
fn comb(n: usize, k: usize, m: i64, frac: &[i64], frac_inv: &[i64]) -> i64 {
let mut ret = 1i64;
if n < k {
return 0;
}
ret *= frac[n] * frac_inv[n - k];
ret %= m;
ret *= frac_inv[k];
ret %= m;
ret
}
#[allow(dead_code)]
fn show1dvec<T: Display>(v: &Vec<T>) {
let n = v.len();
for i in 0..n - 1 {
print!("{} ", v[i]);
}
println!("{} ", v[n - 1]);
}
#[allow(dead_code)]
fn check(i: usize, j: usize, h: usize, w: usize) -> bool {
i < h && j < w
}
#[derive(Debug)]
struct Piece {
mark: char,
y: i32,
x: i32,
}
fn main() {
let inputstatus = 1;
let mut buf = String::new();
let filename = "inputrust.txt";
if inputstatus == 0 {
let mut f = File::open(filename).expect("file not found");
f.read_to_string(&mut buf)
.expect("something went wrong reading the file");
} else {
std::io::stdin().read_to_string(&mut buf).unwrap();
}
let mut iter = buf.split_whitespace();
let s: Vec<char> = iter.next().unwrap().chars().collect();
let t: Vec<char> = "abcdefghijklmnopqrstuvwxyz".chars().collect();
for i in 0..26 {
if s[i] != t[i] {
println!("{}to{}", t[i], s[i]);
}
}
// let n = iter.next().unwrap().parse().unwrap();
// println!("{}", n);
// println!("{:?}", cum_num);
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0