Submission #4239613
Source Code Expand
using System;
using System.Collections.Generic;
using System.Linq;
namespace Practice
{
class Program
{
static void Main(string[] args)
{
Solve();
}
private const int MOD = 1000000007;
static void Solve()
{
var xy = ReadAndParseIntArr();
int ans = Math.Max(xy[0], xy[1]);
Console.WriteLine(ans);
}
#region よく使う便利関数
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 |
A - 正直者 |
User |
masakam1 |
Language |
C# (Mono 4.6.2.0) |
Score |
100 |
Code Size |
4707 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, kensho_diff01, kensho_diff02, kensho_diff03, kensho_diff04, kensho_diff05, kensho_min-max01, kensho_min-max02, kensho_min-max03, kensho_min-max04, kensho_min-max05, kensho_min-max06, kensho_min-max07, kensho_min-max08, kensho_min-max09, kensho_min-max10, kensho_rand01, kensho_rand02, kensho_rand03, kensho_rand04, kensho_rand05, kensho_rand06, kensho_rand07, kensho_rand08, kensho_rand09, kensho_rand10 |
Case Name |
Status |
Exec Time |
Memory |
00_sample_01.txt |
AC |
20 ms |
11092 KB |
00_sample_02.txt |
AC |
20 ms |
11092 KB |
kensho_diff01 |
AC |
21 ms |
11092 KB |
kensho_diff02 |
AC |
20 ms |
11092 KB |
kensho_diff03 |
AC |
20 ms |
9044 KB |
kensho_diff04 |
AC |
20 ms |
11092 KB |
kensho_diff05 |
AC |
20 ms |
11092 KB |
kensho_min-max01 |
AC |
20 ms |
11092 KB |
kensho_min-max02 |
AC |
20 ms |
9044 KB |
kensho_min-max03 |
AC |
20 ms |
9044 KB |
kensho_min-max04 |
AC |
21 ms |
13140 KB |
kensho_min-max05 |
AC |
20 ms |
11092 KB |
kensho_min-max06 |
AC |
20 ms |
11092 KB |
kensho_min-max07 |
AC |
20 ms |
9044 KB |
kensho_min-max08 |
AC |
20 ms |
9044 KB |
kensho_min-max09 |
AC |
20 ms |
9044 KB |
kensho_min-max10 |
AC |
20 ms |
9044 KB |
kensho_rand01 |
AC |
20 ms |
9044 KB |
kensho_rand02 |
AC |
20 ms |
11092 KB |
kensho_rand03 |
AC |
21 ms |
11092 KB |
kensho_rand04 |
AC |
20 ms |
11092 KB |
kensho_rand05 |
AC |
21 ms |
13140 KB |
kensho_rand06 |
AC |
20 ms |
11092 KB |
kensho_rand07 |
AC |
20 ms |
9044 KB |
kensho_rand08 |
AC |
20 ms |
9044 KB |
kensho_rand09 |
AC |
20 ms |
11092 KB |
kensho_rand10 |
AC |
20 ms |
11092 KB |