X^2 Mod P

X^2 Mod P

暴力直接过

 

#include <iostream> 
#include <cstdio> 
#include <cstring> 
#include <algorithm> 
using namespace std;
#define ll long long 
ll num[100005];
int main()
{
	ll p, a;
	while (cin >> p >> a) {
		ll i;
		int u = 0;
		for (i = 0; i < p; i ++) {
			if (i * i % p == a) {
				cout << i << " ";
				u = 1;
			}
		}
		if(u == 0)
			cout << "No Solution";
		cout << endl;
	}
}