uva 10591- Happy Number
来源:互联网 发布:淘宝免费推广平台 编辑:程序博客网 时间:2024/05/16 13:51
#include <cstdio>#include <iostream>#include <cstring>#include <list>#include <algorithm>using namespace std;int vis[1000];int solve(int n){ int sum = 0; while(n>0) { sum += (n%10)*(n%10); n /= 10; } return sum;}int main(){ int n, x, casen = 1; cin >> n; while(n--) { cin >> x; memset(vis, 0, sizeof(vis)); int m = x; while(x) { m = solve(m); if(m == 1) { printf("Case #%d: %d is a Happy number.\n", casen++, x); break; } if(vis[m]) { printf("Case #%d: %d is an Unhappy number.\n", casen++, x); break; } vis[m] = 1; } } return 0;}
- UVa 10591 - Happy Number
- uva 10591 - Happy Number
- uva 10591 - Happy Number
- UVa 10591 - Happy Number
- uva-10591 - Happy Number
- UVa 10591 - Happy Number
- UVA 10591 Happy Number
- UVA 10591 - Happy Number
- uva 10591- Happy Number
- UVA 10591 Happy Number
- UVa 10591 - Happy Number
- UVA 10591 - Happy Number
- UVA - 10591 Happy Number
- UVA - 10591 Happy Number
- UVA - 10591 Happy Number
- UVA - 10591Happy Number
- uva 10591Happy Number
- UVa OJ 10591-Happy Number
- hdu1087 Super Jumping! Jumping! Jumping!
- 销售管理系统功能
- linux网络编程之socket(十四):基于UDP协议的网络程序
- easy_install
- 2410之MMU_Init()
- uva 10591- Happy Number
- 2013蓝桥杯预赛试题汇总
- 简易WCF负载均衡方案
- hdu2571 命运
- 辞职的程序员那些事儿
- Gartner的防火墙魔力象限(2013)
- 树形结构的数据库表Schema设计
- 果不其然,这条路不是一般的长与艰难。
- iOS开发学习笔记(一) - 预备知识(1)