시간 제한메모리 제한제출정답맞힌 사람정답 비율
1 초 128 MB133834119922.769%

문제

가장 작은 소인수가 P인 숫자 중에서 N번째 작은 수를 구하는 프로그램을 작성하시오.

입력

첫째 줄에 N과 P가 주어진다. (1 ≤ N, P ≤ 109) P는 항상 소수이다.

출력

첫째 줄에 가장 작은 소인수가 P인 숫자 중 N번째로 작은 수를 출력한다. 만약, 그러한 수가 109를 넘을 경우에는 0을 출력한다.

예제 입력 1

1 2

예제 출력 1

2

예제 입력 2

2 3

예제 출력 2

9

예제 입력 3

1000 1000003

예제 출력 3

0
W3sicHJvYmxlbV9pZCI6IjI4MTQiLCJwcm9ibGVtX2xhbmciOiIwIiwidGl0bGUiOiJcdWNkNWNcdWMxOGNcdWM3NzhcdWMyMTgiLCJkZXNjcmlwdGlvbiI6IjxwPlx1YWMwMFx1YzdhNSBcdWM3OTFcdWM3NDAgXHVjMThjXHVjNzc4XHVjMjE4XHVhYzAwIFBcdWM3NzggXHVjMjJiXHVjNzkwIFx1YzkxMVx1YzVkMFx1YzExYyBOXHViYzg4XHVjOWY4IFx1Yzc5MVx1Yzc0MCBcdWMyMThcdWI5N2MgXHVhZDZjXHVkNTU4XHViMjk0IFx1ZDUwNFx1Yjg1Y1x1YWRmOFx1YjdhOFx1Yzc0NCBcdWM3OTFcdWMxMzFcdWQ1NThcdWMyZGNcdWM2MjQuPFwvcD5cclxuIiwiaW5wdXQiOiI8cD5cdWNjYWJcdWM5ZjggXHVjOTA0XHVjNWQwIE5cdWFjZmMgUFx1YWMwMCBcdWM4ZmNcdWM1YjRcdWM5YzRcdWIyZTQuICgxICZsZTsgTiwgUCAmbGU7IDEwPHN1cD45PFwvc3VwPikgUFx1YjI5NCBcdWQ1NmRcdWMwYzEgXHVjMThjXHVjMjE4XHVjNzc0XHViMmU0LjxcL3A+XHJcbiIsIm91dHB1dCI6IjxwPlx1Y2NhYlx1YzlmOCBcdWM5MDRcdWM1ZDAgXHVhYzAwXHVjN2E1IFx1Yzc5MVx1Yzc0MCBcdWMxOGNcdWM3NzhcdWMyMThcdWFjMDAgUFx1Yzc3OCBcdWMyMmJcdWM3OTAgXHVjOTExIE5cdWJjODhcdWM5ZjhcdWI4NWMgXHVjNzkxXHVjNzQwIFx1YzIxOFx1Yjk3YyBcdWNkOWNcdWI4MjVcdWQ1NWNcdWIyZTQuIFx1YjljY1x1YzU3ZCwgXHVhZGY4XHViN2VjXHVkNTVjIFx1YzIxOFx1YWMwMCAxMDxzdXA+OTxcL3N1cD5cdWI5N2MgXHViMTE4XHVjNzQ0IFx1YWNiZFx1YzZiMFx1YzVkMFx1YjI5NCAwXHVjNzQ0IFx1Y2Q5Y1x1YjgyNVx1ZDU1Y1x1YjJlNC48XC9wPlxyXG4iLCJoaW50IjoiIiwib3JpZ2luYWwiOiIwIiwiaHRtbF90aXRsZSI6IjAiLCJwcm9ibGVtX2xhbmdfdGNvZGUiOiJLb3JlYW4ifSx7InByb2JsZW1faWQiOiIyODE0IiwicHJvYmxlbV9sYW5nIjoiMSIsInRpdGxlIjoiQlJPSiIsImRlc2NyaXB0aW9uIjoiPHA+RmluZCB0aGUgTi10aCBzbWFsbGVzdCBwb3NpdGl2ZSBpbnRlZ2VyIHdob3NlIGxlYXN0IHByaW1lIGZhY3RvciBpcyBQLCBvciBzdGF0ZSB0aGF0IHRoZSByZXN1bHQgaXMgZ3JlYXRlciB0aGFuIDEwPHN1cD45PFwvc3VwPi4mbmJzcDs8XC9wPlxyXG4iLCJpbnB1dCI6IjxwPlRoZSBmaXJzdCBhbmQgb25seSBsaW5lIG9mIGlucHV0IGNvbnRhaW5zIHNwYWNlIHNlcGVyYXRlZCBpbnRlZ2VycyBOIGFuZCBQICgxICZsZTsgTiwgUCAmbGU7IDEwPHN1cD45PFwvc3VwPikuIFAgd2lsbCBhbHdheXMgYmUgcHJpbWUuJm5ic3A7PFwvcD5cclxuIiwib3V0cHV0IjoiPHA+T3V0cHV0IGEgc2luZ2xlIGxpbmUgd2l0aCB0aGUgZXhwZWN0ZWQgcmVzdWx0LCBvciB6ZXJvIGlmIHJlc3VsdCBleGNlZWRzIDEwPHN1cD45PFwvc3VwPi48XC9wPlxyXG4iLCJoaW50IjoiIiwib3JpZ2luYWwiOiIxIiwiaHRtbF90aXRsZSI6IjAiLCJwcm9ibGVtX2xhbmdfdGNvZGUiOiJFbmdsaXNoIn1d

출처

Contest > Croatian Open Competition in Informatics > COCI 2011/2012 > Contest #4 5번

  • 문제를 번역한 사람: baekjoon
  • 문제의 오타를 찾은 사람: rdd6584