Ural 1049. Brave Balloonists 求因子的个数

1049. Brave Balloonists

Time limit: 2.0 second
Memory limit: 64 MB

Ten mathematicians are flying on a balloon over the Pacific ocean. When they are crossing the equator they decide to celebrate this event and open a bottle of champagne. Unfortunately, the cork makes a hole in the balloon. Hydrogen is leaking out and the balloon is descending now. Soon it will fall into the ocean and all the balloonists will be eaten by hungry sharks.

But not everything is lost yet. One of the balloonists can sacrifice himself jumping out, so that his friends would live a little longer. Only one problem still exists: who is the one to get out. There is a fair way to solve this problem. First, each of them writes an integer  ai not less than 1 and not more than 10000. Then they calculate the magic number  N that is the number of positive divisors of the product  a 1* a 2*…* a 10. For example, the number of positive integer divisors of 6 is 4 (they are 1,2,3,6). The hero (a mathematician who will be thrown out) is determined according to the last digit of  N. Your task is to find this digit.

Input

Input contains ten integer numbers (each number is in separate line).

Output

Output a single digit from 0 to 9 — the last digit of  N.

Sample

input	output
1 2 6 1 3 1 1 1 1 1	9

Problem Author: Stanislav Vasilyev
Problem Source: Ural State University collegiate programming contest (25.03.2000)

10个整数，然后计算出a1×a2×a3×a4×……×a10的积的约数的个数N。

设正整数n有素数因子分解n=p1^a1*p2^a2*p3^a3*...pn^an,那么所有因子的和为( p1^(a1+1)-1)/(p1-1)*(p2^(a2+1)-1)/(p2-1)*(p3^(a3+1)-1)/(p3-1)*...(pn^(an+1)-1)/(pn-1),因子的个数为(a1+1)*(a2+1)*(a3+1)*...*(an+1).

#include<cstdio>
#include<cstring>
#include<iostream>

int a[10001];
int const maxSize=10000;
int prime[maxSize];     //保存筛得的素数
int primeSize;          //保存的素数的个数
//若mark[x]为true,则表示该数x已被标记成非素数
bool isPrime[maxSize+1];
void init()//素数筛法
{
    //#include <cstring>
    //初始化，所有数字均没被标记
    memset(isPrime,true,sizeof(isPrime));
    isPrime[0]=isPrime[1]=false;
    primeSize = 0; //得到的素数个数为0
    //依次遍历2到maxSize所有数字
    for (int i=2; i<= maxSize; i++)
    {
        //若该数字已经被标记,则跳过
        if(!isPrime[i]) continue;
        //否则,又新得到一个新素数
        prime[primeSize++]=i;
        //并将该数的所有倍数均标记成非素数
        for (int j=i*i; j<=maxSize &&j>=0; j+=i)
        {
            isPrime[j]=false;
        }
    }
}
void find(int n)
{
    int i=0;
    while (n!=1&&n>=prime[i])
    {

        while (n%prime[i]==0)
        {
            n=n/prime[i];
            a[prime[i]]++;
        }
        i++;
    }
}
int main()
{
    init();
    int i,l,n;
    for (i=1; i<=10; i++)
    {
        scanf("%d",&n);
        find(n);
    }
//    for (i=0;i<=15;i++)
//      printf("%d\n",a[prime[i]]);

    l=1;
    for (i=1; i<=10000; i++)
    {
        l=l*(a[i]+1);
//        cout<<l<<endl;
    }
    printf("%d\n",l%10);
    return 0;
}