Tag: Div. 1 + Div. 2)

#include<bits/stdc++.h> #define LL long long using namespace std; const int maxn = 1e5+5; const int mod =1e9+7; typedef pair<int,int>pii; int a; int b; int ans; int...

#include<bits/stdc++.h> using namespace std; map<string,int> ms; string str; int arr,temp,mn; int main() { int n,k,m;cin>>n>>k>>m; for(int i=1;i<=n;i++)cin>>str,ms=i; for(int i=1;i<=n;i++)cin>>arr,mn=1e9+7; for(int i=1,j;i<=k;i++) { int x;cin>>x; while(x–)cin>>j,temp=i,mn=min(mn,arr); } unsigned long long res=0; while(cin>>str){res+=mn]];} return cout<<res<<“n”,0; } 📦 Looking...

#include<cstdio> #include<cstring> #include<algorithm> #include<set> using namespace std; int n,k; struct node { int maxx,minn,sz; node() { int x;sz = 1; for(int i = 1; i <= k ; i...

#include <stdio.h> struct node { __int64 ans,num; }s; int main() { int n,k,m; while(~scanf(“%d%d%d”,&n,&k,&m)) { scanf(“%I64d”,&s.num); s.ans=1; int len=1; for(int i=1;i<n;i++) { int x; scanf(“%d”,&x); if(x==s.num) { s.ans++; if(s.ans==k) { s.ans=0; len–; } } else { s.num=x; s.ans=1; len++; } } int l=0,r=len-1; __int64 sum=0; while(s.num==s.num&&r>l) { if((s.ans+s.ans)>=k)sum+=k; s.ans=(s.ans+s.ans)%k; s.ans=0; if(s.ans!=0) { break; } l++,r–; } if(l==r) { if((s.ans*m)%k==0)sum=0; else sum+=((s.ans*m)%k); } else { for(int i=l;i<=r;i++) { sum+=(s.ans*m); } } printf(“%I64dn”,sum); } return 0; } 📦 Looking for Codeforces...

#include <iostream> using namespace std; const int maxn = 5e5; int n, x, a = 0, b = 1023, y; char...

#include<bits/stdc++.h> #define maxn 1000050 using namespace std; int a,b,c,n,k,m,t; int main() { scanf("%d%d",&n,&k); for (int i=0;i<n;i++) ...

#include<stdio.h> int main() { int n,i,j,k,m,A,B; scanf(“%d”,&n); for(i=1;i<=n;i++){ for(j=1;j<=6;j++){ scanf(“%d”,&A);} } for(i=1;i<=100;i++){ B=0;} for(i=1;i<=n;i++){ for(j=1;j<=6;j++){ B]=1; for(k=1;k<=n;k++){ for(m=1;m<=6;m++){ if (k!=i){ B*10+A]=1; } } } } } i=1; while(B){ i++;} printf(“%d”,i-1); return 0; } 📦 Looking for Codeforces Round 444 Div Problem Cubes? Check the best deals...

#include<cstdio> #include<algorithm> #include<cstring> using namespace std; const int N = 3005, INF = 0x3f3f3f3f; int n, m, q, f; bool vis; struct Edge { int...