Ignatius’s puzzle
#include<stdio.h>
int main()
{ //f(x) = 5*x^13 + 13*x^5 + k*a*x;
int n,i,k; //x==1时f(x) = 18+ka 能被65整除
while(scanf("%d",&k) != EOF){ //求a的值使(18+k*a)%65 == 0
for(i=1; i<=65; i++){
if((18+i*k)%65==0){
printf("%d\n",i);
break;
}
}
if(i>65)
printf("no\n");
}
return 0;
}