#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,i;
cin>>n;
vector<pair<int,int>> vect;
for(i=0;i<n;i++)
{
int x;
cin>>x;
vect.push_back(make_pair(x,i+1));
}
sort(vect.begin(),vect.end());
for(i=0;i<n;i++)
{
cout<<vect[i].second<<" ";
}
return 0;
}
#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 ; }
Comments
Post a Comment