Codeforces 32B B. Borze Solution



Solve in  C++:

///**********ALLAH IS ALMIGHTY************///
///AH Tonmoy
///Department of CSE
///Islamic University,Bangladesh
#include<bits/stdc++.h>
using namespace std;
int main()
{
    int i,n,l;
    char  s[10000];
    gets(s);
    l=strlen(s);
    for(i=0;i<l;i++)
    {
        if(s[i]=='.')
        cout<<"0";
         if((s[i]=='-')&&(s[i+1]=='.'))
         {
           cout<<"1";
           i++;
         }

        if((s[i]=='-')&&(s[i+1]=='-'))

        {
            cout<<"2";
            i++;
        }

    }
    cout<<endl;
}


No comments

Most View Post

Recent post

Codeforces Round 925 (Div. 3) 1931D. Divisible Pairs Solution

    Problem Link  :   https://codeforces.com/contest/1931/problem/D S olution in C++: /// Author : AH_Tonmoy #include < bits / stdc ++. ...

Powered by Blogger.