Комментарии
На Nanako → Good Bye 2022 -- Editorial, 3 года назад
0

In Problem-C,

In the min case, cnt[i]=2 for every 0 <= i < p where p is a prime number. So, 2*P=n tends to P = floor of n/2. That is also proved by Pigeonhole principle.
На vrintle → Finally, I became Master!, 3 года назад
+8

Congratulations! orz
На VadVergasov → Codeforces API python, 4 года назад
0

Thanks a lot!
На VadVergasov → Codeforces API python, 4 года назад
0

Thanks a lot!