結果

問題 No.1109 調の判定
ユーザー clocklnclockln
提出日時 2020-07-18 21:02:05
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 31 ms / 2,000 ms
コード長 4,136 bytes
コンパイル時間 972 ms
コンパイル使用メモリ 112,536 KB
実行使用メモリ 28,272 KB
最終ジャッジ日時 2024-12-14 07:09:50
合計ジャッジ時間 4,020 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 29 ms
26,360 KB
testcase_01 AC 30 ms
24,132 KB
testcase_02 AC 29 ms
24,264 KB
testcase_03 AC 30 ms
26,104 KB
testcase_04 AC 29 ms
26,224 KB
testcase_05 AC 30 ms
26,308 KB
testcase_06 AC 28 ms
24,008 KB
testcase_07 AC 31 ms
28,148 KB
testcase_08 AC 30 ms
24,008 KB
testcase_09 AC 30 ms
24,012 KB
testcase_10 AC 30 ms
26,040 KB
testcase_11 AC 29 ms
24,008 KB
testcase_12 AC 29 ms
26,044 KB
testcase_13 AC 29 ms
24,236 KB
testcase_14 AC 29 ms
24,008 KB
testcase_15 AC 30 ms
26,232 KB
testcase_16 AC 28 ms
24,264 KB
testcase_17 AC 30 ms
24,180 KB
testcase_18 AC 28 ms
26,040 KB
testcase_19 AC 27 ms
24,260 KB
testcase_20 AC 29 ms
21,816 KB
testcase_21 AC 29 ms
24,132 KB
testcase_22 AC 29 ms
23,872 KB
testcase_23 AC 29 ms
26,428 KB
testcase_24 AC 29 ms
23,984 KB
testcase_25 AC 29 ms
24,312 KB
testcase_26 AC 30 ms
24,264 KB
testcase_27 AC 29 ms
24,304 KB
testcase_28 AC 29 ms
24,236 KB
testcase_29 AC 29 ms
24,396 KB
testcase_30 AC 30 ms
23,876 KB
testcase_31 AC 30 ms
24,128 KB
testcase_32 AC 30 ms
24,268 KB
testcase_33 AC 30 ms
24,236 KB
testcase_34 AC 29 ms
26,232 KB
testcase_35 AC 30 ms
28,272 KB
testcase_36 AC 30 ms
26,108 KB
testcase_37 AC 31 ms
24,324 KB
testcase_38 AC 28 ms
24,116 KB
testcase_39 AC 29 ms
24,304 KB
testcase_40 AC 29 ms
24,388 KB
testcase_41 AC 29 ms
23,988 KB
testcase_42 AC 29 ms
24,008 KB
testcase_43 AC 30 ms
25,980 KB
testcase_44 AC 29 ms
24,256 KB
testcase_45 AC 29 ms
24,008 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff # 

using System;
using System.Collections;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using static System.Console;
using static System.Math;
 
public class Solve{
    static public int mod = 1000000007;
    static public string al = "abcdefghijklmnopqrstuvwxyz";
    public static void Main(){
        // •ûj
        //
        var n = rint();
        var a = inta();
        var list = new List<int>();
        for(int i=0;i<n;i++){
            list.Add(a[i]);
        }
        list.Sort();
        var anslist = new List<int>();
        for(int i=0;i<12;i++){
            for(int j=list.Count-1;j>=0;j--){
                if(list[j] < i){
                    list.Add(list[j]+12);
                    list.RemoveAt(j);
                }
            }
            list.Sort();
            var checker = true;
            for(int j=0;j<list.Count;j++){
                if(!(list[j] == i || list[j] == i+2 || list[j] == i+4 || list[j] == i+5 || list[j] == i+7 || list[j] == i+9 || list[j] == i+11)) checker = false;
            }
            if(checker){
                anslist.Add(i);
            }
        }
        if(anslist.Count == 1){
            WriteLine(anslist[0]);
        }else{
            WriteLine(-1);
        }
        
	
    }
    public static void swap(ref int a,ref int b){int temp = a;a= b;b = temp;}
    static void charswap(ref char a,ref char b){char temp = a;a= b;b = temp;}
    static int ncr(int n,int r){if(n<r)return 0;r = Min(r,n-r);long nn = 1;for(int i=n-r+1;i<=n;i++){nn = nn*i%mod;}long rr = 1;for(int i=1;i<=r;i++){rr = rr*i%mod;}rr = square((int)rr,mod-2);nn = nn * rr %mod;return (int)nn;}
    // a^b mod
    static int square(int a,int b){string binary = Convert.ToString(b,2);int bileng = binary.Length;long a_power = a;long value = 1;for(int i=bileng-1;i>=0;i--){if(binary[i] == '1'){value = value*a_power%mod;}a_power = a_power*a_power%mod;}return (int)value;}
    static int square2(int a,int b){long output = 1;var list = new List<long>();int sh = 1;long n = a;list.Add(a);while(sh < b){sh *= 2;n = n*n%mod;list.Add(n);}for(int i=list.Count-1;i>=0;i--){if(b > sh){b -= sh;sh /= 2;output = output*list[i]%mod;}}return (int)output;}
    //Šeí“Çæ
    static string rstr(){ return ReadLine(); }
    static int rint(){ return int.Parse(ReadLine()); }
    static long rlong(){ return long.Parse(ReadLine()); }
    static string[] stra(){ return ReadLine().Split(' '); }
    static char[] chara(){ string[] a=stra();string b="";for(int i=0;i<a.Length;i++){b+=a[i];}return b.ToCharArray();}
    static int[] inta(){ string[] read_str_array = ReadLine().Split(' '); int[] return_int_array = new int[read_str_array.Length]; for(int countup_i=0;countup_i<read_str_array.Length;countup_i++){ return_int_array[countup_i] = int.Parse(read_str_array[countup_i]); } return return_int_array; }
    static int[,] inta2(int num_array,int in_array){ int[,] int_array2 = new int[num_array,in_array]; for(int i=0;i<num_array;i++){ int[] temp_array = inta(); for(int j=0;j<in_array;j++){ int_array2[i,j] = temp_array[j]; } } return int_array2; }
    static long[] longa(){ string[] read_str_array = ReadLine().Split(' '); long[] return_long_array = new long[read_str_array.Length]; for(long countup_i=0;countup_i<read_str_array.Length;countup_i++){ return_long_array[countup_i] = long.Parse(read_str_array[countup_i]); } return return_long_array; }
    static double[] doublea(){ string[] read_str_array = ReadLine().Split(' '); double[] return_double_array = new double[read_str_array.Length]; for(long countup_i=0;countup_i<read_str_array.Length;countup_i++){ return_double_array[countup_i] = double.Parse(read_str_array[countup_i]); } return return_double_array; }
    // -----------------------------
    static long GCD(long a,long b){ if(a < b){ long temp = a; a = b; b = temp; } if(a % b == 0){ return b; } else{ long temp = b; b = a%b; a = temp; return GCD(a,b); } }
    static long LCM(long a,long b){ return a * b / GCD(a,b); }
    static void WriteArray(int[,] a,int b,int c){for(int i=0;i<b;i++){for(int j=0;j<c;j++){if(j!=0) Write(" ");Write(a[i,j]);}WriteLine();}}
}
0