算法练习:水仙花数、完全数、相亲数
2007-01-31 11:41
316 查看
输出所有水仙花数
一个三位数,每位的立方之和为其数本身
1
![](http://www.cnblogs.com/Images/OutliningIndicators/None.gif)
for (int i = 100; i <= 999; i++)
2
![](http://www.cnblogs.com/Images/OutliningIndicators/ExpandedBlockStart.gif)
![](http://www.cnblogs.com/Images/OutliningIndicators/ContractedBlock.gif)
![](http://www.cnblogs.com/Images/dot.gif)
{
3
![](http://www.cnblogs.com/Images/OutliningIndicators/InBlock.gif)
4
![](http://www.cnblogs.com/Images/OutliningIndicators/InBlock.gif)
if (Math.Pow(i / 100, 3) +
5
![](http://www.cnblogs.com/Images/OutliningIndicators/InBlock.gif)
Math.Pow((i / 10) - (i / 100) * 10, 3) +
6
![](http://www.cnblogs.com/Images/OutliningIndicators/InBlock.gif)
Math.Pow(i - i / 10 * 10, 3) == i)
7
![](http://www.cnblogs.com/Images/OutliningIndicators/ExpandedSubBlockStart.gif)
![](http://www.cnblogs.com/Images/OutliningIndicators/ContractedSubBlock.gif)
![](http://www.cnblogs.com/Images/dot.gif)
{
8
![](http://www.cnblogs.com/Images/OutliningIndicators/InBlock.gif)
System.Console.WriteLine(
9
![](http://www.cnblogs.com/Images/OutliningIndicators/InBlock.gif)
"{0}:[{1}|{2}|{3}]", i, i / 100, (i / 10) - (i / 100) * 10, i - i / 10 * 10);
10
![](http://www.cnblogs.com/Images/OutliningIndicators/ExpandedSubBlockEnd.gif)
}
11
![](http://www.cnblogs.com/Images/OutliningIndicators/ExpandedBlockEnd.gif)
}
输出10000以内的完全数
又称完美数,它是指真因子之和等于自身的自然数
1
![](http://www.cnblogs.com/Images/OutliningIndicators/None.gif)
for (int i = 1; i <= 10000; i++)
2
![](http://www.cnblogs.com/Images/OutliningIndicators/ExpandedBlockStart.gif)
![](http://www.cnblogs.com/Images/OutliningIndicators/ContractedBlock.gif)
![](http://www.cnblogs.com/Images/dot.gif)
{
3
![](http://www.cnblogs.com/Images/OutliningIndicators/InBlock.gif)
int k = 0;
4
![](http://www.cnblogs.com/Images/OutliningIndicators/InBlock.gif)
for (int j = 1; j <= i - 1; j++)
5
![](http://www.cnblogs.com/Images/OutliningIndicators/ExpandedSubBlockStart.gif)
![](http://www.cnblogs.com/Images/OutliningIndicators/ContractedSubBlock.gif)
![](http://www.cnblogs.com/Images/dot.gif)
{
6
![](http://www.cnblogs.com/Images/OutliningIndicators/InBlock.gif)
if ((i % j) == 0)
7
![](http://www.cnblogs.com/Images/OutliningIndicators/ExpandedSubBlockStart.gif)
![](http://www.cnblogs.com/Images/OutliningIndicators/ContractedSubBlock.gif)
![](http://www.cnblogs.com/Images/dot.gif)
{
8
![](http://www.cnblogs.com/Images/OutliningIndicators/InBlock.gif)
k += j;
9
![](http://www.cnblogs.com/Images/OutliningIndicators/ExpandedSubBlockEnd.gif)
}
10
![](http://www.cnblogs.com/Images/OutliningIndicators/ExpandedSubBlockEnd.gif)
}
11
![](http://www.cnblogs.com/Images/OutliningIndicators/InBlock.gif)
if (k == i)
12
![](http://www.cnblogs.com/Images/OutliningIndicators/ExpandedSubBlockStart.gif)
![](http://www.cnblogs.com/Images/OutliningIndicators/ContractedSubBlock.gif)
![](http://www.cnblogs.com/Images/dot.gif)
{
13
![](http://www.cnblogs.com/Images/OutliningIndicators/InBlock.gif)
System.Console.WriteLine(i);
14
![](http://www.cnblogs.com/Images/OutliningIndicators/ExpandedSubBlockEnd.gif)
}
15
![](http://www.cnblogs.com/Images/OutliningIndicators/ExpandedBlockEnd.gif)
}
输出10000以内的相亲数
两个正整数,X的真因子之和等于Y的真因子之和
1
![](http://www.cnblogs.com/Images/OutliningIndicators/None.gif)
for (int i = 1; i <= 10000; i++)
2
![](http://www.cnblogs.com/Images/OutliningIndicators/ExpandedBlockStart.gif)
![](http://www.cnblogs.com/Images/OutliningIndicators/ContractedBlock.gif)
![](http://www.cnblogs.com/Images/dot.gif)
{
3
![](http://www.cnblogs.com/Images/OutliningIndicators/InBlock.gif)
int x = i;//X为初值
4
![](http://www.cnblogs.com/Images/OutliningIndicators/InBlock.gif)
int y = 0;
5
![](http://www.cnblogs.com/Images/OutliningIndicators/InBlock.gif)
for (int j = 1; j <= x - 1; j++)//计算X的真因子
6
![](http://www.cnblogs.com/Images/OutliningIndicators/ExpandedSubBlockStart.gif)
![](http://www.cnblogs.com/Images/OutliningIndicators/ContractedSubBlock.gif)
![](http://www.cnblogs.com/Images/dot.gif)
{
7
![](http://www.cnblogs.com/Images/OutliningIndicators/InBlock.gif)
if ((x % j) == 0)
8
![](http://www.cnblogs.com/Images/OutliningIndicators/ExpandedSubBlockStart.gif)
![](http://www.cnblogs.com/Images/OutliningIndicators/ContractedSubBlock.gif)
![](http://www.cnblogs.com/Images/dot.gif)
{ y += j; }
9
![](http://www.cnblogs.com/Images/OutliningIndicators/ExpandedSubBlockEnd.gif)
}//Y=X的真因子之合
10
![](http://www.cnblogs.com/Images/OutliningIndicators/InBlock.gif)
if (y == x)//完美数
11
![](http://www.cnblogs.com/Images/OutliningIndicators/ExpandedSubBlockStart.gif)
![](http://www.cnblogs.com/Images/OutliningIndicators/ContractedSubBlock.gif)
![](http://www.cnblogs.com/Images/dot.gif)
{ continue; }
12
![](http://www.cnblogs.com/Images/OutliningIndicators/InBlock.gif)
x = 0;
13
![](http://www.cnblogs.com/Images/OutliningIndicators/InBlock.gif)
for (int j = 1; j <= y - 1; j++)//计算Y的真因子
14
![](http://www.cnblogs.com/Images/OutliningIndicators/ExpandedSubBlockStart.gif)
![](http://www.cnblogs.com/Images/OutliningIndicators/ContractedSubBlock.gif)
![](http://www.cnblogs.com/Images/dot.gif)
{
15
![](http://www.cnblogs.com/Images/OutliningIndicators/InBlock.gif)
if ((y % j) == 0)
16
![](http://www.cnblogs.com/Images/OutliningIndicators/ExpandedSubBlockStart.gif)
![](http://www.cnblogs.com/Images/OutliningIndicators/ContractedSubBlock.gif)
![](http://www.cnblogs.com/Images/dot.gif)
{ x += j; }
17
![](http://www.cnblogs.com/Images/OutliningIndicators/ExpandedSubBlockEnd.gif)
}//X=Y的真因子之合
18
![](http://www.cnblogs.com/Images/OutliningIndicators/InBlock.gif)
if (x == i)
19
![](http://www.cnblogs.com/Images/OutliningIndicators/ExpandedSubBlockStart.gif)
![](http://www.cnblogs.com/Images/OutliningIndicators/ContractedSubBlock.gif)
![](http://www.cnblogs.com/Images/dot.gif)
{
20
![](http://www.cnblogs.com/Images/OutliningIndicators/InBlock.gif)
System.Console.WriteLine("{0}--{1}", x, y);
21
![](http://www.cnblogs.com/Images/OutliningIndicators/ExpandedSubBlockEnd.gif)
}
22
![](http://www.cnblogs.com/Images/OutliningIndicators/ExpandedBlockEnd.gif)
}
一个三位数,每位的立方之和为其数本身
1
![](http://www.cnblogs.com/Images/OutliningIndicators/None.gif)
for (int i = 100; i <= 999; i++)
2
![](http://www.cnblogs.com/Images/OutliningIndicators/ExpandedBlockStart.gif)
![](http://www.cnblogs.com/Images/OutliningIndicators/ContractedBlock.gif)
![](http://www.cnblogs.com/Images/dot.gif)
{
3
![](http://www.cnblogs.com/Images/OutliningIndicators/InBlock.gif)
4
![](http://www.cnblogs.com/Images/OutliningIndicators/InBlock.gif)
if (Math.Pow(i / 100, 3) +
5
![](http://www.cnblogs.com/Images/OutliningIndicators/InBlock.gif)
Math.Pow((i / 10) - (i / 100) * 10, 3) +
6
![](http://www.cnblogs.com/Images/OutliningIndicators/InBlock.gif)
Math.Pow(i - i / 10 * 10, 3) == i)
7
![](http://www.cnblogs.com/Images/OutliningIndicators/ExpandedSubBlockStart.gif)
![](http://www.cnblogs.com/Images/OutliningIndicators/ContractedSubBlock.gif)
![](http://www.cnblogs.com/Images/dot.gif)
{
8
![](http://www.cnblogs.com/Images/OutliningIndicators/InBlock.gif)
System.Console.WriteLine(
9
![](http://www.cnblogs.com/Images/OutliningIndicators/InBlock.gif)
"{0}:[{1}|{2}|{3}]", i, i / 100, (i / 10) - (i / 100) * 10, i - i / 10 * 10);
10
![](http://www.cnblogs.com/Images/OutliningIndicators/ExpandedSubBlockEnd.gif)
}
11
![](http://www.cnblogs.com/Images/OutliningIndicators/ExpandedBlockEnd.gif)
}
输出10000以内的完全数
又称完美数,它是指真因子之和等于自身的自然数
1
![](http://www.cnblogs.com/Images/OutliningIndicators/None.gif)
for (int i = 1; i <= 10000; i++)
2
![](http://www.cnblogs.com/Images/OutliningIndicators/ExpandedBlockStart.gif)
![](http://www.cnblogs.com/Images/OutliningIndicators/ContractedBlock.gif)
![](http://www.cnblogs.com/Images/dot.gif)
{
3
![](http://www.cnblogs.com/Images/OutliningIndicators/InBlock.gif)
int k = 0;
4
![](http://www.cnblogs.com/Images/OutliningIndicators/InBlock.gif)
for (int j = 1; j <= i - 1; j++)
5
![](http://www.cnblogs.com/Images/OutliningIndicators/ExpandedSubBlockStart.gif)
![](http://www.cnblogs.com/Images/OutliningIndicators/ContractedSubBlock.gif)
![](http://www.cnblogs.com/Images/dot.gif)
{
6
![](http://www.cnblogs.com/Images/OutliningIndicators/InBlock.gif)
if ((i % j) == 0)
7
![](http://www.cnblogs.com/Images/OutliningIndicators/ExpandedSubBlockStart.gif)
![](http://www.cnblogs.com/Images/OutliningIndicators/ContractedSubBlock.gif)
![](http://www.cnblogs.com/Images/dot.gif)
{
8
![](http://www.cnblogs.com/Images/OutliningIndicators/InBlock.gif)
k += j;
9
![](http://www.cnblogs.com/Images/OutliningIndicators/ExpandedSubBlockEnd.gif)
}
10
![](http://www.cnblogs.com/Images/OutliningIndicators/ExpandedSubBlockEnd.gif)
}
11
![](http://www.cnblogs.com/Images/OutliningIndicators/InBlock.gif)
if (k == i)
12
![](http://www.cnblogs.com/Images/OutliningIndicators/ExpandedSubBlockStart.gif)
![](http://www.cnblogs.com/Images/OutliningIndicators/ContractedSubBlock.gif)
![](http://www.cnblogs.com/Images/dot.gif)
{
13
![](http://www.cnblogs.com/Images/OutliningIndicators/InBlock.gif)
System.Console.WriteLine(i);
14
![](http://www.cnblogs.com/Images/OutliningIndicators/ExpandedSubBlockEnd.gif)
}
15
![](http://www.cnblogs.com/Images/OutliningIndicators/ExpandedBlockEnd.gif)
}
输出10000以内的相亲数
两个正整数,X的真因子之和等于Y的真因子之和
1
![](http://www.cnblogs.com/Images/OutliningIndicators/None.gif)
for (int i = 1; i <= 10000; i++)
2
![](http://www.cnblogs.com/Images/OutliningIndicators/ExpandedBlockStart.gif)
![](http://www.cnblogs.com/Images/OutliningIndicators/ContractedBlock.gif)
![](http://www.cnblogs.com/Images/dot.gif)
{
3
![](http://www.cnblogs.com/Images/OutliningIndicators/InBlock.gif)
int x = i;//X为初值
4
![](http://www.cnblogs.com/Images/OutliningIndicators/InBlock.gif)
int y = 0;
5
![](http://www.cnblogs.com/Images/OutliningIndicators/InBlock.gif)
for (int j = 1; j <= x - 1; j++)//计算X的真因子
6
![](http://www.cnblogs.com/Images/OutliningIndicators/ExpandedSubBlockStart.gif)
![](http://www.cnblogs.com/Images/OutliningIndicators/ContractedSubBlock.gif)
![](http://www.cnblogs.com/Images/dot.gif)
{
7
![](http://www.cnblogs.com/Images/OutliningIndicators/InBlock.gif)
if ((x % j) == 0)
8
![](http://www.cnblogs.com/Images/OutliningIndicators/ExpandedSubBlockStart.gif)
![](http://www.cnblogs.com/Images/OutliningIndicators/ContractedSubBlock.gif)
![](http://www.cnblogs.com/Images/dot.gif)
{ y += j; }
9
![](http://www.cnblogs.com/Images/OutliningIndicators/ExpandedSubBlockEnd.gif)
}//Y=X的真因子之合
10
![](http://www.cnblogs.com/Images/OutliningIndicators/InBlock.gif)
if (y == x)//完美数
11
![](http://www.cnblogs.com/Images/OutliningIndicators/ExpandedSubBlockStart.gif)
![](http://www.cnblogs.com/Images/OutliningIndicators/ContractedSubBlock.gif)
![](http://www.cnblogs.com/Images/dot.gif)
{ continue; }
12
![](http://www.cnblogs.com/Images/OutliningIndicators/InBlock.gif)
x = 0;
13
![](http://www.cnblogs.com/Images/OutliningIndicators/InBlock.gif)
for (int j = 1; j <= y - 1; j++)//计算Y的真因子
14
![](http://www.cnblogs.com/Images/OutliningIndicators/ExpandedSubBlockStart.gif)
![](http://www.cnblogs.com/Images/OutliningIndicators/ContractedSubBlock.gif)
![](http://www.cnblogs.com/Images/dot.gif)
{
15
![](http://www.cnblogs.com/Images/OutliningIndicators/InBlock.gif)
if ((y % j) == 0)
16
![](http://www.cnblogs.com/Images/OutliningIndicators/ExpandedSubBlockStart.gif)
![](http://www.cnblogs.com/Images/OutliningIndicators/ContractedSubBlock.gif)
![](http://www.cnblogs.com/Images/dot.gif)
{ x += j; }
17
![](http://www.cnblogs.com/Images/OutliningIndicators/ExpandedSubBlockEnd.gif)
}//X=Y的真因子之合
18
![](http://www.cnblogs.com/Images/OutliningIndicators/InBlock.gif)
if (x == i)
19
![](http://www.cnblogs.com/Images/OutliningIndicators/ExpandedSubBlockStart.gif)
![](http://www.cnblogs.com/Images/OutliningIndicators/ContractedSubBlock.gif)
![](http://www.cnblogs.com/Images/dot.gif)
{
20
![](http://www.cnblogs.com/Images/OutliningIndicators/InBlock.gif)
System.Console.WriteLine("{0}--{1}", x, y);
21
![](http://www.cnblogs.com/Images/OutliningIndicators/ExpandedSubBlockEnd.gif)
}
22
![](http://www.cnblogs.com/Images/OutliningIndicators/ExpandedBlockEnd.gif)
}
相关文章推荐
- 算法练习:水仙花数、完全数、相亲数
- 算法练习:水仙花数、完全数、相亲数
- 算法练习:水仙花数、完全数、相亲数
- 学习笔记---几个小算法练习:1!-n!求和,Fibonacci数列,完全数,水仙花数,回文数
- 相亲数&amp;完全数最简单算法
- 蛙蛙推荐:[算法练习]最长不完全匹配子串频率计算
- 算法练习-求21位数的水仙花数
- 蛙蛙推荐:[算法练习]最长不完全匹配子串频率计算
- 小白算法练习 简单背包专题003 完全背包 hdu lanqiao 包子凑数 dp
- 算法练习——完全数
- 算法练习-相亲数
- 相亲数&完全数最简单算法
- 算法练习-水仙花数
- 算法练习六 B树上 B树的创建,添加
- 常见算法练习
- 2018年全国多校算法寒假训练营练习比赛(第五场)B Big Water Problem
- C/C++编程小练习 计算10亿之内的素数和(合数筛选算法实现)
- 算法:输出100到1000之内的水仙花数
- 2018年全国多校算法寒假训练营练习比赛(第五场)D集合问题详解
- 【算法练习】还是求二进制数中1的个数