}intQuery(intx,inty){intans=1e9;while(top[x]!=top[y]){if(dep[top[x]]<dep[top[y]]) swap(x,y); ans=min(ans,query(1,1,cnt,id[top[x]],id[x])); x=father[top[x]]; }if(dep[x]<dep[y]) swap(x,y); ans=min(ans,query(1,1,cnt,id[y],id[x]));returnans; }intm...
int a,b,c;cin>>a>>b>>c; int ans;ans=1e9; int outa,outb,outc; int finouta,finoutb,finoutc=-1; for(int bp=1;bp<=2e4;bp++){ int tmpans=abs(b-bp); // interesting int fans=1e9; for(int i=1;i<=sqrt(bp);i++){ if(bp%i==0){ if(abs(a-i)<fans){ fans=abs(a...
intdp[1<<N],dis[N],f[N][N],n,m,x,y,z,ans=1e9; inlineboolin(intx,intS){return((1<<(x-1))&S);} voiddfs(intS){ for(inti=1;i<=n;i++){ if(in(i,S)){ for(intj=1;j<=n;j++){ if(!in(j,S)){ if(f[i][j]>1e9)continue; intnow=(1<<(j-1))+S; if(d...
usingnamespacestd;constintMAXN =2e5+5;intn,w,q;pair<pair<int,int>,int> box[MAXN];// ((Y,X),id)pair<pair<int,int>,int> qry[MAXN];// ((T,A),id)boolans[MAXN]; deque<int> wait_to_del[MAXN];intcnt =0;boolalive[MAXN]; intmain{scanf("%d%d",&n,&w);for(inti =1;...
intp1 =std::lower_bound(all(goright), x)-goright.begin-1;intp2 =std::lower_bound(all(goright),x-2*T)-goright.begin;ans += p1-p2+1; }printf("%lld\n",ans);return0;} E 参考代码 #include<bits/stdc++.h> #definefi first#definese second#defineDB double#defineU unsigned#define...
1 #include<bits/stdc++.h> #define int long long using namespace std; const int p=1e9+3; int T,n,m,a,fac[100010]={1}; signed main() { for(int i=1;i<=100000;i++) fac[i]=fac[i-1]*i%p; scanf("%lld",&T); while(T--) { int res=1,ans=1; scanf("%lld %lld",...
#include<bits/stdc++.h>usingnamespacestd;constintmo=1e9+7; typedef __int128 lll;intT,a,b;longlongn; lll calc(lll n) { lll ans=n*n*n*b+(n-1)*n*n*a;if(n%2==0) ans=min(ans,18*(n/2)*(n/2)*a+7*calc(n/2));returnans; ...
#include using namespace std; const int N=1e3+5,MOD=1e9+7; int n,k,ans; int f[N][N]; bool vis[27]; char str[N]; int main(){ scanf("%d%d",&n,&k); scanf("%s",str+1); for (register int i=1; i=1; --i) if (!vis[str[i]-'a'+1]) vis[str[i]-'a'+1]=...
#include<bits/stdc++.h>#defineint long longusingnamespacestd;constintp=1e9+3;intT,n,m,a,fac[100010]={1};signedmain(){for(inti=1;i<=100000;i++) fac[i]=fac[i-1]*i%p;scanf("%lld",&T);while(T--) {intres=1,ans=1;scanf("%lld %lld",&n,&m);for(inti=1;i<=n;i++)...
static int mod = (int) 1e9 + 7; public static void main(String[] args) { int m = 2, n = 2, x = 2; System.out.println(qpow(x, m + n - 1) * qpow(x / 2, (m - 1) * (n - 1)) % mod); } static long qpow(long x, long n) { long ans = 1; while (n !