結果
問題 | No.593 4進FizzBuzz |
ユーザー | くれちー |
提出日時 | 2017-11-11 00:03:21 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
TLE
|
実行時間 | - |
コード長 | 9,919 bytes |
コンパイル時間 | 1,153 ms |
コンパイル使用メモリ | 123,308 KB |
実行使用メモリ | 59,856 KB |
最終ジャッジ日時 | 2024-05-03 14:56:50 |
合計ジャッジ時間 | 5,769 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 26 ms
32,952 KB |
testcase_01 | AC | 26 ms
17,664 KB |
testcase_02 | AC | 28 ms
17,536 KB |
testcase_03 | AC | 29 ms
17,664 KB |
testcase_04 | AC | 26 ms
17,664 KB |
testcase_05 | AC | 27 ms
17,536 KB |
testcase_06 | AC | 26 ms
17,536 KB |
testcase_07 | AC | 27 ms
17,664 KB |
testcase_08 | AC | 26 ms
17,408 KB |
testcase_09 | AC | 26 ms
17,664 KB |
testcase_10 | AC | 28 ms
17,792 KB |
testcase_11 | AC | 28 ms
17,664 KB |
testcase_12 | AC | 28 ms
17,536 KB |
testcase_13 | AC | 29 ms
17,664 KB |
testcase_14 | AC | 28 ms
17,536 KB |
testcase_15 | AC | 28 ms
17,792 KB |
testcase_16 | TLE | - |
testcase_17 | -- | - |
testcase_18 | -- | - |
testcase_19 | -- | - |
testcase_20 | -- | - |
testcase_21 | -- | - |
testcase_22 | -- | - |
testcase_23 | -- | - |
testcase_24 | -- | - |
testcase_25 | -- | - |
testcase_26 | -- | - |
testcase_27 | -- | - |
testcase_28 | -- | - |
testcase_29 | -- | - |
testcase_30 | -- | - |
testcase_31 | -- | - |
testcase_32 | -- | - |
testcase_33 | -- | - |
testcase_34 | -- | - |
コンパイルメッセージ
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.Numerics; using System.Text; using static System.Math; using static Extentions; using static MathExtensions; public static class Program { public static void Solve() { var n4 = S; var n10 = new BigInteger(); for (var i = 0; i < n4.Length; i++) n10 += (n4[n4.Length - i - 1] - '0') * BigInteger.Pow(4, i); var buzz = (n10 - n10 / 10 * 10) % 5 == 0; var ds = 0; while (n10 > 0) { var d = (int)(n10 - n10 / 10 * 10); ds += d; ds %= 3; n10 /= 10; } var fizz = ds == 0; var str = (fizz ? "Fizz" : "") + (buzz ? "Buzz" : ""); Console.WriteLine(str.Length > 0 ? str : n4); } #region Scanners static Scanner _scanner; static char C => _scanner.NextChar(); static string S => _scanner.NextString(); static int I => _scanner.NextInt(); static long L => _scanner.NextLong(); static BigInteger B => _scanner.NextBigInteger(); static double D => _scanner.NextDouble(); static decimal M => _scanner.NextDecimal(); #endregion public static void Main() { var sw = new StreamWriter(Console.OpenStandardOutput()); sw.NewLine = "\n"; #if DEBUG sw.AutoFlush = true; Console.SetError(sw); #else sw.AutoFlush = false; #endif Console.SetOut(sw); _scanner = new Scanner(Console.OpenStandardInput()); Solve(); Console.Out.Flush(); } } public static partial class Extentions { } #region Library public class Scanner { private readonly Stream _stream; private const int _bufferSize = 1024; private readonly byte[] _buf = new byte[_bufferSize]; private int _len, _ptr; public Scanner(Stream stream) { _stream = stream; } public byte ReadByte() { if (_ptr >= _len) { _len = _stream.Read(_buf, 0, 1024); _ptr = 0; } return _buf[_ptr++]; } public char ReadChar() => (char)ReadByte(); public string ReadLine() { var r = new StringBuilder(); if (_ptr == 0) r.Append(ReadChar()); for (; _ptr < _len; _ptr++) r.Append((char)_buf[_ptr]); return r.ToString(); } public char NextChar() => char.Parse(NextString()); public string NextString() { var r = new StringBuilder(); var b = ReadChar(); while (b != ' ' && b != '\n') { r.Append(b); b = ReadChar(); } return r.ToString(); } public int NextInt() => (int)NextLong(); public long NextLong() { var r = 0L; var b = ReadByte(); var n = b == '-'; if (n) b = ReadByte(); while (b != ' ' && b != '\n') { r = r * 10 + b - '0'; b = ReadByte(); } return n ? -r : r; } public BigInteger NextBigInteger() { var r = new BigInteger(); var b = ReadByte(); var n = b == '-'; if (n) b = ReadByte(); while (b != ' ' && b != '\n') { r = r * 10 + b - '0'; b = ReadByte(); } return n ? -r : r; } public double NextDouble() { var i = 0L; var b = ReadByte(); var n = b == '-'; if (n) b = ReadByte(); while (b != '.' && b != ' ' && b != '\n') { i = i * 10 + b - '0'; b = ReadByte(); } if (b != '.') return n ? -i : i; b = ReadByte(); var f = 0L; var p = 0; while (b != ' ' && b != '\n') { f = f * 10 + b - '0'; b = ReadByte(); p++; } var r = i + (double)f / Pow(10, p); return n ? -r : r; } public decimal NextDecimal() => decimal.Parse(NextString()); public T Next<T>(Func<string, T> parser) => parser(NextString()); } [DebuggerStepThrough] public static partial class Extentions { public static void Assert(bool condition) { if (!condition) throw new Exception("Assertion failed"); } public static string AsString(this IEnumerable<char> source) => new string(source.ToArray()); public static void ForEach<T>(this IEnumerable<T> source, Action<T> action) { foreach (var item in source) action(item); } public static void ForEach<T, _>(this IEnumerable<T> source, Func<T, _> func) { foreach (var item in source) func(item); } public static void ForEach<T>(this IEnumerable<T> source, Action<T, int> action) { var i = 0; foreach (var item in source) action(item, i++); } public static void ForEach<T, _>(this IEnumerable<T> source, Func<T, int, _> func) { var i = 0; foreach (var item in source) func(item, i++); } public static T Iterate<T>(int count, T seed, Func<T, T> func) { var r = seed; Repeat(count, () => { r = func(r); }); return r; } public static void Repeat(int count, Action action) { for (var i = 0; i < count; i++) action(); } public static void Repeat(int count, Action<int> action) { for (var i = 0; i < count; i++) action(i); } public static IEnumerable<T> Repeat<T>(Func<T> func) { for (var i = 0; ; i++) yield return func(); } public static IEnumerable<T> Repeat<T>(int count, Func<T> func) { for (var i = 0; i < count; i++) yield return func(); } public static IEnumerable<T> Repeat<T>(Func<int, T> func) { for (var i = 0; ; i++) yield return func(i); } public static IEnumerable<T> Repeat<T>(int count, Func<int, T> func) { for (var i = 0; i < count; i++) yield return func(i); } public static void Swap<T>(ref T x, ref T y) { var tmp = x; x = y; y = tmp; } public static (T1[], T2[]) Unzip<T1, T2>(this ICollection<(T1, T2)> source) { var ts1 = new T1[source.Count]; var ts2 = new T2[source.Count]; var i = 0; foreach (var (t1, t2) in source) { ts1[i] = t1; ts2[i] = t2; i++; } return (ts1, ts2); } public static (T1[], T2[], T3[]) Unzip<T1, T2, T3>(this ICollection<(T1, T2, T3)> source) { var ts1 = new T1[source.Count]; var ts2 = new T2[source.Count]; var ts3 = new T3[source.Count]; var i = 0; foreach (var (t1, t2, t3) in source) { ts1[i] = t1; ts2[i] = t2; ts3[i] = t3; i++; } return (ts1, ts2, ts3); } public static (T1[], T2[], T3[], T4[]) Unzip<T1, T2, T3, T4>(this ICollection<(T1, T2, T3, T4)> source) { var ts1 = new T1[source.Count]; var ts2 = new T2[source.Count]; var ts3 = new T3[source.Count]; var ts4 = new T4[source.Count]; var i = 0; foreach (var (t1, t2, t3, t4) in source) { ts1[i] = t1; ts2[i] = t2; ts3[i] = t3; ts4[i] = t4; i++; } return (ts1, ts2, ts3, ts4); } public static IEnumerable<T> Zip<T1, T2, T3, T>(this IEnumerable<T1> first, IEnumerable<T2> second, IEnumerable<T3> thrid, Func<T1, T2, T3, T> resultSelector) { using (var e1 = first.GetEnumerator()) using (var e2 = second.GetEnumerator()) using (var e3 = thrid.GetEnumerator()) { while (e1.MoveNext() && e2.MoveNext() && e3.MoveNext()) yield return resultSelector(e1.Current, e2.Current, e3.Current); } } public static IEnumerable<T> Zip<T1, T2, T3, T4, T>(this IEnumerable<T1> first, IEnumerable<T2> second, IEnumerable<T3> thrid, IEnumerable<T4> fourth, Func<T1, T2, T3, T4, T> resultSelector) { using (var e1 = first.GetEnumerator()) using (var e2 = second.GetEnumerator()) using (var e3 = thrid.GetEnumerator()) using (var e4 = fourth.GetEnumerator()) { while (e1.MoveNext() && e2.MoveNext() && e3.MoveNext() && e4.MoveNext()) yield return resultSelector(e1.Current, e2.Current, e3.Current, e4.Current); } } } [DebuggerStepThrough] public static class MathExtensions { public static int Gcd(int left, int right) { int r; while ((r = left % right) != 0) { left = right; right = r; } return right; } public static long Gcd(long left, long right) { long r; while ((r = left % right) != 0L) { left = right; right = r; } return right; } public static BigInteger Gcd(BigInteger left, BigInteger right) => BigInteger.GreatestCommonDivisor(left, right); public static int HighestOneBit(int x) { x |= x >> 01; x |= x >> 02; x |= x >> 04; x |= x >> 08; x |= x >> 16; return x - (x >> 1); } public static long HighestOneBit(long x) { x |= x >> 01; x |= x >> 02; x |= x >> 04; x |= x >> 08; x |= x >> 16; x |= x >> 32; return x - (x >> 1); } public static int Lcm(int left, int right) => left / Gcd(left, right) * right; public static long Lcm(long left, long right) => left / Gcd(left, right) * right; public static BigInteger Lcm(BigInteger left, BigInteger right) => left / Gcd(left, right) * right; public static int Pow(int value, int exponent) { var r = 1; while (exponent > 0) { if ((exponent & 1) == 1) r *= value; value *= value; exponent >>= 1; } return r; } public static long Pow(long value, int exponent) { var r = 1L; while (exponent > 0) { if ((exponent & 1) == 1) r *= value; value *= value; exponent >>= 1; } return r; } public static long Fact(int value) { var r = 1L; for (var i = 2; i <= value; i++) r *= i; return r; } } #endregion