結果
| 問題 |
No.2379 Burnside's Theorem
|
| コンテスト | |
| ユーザー |
 Asahi
|
| 提出日時 | 2023-07-14 23:07:36 |
| 言語 | Java (openjdk 23) |
| 結果 |
AC
|
| 実行時間 | 87 ms / 2,000 ms |
| コード長 | 9,140 bytes |
| コンパイル時間 | 2,878 ms |
| コンパイル使用メモリ | 87,084 KB |
| 実行使用メモリ | 51,048 KB |
| 最終ジャッジ日時 | 2024-09-16 08:15:51 |
| 合計ジャッジ時間 | 4,903 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge6 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 4 |
| other | AC * 20 |
ソースコード
import java.util.*;
import java.io.*;
import java.math.*;
class Main{
static final long MOD7 = 1000000007;
static final long MOD9 = 998244353 ;
static final int inf = (1 << 30);
static final long lnf = (1L << 60);
final String yes = "Yes";
final String no = "No" ;
void solve(PrintWriter out , In in) {
long n = in.nextLong();
Map<Long,Integer> p = prime_factorization(n);
boolean ok = true;
if(p.size() > 2) ok = false;
for(long v : p.keySet()) {
if(!isprime(v)) ok = false;
}
out.print(ok ? yes : no);
}
public static void main(String[] args) {
PrintWriter pw = new PrintWriter(System.out);
In in = new In();
new Main().solve(pw,in);
pw.flush();
}
Map<Long,Integer> prime_factorization(long val) {
Map<Long,Integer> map = new HashMap<>();
for(long i = 2; i * i <= val; i++ ) {
int count = 0;
while(val % i == 0) { val /= i; count++; }
if(count > 0) map.put(i,count);
}
if(val != 1L) map.put(val,1);
return map;
}
boolean isprime(long N) {
if(N <= 1) return false;
else if(N == 2) return true;
for(long i = 2; i * i <= N ; i++ ) if(N % i == 0) return false;
return true;
}
}
class BinarySearch <T extends Comparable<T>>{
int or_greater(ArrayList<T> A , T key) {
return A.size() - lower_bound(A, key);
}
int or_under(ArrayList<T> A , T key) {
return upper_bound(A, key);
}
int greater(ArrayList<T> A , T key) {
return A.size() - upper_bound(A, key);
}
int under(ArrayList<T> A , T key) {
return lower_bound(A, key);
}
private int lower_bound(ArrayList<T> A, T key) {
int left = 0;
int right = A.size();
while(left < right) {
int mid = (left + right) / 2;
if(compare(A.get(mid), key , 0)) left = mid + 1;
else right = mid;
}
return right;
}
private int upper_bound(ArrayList<T> A , T key) {
int left = 0;
int right = A.size();
while(left < right) {
int mid = (left + right) / 2;
if(compare(A.get(mid) , key , 1)) left = mid + 1;
else right = mid;
}
return right;
}
boolean compare(T o1, T o2 , int c) {
int res = o1.compareTo(o2);
return c == 0 ? res == -1 : (res == 0 || res == -1);
}
}
class Pair<T extends Comparable<T>, U extends Comparable<U>> implements Comparable<Pair<T, U>> {
private final T first;
private final U second;
Pair(T first, U second) {
this.first = first;
this.second = second;
}
T first() {
return first;
}
U second() {
return second;
}
@Override
public boolean equals(Object o) {
if (this == o) return true;
if (o == null || getClass() != o.getClass()) return false;
Pair<?, ?> pair = (Pair<?, ?>) o;
return Objects.equals(first, pair.first) && Objects.equals(second, pair.second);
}
@Override
public int hashCode() {
return Objects.hash(first, second);
}
@Override
public int compareTo(Pair<T, U> other) {
T small_First = this.first , large_First = other.first;
U small_Second = this.second , large_Second = other.second;
int First_Result = large_First.compareTo(small_First);
int Second_Result = small_Second.compareTo(large_Second);
return First_Result == 0 ? Second_Result : First_Result ;
}
@Override
public String toString() {
return this.first+" "+this.second;
}
}
class Triple<T extends Comparable<T>, U extends Comparable<U>, V extends Comparable<V>> implements Comparable<Triple<T, U, V>> {
private final T first;
private final U second;
private final V third;
Triple(T first, U second, V third) {
this.first = first;
this.second = second;
this.third = third;
}
T first() {
return first;
}
U second() {
return second;
}
V third() {
return third;
}
@Override
public boolean equals(Object o) {
if (this == o) return true;
if (o == null || getClass() != o.getClass()) return false;
Triple<?, ?, ?> triple = (Triple<?, ?, ?>) o;
return Objects.equals(first, triple.first)
&& Objects.equals(second, triple.second)
&& Objects.equals(third, triple.third) ;
}
@Override
public int hashCode() {
return Objects.hash(first, second, third);
}
@Override
public int compareTo(Triple<T, U, V> other) {
T small_First = this.first , large_First = other.first;
U small_Second = this.second , large_Second = other.second;
V small_Third = this.third , large_Third = other.third;
int First_Result = small_First.compareTo(large_First);
int Second_Result = small_Second.compareTo(large_Second);
int Third_Result = small_Third.compareTo(large_Third);
return First_Result == 0 ? (Second_Result == 0 ? Third_Result : Second_Result ) : First_Result;
}
}
class In{
private final InputStream in = System.in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
}else{
ptr = 0;
try {
buflen = in.read(buffer);
} catch (IOException e) {
e.printStackTrace();
}
if (buflen <= 0) {
return false;
}
}
return true;
}
private int readByte() {
if (hasNextByte()) return buffer[ptr++]; else return -1;
}
private static boolean isPrintableChar(int c) {
return 33 <= c && c <= 126;
}
public boolean hasNext() {
while(hasNextByte() && !isPrintableChar(buffer[ptr])) {
ptr++;
}
return hasNextByte();
}
String next() {
if (!hasNext()) throw new NoSuchElementException();
StringBuilder sb = new StringBuilder();
int b = readByte();
while(isPrintableChar(b)) {
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
long nextLong() {
if (!hasNext()) throw new NoSuchElementException();
long n = 0;
boolean minus = false;
int b = readByte();
if (b == '-') {
minus = true;
b = readByte();
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while(true){
if ('0' <= b && b <= '9') {
n *= 10;
n += b - '0';
}else if(b == -1 || !isPrintableChar(b)){
return minus ? -n : n;
}else{
throw new NumberFormatException();
}
b = readByte();
}
}
int nextInt() {
long nl = nextLong();
if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
return (int) nl;
}
double nextDouble() {
return Double.parseDouble(next());
}
char nextChar() {
return next().charAt(0);
}
int [] IntArray(int n) {
final int [] Array = new int [n];
for(int i = 0 ; i < n ; i ++ ) {
Array[i] = nextInt();
}
return Array;
}
int [][] IntArray(int n , int m) {
final int [][] Array = new int [n][m];
for(int i = 0 ; i < n ; i ++ ) {
Array[i] = IntArray(m);
}
return Array;
}
long [] LongArray(int n) {
final long [] Array = new long [n];
for(int i = 0 ; i < n ; i ++ ) {
Array[i] = nextLong();
}
return Array;
}
long [][] LongArray(int n , int m) {
final long [][] Array = new long [n][m];
for(int i = 0 ; i < n ; i ++ ) {
Array[i] = LongArray(m);
}
return Array;
}
String [] StringArray(int n) {
final String [] Array = new String [n];
for(int i = 0 ; i < n ; i ++ ) {
Array[i] = next();
}
return Array;
}
char [] CharArray(int n) {
final char [] Array = new char[n];
for(int i = 0 ; i < n ; i ++ ) {
Array[i] = next().charAt(0);
}
return Array;
}
char [][] CharArray(int n , int m) {
final char [][] Array = new char [n][m];
for(int i = 0 ; i < n ; i ++ ) {
Array[i] = next().toCharArray();
}
return Array;
}
char [][] CharArray2(int n , int m) {
final char [][] Array = new char [n][m];
for(int i = 0 ; i < n ; i ++ ) {
for(int j = 0 ; j < n ; j ++ ) {
Array[i][j] = next().charAt(0);
}
}
return Array;
}
}