小C的倍数问题
Accepts: 1990
Submissions: 4931
Time Limit: 2000/1000 MS (Java/Others)
Memory Limit: 32768/32768 K (Java/Others)
答案就是P-1的因子个数,也就是满足P%x==1,x的数量加上数字1
#include<stdio.h>
int main(void)
{
int T, p, i, ans;
scanf("%d", &T);
while(T--)
{
scanf("%d", &p);
p -= 1, ans = 0;
for(i=1;i*i<=p;i++)
{
if(p%i==0)
{
if(i*i==p)
ans++;
else
ans += 2;
}
}
printf("%d\n", ans);
}
return 0;
}