Submission #6389850
Source Code Expand
using System;
using System.Collections;
using System.Collections.Generic;
using System.Diagnostics;
using System.IO;
using System.Linq;
using System.Text;
namespace AGC018A
{
class Program
{
public static void Solve(Input input)
{
var n = input.NextInt();
var k = input.NextInt();
var a = input.NextInt(n);
// 元からあった数とそれぞれの差
var g = a.Aggregate(a[0], (x, y) => gcd(x, y));
if (k <= a.Max() && k % g == 0)
{
Console.WriteLine("POSSIBLE");
}
else
{
Console.WriteLine("IMPOSSIBLE");
}
}
static int gcd(int a, int b)
{
var r = a % b;
if (r == 0)
{
return b;
}
else
{
return gcd(b, r);
}
}
#region Main
public static void Main(string[] args)
{
// 出力が少ないときはこれをセットする方が時間かかるけれど
// その場合は出力がボトルネックになっていないので、まあ良しとする
var needsFlushOutput = true;
if (needsFlushOutput)
{
// 細かく出力しないようにする
var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
Console.SetOut(sw);
}
// 通常は引数無しで、ファイルから読み出したい場合はpath指定する
var input = new Input();
// 仮想的に標準入力をセットする
//input.SetText("");
Solve(input);
Console.Out.Flush();
}
#endregion
#region Competitive Template
#pragma warning disable CS0414
static readonly int MOD = (int)1e9 + 7;
static readonly int[] dx = { 1, 0, -1, 0 };
static readonly int[] dy = { 0, 1, 0, -1 };
/// <summary> 左上が原点 </summary>
static readonly char[] dir = { 'R', 'U', 'L', 'D' };
#pragma warning restore CS0414
/// <summary>
/// 値を書き換え可能なTuple(ぐらいのイメージ)
/// </summary>
/// <typeparam name="T"></typeparam>
/// <typeparam name="U"></typeparam>
public class Pair<T, U> : IComparable<Pair<T, U>>, IEquatable<Pair<T, U>>
where T : IComparable<T>
where U : IComparable<U>
{
public T V1 { get; set; }
public U V2 { get; set; }
public Pair(T v1, U v2)
{
this.V1 = v1;
this.V2 = v2;
}
public Pair(Pair<T, U> src)
{
this.V1 = src.V1;
this.V2 = src.V2;
}
public int CompareTo(Pair<T, U> other)
{
var r = this.V1.CompareTo(other.V1);
if (r == 0) r = this.V2.CompareTo(other.V2);
return r;
}
public bool Equals(Pair<T, U> other)
{
return other != null && this.CompareTo(other) == 0;
}
public override string ToString()
{
return $"{V1} {V2}";
}
public override bool Equals(object obj)
{
return Equals(obj as Pair<T, U>);
}
public override int GetHashCode()
{
var hashCode = 1989511945;
hashCode = hashCode * -1521134295 + V1.GetHashCode();
hashCode = hashCode * -1521134295 + V2.GetHashCode();
return hashCode;
}
public static bool operator ==(Pair<T, U> a, Pair<T, U> b)
{
if (object.ReferenceEquals(a, null))
{
return object.ReferenceEquals(b, null);
}
return a.Equals(b);
}
public static bool operator !=(Pair<T, U> a, Pair<T, U> b)
=> !(a == b);
public static bool operator <(Pair<T, U> a, Pair<T, U> b)
=> a.CompareTo(b) < 0;
public static bool operator <=(Pair<T, U> a, Pair<T, U> b)
=> a.CompareTo(b) <= 0;
public static bool operator >(Pair<T, U> a, Pair<T, U> b)
=> a.CompareTo(b) > 0;
public static bool operator >=(Pair<T, U> a, Pair<T, U> b)
=> a.CompareTo(b) >= 0;
}
public class Input
{
// 変な改行コードがたまに混じっているので、一応セパレート指定する
// スペース単独指定の方がもちろん早い
static readonly char[] separator = { ' ', '\r', '\n' };
Queue<string> q { get; set; }
StreamReader sr;
/// <summary>
/// 特定のファイルから読み出したい場合はpath指定する
/// </summary>
/// <param name="path"></param>
public Input(string path = "")
{
q = new Queue<string>();
if (string.IsNullOrEmpty(path))
{
sr = new StreamReader(Console.OpenStandardInput());
}
else
{
sr = new StreamReader(path);
}
}
/// <summary>
/// 入力予約
/// </summary>
/// <param name="items"></param>
public void SetText(IEnumerable<string> items)
{
foreach (var item in items)
{
SetText(item);
}
}
/// <summary>
/// 入力予約
/// </summary>
/// <param name="s"></param>
/// <returns></returns>
public bool SetText(string s)
{
if (s == null) return false;
foreach (var elem in s.Trim().Split(separator, StringSplitOptions.RemoveEmptyEntries))
{
q.Enqueue(elem);
}
return true;
}
/// <summary>
/// 要素が存在するか
/// </summary>
/// <returns></returns>
public bool Any()
=> q.Any() || read();
/// <summary>
/// 内部queueに入力からの値をsplitして格納する
/// </summary>
/// <returns></returns>
bool read()
{
var s = sr.ReadLine();
if (s == null) return false;
foreach (var elem in s.Trim().Split(separator, StringSplitOptions.RemoveEmptyEntries))
{
q.Enqueue(elem);
}
if (!q.Any()) return read();
return true;
}
/// <summary>
/// 次のstringを一つ読み込む
/// </summary>
/// <returns></returns>
public string Next()
{
if (!q.Any())
{
if (!read())
{
return "";
}
}
return q.Dequeue();
}
/// <summary>
/// 指定個数queueにたまるまでenqueueし続ける
/// </summary>
/// <param name="n"></param>
/// <returns></returns>
bool accumulate(int n)
{
while (q.Count() < n)
{
if (!read()) return false;
}
return true;
}
public int NextInt() => int.Parse(Next());
public long NextLong() => long.Parse(Next());
public double NextDouble() => double.Parse(Next());
/// <summary>
/// n個の要素をparseして、それぞれにoffsetをaddした配列を返す
/// </summary>
/// <typeparam name="T"></typeparam>
/// <param name="n"></param>
/// <param name="offset"></param>
/// <param name="parse"></param>
/// <param name="add"></param>
/// <returns></returns>
T[] NextT<T>(int n, T offset, Func<string, T> parse, Func<T, T, T> add)
{
if (!accumulate(n)) return null;
var a = new T[n];
for (int i = 0; i < n; i++)
a[i] = add(parse(q.Dequeue()), offset);
return a;
}
public string[] Next(int n) => NextT(n, "", x => x, (x, y) => x);
public int[] NextInt(int n, int offset = 0) => NextT(n, offset, int.Parse, (x, y) => x + y);
public long[] NextLong(int n, long offset = 0) => NextT(n, offset, long.Parse, (x, y) => x + y);
public double[] NextDouble(int n, double offset = 0.0) => NextT(n, offset, double.Parse, (x, y) => x + y);
/// <summary>
/// n個の要素をparseして、それぞれにoffsetをaddした配列を返す
/// </summary>
/// <typeparam name="T"></typeparam>
/// <param name="n"></param>
/// <param name="offset"></param>
/// <param name="parse"></param>
/// <param name="add"></param>
/// <returns></returns>
void NextT<T>(T[] a, T[] b, T offset, Func<string, T> parse, Func<T, T, T> add)
{
if (a.Length != b.Length) return;
if (!accumulate(a.Length * 2)) return;
for (int i = 0; i < a.Length; i++)
{
a[i] = add(parse(q.Dequeue()), offset);
b[i] = add(parse(q.Dequeue()), offset);
}
}
public void Next2D(string[] a, string[] b) => NextT(a, b, "", x => x, (x, y) => x);
public void Next2DInt(int[] a, int[] b, int offset = 0) => NextT(a, b, offset, int.Parse, (x, y) => x + y);
public void Next2DLong(long[] a, long[] b, long offset = 0) => NextT(a, b, offset, long.Parse, (x, y) => x + y);
public void Next2DDouble(double[] a, double[] b, double offset = 0.0) => NextT(a, b, offset, double.Parse, (x, y) => x + y);
}
static class Utils
{
public static void Print<T>(IEnumerable<T> ie, string sep = " ") => Console.WriteLine(string.Join(sep, ie));
public static void Print<T>(params T[] objs) => Print(objs);
public static T Max<T>(params T[] objs) => objs.Max();
public static T Min<T>(params T[] objs) => objs.Min();
public static void Swap<T>(ref T x, ref T y) where T : struct { var t = x; x = y; y = t; }
public static void Swap<T>(IList<T> list, int i, int j) where T : struct { var t = list[i]; list[i] = list[j]; list[j] = t; }
/// <summary>
/// vでfillされたT[d1][d2]配列を作成する
/// </summary>
/// <typeparam name="T"></typeparam>
/// <param name="d1"></param>
/// <param name="d2"></param>
/// <param name="v"></param>
/// <returns></returns>
public static T[][] Create2DArray<T>(int d1, int d2, T v = default(T))
{
return
Enumerable.Repeat(0, d1).Select(_ =>
Enumerable.Repeat(v, d2).ToArray()).ToArray();
}
/// <summary>
/// vでfillされたT[d1][d2][d3]配列を作成する
/// </summary>
/// <typeparam name="T"></typeparam>
/// <param name="d1"></param>
/// <param name="d2"></param>
/// <param name="d3"></param>
/// <param name="v"></param>
/// <returns></returns>
public static T[][][] Create3DArray<T>(int d1, int d2, int d3, T v = default(T))
{
return
Enumerable.Repeat(0, d1).Select(_ =>
Enumerable.Repeat(0, d2).Select(__ =>
Enumerable.Repeat(v, d3).ToArray()).ToArray()).ToArray();
}
}
#endregion
}
}
Submission Info
Submission Time |
|
Task |
A - Getting Difference |
User |
tetora1011 |
Language |
C# (Mono 4.6.2.0) |
Score |
300 |
Code Size |
12952 Byte |
Status |
AC |
Exec Time |
77 ms |
Memory |
20576 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
300 / 300 |
Status |
|
|
Set Name |
Test Cases |
Sample |
sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt |
All |
sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt |
Case Name |
Status |
Exec Time |
Memory |
sample_01.txt |
AC |
25 ms |
11348 KB |
sample_02.txt |
AC |
26 ms |
11348 KB |
sample_03.txt |
AC |
26 ms |
13268 KB |
sample_04.txt |
AC |
26 ms |
11476 KB |
subtask_1_01.txt |
AC |
25 ms |
9300 KB |
subtask_1_02.txt |
AC |
26 ms |
13396 KB |
subtask_1_03.txt |
AC |
77 ms |
20576 KB |
subtask_1_04.txt |
AC |
74 ms |
20576 KB |
subtask_1_05.txt |
AC |
51 ms |
17248 KB |
subtask_1_06.txt |
AC |
33 ms |
12768 KB |
subtask_1_07.txt |
AC |
55 ms |
17632 KB |
subtask_1_08.txt |
AC |
71 ms |
19808 KB |
subtask_1_09.txt |
AC |
45 ms |
12384 KB |
subtask_1_10.txt |
AC |
62 ms |
20576 KB |
subtask_1_11.txt |
AC |
67 ms |
17248 KB |