結果
| 問題 | No.2608 Divide into two |
| ユーザー |
 Moss_Local
|
| 提出日時 | 2024-01-19 22:19:36 |
| 言語 | Rust (1.83.0 + proconio) |
| 結果 |
AC
|
| 実行時間 | 2 ms / 1,000 ms |
| コード長 | 5,794 bytes |
| コンパイル時間 | 11,925 ms |
| コンパイル使用メモリ | 405,096 KB |
| 実行使用メモリ | 6,944 KB |
| 最終ジャッジ日時 | 2024-09-28 04:41:15 |
| 合計ジャッジ時間 | 12,622 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 1 |
| other | AC * 2 |
コンパイルメッセージ
warning: unused variable: `x`
--> src/main.rs:219:13
|
219 | let mut x = n;
| ^ help: if this is intentional, prefix it with an underscore: `_x`
|
= note: `#[warn(unused_variables)]` on by default
warning: variable does not need to be mutable
--> src/main.rs:219:9
|
219 | let mut x = n;
| ----^
| |
| help: remove this `mut`
|
= note: `#[warn(unused_mut)]` on by default
warning: unused variable: `i`
--> src/main.rs:243:9
|
243 | for i in 0..n {
| ^ help: if this is intentional, prefix it with an underscore: `_i`
ソースコード
// -*- 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::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) => {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}};}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 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() {let n: usize = read();if n <= 2 {p!(-1);return;}let mut res = vec![0; n];let mut su = 0;let mut x = n;for i in (1..=n).rev() {if (su + i) * 2 <= n * (n + 1) / 2 {res[i - 1] = 1;su += i;}}// d!(su);if su * 2 != n * (n + 1) / 2 {p!(-1);return;}println!("{}",res.iter().map(|x| x.to_string()).collect::<Vec<_>>().join(""));return;}fn solve() {let n: usize = read();for i in 0..n {solve_part();}return;}