Tag: Codeforces Round #429 (Div. 2)

#include<bits/stdc++.h> #define ll long long int #define LL long long int #define...

#include<cstdio> using namespace std; const int MAXN = 300000+5; const int MAXE...

#include<bits/stdc++.h> using namespace std; int main(){ std::ios::sync_with_stdio(false); int m; cin>>m; int a,b; for(int i=0;i<m;i++) cin>>a; vector<pair<int,int> >br(m); for(int i=0;i<m;i++){ cin>>b; br=make_pair(b,i); } sort(a,a+m); int...

#include<cstdio> int main() { int n;int t;scanf("%d",&n); for(int i=1;i<=n;i++) {scanf("%d",&t); if(t%2) { printf("First"); return 0; } } printf("Second"); return 0; }

#include<iostream> using namespace std; int i,j,n,k,a; string s; main(){ for(cin>>n>>k>>s;i<s.size();)a-'a']++; for(i=0;j<26;)a>k?i=1:0; cout<<(i?"NOn":"YESn"); }