用循环××××××××××××××××××program pf(input,output);{program by cnpascal.cn}uses crt;var r:char;procedure pfjs ;var a,c,b:longint;beginrepeatwrite ('Input a number(N>=0):');readln (a);until a>=0;if a=0 then writeln ('0^2=0') else beginc:=0;b:=1;repeat c:=c+b; b:=b+2; until (c=a) or (exp(ln((b-1)/2)*2)>a); if c=a then writeln ((b-1)/2:3:0,'^2=',a) else writeln ('NO!');
end;{if} end;{procedure pfjs}beginclrscr;repeatpfjs;writeln (Again?(Y/N)');r:=readkey;writeln (r);until (r='n') or (r='N');end.×××××××××××××××××××××××以上PASCAL源程序使用了 公式 1+3+5+7+…+(2n-1)=n^2参考资料：http://bbs.cnpascal.cn
已赞过已踩过>m; for (long i=1,temp=0; iend)
return 0;
if ( ((begin-end) * (begin-end)) / 4== a )
return 1;
if(((begin-end) * (begin-end)) / 4> a)
return BinarySearchSqrt( a , begin , (begin-end)/2 - 1);
else
return BinarySearchSqrt( a , (begin-end)/2 + 1, end );}
|
