UVA 10299 Solution



 

Solution 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 r,i;
int phi (int n)
{
    if(n == 1)
        return 0;
    r=n;
    for(i=2; i*i<=n; i++)
    {
        if(n%i==0)
        {
            while(n%i==0)
                n=n/i;

            r-=r/i;
        }
    }
    if(n>1)
        r-=r/n;
    return r;
}
int main()
{
    int n;
    while((cin>>n)&&n!=0)
    {
        cout<<phi(n)<<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.