結果

問題 No.1330 Multiply or Divide
ユーザー watarimaycry2watarimaycry2
提出日時 2021-01-08 21:57:24
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 3,531 bytes
コンパイル時間 3,215 ms
コンパイル使用メモリ 81,180 KB
実行使用メモリ 62,820 KB
最終ジャッジ日時 2024-04-28 02:50:07
合計ジャッジ時間 13,807 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 AC 345 ms
60,316 KB
testcase_02 WA -
testcase_03 AC 53 ms
36,428 KB
testcase_04 AC 54 ms
36,620 KB
testcase_05 AC 52 ms
37,324 KB
testcase_06 AC 259 ms
59,988 KB
testcase_07 WA -
testcase_08 AC 354 ms
62,008 KB
testcase_09 AC 376 ms
61,912 KB
testcase_10 AC 363 ms
62,740 KB
testcase_11 AC 371 ms
62,328 KB
testcase_12 AC 356 ms
62,152 KB
testcase_13 AC 54 ms
36,924 KB
testcase_14 WA -
testcase_15 WA -
testcase_16 AC 52 ms
37,024 KB
testcase_17 WA -
testcase_18 AC 378 ms
62,276 KB
testcase_19 AC 367 ms
62,220 KB
testcase_20 AC 360 ms
61,896 KB
testcase_21 AC 397 ms
62,076 KB
testcase_22 AC 361 ms
62,012 KB
testcase_23 AC 362 ms
62,820 KB
testcase_24 AC 53 ms
36,964 KB
testcase_25 AC 52 ms
37,200 KB
testcase_26 AC 52 ms
36,572 KB
testcase_27 AC 52 ms
36,864 KB
testcase_28 AC 53 ms
37,200 KB
testcase_29 AC 52 ms
36,668 KB
testcase_30 AC 53 ms
37,160 KB
testcase_31 AC 53 ms
36,556 KB
testcase_32 AC 53 ms
36,864 KB
testcase_33 AC 52 ms
37,076 KB
testcase_34 AC 359 ms
55,484 KB
testcase_35 AC 181 ms
45,948 KB
testcase_36 AC 291 ms
53,804 KB
testcase_37 AC 279 ms
53,700 KB
testcase_38 AC 228 ms
49,380 KB
testcase_39 AC 191 ms
46,332 KB
testcase_40 AC 224 ms
48,436 KB
testcase_41 AC 165 ms
45,540 KB
testcase_42 AC 274 ms
54,000 KB
testcase_43 AC 289 ms
53,380 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();
			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){
				if(v % P == 0){
					isOK = false;
					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