Coodechef Chef and Notebooks Problem Code: CNOTE Solution


Solution in C++:
///**********ALLAH IS ALMIGHTY************///
///AH Tonmoy
///Department of CSE,23rd batch
///Islamic University,Bangladesh

#include<iostream>
using namespace std;
int main()
{
    int t,i,x,y,k,f,n,p,c,np;
    cin>>t;
    while(t--)
    {
        f=0;
        cin>>x>>y>>k>>n;
        np=x-y;
        for(i=0;i<n;i++)
        {
            cin>>p>>c;
            if(p>=np&&c<=k)
              f=1;
        }
        if(f==1)
        cout<<"LuckyChef"<<endl;
        else
        cout<<"UnluckyChef"<<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.