CF734A.Anton and Danik
入门
通过率:0%
时间限制:1.00s
内存限制:256MB
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
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.
安东喜欢下国际象棋,他的朋友达尼科也是如此。
他们连续进行了 n 场比赛。对于每场比赛,已知获胜者是安东还是达尼科。所有比赛均无平局。
现在安东想知道:他和达尼科谁赢得的比赛更多?请帮助他判断这一点。
输入格式
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.
输入的第一行包含一个整数 n(1 ≤ n ≤ 100000)—— 表示进行的比赛场数。
第二行包含一个长度为 n 的字符串 s,由大写英文字母 'A' 和 'D' 组成 —— 表示每场比赛的结果。字符串的第 i 个字符为 'A' 表示 Anton 赢得了第 i 场比赛,为 'D' 表示 Danik 赢得了第 i 场比赛。
输出格式
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).
如果安东获胜的局数多于丹尼尔,则在输出的唯一一行中打印 “Anton”(不带引号)。
如果丹尼尔获胜的局数多于安东,则在输出的唯一一行中打印 “Danik”(不带引号)。
如果安东和丹尼尔获胜的局数相同,则打印 “Friendship”(不带引号)。
输入输出样例
输入#1
6 ADAAAA
输出#1
Anton
输入#2
7 DDDAADA
输出#2
Danik
输入#3
6 DADADA
输出#3
Friendship
说明/提示
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".
在第一个样例中,安东赢了 6 场比赛,而丹尼尔仅赢了 1 场。因此,答案是 “Anton”。
在第二个样例中,安东赢了 3 场比赛,丹尼尔赢了 4 场比赛,因此答案是 “Danik”。
在第三个样例中,安东和丹尼尔均赢了 3 场比赛,因此答案是 “Friendship”。
输入解题思路,AI测评打分。不知道怎么写?