結果
| 問題 | No.1264 010 |
| ユーザー |
 g4np0n_kyopro
|
| 提出日時 | 2020-10-23 22:08:08 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 9,455 bytes |
| コンパイル時間 | 1,542 ms |
| コンパイル使用メモリ | 112,000 KB |
| 実行使用メモリ | 18,816 KB |
| 最終ジャッジ日時 | 2024-07-21 10:38:57 |
| 合計ジャッジ時間 | 4,396 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge2 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | WA | - |
| testcase_01 | WA | - |
| testcase_02 | WA | - |
| testcase_03 | WA | - |
| testcase_04 | WA | - |
| testcase_05 | WA | - |
| testcase_06 | WA | - |
| testcase_07 | WA | - |
| testcase_08 | WA | - |
| testcase_09 | WA | - |
| testcase_10 | WA | - |
| testcase_11 | WA | - |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using Microsoft.Win32.SafeHandles;
using System;
using System.Collections.Generic;
using System.IO;
using System.Linq;
using System.Runtime.CompilerServices;
using System.Xml.Schema;
public static class Ex
{
public static bool IsNullOrEmpty(this string s) { return string.IsNullOrEmpty(s); }
public static void yesno(this bool b) => Console.WriteLine(b ? "yes" : "no");
public static void YesNo(this bool b) => Console.WriteLine(b ? "Yes" : "No");
public static void YESNO(this bool b) => Console.WriteLine(b ? "YES" : "NO");
//[MethodImpl(MethodImplOptions.AggressiveInlining)]
//public static bool Chmax<T>(ref this T a, T b) where T : struct, IComparable<T>
//{
// if (b.CompareTo(a) > 0) { a = b; return true; }
// else return false;
//}
//[MethodImpl(MethodImplOptions.AggressiveInlining)]
//public static bool Chmin<T>(ref this T a, T b) where T : struct, IComparable<T>
//{
// if (b.CompareTo(a) < 0) { a = b; return true; }
// else return false;
//}
public static List<string> FastSort(this List<string> s) { s.Sort(StringComparer.OrdinalIgnoreCase); return s.ToList(); }
public static int PopCount(this uint bits)
{
bits = (bits & 0x55555555) + (bits >> 1 & 0x55555555);
bits = (bits & 0x33333333) + (bits >> 2 & 0x33333333);
bits = (bits & 0x0f0f0f0f) + (bits >> 4 & 0x0f0f0f0f);
bits = (bits & 0x00ff00ff) + (bits >> 8 & 0x00ff00ff);
return (int)((bits & 0x0000ffff) + (bits >> 16 & 0x0000ffff));
}
}
partial class Program
{
[MethodImpl(MethodImplOptions.AggressiveInlining)]
string GetStr() { return Console.ReadLine().Trim(); }
[MethodImpl(MethodImplOptions.AggressiveInlining)]
char GetChar() { return Console.ReadLine().Trim()[0]; }
[MethodImpl(MethodImplOptions.AggressiveInlining)]
int GetInt() { return int.Parse(Console.ReadLine().Trim()); }
[MethodImpl(MethodImplOptions.AggressiveInlining)]
long GetLong() { return long.Parse(Console.ReadLine().Trim()); }
[MethodImpl(MethodImplOptions.AggressiveInlining)]
double GetDouble() { return double.Parse(Console.ReadLine().Trim()); }
[MethodImpl(MethodImplOptions.AggressiveInlining)]
string[] GetStrArray() { return Console.ReadLine().Trim().Split(' '); }
[MethodImpl(MethodImplOptions.AggressiveInlining)]
string[][] GetStrArray(int N)
{
var res = new string[N][];
for (int i = 0; i < N; i++) res[i] = Console.ReadLine().Trim().Split(' ');
return res;
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
int[] GetIntArray() { return Console.ReadLine().Trim().Split(' ').Select(int.Parse).ToArray(); }
[MethodImpl(MethodImplOptions.AggressiveInlining)]
int[][] GetIntArray(int N)
{
var res = new int[N][];
for (int i = 0; i < N; i++) res[i] = Console.ReadLine().Trim().Split(' ').Select(int.Parse).ToArray();
return res;
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
public long[] GetLongArray() { return Console.ReadLine().Trim().Split(' ').Select(long.Parse).ToArray(); }
[MethodImpl(MethodImplOptions.AggressiveInlining)]
long[][] GetLongArray(int N)
{
var res = new long[N][];
for (int i = 0; i < N; i++) res[i] = Console.ReadLine().Trim().Split(' ').Select(long.Parse).ToArray();
return res;
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
char[] GetCharArray() { return Console.ReadLine().Trim().Split(' ').Select(char.Parse).ToArray(); }
[MethodImpl(MethodImplOptions.AggressiveInlining)]
double[] GetDoubleArray() { return Console.ReadLine().Trim().Split(' ').Select(double.Parse).ToArray(); }
[MethodImpl(MethodImplOptions.AggressiveInlining)]
double[][] GetDoubleArray(int N)
{
var res = new double[N][];
for (int i = 0; i < N; i++) res[i] = Console.ReadLine().Trim().Split(' ').Select(double.Parse).ToArray();
return res;
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
char[][] GetGrid(int H)
{
var res = new char[H][];
for (int i = 0; i < H; i++) res[i] = Console.ReadLine().Trim().ToCharArray();
return res;
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
T[] CreateArray<T>(int N, T value)
{
var res = new T[N];
for (int i = 0; i < N; i++) res[i] = value;
return res;
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
T[][] CreateArray<T>(int H, int W, T value)
{
var res = new T[H][];
for (int i = 0; i < H; i++)
{
res[i] = new T[W];
for (int j = 0; j < W; j++) res[i][j] = value;
}
return res;
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
T[][][] CreateArray<T>(int H, int W, int R, T value)
{
var res = new T[H][][];
for (int i = 0; i < H; i++)
{
res[i] = new T[W][];
for (int j = 0; j < W; j++)
{
res[i][j] = new T[R];
for (int k = 0; k < R; k++) res[i][j][k] = value;
}
}
return res;
}
Dictionary<int, List<int>> GetUnweightedAdjacencyList(int N, int M, bool isDirected, bool isNode_0indexed)
{
var dic = new Dictionary<int, List<int>>();
foreach (var e in Enumerable.Range(0, N)) { dic.Add(e, new List<int>()); }
for (int i = 0; i < M; i++)
{
var input = GetIntArray();
var a = isNode_0indexed ? input[0] : input[0] - 1;
var b = isNode_0indexed ? input[1] : input[1] - 1;
dic[a].Add(b);
if (isDirected == false) dic[b].Add(a);
}
return dic;
}
//Dictionary<int, List<(int node, long cost)>> GetWeightedAdjacencyList(int N, int M, bool isDirected, bool isNode_0indexed)
//{
// var dic = new Dictionary<int, List<(int, long)>>();
// foreach (var e in Enumerable.Range(0, N)) { dic.Add(e, new List<(int, long)>()); }
// for (int i = 0; i < M; i++)
// {
// var input = GetIntArray();
// var a = isNode_0indexed ? input[0] : input[0] - 1;
// var b = isNode_0indexed ? input[1] : input[1] - 1;
// var c = input[2];
// dic[a].Add((b, c));
// if (isDirected == false) dic[b].Add((a, c));
// }
// return dic;
//}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
bool eq<T, U>() => typeof(T).Equals(typeof(U));
[MethodImpl(MethodImplOptions.AggressiveInlining)]
T ct<T, U>(U a) => (T)Convert.ChangeType(a, typeof(T));
[MethodImpl(MethodImplOptions.AggressiveInlining)]
T cv<T>(string s) => eq<T, int>() ? ct<T, int>(int.Parse(s))
: eq<T, long>() ? ct<T, long>(long.Parse(s))
: eq<T, double>() ? ct<T, double>(double.Parse(s))
: eq<T, char>() ? ct<T, char>(s[0])
: ct<T, string>(s);
[MethodImpl(MethodImplOptions.AggressiveInlining)]
void Multi<T>(out T a) => a = cv<T>(GetStr());
[MethodImpl(MethodImplOptions.AggressiveInlining)]
void Multi<T, U>(out T a, out U b)
{
var ar = GetStrArray(); a = cv<T>(ar[0]); b = cv<U>(ar[1]);
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
void Multi<T, U, V>(out T a, out U b, out V c)
{
var ar = GetStrArray(); a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]);
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
void Multi<T, U, V, W>(out T a, out U b, out V c, out W d)
{
var ar = GetStrArray(); a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]);
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
void Multi<T, U, V, W, X>(out T a, out U b, out V c, out W d, out X e)
{
var ar = GetStrArray(); a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]); e = cv<X>(ar[4]);
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
void Multi<T, U, V, W, X, Y>(out T a, out U b, out V c, out W d, out X e, out Y f)
{
var ar = GetStrArray(); a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]); e = cv<X>(ar[4]); f = cv<Y>(ar[5]);
}
[MethodImpl(MethodImplOptions.AggressiveInlining)]
void Output<T>(T t) => Console.WriteLine(t);
[MethodImpl(MethodImplOptions.AggressiveInlining)]
void Output<T>(IList<T> ls) => Console.WriteLine(string.Join(" ", ls));
void Debug<T>(IList<IList<T>> ls)
{
foreach (var l in ls)
foreach (var s in l)
Console.WriteLine(s);
}
void Swap<T>(ref T a, ref T b) { T temp = a; a = b; b = temp; }
int[] dx = new int[] { 1, 0, -1, 0, 1, -1, -1, 1 };
int[] dy = new int[] { 0, 1, 0, -1, 1, 1, -1, -1 };
long mod = 1000000007;
}
partial class Program
{
static void Main()
{
Console.SetIn(new StreamReader(Console.OpenStandardInput(8192)));
Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
new Program().Solve();
Console.Out.Flush();
Console.Read();
}
public void Solve()
{
int N = GetInt();
var S = new List<char>();
S.AddRange(Enumerable.Repeat('0', N));
S.AddRange(new char[] { '1', '0', '1' });
Output<char>(S);
}
}