hdu 4432 Sum of divisors(十进制转其他进制)
2013-10-06 19:14
330 查看
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4432
代码:
View Code
代码:
#include<cstdio> #include<cstring> #include<iostream> #include<algorithm> using namespace std; int sum; int n,k; int tranfer(int num) { int ret = 0; while(num > 0) { int a = num%k; num = num/k; ret += a*a; } return ret; } int main() { // freopen("E:\\acm\\input.txt","r",stdin); while(cin>>n>>k) { int ans[100],cnt; cnt = 0; sum = 0; for(int i=1; i*i<=n; i++) { if(n % i) continue; if(i*i == n) sum += tranfer(i); else sum += tranfer(i) + tranfer(n/i); } while(sum > 0) { ans[++cnt] = sum%k; sum /= k; } for(int i=cnt; i>=1; i--) { if(ans[i]>9) { printf("%c",ans[i]-10+'A'); } else { printf("%d",ans[i]); } } printf("\n"); } }
View Code
相关文章推荐
- hdu 4432 Sum of divisors
- hdu 4432 Sum of divisors
- hdu-4432-Sum of divisors
- HDU 4432 Sum of divisors (进制转换模板)
- HDU:4432 Sum of divisors
- HDU—— 4432 Sum of divisors
- hdu 4432 Sum of divisors(模拟)
- 哈理工校园编程练习赛杭电 acm 4432 G.Sum of divisors
- HDU 4432 Sum of divisors (进制模拟)
- HDU 4432 Sum of divisors (进制模拟)
- HDU 4432 Sum of divisors (进制模拟)
- HDU-#4432 Sum of divisors(模拟)
- HDOJ4432 Sum of divisors(暴力)
- HDOJ4432 Sum of divisors(暴力)
- HDU--2031--十进制转换到任意进制
- HDU 3415 Max Sum of Max-K-sub-sequence
- HDU 4432 Sum of divisors
- P122 第三章 20题 十进制转换其他进制
- HDU--杭电--3415--Max Sum of Max-K-sub-sequence--暴力或单调队列
- hdu 5381 The sum of gcd