Codeforces-734A-Anton and Danik(很水)

本文介绍了一个简单的比赛结果统计问题,通过输入一系列比赛结果,判断Anton和Danik谁赢得比赛次数更多。文章提供了一段C++代码实现,展示了如何统计字符'A'和'D'的数量并据此输出获胜者。

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

A. Anton and Danik
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
Anton likes to play chess, and so does his friend Danik.

Once they have played n games in a row. For each game it’s known who was the winner — Anton or Danik. None of the games ended with a tie.

Now Anton wonders, who won more games, he or Danik? Help him determine this.

Input
The first line of the input contains a single integer n (1 ≤ n ≤ 100 000) — the number of games played.

The second line contains a string s, consisting of n uppercase English letters ‘A’ and ‘D’ — the outcome of each of the games. The i-th character of the string is equal to ‘A’ if the Anton won the i-th game and ‘D’ if Danik won the i-th game.

Output
If Anton won more games than Danik, print “Anton” (without quotes) in the only line of the output.

If Danik won more games than Anton, print “Danik” (without quotes) in the only line of the output.

If Anton and Danik won the same number of games, print “Friendship” (without quotes).

Examples
input
6
ADAAAA
output
Anton
input
7
DDDAADA
output
Danik
input
6
DADADA
output
Friendship
Note
In the first sample, Anton won 6 games, while Danik — only 1. Hence, the answer is “Anton”.

In the second sample, Anton won 3 games and Danik won 4 games, so the answer is “Danik”.

In the third sample, both Anton and Danik won 3 games and the answer is “Friendship”.

题意:记下字符’A’和’D’的数量,比较数量后输出对应字符串

代码

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string.h>
using namespace std;
int main()
{
    int N;
    scanf("%d",&N);
    int num_1=0;
    int num_2=0;
    getchar();
    for(int i=0; i<N; i++)
    {
        char flag;
        scanf("%c",&flag);
        if(flag=='A')
            num_1++;
        else
            num_2++;
    }
    if(num_1>num_2)
        printf("Anton\n");
    else if(num_1==num_2)
        printf("Friendship\n");
    else
        printf("Danik\n");
    return 0;
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值