CodeCraft-21 and Codeforces Round 711 (Div. 2)A-F
1.Problem-A-Codeforces(1)题意求一个大于等于n的整数x,满足gcd(x,sum(dig(x))>1,dig表示x的各个数位。(2)思路考虑最差是满足gcd(x,sum(dig(x))=2,因此不会枚举很多,直接暴力枚举即可。(3)代码#include#definerep(i,z,n)for(inti=z;i=z;i--)#definePIIpair#definefifirs