import java.util.Scanner;
public class Main {
static int n, p;
static int arr[] = new int [101];
static int visit[] = new int [1001];
static int cnt;
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner scan = new Scanner(System.in);
int i;
n = scan.nextInt();
p = scan.nextInt();
System.out.print(f(n,p,1));
}
private static int f(int num,int p,int cnt) {
// TODO Auto-generated method stub
if (visit[num] != 0) return cnt - visit[num];
visit[num] = cnt;
return f((num * n) % p, p, cnt + 1);
}
}
http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&wr_id=1828&sca=2080
'정올문제소스코드' 카테고리의 다른 글
Jungol_Beginner_수학1 (0) | 2023.02.07 |
---|---|
Jungol_Beginner_도형만들기1 (0) | 2022.12.24 |
1490 : 다음 조합(next combination) (0) | 2022.03.18 |
2817 : 로또(Lotto) (0) | 2022.03.18 |
1021 : 장난감조립 (0) | 2021.12.05 |