Submission #4330118
Source Code Expand
using System; using System.Collections.Generic; using System.Linq; using System.Text; namespace Practice { class Program { static void Main(string[] args) { Solve(); } private const int MOD = 10007;// 1000000007; static void Solve() { var m = ReadAndParseInt(); string ans = ""; if( m < 100) { ans = "00"; }else if( m / 1000 <= 5) { ans = (m * 10 / 1000).ToString("D2"); }else if( m / 1000 <= 30 ) { ans = (m / 1000 + 50).ToString("D2"); }else if(m <= 70000) { ans = ((m / 1000 - 30) / 5 + 80).ToString("D2"); } else { ans = "89"; } Console.WriteLine(ans); } #region よく使う便利関数a private static bool isPrime(long x) { if(x == 2) { return true; } if(x < 2 || x % 2 == 0) { return false; } long i = 3; while(i * i <= x) { if(x % i == 0) { return false; } i = i + 2; } return true; } private static long lcm(long x, long y) { return x / gcd(x, y) * y; } private static long gcd(long x, long y) { return y > 0 ? gcd(y, x % y) : x; } private static long pow(long x, long n) { if(n == 0) { return 1; } long res = pow(x * x % MOD, n / 2); if(n % 2 == 1) { res = res * x % MOD; } return res; } private static int ReadAndParseInt() { return int.Parse(Console.ReadLine()); } private static int[] ReadAndParseIntArr() { return Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse); } private static long ReadAndParseLong() { return long.Parse(Console.ReadLine()); } private static long[] ReadAndParseLongArr() { return Array.ConvertAll(Console.ReadLine().Split(' '), long.Parse); } /// <summary> /// 指定した値以上の先頭のインデクスを返す /// </summary> /// <typeparam name="T">比較する値の型</typeparam> /// <param name="arr">対象の配列(※ソート済みであること)</param> /// <param name="start">開始インデクス [inclusive]</param> /// <param name="end">終了インデクス [exclusive]</param> /// <param name="value">検索する値</param> /// <param name="comparer">比較関数(インターフェイス)</param> /// <returns>指定した値以上の先頭のインデクス</returns> public static int LowerBound<T>(IReadOnlyList<T> arr, int start, int end, T value, IComparer<T> comparer) { int low = start; int high = end; int mid; while(low < high) { mid = ((high - low) >> 1) + low; if(comparer.Compare(arr[mid], value) < 0) low = mid + 1; else high = mid; } return low; } //引数省略のオーバーロード public static int LowerBound<T>(IReadOnlyList<T> arr, T value) where T : IComparable { return LowerBound(arr, 0, arr.Count, value, Comparer<T>.Default); } /// <summary> /// 指定した値より大きい先頭のインデクスを返す /// </summary> /// <typeparam name="T">比較する値の型</typeparam> /// <param name="arr">対象の配列(※ソート済みであること)</param> /// <param name="start">開始インデクス [inclusive]</param> /// <param name="end">終了インデクス [exclusive]</param> /// <param name="value">検索する値</param> /// <param name="comparer">比較関数(インターフェイス)</param> /// <returns>指定した値より大きい先頭のインデクス</returns> public static int UpperBound<T>(IReadOnlyList<T> arr, int start, int end, T value, IComparer<T> comparer) { int low = start; int high = end; int mid; while(low < high) { mid = ((high - low) >> 1) + low; if(comparer.Compare(arr[mid], value) <= 0) low = mid + 1; else high = mid; } return low; } //引数省略のオーバーロード public static int UpperBound<T>(IReadOnlyList<T> arr, T value) { return UpperBound(arr, 0, arr.Count, value, Comparer<T>.Default); } #endregion } }
Submission Info
Submission Time | |
---|---|
Task | B - 視程の通報 |
User | masakam1 |
Language | C# (Mono 4.6.2.0) |
Score | 100 |
Code Size | 4109 Byte |
Status | AC |
Exec Time | 21 ms |
Memory | 13140 KB |
Judge Result
Set Name | all | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
Set Name | Test Cases |
---|---|
all | 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt, test_34.txt, test_35.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_sample_01.txt | AC | 20 ms | 9044 KB |
00_sample_02.txt | AC | 20 ms | 11092 KB |
00_sample_03.txt | AC | 21 ms | 13140 KB |
test_01.txt | AC | 20 ms | 11092 KB |
test_02.txt | AC | 20 ms | 11092 KB |
test_03.txt | AC | 20 ms | 9044 KB |
test_04.txt | AC | 20 ms | 11092 KB |
test_05.txt | AC | 20 ms | 9044 KB |
test_06.txt | AC | 20 ms | 11092 KB |
test_07.txt | AC | 21 ms | 13140 KB |
test_08.txt | AC | 20 ms | 11092 KB |
test_09.txt | AC | 20 ms | 9044 KB |
test_10.txt | AC | 20 ms | 9044 KB |
test_11.txt | AC | 19 ms | 9044 KB |
test_12.txt | AC | 20 ms | 9044 KB |
test_13.txt | AC | 20 ms | 11092 KB |
test_14.txt | AC | 19 ms | 9044 KB |
test_15.txt | AC | 20 ms | 9044 KB |
test_16.txt | AC | 20 ms | 9044 KB |
test_17.txt | AC | 20 ms | 9044 KB |
test_18.txt | AC | 20 ms | 11092 KB |
test_19.txt | AC | 21 ms | 13140 KB |
test_20.txt | AC | 20 ms | 11092 KB |
test_21.txt | AC | 20 ms | 11092 KB |
test_22.txt | AC | 20 ms | 9044 KB |
test_23.txt | AC | 20 ms | 9044 KB |
test_24.txt | AC | 20 ms | 11092 KB |
test_25.txt | AC | 20 ms | 9044 KB |
test_26.txt | AC | 20 ms | 9044 KB |
test_27.txt | AC | 20 ms | 11092 KB |
test_28.txt | AC | 20 ms | 9044 KB |
test_29.txt | AC | 20 ms | 9044 KB |
test_30.txt | AC | 20 ms | 11092 KB |
test_31.txt | AC | 20 ms | 11092 KB |
test_32.txt | AC | 20 ms | 9044 KB |
test_33.txt | AC | 20 ms | 11092 KB |
test_34.txt | AC | 20 ms | 11092 KB |
test_35.txt | AC | 19 ms | 9044 KB |