Toph Number theory Problem Challenging Lover Solutio

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