結果

問題 No.1723 [Cherry 3rd Tune *] Dead on
ユーザー watarimaycry2watarimaycry2
提出日時 2021-10-29 21:30:47
言語 Java21
(openjdk 21)
結果
AC  
実行時間 79 ms / 2,000 ms
コード長 6,179 bytes
コンパイル時間 2,843 ms
コンパイル使用メモリ 82,168 KB
実行使用メモリ 38,340 KB
最終ジャッジ日時 2024-04-16 14:11:35
合計ジャッジ時間 7,195 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 55 ms
37,296 KB
testcase_01 AC 54 ms
37,252 KB
testcase_02 AC 56 ms
37,000 KB
testcase_03 AC 58 ms
37,048 KB
testcase_04 AC 70 ms
37,924 KB
testcase_05 AC 65 ms
37,480 KB
testcase_06 AC 58 ms
37,112 KB
testcase_07 AC 55 ms
37,388 KB
testcase_08 AC 59 ms
37,328 KB
testcase_09 AC 56 ms
37,280 KB
testcase_10 AC 63 ms
37,368 KB
testcase_11 AC 57 ms
37,308 KB
testcase_12 AC 59 ms
37,240 KB
testcase_13 AC 53 ms
37,012 KB
testcase_14 AC 54 ms
37,288 KB
testcase_15 AC 73 ms
38,280 KB
testcase_16 AC 61 ms
37,112 KB
testcase_17 AC 75 ms
37,928 KB
testcase_18 AC 67 ms
38,068 KB
testcase_19 AC 62 ms
37,304 KB
testcase_20 AC 63 ms
37,328 KB
testcase_21 AC 68 ms
38,076 KB
testcase_22 AC 69 ms
38,340 KB
testcase_23 AC 63 ms
36,884 KB
testcase_24 AC 56 ms
37,280 KB
testcase_25 AC 73 ms
38,012 KB
testcase_26 AC 60 ms
37,036 KB
testcase_27 AC 55 ms
37,384 KB
testcase_28 AC 71 ms
38,048 KB
testcase_29 AC 69 ms
38,100 KB
testcase_30 AC 76 ms
38,112 KB
testcase_31 AC 71 ms
37,820 KB
testcase_32 AC 59 ms
37,256 KB
testcase_33 AC 54 ms
37,264 KB
testcase_34 AC 55 ms
37,224 KB
testcase_35 AC 56 ms
37,448 KB
testcase_36 AC 79 ms
38,132 KB
testcase_37 AC 54 ms
37,048 KB
testcase_38 AC 56 ms
37,412 KB
testcase_39 AC 55 ms
37,240 KB
testcase_40 AC 53 ms
37,036 KB
testcase_41 AC 55 ms
37,272 KB
testcase_42 AC 54 ms
37,296 KB
testcase_43 AC 55 ms
36,836 KB
testcase_44 AC 54 ms
37,400 KB
testcase_45 AC 54 ms
37,324 KB
testcase_46 AC 57 ms
37,448 KB
testcase_47 AC 57 ms
37,240 KB
testcase_48 AC 57 ms
37,144 KB
testcase_49 AC 55 ms
36,980 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.*; import java.io.*; import java.math.*;
public class Main{
	//見なくていいよ　ここから------------------------------------------
	static class InputIterator{
		ArrayList<String> inputLine = new ArrayList<>(buf);
		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");
			}
		}
	}
	//入力バッファサイズのつもり。入力点数（スペース区切りでの要素数）が100万を超える場合はバッファサイズを100万にすること
	static int buf = 1024;
	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
		StringBuilder sb = new StringBuilder("");
		String joinString = CONVSTR.get(no);
		if(list instanceof String[]){
			return String.join(joinString, (String[])list);
		}else if(list instanceof long[]){
			long[] tmp = (long[])list;
			if(tmp.length == 0){
				return "";
			}
			sb.append(String.valueOf(tmp[0]));
			for(int i = 1; i < tmp.length; i++){
				sb.append(joinString).append(String.valueOf(tmp[i]));
			}
			return sb.toString();
		}else if(list instanceof int[]){
			int[] tmp = (int[])list;
			if(tmp.length == 0){
				return "";
			}
			sb.append(String.valueOf(tmp[0]));
			for(int i = 1; i < tmp.length; i++){
				sb.append(joinString).append(String.valueOf(tmp[i]));
			}
			return sb.toString();
		}else if(list instanceof ArrayList){
			ArrayList tmp = (ArrayList)list;
			if(tmp.size() == 0){
				return "";
			}
			sb.append(tmp.get(0));
			for(int i = 1; i < tmp.size(); i++){
				sb.append(joinString).append(tmp.get(i));
			}
			return sb.toString();
		}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)));
	}
	static ArrayList<String> myconv(String str, String no){
		return new ArrayList<String>(Arrays.asList(str.split(no)));
	}
	public static void main(String[] args){
		CONVSTR.put(8, " "); CONVSTR.put(9, "\n"); CONVSTR.put(0, "");
		solve();flush();
	}
	//見なくていいよ　ここまで------------------------------------------
	//このコードをコンパイルするときは、「-encoding UTF-8」を指定すること
	static void solve(){//ここがメイン関数
		long X = nextLong();
		long A = nextLong();
		long Y = nextLong();
		long B = nextLong();
		PrimeFactorization pfx = new PrimeFactorization(X);
		PrimeFactorization pfy = new PrimeFactorization(Y);
		
		for(long key : pfy.getKeys()){
			long size = B * pfy.get(key);
			if(pfx.containsKey(key) && size <= A * pfx.get(key)){

			}else{
				myout("No");
				return;
			}
		}
		myout("Yes");
	}
	//メソッド追加エリア　ここから

static boolean isPrime(long val){
    if(val <= 1 || (val != 2 && val % 2 == 0)){
        return false;
    }else if(val == 2){
        return true;
    }
    double root = Math.floor(Math.sqrt(val));
    for(long i = 3; i <= root; i += 2){
        if(val % i == 0){
            return false;
        }
    }
    return true;
}

static class PrimeFactorization{
    HashSet<Long> primes;
    HashMap<Long, Integer> map = new HashMap<>();
    PrimeFactorization(long val){
        if(isPrime(val)){
            map.put(val, 1);
            primes = new HashSet<>(map.keySet());
            return;
        }
        long div = 2;
        while(val != 1){
            if(val % div == 0){
                int count = 2;
                while(val % (long)Math.pow(div, count) == 0){
                    count++;
                }
                if(map.containsKey(div)){
                    map.put(div, map.get(div) + (count - 1));
                }else{
                    map.put(div, count - 1);
                }
                val /= (long)Math.pow(div, count - 1);
                if(isPrime(val)){
                    if(map.containsKey(val)){
                        map.put(val, map.get(val) + 1);
                    }else{
                        map.put(val, 1);
                    }
                    break;
                }
            }else{
                div = (div == 2) ? div + 1 : div + 2;
            }
        }
        primes = new HashSet<>(map.keySet());
    }
    public int get(long K){
        return map.get(K);
    }
    public HashSet<Long> getKeys(){
        return primes;
    }
    public boolean containsKey(long K){
        return map.containsKey(K);
    }
}

	//メソッド追加エリア　ここまで
}
0