2603.txt

来自「北大ACM题目例程 详细的解答过程 程序实现 算法分析」· 文本 代码 · 共 48 行

Problem Id:2603  User Id:fzk 
Memory:48K  Time:15MS
Language:C++  Result:Accepted

Source 

#include <stdio.h>

bool s[10001];
int prime[10000];
int ans[10000];

int main()
{
	int a[10], i, j, t, n;

	for( i=2, n=0; i<=10000; i++ )
		if( !s[i] )
		{
			for( j=i+i; j<=10000; j+=i )
				s[j] = 1;
			prime[n] = i;
			ans[n] = 0;
			n++;
		}

	for( i=0; i<10; i++ )
		scanf( "%d", &a[i] );

	for( i=0; i<10; i++ )
	{
		for( j=0; j<n&&a[i]>1; j++ )
			while( a[i] % prime[j] == 0 )
				ans[j]++, a[i] /= prime[j];
	}

	t = 1;
	for( i=0; i<n; i++ )
		t = t*(ans[i]+1)%10;

	printf( "%d\n", t );

	return 0;
}