UVA 10110 Solution

 Solve in C++:

#include<bits/stdc++.h>
using namespace std;
int main()
{
    long long int n,i,s,a,r;
    while(cin>>a)
    {
        if(a==0)
            break;
        s=sqrt(a);
        r=s*s;
        if(r==a)
            cout<<"yes"<<endl;
        else
            cout<<"no"<<endl;

    }
    return 0;
}

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.