Ignatius's puzzle

Ignatius’s puzzle
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 12862 Accepted Submission(s): 9046

Problem Description
Ignatius is poor at math,he falls across a puzzle problem,so he has no choice but to appeal to Eddy. this problem describes that:f(x)=5x^13+13*x5+ka*x,input a nonegative integer k(k<10000),to find the minimal nonegative integer a,make the arbitrary integer x ,65|f(x)if
no exists that a,then print “no”.

Input
The input contains several test cases. Each test case consists of a nonegative integer k, More details in the Sample Input.

Output
The output contains a string “no”,if you can’t find a,or you should output a line contains the a.More details in the Sample Output.

Sample Input
11
100
9999

Sample Output
22
no
43

Author
eddy

Recommend
We have carefully selected several similar problems for you: 1071 1014 1052 1049 1097

#include<iostream>
#include<cstdio>
using namespace std;
int main()
{
	int a, k, sum;
	while (scanf_s("%d", &k) != EOF)
	{
		for (a = 1; a <= 65; a++)
		{
			sum= 18 + a*k;
			if (sum % 65 == 0)
				break;
		}
		if (a== 66)
			printf("no\n");
		else
			printf("%d\n", a);
	}
	system("pause");
	return 0;
}