[hdu]2848 the Euler function[Euler function] [water problem]

Source: Internet
Author: User

Problem Description
The Euler function phi is an important kind of function in number theory, (n) represents the amount of the numbers which a Re smaller than N and coprime to n, and this function have a lot of beautiful characteristics. Here comes a very easy question:suppose is given a, B, try to calculate (a) + (a+1) +....+ (b)

Input
There is several test cases. Each line has a integers a, B (2

#include <stdio.h>
#define MAX_N 3000100
int phi[max_n];

void Init () {for
    (int i=1;i<max_n;i++) phi[i]=i;
    for (int i=2;i<max_n;i++)
        if (phi[i]==i) for
            (int j=i;j<max_n;j+=i)
                phi[j]=phi[j]/i* (i-1);
}

int main ()
{
    init (); int a, b;
    while (~SCANF ("%d%d", &a,&b)) {
        long long ans=0;
        for (int i=a;i<=b;i++)
            ans+=phi[i];
        printf ("%lld\n", ans);
    }
    return 0;
}

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.