POJ 1808 (用欧拉准则计算勒让德符号 ,入门题) (二次剩余)

#include <utility>
#include <algorithm>
#include <string>
#include <cstring>
#include <cstdio>
#include <iostream>
#include <iomanip>
#include <set>
#include <numeric>
#include <vector>
#include <cmath>
#include <queue>
#include <bitset>
#include <map>
#include <iterator>
using namespace std;
#define clr(a,v) memset(a,v,sizeof(a))
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
const int INF = 0x7f7f7f7f;
const int maxn = 20001;
const double pi = acos(-1.0);
const double eps = 1e-8;
const int mod = 777777777;
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> pii;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
LL POW(LL a, LL b, LL p) {
	LL res = 1;
	while (b) {
		if (b & 1)
			res = res * a % p;
		a = a * a % p;
		b >>= 1;
	}
	return res;
}
int solve(LL a, LL p) {
	LL res = POW(a , (p - 1) >> 1, p);
	if (res == p - 1)
		return -1;
	return 1;
}
int main() {
	ios::sync_with_stdio(false);
	int n, m;
	int T;
	scanf("%d", &T);
	for (int cas = 1; cas <= T; ++cas) {
		scanf("%d%d", &n, &m);
		printf("Scenario #%d:\n", cas);
		printf("%d\n\n", solve(n, m));
	}
	return 0;
}