zoukankan      html  css  js  c++  java
  • 【77.39%】【codeforces 734A】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”.

    【题目链接】:http://codeforces.com/contest/734/problem/A

    【题解】

    统计一下两个字符出现的次数;
    比较大小即可;
    好水的题。。
    不,这已经水破天际了;
    ps:D题手慢了TAT,捶胸顿足状。

    【完整代码】

    #include <bits/stdc++.h>
    
    using namespace std;
    
    int a[2],n;
    
    int main()
    {
        cin >> n;
        string s;
        cin >> s;
        for (int i = 0;i <= n-1;i ++)
            if (s[i] == 'A')
                a[0]++;
            else
                if (s[i] == 'D')
                    a[1] ++;
        if (a[0] == a[1])
            puts("Friendship");
        else
            if (a[0] > a[1])
                puts("Anton");
        else
            puts("Danik");
        return 0;
    }
  • 相关阅读:
    java程序员怎么创建自己的网站:第一章:总体流程
    技术汇总:第五章:使用angularjs做首页三级分类
    js中Function的apply方法与call方法理解
    常用方法
    Array对象(一)
    一张图理解is_nll isset empty
    解析centos中Apache、php、mysql 默认安装路径
    常用命令
    centos虚拟机启用网卡
    初学Linux笔记
  • 原文地址:https://www.cnblogs.com/AWCXV/p/7632058.html
Copyright © 2011-2022 走看看