Codeforces 1256A - Payment Without Change Solution

 Solution in C++:

 ///La ilaha illellahu muhammadur rasulullah

///******Bismillahir-Rahmanir-Rahim******///

///AH Tonmoy

///Department of CSE,23rd batch

    ///Islamic University,Bangladesh

    1. #include <bits/stdc++.h>
    2. using namespace std;
    3. int main()
    4. {
    5. long long n,a,b,s,t;
    6. cin>>t;
    7. while(t--)
    8. {
    9. cin>>a>>b>>n>>s;
    10. if((((a*n)+b)>=s)&&(s%n<=b))
    11. cout<<"YES"<<endl;
    12. else
    13. cout<<"NO"<<endl;
    14. }
    15.  
    16. }

    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.