#include<bits/stdc++.h>using namespace std;const long long mod = 998244353;typedef const long long ll;vector<long long>p;long long inv(long long x,long long y)//快速幂求逆元模板(以乘代除){ long long r=1; while(y>0) { if(y&1)
int tree[4*N]; void build(int o,int l,int r) { if(l==r) {cin>>tree[o];return;} build(ls,l,mid); build(rs,mid+1,r); tree[o] = max(tree[ls],tree[rs]); } int get(int o, int l, int r, int x) { if (l == r) return l; return tree[ls] > x ? get(ls, l, mi
题目链接:http://poj.org/problem?id=2773 Happy 2006 Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 12942 Accepted: 4557 Description Two positive integers are said to be relatively prime to each other if the Great Common Divisor (GCD) is 1.