const int INF = 0x3f3f3f3f; const db eps = 1e-8; const int maxn = 1e5 + 5; const int mod = 2012; const int maxs = 12; In ll read() { ll ans = 0; char ch = getchar(), las = ' '; while(!isdigit(ch)) las = ch, ch = getchar(); while(isdigit(ch)) ans = ...
intmain(){ // freopen("F:\\in.txt","r",stdin); //int T=10; scanf("%d",&T); __int128ans=0; intn,x; s1(n); for(inti=1;i<=n;i++){ s1(x); if(x>=0) ans+=x; else ans+=1LL*i*x; } if(ans<0){ ans=-ans; printf("-"); } print(ans); return0; } 1. ...
f[i][1]=(Σmin(f[d][0],f[d][1]))+increse 这个increse是选的那个来贡献父亲的(f[d][0]−f[d][1]) f[i][2]=Σmin(f[d][0],f[d][1])这里没有f[d][2]因为i不选 #include<bits/stdc++.h>using namespacestd;#defineINF 0x3f3f3f3fconstintmaxn =10100;intf[maxn]...
constT&b){returnb<=a?false:(a=b,true);}template<typenameT>boolumin(T&a,constT&b){returnb>=a?false:(a=b,true);}constdoublePI=acos(-1.0);constintINF=0x3f3f3f3f;constdoubleEPS=1e-14;/* --- */constint
const int inf=0x3f3f3f3f; int main(){ int k,p; cin>>k>>p; long long x; long long ans=0; string a; for(int i=1;i<=k;i++){ stringstream ss; ss<<i; a=ss.str(); string b(a.rbegin(),a.rend()); //这里为声明b为a的逆序 a=a+b; x=atoll(a.c_str()); x%=p;...
return ans; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); cin >> n >> m; for (int i = 1; i <= m; ++i) { int u, v, w; cin >> u >> v >> w; g[u].emplace_back(v, w); g[v].emplace_back(u, w); ...
using namespace std; #include<bits/stdc++.h> #include <stdio.h> #include <string.h> #include <stdlib.h> #include <iostream> #define LL long long #define INF 0x3f3f3f3f map<string,int>mp; string s; map <string,int> ::iterator iter; void acc_ios() { ios::sync_with_stdio(...
if num == 0: ans = "000-" + count * '0' + (7-count) * '7' elif num == 7: ans = "000-" + count * '7' + (7-count) * '0' else: ans = "000-" + (str(7 - (num * count % 7)) + count * str(num)).rjust(7, '0') p.sendlineafter(': ', ans) p.intera...
return ans; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); cin >> n >> m; for (int i = 1; i <= m; ++i) { int u, v, w; cin >> u >> v >> w; g[u].emplace_back(v, w); g[v].emplace_back(u, w); ...
intans =0; for(inti =1; i <= rt; i++) topo[maxlen[i]]++; for(inti =1; i <= rt; i++) topo[i] += topo[i -1]; for(inti =1; i <= rt; i++) topo_id[topo[maxlen[i]]--] = i; sum[1] =1; for(inti =1; i <= rt; i++) { ...