Lang:G++
Edit12345678910111213141516171819202122232425262728293031#include<bits/stdc++.h>using namespace std;#define ll long long#define maxn 100005const long long mod=1e9+7;ll m;ll a[maxn];ll q_pow(ll a,ll b){ll ans=1;while(b){if(b&1)ans=ans*a%mod;a=a*a%mod;b>>=1;}return ans;}int n,k;int juli(int a,int b){int tmpa=max(a,b)-min(a,b);int tmpb=min(a,b)+n-max(a,b);return min(tmpa,tmpb);}int julizuo(int zhong,int zuo){if(zhong>=zuo)return zhong-zuo;else return zhong+n-zuo;