HDU 1098 Ignatius's puzzle 也不大懂

 1 #include <iostream>
 2 using namespace std;
 3 typedef long long ll;
 4 
 5 int main() {
 6     ll k;
 7     while (cin>>k)
 8     {
 9         int flag = 0,a;
10         for ( a = 1; a <= 64; a++) {
11             if ((18 + k*a) % 65 == 0) {
12                 flag = 1;
13                 break;
14             }
15         }
16         if (flag==0)
17             cout << "no" << endl;
18         else
19             cout << a << endl;
20     }
21 }