传送门:点击打开链接
One day Kefa found n baloons. For convenience, we denote color of i-th baloon as si — lowercase letter of the Latin alphabet. Also Kefa has k friends. Friend will be upset, If he get two baloons of the same color. Kefa want to give out all baloons to his friends. Help Kefa to find out, can he give out all his baloons, such that no one of his friens will be upset — print «YES», if he can, and «NO», otherwise. Note, that Kefa's friend will not upset, if he doesn't get baloons at all.
The first line contains two integers n and k (1 ≤ n, k ≤ 100) — the number of baloons and friends.
Next line contains string s — colors of baloons.
Answer to the task — «YES» or «NO» in a single line.
You can choose the case (lower or upper) for each letter arbitrary.
4 2 aabb
YES
6 3 aacaab
NO
In the first sample Kefa can give 1-st and 3-rd baloon to the first friend, and 2-nd and 4-th to the second.
In the second sample Kefa needs to give to all his friends baloons of color a, but one baloon will stay, thats why answer is «NO».
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<queue>
#include<cstdio>
#include<map>
#define ll long long
#define mset(a,x) memset(a,x,sizeof(a))
using namespace std;
const double PI=acos(-1);
const int inf=0x3f3f3f3f;
const double esp=1e-6;
const int maxn=100005;
const int mod=1e9+7;
int dir[4][2]={0,1,1,0,0,-1,-1,0};
int main()
{
map <char,int> mp;
int n,k,i;
char ch;
while(cin>>n>>k)
{
mp.clear();
for(i=0;i<n;i++)
{
cin>>ch;
mp[ch]++;
}
map<char,int>::iterator it;
int flag=1;
for(it=mp.begin();it!=mp.end();it++)
{
if(it->second>k)
{
flag=0;
break;
}
}
if(flag)
cout<<"YES"<<endl;
else
cout<<"NO"<<endl;
}
return 0;
}
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<queue>
#include<cstdio>
#define ll long long
#define mset(a,x) memset(a,x,sizeof(a))
using namespace std;
const double PI=acos(-1);
const int inf=0x3f3f3f3f;
const double esp=1e-6;
const int maxn=100005;
const int mod=1e9+7;
int dir[4][2]={0,1,1,0,0,-1,-1,0};
int ans[30];
int main()
{
int n,k,i,j;
char ch;
while(cin>>n>>k)
{
mset(ans,0);
for(i=0;i<n;i++)
{
cin>>ch;
ans[ch-'a']++;
}
int flag=1;
for(i=0;i<30;i++)
{
if(ans[i]>k)
{
flag=0;
break;
}
}
if(flag)
cout<<"YES"<<endl;
else
cout<<"NO"<<endl;
}
return 0;
}
Leha somehow found an array consisting of n integers. Looking at it, he came up with a task. Two players play the game on the array. Players move one by one. The first player can choose for his move a subsegment of non-zero length with an odd sum of numbers and remove it from the array, after that the remaining parts are glued together into one array and the game continues. The second player can choose a subsegment of non-zero length with an even sum and remove it. Loses the one who can not make a move. Who will win if both play optimally?
First line of input data contains single integer n (1 ≤ n ≤ 106) — length of the array.
Next line contains n integers a1, a2, ..., an (0 ≤ ai ≤ 109).
Output answer in single line. "First", if first player wins, and "Second" otherwise (without quotes).
4 1 3 2 3
First
2 2 2
Second
In first sample first player remove whole array in one move and win.
In second sample first player can't make a move and lose.
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<queue>
#include<cstdio>
#define ll long long
#define mset(a,x) memset(a,x,sizeof(a))
using namespace std;
const double PI=acos(-1);
const int inf=0x3f3f3f3f;
const double esp=1e-6;
const int maxn=1e6+5;
const int mod=1e9+7;
int dir[4][2]={0,1,1,0,0,-1,-1,0};
int map[maxn];
int main()
{
int n,i,ans,sum;
while(cin>>n)
{
ans=sum=0;
for(i=0;i<n;i++)
{
cin>>map[i];
if(map[i]%2)
ans++;
sum+=map[i];
}
if(sum%2)
{
cout<<"First"<<endl;
continue;
}
if(ans==0)
{
cout<<"Second"<<endl;
}
else
{
cout<<"First"<<endl;
}
}
return 0;
}
Leha like all kinds of strange things. Recently he liked the function F(n, k). Consider all possible k-element subsets of the set[1, 2, ..., n]. For subset find minimal element in it. F(n, k) — mathematical expectation of the minimal element among all k-element subsets.
But only function does not interest him. He wants to do interesting things with it. Mom brought him two arrays A and B, each consists ofm integers. For all i, j such that 1 ≤ i, j ≤ m the condition Ai ≥ Bj holds. Help Leha rearrange the numbers in the array A so that the sum is maximally possible, where A' is already rearranged array.
First line of input data contains single integer m (1 ≤ m ≤ 2·105) — length of arrays A and B.
Next line contains m integers a1, a2, ..., am (1 ≤ ai ≤ 109) — array A.
Next line contains m integers b1, b2, ..., bm (1 ≤ bi ≤ 109) — array B.
Output m integers a'1, a'2, ..., a'm — array A' which is permutation of the array A.
5 7 3 5 3 4 2 1 3 2 3
4 7 3 5 3
7 4 6 5 8 8 2 6 2 1 2 2 1 1 2
2 6 4 5 8 8 6
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<queue>
#include<cstdio>
#define ll long long
#define mset(a,x) memset(a,x,sizeof(a))
using namespace std;
const double PI=acos(-1);
const int inf=0x3f3f3f3f;
const double esp=1e-6;
const int maxn=2*1e5+5;
const int mod=1e9+7;
int dir[4][2]={0,1,1,0,0,-1,-1,0};
struct node{
int num;
int index;
}b[maxn];
int a[maxn],ans[maxn];
int cmp1(int x,int y)
{
return x>y;
}
int cmp2(node a,node b)
{
return a.num<b.num;
}
int main()
{
int n,i,j,k;
while(cin>>n)
{
mset(b,0);
mset(a,0);
mset(ans,0);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<n;i++)
{
scanf("%d",&b[i].num);
b[i].index=i;
}
sort(a,a+n,cmp1);
sort(b,b+n,cmp2);
for(i=0;i<n;i++)
ans[b[i].index]=a[i];
for(i=0;i<n;i++)
{
if(i)
cout<<' '<<ans[i];
else
cout<<ans[i];
}
cout<<endl;
}
return 0;
}