URAL1049. Brave Balloonists
2013-11-05 18:00
253 查看
1049
求约数的个数 质因子数的个数+1相乘
View Code
求约数的个数 质因子数的个数+1相乘
#include <iostream> #include<cstdio> #include<cstring> #include<algorithm> #include<stdlib.h> #include<cmath> using namespace std; #define N 10000 int f[N+10],a[12],p[N+10],g,o[N+10]; void init() { int i,j; for(i = 2; i <= 100 ; i++) if(!f[i]) { for(j = i+i ; j <= N ; j+=i) f[j] = 1; } for( i =2 ; i <= N ;i++) if(!f[i]) p[++g] = i; } int main() { int i,j; init(); for(i = 1; i <= 10 ; i++) cin>>a[i]; for(i = 1; i <= 10 ; i++) { int x = a[i]; for(j = 1 ; j <= g ; j++) { while(x&&x%p[j]==0) { x/=p[j]; o[p[j]]++; } } } int ans = 1; for(i = 1 ; i <= g ; i++) ans = (ans*(o[p[i]]+1))%10; cout<<ans<<endl; return 0; }
View Code
相关文章推荐
- URAL 1049
- ural 1049
- Ural1049
- URAL 1049 Brave balloonists【数论】
- ural 1049 Brave Balloonists
- URAL 1049 Brave Balloonists
- ural 1049. Brave Balloonists(标准分解式,数论)
- Ural 1049. Brave Balloonists 求因子的个数
- Ural1049 基础数论
- URAL:1049 Brave Balloonists
- hihocoder#1049 : 后序遍历
- URAL - 1786 Sandro's Biography
- URAL 2037 Richness of binary words
- 13 URAL1303 Minimal Coverage
- 题目1049:字符串去特定字符
- 贪心 URAL 1303 Minimal Coverage
- URAL1029——DP+回溯——Ministry
- URAL 1988 - Planet Ocean Landing【几何&三分答案】
- URAL 1039 Anniversary Party 树形DP 水题
- URAL 1712. Cipher Grille (模拟)