結果
問題 | No.321 (P,Q)-サンタと街の子供たち |
ユーザー | りあん |
提出日時 | 2015-12-14 00:23:25 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 239 ms / 2,000 ms |
コード長 | 5,512 bytes |
コンパイル時間 | 3,665 ms |
コンパイル使用メモリ | 109,344 KB |
実行使用メモリ | 33,548 KB |
最終ジャッジ日時 | 2023-09-21 03:08:30 |
合計ジャッジ時間 | 10,211 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 66 ms
23,944 KB |
testcase_01 | AC | 66 ms
22,064 KB |
testcase_02 | AC | 66 ms
24,060 KB |
testcase_03 | AC | 67 ms
23,884 KB |
testcase_04 | AC | 66 ms
24,004 KB |
testcase_05 | AC | 66 ms
21,920 KB |
testcase_06 | AC | 66 ms
22,104 KB |
testcase_07 | AC | 66 ms
22,056 KB |
testcase_08 | AC | 66 ms
24,076 KB |
testcase_09 | AC | 66 ms
22,008 KB |
testcase_10 | AC | 65 ms
21,924 KB |
testcase_11 | AC | 65 ms
21,956 KB |
testcase_12 | AC | 66 ms
24,048 KB |
testcase_13 | AC | 65 ms
22,072 KB |
testcase_14 | AC | 165 ms
31,504 KB |
testcase_15 | AC | 237 ms
33,132 KB |
testcase_16 | AC | 133 ms
27,540 KB |
testcase_17 | AC | 67 ms
22,052 KB |
testcase_18 | AC | 150 ms
30,156 KB |
testcase_19 | AC | 175 ms
26,840 KB |
testcase_20 | AC | 233 ms
30,840 KB |
testcase_21 | AC | 170 ms
32,568 KB |
testcase_22 | AC | 96 ms
28,484 KB |
testcase_23 | AC | 209 ms
31,988 KB |
testcase_24 | AC | 103 ms
26,820 KB |
testcase_25 | AC | 161 ms
30,560 KB |
testcase_26 | AC | 232 ms
32,676 KB |
testcase_27 | AC | 190 ms
29,300 KB |
testcase_28 | AC | 186 ms
31,404 KB |
testcase_29 | AC | 239 ms
31,236 KB |
testcase_30 | AC | 70 ms
22,020 KB |
testcase_31 | AC | 68 ms
22,140 KB |
testcase_32 | AC | 153 ms
26,152 KB |
testcase_33 | AC | 150 ms
28,128 KB |
testcase_34 | AC | 129 ms
29,576 KB |
testcase_35 | AC | 200 ms
33,548 KB |
testcase_36 | AC | 71 ms
22,000 KB |
testcase_37 | AC | 170 ms
30,868 KB |
testcase_38 | AC | 151 ms
30,144 KB |
testcase_39 | AC | 92 ms
28,472 KB |
testcase_40 | AC | 226 ms
30,448 KB |
testcase_41 | AC | 109 ms
28,924 KB |
testcase_42 | AC | 204 ms
29,864 KB |
testcase_43 | AC | 133 ms
29,472 KB |
testcase_44 | AC | 192 ms
31,396 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.Generic; using System.Linq; using System.IO; using System.IO.Compression; using System.Text; //using System.Numerics; namespace Solver { class Program { const int M = 1000000007; const double eps = 1e-9; static void Main() { var sw = new System.IO.StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false }; var sc = new Scan(); var mt = new mymath(); var a = sc.LongArr; Array.Sort(a); long p = a[0], q = a[1]; var n = sc.Int; var poi = new long[n][]; for (int i = 0; i < n; i++) { poi[i] = sc.LongArr.Select(Math.Abs).ToArray(); } int ans = 0; if (p == 0) { if (q == 0) { foreach (var item in poi) if (item[0] == 0 && item[1] == 0) ++ans; } else { foreach (var item in poi) if (mt.gcd(item[0], item[1]) % q == 0) ++ans; } Console.WriteLine(ans); return; } var gc = mt.gcd(p, q); bool c = (p / gc + q / gc) % 2 == 1; foreach (var item in poi) if (mt.gcd(item[0], item[1]) % gc == 0 && (c || (item[0] / gc + item[1] / gc) % 2 == 0)) ++ans; sw.WriteLine(ans); sw.Flush(); } static bool isprime(long n) { if (n == 1) return false; for (long i = 2; i * i <= n; i++) if (n % i == 0) return false; return true; } static string strsort(string s) { var c = s.ToCharArray(); Array.Sort(c); return string.Join("", c); } static string strswap(string s, int i, int j) { var c = s.ToCharArray(); c[i] = s[j]; c[j] = s[i]; return string.Join("", c); } static T[] copy<T>(T[] a) { var ret = new T[a.Length]; for (int i = 0; i < a.Length; i++) ret[i] = a[i]; return ret; } } class Scan { public int Int { get { return int.Parse(Console.ReadLine().Trim()); } } public long Long { get { return long.Parse(Console.ReadLine().Trim()); } } public string Str { get { return Console.ReadLine().Trim(); } } public int[] IntArr { get { return Console.ReadLine().Trim().Split().Select(int.Parse).ToArray(); } } public int[] IntArrWithSep(char sep) { return Console.ReadLine().Trim().Split(sep).Select(int.Parse).ToArray(); } public long[] LongArr { get { return Console.ReadLine().Trim().Split().Select(long.Parse).ToArray(); } } public double[] DoubleArr { get { return Console.ReadLine().Split().Select(double.Parse).ToArray(); } } public string[] StrArr { get { return Console.ReadLine().Trim().Split(); } } public List<int> IntList { get { return Console.ReadLine().Trim().Split().Select(int.Parse).ToList(); } } public List<long> LongList { get { return Console.ReadLine().Trim().Split().Select(long.Parse).ToList(); } } public void Multi(out int a, out int b) { var arr = IntArr; a = arr[0]; b = arr[1]; } public void Multi(out int a, out int b, out int c) { var arr = IntArr; a = arr[0]; b = arr[1]; c = arr[2]; } public void Multi(out int a, out int b, out int c, out int d) { var arr = IntArr; a = arr[0]; b = arr[1]; c = arr[2]; d = arr[3]; } public void Multi(out int a, out string b) { var arr = StrArr; a = int.Parse(arr[0]); b = arr[1]; } public void Multi(out int a, out int b, out string c) { var arr = StrArr; a = int.Parse(arr[0]); b = int.Parse(arr[1]); c = arr[2]; } public void Multi(out int a, out char b) { var arr = StrArr; a = int.Parse(arr[0]); b = arr[1][0]; } public void Multi(out char a, out int b) { var arr = StrArr; a = arr[0][0]; b = int.Parse(arr[1]); } public void Multi(out long a, out long b) { var arr = LongArr; a = arr[0]; b = arr[1]; } public void Multi(out long a, out int b) { var arr = LongArr; a = arr[0]; b = (int)arr[1]; } public void Multi(out int a, out long b) { var arr = LongArr; a = (int)arr[0]; b = arr[1]; } public void Multi(out string a, out string b) { var arr = StrArr; a = arr[0]; b = arr[1]; } } class mymath { public bool isprime(long a) { if (a < 2) return false; for (long i = 2; i * i <= a; i++) if (a % i == 0) return false; return true; } public long powmod(long a, long b, long M) { if (a == 0) return 0; if (b == 0) return 1; if (b == 1) return a % M; var t = powmod(a, b / 2, M); if ((b & 1) == 0) return t * t % M; else return t * t % M * a % M; } public long gcd(long a, long b) { while (b != 0) { var t = a % b; a = b; b = t; } return a; } public long lcm(int a, int b) { return a * (long)b / gcd(a, b); } } }