LightOJ 1001 Opposite Task Solution



 Problem Link :https://lightoj.com/problem/opposite-task

Solve 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()
{
    long long n,t,i,a,b,r;
    cin>>t;
    while(t--)
    {
        cin>>n;
        if(n<=10)
            cout<<"0 "<<n<<endl;
        else
            cout<<n-10<<" 10"<<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.