Tag: Codeforces Round #473 (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<stdio.h> int vi={0}; int main(void) { int n, a, now = 2; int ans; scanf(“%d”, &n); int flag = 0; int i,j,k; for (i = 1;...

#include<stdio.h> int main(){ int n; scanf(“%d”,&n); if(n <= 5) printf(“-1n”); else{ printf(“1 2n2 3n2 4n”); for(int i = 5;i <= n;i++) printf(“1 %dn”,i); } for(int i = 2;i...

#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; }