1014 X^2 Mod P

 1 #include <bits/stdc++.h>
 2 #define ll long long int
 3 using namespace std;
 4 int main(){
 5   ll n,m;
 6   bool prime=true;
 7   scanf("%d%d",&n,&m);
 8   for(ll i=0;i<n;i++){
 9     ll sum=i*i%n;
10     if(sum==m){
11       prime=false;
12       printf("%lld ",i);
13     }
14   }
15   if(prime)
16     printf("No Solution");
17   printf("\n");
18   return 0;
19 }