51nod 1014 X^2 Mod P

#include <bits/stdc++.h>using namespace std;int main(){long long p,a,i,flag;while(cin>>p>>a){flag=1;for(i=1;i<=p;i++){if(i*i%p==a){if(!flag)printf(" ");flag=0;printf("%lld",i);}}if(flag)printf("No Solution");printf("\n");}}