Uva 11064 - Number Theory

By -
/*
 Thanks to Rafik Forhad.
 Member of team :: SUST_NFS_JAGUYAR
His Code:: Rofik Forhad's Code of Number Theory Problem
*/

 
// Verdict :: Accepted
// Time:: 0.006
#include <iostream>
#include <cstdio>
#include <cstring>
#include <map>
#include <string>
#include <vector>
#include <cmath>
#include <cctype>
#include <sstream>
#include <set>
#include <list>
#include <stack>
#include <queue>
#include <algorithm>
#define sf scanf
#define pf printf
#define sfint scanf ("%d %d",&a,&b)
#define sfl scanf ("%ld %ld",&a,&b)
#define sfll scanf ("%lld %lld",&a,&b)
#define sfd scanf ("%lf %lf",&a,&b)
#define sff scanf ("%f %f",&a,&b)
#define lp1(i,n) for(i=0;i<n;i++)
#define lp2(i,n) for(i=1;i<=n;i++)
#define LL long long
#define L long
#define mem(c,v) memset(c,v,sizeof(c))
#define ui unsigned int
#define ull unsigned long long int
#define nl puts("")
#define sq(x) ((x)*(x))
#define MX 1000005
#define N 100
#define MOD 10000000007
#define pb push_back
#define pi acos(-1.0)
#define sz size()
#define gc getchar ()
#define ps push
#define clr clear
#define inf 2147483647
#define bn begin()
#define ed end()

using namespace std;

ull prime[MX+15],p[MX+15],plen=0;

ull setbit(ull n, ull pos)
{
    n=n|(1<<pos);
    return n;
}

ull checkbit(ull n, ull pos)
{
    n=n&(1<<pos);
    return n;
}

void seieve(ull n)
{
    ull i,j,x=sqrt(n);

    prime[0]=setbit(prime[0],0);
    prime[0]=setbit(prime[0],1);

    for(i=4;i<=n;i+=2)
    {
        prime[i>>5]=setbit(prime[i>>5],i&31);
    }

    for(i=3;i<=x;i+=2)
    {
        if(!checkbit(prime[i>>5],i&31))
        {
            for(j=i*i;j<=n;j+=i)
            {
                prime[j>>5]=setbit(prime[j>>5],j&31);
            }
        }
    }

    for(i=1;i<=n;i++)
    {
        if(!checkbit(prime[i>>5],i&31))
        {
            //cout << i << " ";
            p[plen++]=i;
        }
    }
}

//void euler_phi()
//{
//    ull i,j,k,p;
//
//    for(i=1;i<=MX;i++) phi[i]=i;
//
//    for(p=2;p<=MX;p++)
//    {
//        if(!checkbit(prime[p>>5],p&31))
//        {
//            if(phi[p]==p)
//            {
//                for(k=p;k<=MX;k+=p)
//                {
//                    phi[k]-=phi[k]/p;
//                }
//            }
//        }
//    }
//}

void divisors(ull n)
{
    ull i,m=1,s,phi=n,take=n;

    for(i=0; i<=plen and sq(p[i])<=n ; i++)
    {
        if(!(n%p[i]))
        {
            s=1;
            phi-=phi/p[i];
            while(!(n%p[i]))
            {
                s++;
                n/=p[i];
                //phi-=phi/p[i];
                if(n==0 or n==1) break;
            }

            m*=s;
        }

        //m*=s;
    }

    if(n!=1)
    {
        m*=2;
        phi-=phi/n;
    }


//    cout << "phi = " << phi;
//    return m;

        pf("%llu\n",take-phi-(m-1));
}

int main()
{
    seieve(MX);
    //for(ull i=0;i<plen;i++) cout << p[i] << " ";
//    euler_phi();
    //cout << phi[8];

    ull n;

    while(sf("%llu",&n)==1)
    {
        if(!n) break;

//        euler_phi(n);
//
//        ull t = divisors(n)-1; //cout << t;
//       pf("%llu\n", n - phi - t );
//       cout <<"n = " << n << " phi= " << phi[n] << " t = " << t << " ";

            divisors(n);
    }

    return 0;
}

Comments

Post a Comment

Popular posts from this blog

Hacker Rank The Power Sum

By -
Problem Link: The Power Sum #include<bits/stdc++.h> using namespace std; #define fast ios_base::sync_with_stdio(0) #define bfast cin.tie(0) #define outs(x) cout << x << " " #define outn(x) cout << x << "\n" #define sf scanf #define pf printf #define pfn(x , k) printf(k , x) #define nl puts("") #define psb push_back #define mset(c,v) memset(c , v , sizeof c) #define loop0(n) for(int i=0; i<n; i++) #define loop1(n) for(int i=1; i<=n; i++) #define mpair(x , y) make_pair(x , y) #define all(x) x.begin(), x.end() #define pi acos(-1.0) #define psb push_back #define clr clear() typedef unsigned long long ull; typedef long long LL; typedef vector<int>vii; typedef vector<LL>vll; typedef vector<string>vs; typedef map<int, int>mpii; typedef map<string, int>mpsi; typedef map<char, int>mpci; typedef map<LL, LL>mpll; const int mod = 1000007; const int high = 1002; int x = 0 , y; int getWay(L...
Read more

SPOJ-CMG - Collecting Mango

By -
#include<iostream> #include<cstdio> #include<cstring> #include<vector> #include<queue> #include<stack> #include<map> #include<cmath> #include<algorithm> #define psb push_back #define ppb pop_back #define all(x) x.begin(),x.end() #define N 1000100 #define sf scanf #define pf printf using namespace std; typedef long long LL; typedef vector<LL>vll; LL ar[N] , num[N]; int main() {     int t , tc=0;     //cin >> t;     sf("%d",&t);     while(t--)     {         LL n, x, arlen=-1, nmlen=-1 , i , maxi=-1 , zar;         char c;         //cin >> n;         sf("%lld",&n);         //cout << "Case " << ++tc << ":\n";       ...
Read more

LeetCode Palindrome Number

By -
 Problem Description Link:  https://leetcode.com/problems/palindrome-number/ Accepted Solution /* The solution is easy, and I believe everyone knows the process. However, one problem is that x is a number. If it is a string, in that case, we can get the result after reversing it. Therefore, to solve the problem, we have to find the digits by modulating 10, store them in an array, and finally compare from both sides. If we find any discrepancy, we can tell it is not a palindrome. Note that any negative integer would never be a palindrome since it should contain a minus (-) sign. */ class Solution { public:     bool isPalindrome ( int x ) {         int digit [ 50 ], len= 0 ;         bool f = true ;         if (x < 0 ) {             return false ;         }         while (x> 0 )         {       ...
Read more