Codeforces Round #777 (Div. 2) 1647A - Madoka and Math Dad Solution




Problem Link:  https://codeforces.com/contest/1647/problem/A 

Solution in C++:

///La ilaha illellahu muhammadur rasulullah
///******Bismillahir-Rahmanir-Rahim******///
///Abul Hasnat  Tonmoy
///Department of CSE,23rd batch
///Islamic University,Bangladesh
#include <bits/stdc++.h>
using namespace std;
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int n;
        cin>>n;
        string s;
        for(int i=0;i<n/3;i++)
        {
            s+="21";
        }
        if(n%3==1)
        {
            s="1"+s;
        }
        if(n%3==2)
        {
            s+="2";
        }
        cout<<s<<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.