Codeforces 897A. Between the Offices Solution

Solve in C++:

//AH Tonmoy
//Department of CSE ,Islamic University


#include<bits/stdc++.h>
using namespace  std;
int main()
{
    char s[10000];
    int cf=0,cs=0,i,n;
    cin>>n;
    {
        cf=0,cs=0;
        for(i=0; i<n; i++)
        {
            cin>>s[i];
        }
        for(i=0; i<n; i++)
        {

            if(s[i]=='S'&&s[i+1]=='F')
                cf++;
            else if(s[i]=='F'&&s[i+1]=='S')
                cs++;
        }
        if(cf>cs)
        {
           cout<<"yes"<<endl;
           cs=0,cf=0;
        }

        else
        {
            cout<<"no"<<endl;
            cs=0,cf=0;
        }
    }
}

No comments

Most View Post

Recent post

Codeforces Round 971 (Div. 4) 2009C. The Legend of Freya the Frog Solution

  Problem Link    https://codeforces.com/contest/2009/problem/C S olution in C++: /// Author : AH_Tonmoy #include < bits / stdc ++. h &g...

Powered by Blogger.