UVA 10673 Play with Floor and Ceil Solution

Solve in C++:
///**********ALLAH IS ALMIGHTY************///
///AH Tonmoy
///Department of CSE
///Islamic University,Bangladesh
#include<iostream>
using namespace std;
int main()
{
    long long n,p,q,k,x,t;
    cin>>t;
    while(t--)
    {
        cin>>x>>k;
        q=x%k;
        if(x>=k)
        {
            p=k-q;
            cout<<p<<" "<<q<<endl;
        }
        else
        cout<<"0"<<" "<<q<<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.