Codeforces Round #379 (Div. 2) A. Anton and Danik 水题

2024-04-06 19:18:38

A. Anton and Danik

题目连接：

http://codeforces.com/contest/734/problem/A

Description

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

Sample Input

6
ADAAAA

Sample Output

Anton

Hint

题意

问你A多，还是D多，然后输出谁赢谁输

题解：

签到题

代码

#include<bits/stdc++.h>
using namespace std;string s;
int main()
{cin>>s;cin>>s;int a=0,b=0;for(int i=0;i<s.size();i++)if(s[i]=='A')a++;else b++;if(a>b)puts("Anton");else if(a==b)puts("Friendship");else puts("Danik");
}

转载于:https://www.cnblogs.com/qscqesze/p/6069099.html

Codeforces Round #379 (Div. 2) A. Anton and Danik 水题相关推荐

Codeforces Round #404 (Div. 2) B. Anton and Classes 水题
B. Anton and Classes 题目连接: http://codeforces.com/contest/785/problem/B Description Anton likes to pl ...
Codeforces Round #379 (Div. 2) E. Anton and Tree —— 缩点 + 树上最长路
题目链接:http://codeforces.com/contest/734/problem/E E. Anton and Tree time limit per test 3 seconds mem ...
Codeforces Round #379 (Div. 2) E. Anton and Tree
题意: 给一颗树每个节点有黑白2色可以使一个色块同事变色,问最少的变色次数. 思路: 先缩点把一样颜色的相邻点缩成一个然后新的树刚好每一层是一个颜色. 最后的答案就是树的直径/2 不过我用 ...
Codeforces Round #370 (Div. 2) A. Memory and Crow 水题
A. Memory and Crow 题目连接: http://codeforces.com/contest/712/problem/A Description There are n integer ...
Codeforces Round #311 (Div. 2) A. Ilya and Diplomas 水题
A. Ilya and Diplomas Time Limit: 20 Sec Memory Limit: 256 MB 题目连接 http://codeforces.com/contest/557/ ...
Codeforces Round #394 (Div. 2) A. Dasha and Stairs 水题
A. Dasha and Stairs 题目连接: http://codeforces.com/contest/761/problem/A Description On her way to prog ...
Codeforces Round #374 (Div. 2) A. One-dimensional Japanese Crosswor 水题
A. One-dimensional Japanese Crossword 题目连接: http://codeforces.com/contest/721/problem/A Description ...
Codeforces Round #358 (Div. 2) A. Alyona and Numbers 水题
A. Alyona and Numbers 题目连接: http://www.codeforces.com/contest/682/problem/A Description After finish ...
Codeforces Round #307 (Div. 2) A. GukiZ and Contest 水题
A. GukiZ and Contest Time Limit: 20 Sec Memory Limit: 256 MB 题目连接 http://codeforces.com/contest/551/ ...

最新文章

热门文章