結果

問題 No.1250 汝は倍数なりや?
ユーザー watarimaycry2watarimaycry2
提出日時 2020-10-09 21:44:47
言語 Java21
(openjdk 21)
結果
TLE  
実行時間 -
コード長 3,294 bytes
コンパイル時間 4,489 ms
コンパイル使用メモリ 77,068 KB
実行使用メモリ 81,448 KB
最終ジャッジ日時 2023-09-27 16:05:34
合計ジャッジ時間 9,861 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge11
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 39 ms
49,648 KB
testcase_01 AC 39 ms
50,044 KB
testcase_02 AC 41 ms
49,600 KB
testcase_03 AC 41 ms
49,932 KB
testcase_04 AC 40 ms
49,688 KB
testcase_05 AC 41 ms
49,584 KB
testcase_06 AC 40 ms
49,816 KB
testcase_07 AC 40 ms
49,512 KB
testcase_08 AC 41 ms
49,948 KB
testcase_09 AC 40 ms
49,536 KB
testcase_10 AC 39 ms
49,524 KB
testcase_11 AC 40 ms
49,560 KB
testcase_12 AC 39 ms
49,436 KB
testcase_13 AC 41 ms
49,536 KB
testcase_14 AC 43 ms
49,700 KB
testcase_15 AC 42 ms
49,440 KB
testcase_16 AC 42 ms
49,528 KB
testcase_17 AC 40 ms
49,660 KB
testcase_18 AC 41 ms
49,724 KB
testcase_19 AC 41 ms
49,704 KB
testcase_20 AC 43 ms
49,608 KB
testcase_21 AC 40 ms
49,460 KB
testcase_22 AC 42 ms
49,656 KB
testcase_23 AC 78 ms
53,004 KB
testcase_24 AC 73 ms
51,128 KB
testcase_25 AC 88 ms
53,228 KB
testcase_26 AC 47 ms
47,752 KB
testcase_27 AC 75 ms
53,156 KB
testcase_28 AC 54 ms
51,040 KB
testcase_29 AC 46 ms
49,784 KB
testcase_30 AC 75 ms
52,652 KB
testcase_31 AC 48 ms
51,164 KB
testcase_32 AC 90 ms
52,964 KB
testcase_33 TLE -
testcase_34 -- -
testcase_35 -- -
testcase_36 -- -
testcase_37 -- -
testcase_38 -- -
testcase_39 -- -
testcase_40 -- -
testcase_41 -- -
testcase_42 -- -
testcase_43 -- -
testcase_44 -- -
testcase_45 -- -
testcase_46 -- -
testcase_47 -- -
testcase_48 -- -
testcase_49 -- -
testcase_50 -- -
testcase_51 -- -
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.*; import java.io.*; import java.math.*;
public class Main{
	static void solve(){//Here is the main function
		ArrayList<Integer> one = nextIntArray();
		int N = one.get(0);
		int H = one.get(1);
		ArrayList<Integer> list = nextIntArray();
		BigInteger bi = new BigInteger("1");
		for(int i = 0; i < N; i++){
			bi = bi.multiply(new BigInteger(String.valueOf(list.get(i))));
		}
		myout((bi.mod(new BigInteger(String.valueOf(H))).toString().equals("0")) ? "YES" : "NO");
	}
	//Method addition frame start

static long gcd(long m, long n) {return n != 0 ? gcd(n, m % n) : m;}


	//Method addition frame end

	//Don't have to see. start------------------------------------------
	static class InputIterator{
		ArrayList<String> inputLine = new ArrayList<String>(1024);
		int index = 0; int max; String read;
		InputIterator(){
			BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
			try{
				while((read = br.readLine()) != null){
					inputLine.add(read);
				}
			}catch(IOException e){}
			max = inputLine.size();
		}
		boolean hasNext(){return (index < max);}
		String next(){
			if(hasNext()){
				return inputLine.get(index++);
			}else{
				throw new IndexOutOfBoundsException("There is no more input");
			}
		}
	}
	static HashMap<Integer, String> CONVSTR = new HashMap<Integer, String>();
	static InputIterator ii = new InputIterator();//This class cannot be used in reactive problem.
	static PrintWriter out = new PrintWriter(System.out);
	static void flush(){out.flush();}
	static void myout(Object t){out.println(t);}
	static void myerr(Object t){System.err.print("debug:");System.err.println(t);}
	static String next(){return ii.next();}
	static boolean hasNext(){return ii.hasNext();}
	static int nextInt(){return Integer.parseInt(next());}
	static long nextLong(){return Long.parseLong(next());}
	static double nextDouble(){return Double.parseDouble(next());}
	static ArrayList<String> nextStrArray(){return myconv(next(), 8);}
	static ArrayList<String> nextCharArray(){return myconv(next(), 0);}
	static ArrayList<Integer> nextIntArray(){
		ArrayList<String> input = nextStrArray(); ArrayList<Integer> ret = new ArrayList<Integer>(input.size());
		for(int i = 0; i < input.size(); i++){
			ret.add(Integer.parseInt(input.get(i)));
		}
		return ret;
	}
	static ArrayList<Long> nextLongArray(){
		ArrayList<String> input = nextStrArray(); ArrayList<Long> ret = new ArrayList<Long>(input.size());
		for(int i = 0; i < input.size(); i++){
			ret.add(Long.parseLong(input.get(i)));
		}
		return ret;
	}
	@SuppressWarnings("unchecked")
	static String myconv(Object list, int no){//only join
		String joinString = CONVSTR.get(no);
		if(list instanceof String[]){
			return String.join(joinString, (String[])list);
		}else if(list instanceof ArrayList){
			return String.join(joinString, (ArrayList)list);
		}else{
			throw new ClassCastException("Don't join");
		}
	}
	static ArrayList<String> myconv(String str, int no){//only split
		String splitString = CONVSTR.get(no);
		return new ArrayList<String>(Arrays.asList(str.split(splitString)));
	}
	public static void main(String[] args){
		CONVSTR.put(8, " "); CONVSTR.put(9, "\n"); CONVSTR.put(0, "");
		solve();flush();
	}
	//Don't have to see. end------------------------------------------
}
0