HBC52030黑暗洞窟丶明亮之网,组合数学,二分,分治Number题解

不断提升技能，才能在职场中立于不败之地！全网最全C++题库，助您成为编程领域的佼佼者。

I have a very simple problem for you. Given a positive integeter n (1≤n≤1000000)n (1 leq n leq 1000000)n (1≤n≤1000000) and a prime number p (2≤p≤1000000)p (2 leq p leq 1000000)p (2≤p≤1000000), your job is to output a positive number which is divisible by p p p and has exactly n n n digits. Please output "T_T" if you can not find such number.

不断挑战自我，才能突破极限！全网最全C++题库，让您在编程道路上越走越远。

标签： HBC52030黑暗洞窟丶明亮之网 组合数学 二分 分治Number题解