結果
| 問題 | No.543 命題 | 
| コンテスト | |
| ユーザー |  kenichi | 
| 提出日時 | 2023-06-07 15:39:12 | 
| 言語 | Rust (1.83.0 + proconio) | 
| 結果 | 
                                AC
                                 
                             | 
| 実行時間 | 1 ms / 2,000 ms | 
| コード長 | 3,597 bytes | 
| コンパイル時間 | 14,581 ms | 
| コンパイル使用メモリ | 377,660 KB | 
| 実行使用メモリ | 5,248 KB | 
| 最終ジャッジ日時 | 2024-12-29 20:29:05 | 
| 合計ジャッジ時間 | 15,417 ms | 
| ジャッジサーバーID (参考情報) | judge5 / judge1 | 
(要ログイン)
| ファイルパターン | 結果 | 
|---|---|
| other | AC * 4 | 
ソースコード
use std::io::*;
use std::str::FromStr;
//use std::num;
//use std::cmp;
//use std::collections::VecDeque;
//use std::io::{self, BufRead};
fn main() {
	let a: String = read();
	let b: String = read();
	print!("{} {}",b,a);
}
pub fn ctoi(c: char) -> isize {
	let n = c as isize - '0' as isize;
	return n;
}
pub fn stoi(c: String) -> isize {
	let n = c.parse::<isize>().unwrap();
	return n;
}
pub fn find_char(sentence: Vec<char>, target: char, start: isize) -> isize {
	for _i in start as usize..sentence.len() {
		if sentence[_i] == target {
			return _i as isize;
		}
	}
	return -1;
}
pub fn hex_to_binary(hex_string: &str, x: u32) -> Option<String> {
	match i64::from_str_radix(hex_string, x) {
		Ok(decimal) => Some(format!("{}", decimal)),
		Err(_) => None,
	}
}
pub fn my_floor(x: f64) -> f64 {
	let rounded = (x * 1000.0).floor() / 1000.0;
	rounded
}
pub fn upper_lower(x: char) -> char {
	let result: char;
	if x.is_uppercase() {
		result = x.to_ascii_lowercase();
	} else if x.is_lowercase() {
		result = x.to_ascii_uppercase();
	} else {
		result = x;
	}
	result
}
pub fn maxf_2(x: f64, y: f64) -> f64 {
	let result;
	if x >= y {
		result = x;
	} else {
		result = y;
	}
	result
}
pub fn max_2(x: isize, y: isize) -> isize {
	let result;
	if x >= y {
		result = x;
	} else {
		result = y;
	}
	result
}
pub fn max_u_2(x: usize, y: usize) -> usize {
	let result;
	if x >= y {
		result = x;
	} else {
		result = y;
	}
	result
}
pub fn min_2(x: isize, y: isize) -> isize {
	let result;
	if x >= y {
		result = y;
	} else {
		result = x;
	}
	result
}
pub fn min_2_i32(x: i32, y: i32) -> i32 {
	let result;
	if x >= y {
		result = y;
	} else {
		result = x;
	}
	result
}
pub fn max_3(x: isize, y: isize, z: isize) -> isize {
	let result;
	if x >= y && y >= z {
		result = x;
	} else if x >= z && z >= y {
		result = x;
	} else if y >= x && x >= z {
		result = y;
	} else if y >= z && z >= x {
		result = y;
	} else if z >= x && x >= y {
		result = z;
	} else {
		result = z;
	}
	result
}
pub fn max_u_3(x: usize, y: usize, z: usize) -> usize {
	let result;
	if x >= y && y >= z {
		result = x;
	} else if x >= z && z >= y {
		result = x;
	} else if y >= x && x >= z {
		result = y;
	} else if y >= z && z >= x {
		result = y;
	} else if z >= x && x >= y {
		result = z;
	} else {
		result = z;
	}
	result
}
pub fn min_3(x: usize, y: usize, z: usize) -> usize {
	let result;
	if x <= y && y <= z {
		result = x;
	} else if x <= z && z <= y {
		result = x;
	} else if y <= x && x <= z {
		result = y;
	} else if y <= z && z <= x {
		result = y;
	} else if z <= x && x <= y {
		result = z;
	} else {
		result = z;
	}
	result
}
pub fn min_u_3(x: usize, y: usize, z: usize) -> usize {
	let result;
	if x <= y && y <= z {
		result = x;
	} else if x <= z && z <= y {
		result = x;
	} else if y <= x && x <= z {
		result = y;
	} else if y <= z && z <= x {
		result = y;
	} else if z <= x && x <= y {
		result = z;
	} else {
		result = z;
	}
	result
}
pub fn read_text() -> String {
	let mut word = String::new();
	std::io::stdin().read_line(&mut word).ok();
	let answer = word.trim().to_string();
	answer
}
pub fn read_array() -> Vec<char> {
	let array: String = read();
	let chars: Vec<char> = array.trim().chars().collect::<Vec<char>>();
	chars
}
pub fn read<T: FromStr>() -> T {
	let stdin = stdin();
	let stdin = stdin.lock();
	let token: String = stdin
		.bytes()
		.map(|c| c.expect("failed to read char") as char)
		.skip_while(|c| c.is_whitespace())
		.take_while(|c| !c.is_whitespace())
		.collect();
	token.parse().ok().expect("failed to parse token")
}
            
            
            
        