pascal语言10000以内水仙花数算法流程图

来源:百度知道 编辑:UC知道 时间:2024/05/02 13:05:18
水仙花数就是153=1*1*1+5*5*5+3*3*3

var i,j,k,t:integer;
s:string;
a:array[0..9]of integer;//存储0..9的立方
begin
for i:=0 to 9 do a[i]:=i*i*i;//数组赋值
for i:=1 to 10000 do begin //枚举搜索
str(i,s);//将i转化为字符串
t:=0;
for j:=1 to length(s)do t:=t+a[j];//累加
if t=i then write(i:10);//打印
end;//for循环终止
redlin;
end.

var i,j,s:longint;
a:array[0..9]of longint;
begin
for i:=0 to 9 do a[i]:=i*i*i;
for i:=0 to 10000 do begin
str(i,st);
for j:=length(st) downto 1 do s:=s+a[ord(st[j])];
if s=i then writeln(i);
end;
end.

program xxx(input,output);
var
a,b,c:integer;
begin
for a:=1 to 9 do
for b:=1 to 9 do
for c:=1 to 9 do
if (a*a*a+b*b*b+c*c*c=a*100+b*10+c) then writeln(a,b,c);
end.