Codeforces 937A

本文介绍了一个竞赛场景下确定获奖者名单的问题。通过设定特定规则,文章提供了一种算法来计算不同获奖者组合的数量,并附带了解题代码实现。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

A. Olympiad
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

The recent All-Berland Olympiad in Informatics featured n participants with each scoring a certain amount of points.

As the head of the programming committee, you are to determine the set of participants to be awarded with diplomas with respect to the following criteria:

  • At least one participant should get a diploma.
  • None of those with score equal to zero should get awarded.
  • When someone is awarded, all participants with score not less than his score should also be awarded.

Determine the number of ways to choose a subset of participants that will receive the diplomas.

Input

The first line contains a single integer n (1 ≤ n ≤ 100) — the number of participants.

The next line contains a sequence of n integers a1, a2, ..., an (0 ≤ ai ≤ 600) — participants' scores.

It's guaranteed that at least one participant has non-zero score.

Output

Print a single integer — the desired number of ways.

Examples
input
Copy
4
1 3 3 2
output
3
input
Copy
3
1 1 1
output
1
input
Copy
4
42 0 0 42
output
1
Note

There are three ways to choose a subset in sample case one.

  1. Only participants with 3 points will get diplomas.
  2. Participants with 2 or 3 points will get diplomas.
  3. Everyone will get a diploma!

The only option in sample case two is to award everyone.

Note that in sample case three participants with zero scores cannot get anything.

题意:奥林匹克运动会有三个颁奖标准,一个是不给成绩为0的颁奖,一个是给成绩大于0的都颁奖,一个是给成绩大于等于非零的数的人颁奖,问你共有多少种颁奖的方案。

题解:判断非零的不相同的数字个数。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int book[610];

int main()
{
    int n;
    cin>>n;
    memset(book, 0, sizeof(book));
    for(int i = 1; i<=n; i++)
    {
        int k;
        cin>>k;
        book[k]++;
    }
    int cnt = 0;
    for(int i = 1; i<=600; i++)
    {
        if(book[i]!=0)
            cnt++;

    }
    cout<<cnt<<endl;
    return 0;
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值