結果

問題 No.1330 Multiply or Divide
ユーザー watarimaycry2watarimaycry2
提出日時 2021-01-08 22:06:16
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 3,651 bytes
コンパイル時間 2,513 ms
コンパイル使用メモリ 80,416 KB
実行使用メモリ 63,340 KB
最終ジャッジ日時 2024-11-16 12:16:57
合計ジャッジ時間 11,888 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 AC 311 ms
60,324 KB
testcase_02 AC 49 ms
36,964 KB
testcase_03 AC 48 ms
36,784 KB
testcase_04 AC 48 ms
37,336 KB
testcase_05 AC 50 ms
37,204 KB
testcase_06 AC 251 ms
60,820 KB
testcase_07 WA -
testcase_08 AC 329 ms
62,420 KB
testcase_09 AC 329 ms
62,116 KB
testcase_10 AC 322 ms
62,384 KB
testcase_11 AC 323 ms
62,104 KB
testcase_12 AC 325 ms
62,364 KB
testcase_13 AC 47 ms
36,808 KB
testcase_14 WA -
testcase_15 WA -
testcase_16 AC 47 ms
37,136 KB
testcase_17 WA -
testcase_18 AC 258 ms
62,152 KB
testcase_19 AC 258 ms
62,348 KB
testcase_20 AC 264 ms
62,428 KB
testcase_21 AC 267 ms
62,560 KB
testcase_22 AC 280 ms
62,356 KB
testcase_23 AC 328 ms
63,340 KB
testcase_24 AC 49 ms
37,284 KB
testcase_25 AC 49 ms
37,176 KB
testcase_26 AC 48 ms
37,012 KB
testcase_27 AC 47 ms
37,188 KB
testcase_28 AC 48 ms
37,004 KB
testcase_29 AC 48 ms
37,152 KB
testcase_30 AC 50 ms
37,064 KB
testcase_31 AC 50 ms
37,180 KB
testcase_32 AC 48 ms
36,848 KB
testcase_33 AC 50 ms
37,072 KB
testcase_34 AC 229 ms
53,736 KB
testcase_35 AC 123 ms
44,716 KB
testcase_36 AC 219 ms
53,508 KB
testcase_37 AC 204 ms
53,764 KB
testcase_38 AC 167 ms
48,780 KB
testcase_39 AC 131 ms
44,960 KB
testcase_40 AC 149 ms
47,968 KB
testcase_41 AC 113 ms
44,464 KB
testcase_42 AC 215 ms
53,368 KB
testcase_43 AC 208 ms
53,544 KB
testcase_44 WA -
testcase_45 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.*; import java.io.*; import java.math.*;
public class Main{
	//Don't have to see. start------------------------------------------
	static class InputIterator{
		ArrayList<String> inputLine = new ArrayList<>(1024);
		int index = 0; int max; String read;
		InputIterator(){
			BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
			try{
				while((read = br.readLine()) != null){
					inputLine.addAll(Arrays.asList(read.split(" ")));
				}
			}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<>();
	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> nextCharArray(){return myconv(next(), 0);}
	static ArrayList<String> nextStrArray(int size){
		ArrayList<String> ret = new ArrayList<>(size);
		for(int i = 0; i < size; i++){
			ret.add(next());
		}
		return ret;
	}
	static ArrayList<Integer> nextIntArray(int size){
		ArrayList<Integer> ret = new ArrayList<>(size);
		for(int i = 0; i < size; i++){
			ret.add(Integer.parseInt(next()));
		}
		return ret;
	}
	static ArrayList<Long> nextLongArray(int size){
		ArrayList<Long> ret = new ArrayList<>(size);
		for(int i = 0; i < size; i++){
			ret.add(Long.parseLong(next()));
		}
		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------------------------------------------

	static void solve(){//Here is the main function
		int N = nextInt();
		int M = nextInt();
		int P = nextInt();
		int[] list = new int[N];
		int[] add = new int[N];
		for(int i = 0; i < N; i++){
			int v = nextInt();
			if(v > M){
				myout(1);
				return;
			}
			int check = 0;
			while(v % P == 0){
				v /= P;
				check++;
			}
			list[i] = v;
			add[i] = check;
		}

		int min = 1 << 30;
		for(int i = 0; i < N; i++){
			long v = 1;
			int count = 0;
			if(list[i] == 1){
				continue;
			}
			boolean isOK = true;
			while(v <= M){
				while(v % P == 0){
					v /= P;
					if(v == 1){
						isOK = false;
						break;
					}
				}
				if(!isOK){
					break;
				}
				v *= list[i];
				count++;
				count += add[i];
			}
			if(isOK){
				min = Math.min(min, count);
			}
		}
		if(min == (1 << 30)){
			myout(-1);
		}else{
			myout(min);
		}
	}
	//Method addition frame start



	//Method addition frame end
}
0