亲密数对(pascal)

varn,i,j:longint;functionyinzihe(n:longint):longint;vars,i,j:longint;begins:=0;j:=trunc(sqrt(n));for

#include#include#include#defineMAX_NUMBER500/*本程序默认求500以内的亲密数可以输入参数,求亲密数的范围：假定程序名为qinmi.exeqinmi.exe

vari,a,b:longint;beginfori:=1000to9999dobegina:=idiv100;b:=imod100;ifsqr(a+b)=ithenwriteln(i);end;en

这是结果：361529784361784529529361784529784361784361529784529361下面是代码varu:array[1..9]ofboolean;a:array[1.

若:a的所有因子（包括1但不包括自身）之和等于b,而b的所有因子之和也等于a则:a和b是一个亲密数对-----------------------因子就是约数

vari,j,m,p:longint;t:array[1..9]oflongint;n:array[1..9]ofstring;s:string;beginm:=0;readln(s);fori:=1

类型：搜索本题动态规划无从下手,也无数学公式可寻,看来只能搜索（组合的生成算法）,其实1

vari,n:longint;functionys(x:longint):longint;vari:longint;beginys:=0;fori:=1toxdiv2doifxmodi=0thenys

//电脑速度慢的话,请将5000改为1000.#includevoidmain(){intgetsum(intn);intx,y;for(x=6;x

#includevoidmain(){intk,j,m,n;for(n=2;n

varm,i,max,j,t:longint;a:Array[0..10000]oflongint;f:array[1..10000]oflongint;beginreadln(m);fori:=1t

varn,a,b,i,i1,i2:integer;beginreadln(a,b);fori:=atobdobegini2:=1;fori1:=2totrunc(sqrt(i))doifimodi1=

vari:longint;beginfori:=1to500dobeginif(imod3=2)and(imod5=3)and(imod7=2)thenwriteln(i);end;end.

前面应该加上varifc[n,i]=c[s,i]不对正确：if(c[n,i]=c[s,i]){用and时应该加上括号}；马鞍数：5678945678345212349012548试过好使1,1是马鞍数

varn,i,j:integer;s:string;beginreadln(n);forn:=1tondobeginstr(n,s);i:=1;j:=length(s);while(i=jthenwr

vari,k:integer;functionf(n:integer):boolean;varx,y:integer;beginf:=false;forx:=1tondiv2doifnmodx=0th

var  a:array[1..9,1..9] of longint;  f:array[0..20,0..11,0..11] o

不得不问一句：LZ到底想干嘛?这样编程,岂止是很费时间?太麻烦了!先说一下你的问题：     你的代码的问题,首先在于很麻烦,看起来不容易找出错误,只

typenum=array[1..10000]ofinteger;vara:string;b:num;i,j,k,n:longint;ci:integer;procedureinit;beginrea

varv,u,x,y:array[0..9]oflongint;a:array[0..9,0..9]oflongint;b:array[1..1000]oflongint;sum:array[1..1