zoukankan      html  css  js  c++  java
  • Codeforces841A

    A. Generous Kefa

    time limit per test:2 seconds
    memory limit per test:256 megabytes
    input:standard input
    output:standard output

    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.

    Input

    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.

    Output

    Answer to the task — «YES» or «NO» in a single line.

    You can choose the case (lower or upper) for each letter arbitrary.

    Examples

    input

    4 2
    aabb

    output

    YES

    input

    6 3
    aacaab

    output

    NO

    Note

    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».

     1 //2017-08-22
     2 #include <cstdio>
     3 #include <cstring>
     4 #include <iostream>
     5 #include <algorithm>
     6 
     7 using namespace std;
     8 
     9 int main()
    10 {
    11     int n, k, book[30];
    12     string str;
    13     while(cin>>n>>k){
    14         cin>>str;
    15         memset(book, 0, sizeof(book));
    16         for(int i = 0; i < n; i++)
    17               book[str[i]-'a']++;
    18         int maxinum = 0;
    19         for(int i = 0; i < 26; i++){
    20             maxinum = max(maxinum, book[i]);
    21         }
    22         if(maxinum <= k)cout<<"YES"<<endl;
    23         else cout<<"NO"<<endl;
    24     }
    25 
    26     return 0;
    27 }
  • 相关阅读:
    display:inline、block、inline-block的区别
    JQ里的this与$(this)
    CSS3常用功能的写法
    左右菜单
    php smarty
    网页制作重点记录
    scrapy保存csv文件有空行的解决方案
    scrapy实现多级页面的抓取时使用meta传递item数据的问题(转)
    scrapy抓取拉勾网职位信息(八)——使用scrapyd对爬虫进行部署
    scrapy抓取拉勾网职位信息(七)——实现分布式
  • 原文地址:https://www.cnblogs.com/Penn000/p/7413620.html
Copyright © 2011-2022 走看看