51Nod 1014 X^2 Mod P

#include<iostream>  #include<queue>  #include<vector>  #include<stack>  #include<algorithm>#include<cmath> #include<set>using namespace std;  const long long INF=1e18;int main(){long long n,p;cin>>n>>p;static int a[1000001]={0};int cnt=0;for(long long i=1;i<=n;i++){long long l=i*i;if(l%n==p) a[cnt++]=i;}if(cnt==0){cout<<"No Solution";}else{printf("%d",a[0]);for(int i=1;i<cnt;i++) printf(" %d",a[i]);}return 0;}