Codeforces 1476A - K-divisible Sum 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 int t;
    6. cin>>t;
    7. while(t--)
    8. {
    9. long long int n,k,r;
    10. cin>>n>>k;
    11. if(n%k==0)
    12. cout<<"1"<<endl;
    13. else if(k%n==0)
    14. cout<<k/n<<endl;
    15. else if(n>k)
    16. cout<<"2"<<endl;
    17. else
    18. cout<<(k/n)+1<<endl;
    19. }
    20. }

    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.