Codeforces Round #586 (Div.1+Div.2)

#include
using namespace std;
const int maxn=1e5+7;
char s[maxn];
int main()
{
    int n,s1=0,s2=0;scanf("%d",&n);
    scanf("%s",s+1);
    for (int i=1;i<=n;i++)
    {
        if(s[i]=='n') s1++;
        if(s[i]=='r') s2++;
    }
    if(s1) printf("1"),s1--;
    else if(s2) printf("0"),s2--;
    while (s1--) printf(" 1");
    while (s2--) printf(" 0");
    return 0;
}

#include
using namespace std;
const int maxn=1005;
typedef long long ll;
ll a[maxn],p[maxn][maxn],k[maxn][maxn];
ll gcd(ll a,ll b) {return b==0?a:gcd(b,a%b);}
int main()
{
    int n;scanf("%d",&n);
    for (int i=1;i<=n;i++) 
        for (int j=1;j<=n;j++) scanf("%lld",&p[i][j]);
    for (int i=1;i<=n;i++)
    {
        ll res=0;
        for (int j=1;j<=n;j++)
        {
            if(i==j) continue;
            if(!res) res=p[i][j];
            else res=gcd(res,p[i][j]);
        }
        a[i]=res;
    }
    for (int i=1;i<=n;i++)
        for (int j=1;j<=n;j++) 
            if(i!=j)k[i][j]=(a[i]*a[j])/p[i][j];
    int x,y,z;
    for (int i=1;i<=n;i++)
    {
        x=i;
        if(x==1) y=2,z=3;
        else if(x==n) y=n-1,z=n-2;
        else y=x-1,z=x+1;
        ll tmp=(ll)sqrt(1.0*(k[x][y]*k[x][z])/k[y][z]);
        a[i]/=tmp;
    }
    for (int i=1;i

#include
using namespace std;
const int maxn=5e5+7;
char s[maxn],a[maxn];
int main()
{
    scanf("%s",s+1);
    int n=strlen(s+1);
    a[1]=s[1];
    for (int i=2;i<=n;i++) a[i]=min(a[i-1],s[i]);
    printf("Mike
");
    for (int i=2;i<=n;i++)
        if(a[i]