#include<bits/stdc++.h>
using namespace std;
int main()
{
long n;
string str;
cin>>n;
cin>>str;
long count=0,index;
index=str.find("A");
while(index!=-1)
{
count++;
str.erase(str.begin()+index,str.begin()+index+1);
index=str.find("A");
}
if(count>n-count)
cout<<"Anton";
else if(count<n-count)
cout<<"Danik";
else
cout<<"Friendship";
return 0;
}
#include<bits/stdc++.h> using namespace std; class graph { int v; list<int> *adj; public: graph(int v) { this->v=v; adj=new list<int>[v]; } void add_edge(int v,int w) { adj[v].push_back(w); } void bfs(int start); }; void graph:: bfs(int start) { bool *visited=new bool[v]; for(int i=0;i<v;i++) visited[i]=false; visited[start]=true; list<int> queue; queue.push_back(start); while(!queue.empty()) { int s=queue.front(); cout<<s<...
Comments
Post a Comment