• 第十二届浙江省大学生程序设计大赛-Demacia of the Ancients 分类: 比赛 2015-06-26 14:39 30人阅读 评论(0) 收藏


    Demacia of the Ancients
    Time Limit: 2 Seconds Memory Limit: 65536 KB

    There is a popular multiplayer online battle arena game called Demacia of the Ancients. There are lots of professional teams playing this game. A team will be approved as Level K if there are exact K team members whose match making ranking (MMR) is strictly greater than 6000.

    You are given a list of teams. Please calculate the level of each team.
    Input

    There are multiple test cases. The first line of input contains an integer T indicating the number of test cases. For each test case:

    The first line contains an integer N (1 <= N <= 10) indicating the number of team members.

    The second line contains N integers representing the MMR of each team member. All MMRs are non-negative integers less than or equal to 9999.
    Output

    For each test case, output the level of the given team.
    Sample Input

    3
    5
    7986 6984 6645 6200 6150
    5
    7401 7377 6900 6000 4300
    3
    800 600 200

    Sample Output

    5
    3
    0

    #include <bits/stdc++.h>
    
    using namespace std;
    
    int main()
    {
        int t,n,i,sum;
        int a[100];
        scanf("%d",&t);
        while(t--)
        {
            scanf("%d",&n);
            sum=0;
            for(i=0; i<n; i++)
            {
                scanf("%d",&a[i]);
                if(a[i]>6000)
                    sum++;
    
    
            }
            cout<<sum<<endl;
        }
        return 0;
    }
    

    版权声明:本文为博主原创文章,未经博主允许不得转载。

  • 相关阅读:
    Log4j,Log4j2,logback,slf4j日志学习(转)
    MultipartFile类
    @Transactional(转)
    redis序列化和反序列化
    redis常见问题(转)
    为什么说Redis是单线程的以及Redis为什么这么快!(转)
    Numpy 用法小结
    正则表达式使用小结
    Hive 窗口函数、分析函数
    Hive UDF开发实例学习
  • 原文地址:https://www.cnblogs.com/juechen/p/4721974.html
Copyright © 2020-2023  润新知