結果
問題 | No.536 人工知能 |
ユーザー | tak |
提出日時 | 2017-07-28 12:38:58 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 28 ms / 1,000 ms |
コード長 | 4,792 bytes |
コンパイル時間 | 1,010 ms |
コンパイル使用メモリ | 116,040 KB |
実行使用メモリ | 26,200 KB |
最終ジャッジ日時 | 2024-10-10 04:46:43 |
合計ジャッジ時間 | 1,900 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 28 ms
24,180 KB |
testcase_01 | AC | 27 ms
24,140 KB |
testcase_02 | AC | 28 ms
24,540 KB |
testcase_03 | AC | 27 ms
24,156 KB |
testcase_04 | AC | 28 ms
26,108 KB |
testcase_05 | AC | 28 ms
23,924 KB |
testcase_06 | AC | 28 ms
26,200 KB |
testcase_07 | AC | 28 ms
26,064 KB |
testcase_08 | AC | 27 ms
24,176 KB |
testcase_09 | AC | 27 ms
26,068 KB |
testcase_10 | AC | 26 ms
22,452 KB |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System; using System.Collections; using System.Collections.Generic; using System.Diagnostics; using System.IO; using System.Linq; using System.Text; namespace AtCoder { class MainClass { void Solve() { io.i(out string s); if(s.Substring(s.Length-2,2).ToLower()=="ai") s = s.Substring(0, s.Length - 2) + "AI"; else s += "-AI"; io.o(s); } public static void Main(string[] args) { new MainClass().Stream(); } IO io = new IO(); void Stream() { Solve(); io.writeFlush(); } class IO { string[] nextBuffer; int BufferCnt; char[] cs = new char[] { ' ' }; StreamWriter sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false }; public IO() { nextBuffer = new string[0]; BufferCnt = 0; Console.SetOut(sw); } public string next() { if (BufferCnt < nextBuffer.Length) return nextBuffer[BufferCnt++]; string st = Console.ReadLine(); while (st == "") st = Console.ReadLine(); nextBuffer = st.Split(cs, StringSplitOptions.RemoveEmptyEntries); BufferCnt = 0; return nextBuffer[BufferCnt++]; } public char nextChar() { return char.Parse(next()); } public int nextInt() { return int.Parse(next()); } public long nextLong() { return long.Parse(next()); } public double nextDouble() { return double.Parse(next()); } public string[] array() { return Console.ReadLine().Split(' '); } public char[] arrayChar() { return Array.ConvertAll(array(), char.Parse); } public int[] arrayInt() { return Array.ConvertAll(array(), int.Parse); } public long[] arrayLong() { return Array.ConvertAll(array(), long.Parse); } public double[] arrayDouble() { return Array.ConvertAll(array(), double.Parse); } private bool typeEQ<T, U>() { return typeof(T).Equals(typeof(U)); } private T convertType<T, U>(U v) { return (T)Convert.ChangeType(v, typeof(T)); } private T suitType<T>(string s) { if (typeEQ<T, int>()) return convertType<T, int>(int.Parse(s)); if (typeEQ<T, long>()) return convertType<T, long>(long.Parse(s)); if (typeEQ<T, double>()) return convertType<T, double>(double.Parse(s)); if (typeEQ<T, char>()) return convertType<T, char>(char.Parse(s)); return convertType<T, string>(s); } public void i<T>(out T v) { v = suitType<T>(next()); } public void i<T, U>(out T v1, out U v2) { var a = array(); v1 = suitType<T>(a[0]); v2 = suitType<U>(a[1]); } public void i<T, U, V>(out T v1, out U v2, out V v3) { var a = array(); v1 = suitType<T>(a[0]); v2 = suitType<U>(a[1]); v3 = suitType<V>(a[2]); } public void i<T, U, V, W>(out T v1, out U v2, out V v3, out W v4) { var a = array(); v1 = suitType<T>(a[0]); v2 = suitType<U>(a[1]); v3 = suitType<V>(a[2]); v4 = suitType<W>(a[3]); } public void o<T>(T v) { Console.WriteLine(v); } public void o<T>(T[] a) { foreach (T v in a) Console.WriteLine(v); } public void o<T>(List<T> l) { foreach (T v in l) sw.WriteLine(v); } public void writeFlush() { Console.Out.Flush(); } } class Mathf { public int mod = 1000000007;//10^9+7 public long Pow(long a, long b) { if (b == 0) return 1; if (b % 2 == 1) return (a % mod * Pow(a % mod, b - 1) % mod) % mod; else return Pow(a * a % mod, b / 2) % mod; } public long Fact(long n) { return n != 0 ? (n % mod * (Fact(n - 1) % mod) % mod) : 1; } public long C(long n, long r) { if (r == 0 || n == r) return 1; else return (Fact(n) % mod * Pow((Fact(n - r) % mod * Fact(r) % mod) % mod, mod - 2) % mod) % mod; } public int GCD(int a, int b) { if (a < b) Swap(ref a, ref b); return b == 0 ? a : GCD(b, a % b); } public int GCD(int[] array) { return array.Aggregate((v, next) => GCD(v, next)); } public void Swap<T>(ref T a, ref T b) { T tmp = a; a = b; b = tmp; } public T Max<T>(params T[] v) { return v.Max(); } public T Min<T>(params T[] v) { return v.Min(); } public int ManhattanDis(int x1, int y1, int x2, int y2) { return Math.Abs(x1 - x2) + Math.Abs(y1 - y2); } } } }