NOIP9提高组解题报告.docVIP

[原创]NOIP2009提高组解题报告{继续供大牛BS} 2009-11-21 10:46 P.M. 第一题：水题，按照题目要求去枚举。注意，同一个字母加密后的字母是一样的，加密后一样的字母原字母也是一样的。 var?? s1,s2,s3:string;?? a,b:array[A..Z]of char;?? i:longint;?? c:char;procedure main;begin???? readln(s1);???? readln(s2);???? readln(s3);???? fillchar(a,sizeof(a), );???? fillchar(b,sizeof(b), );???? for i:=1 to length(s1) do???? if ((a[s1[i]] )and(a[s1[i]]s2[i]))???????? or((b[s2[i]] )and(b[s2[i]]s1[i])) then???????? begin???????????? writeln(Failed);???????????? exit;???????? end???????? else???????? begin????????????? a[s1[i]]:=s2[i];????????????? b[s2[i]]:=s1[i];???????? end;???? for c:=A to Z do???? if a[c]= then???? begin????????? writeln(Failed);????????? exit;???? end;???? for i:=1 to length(s3) do??????? write(a[s3[i]]);???? writeln; end;begin???? assign(input,spy.in);???? reset(input);???? assign(output,spy.out);???? rewrite(output);???? main;???? close(input);???? close(output);end. 第二题： 数论题，分解质因数。通过a0,a1,b0,b1确定X中每项质因子的最大幂数和最小幂数。然后再把每个质因子的幂数范围乘起来。 PS:参考程序过10个点的总耗时为0.23秒,评测环境为2.10GHz 2.00GB const???? maxn=100;???? maxm=46341;type??? data = record??????? n,c : longint;??? end;??? ans = record??????? n,min,max : longint;??? end;??? arr = array[0..maxn]of data;var??? a0,a1,b0,b1???? : longint;??? fa0,fa1,fb0,fb1 : arr;??? xmin,xmax,xn??? : array[0..maxn]of longint;??? bool??????????? : array[1..maxm]of boolean;??? next??????????? : array[1..maxm]of longint; procedure change(??? n : longint;var a:arr);var??? i,k,t : longint;begin??? fillchar(a,sizeof(a),0);??? t:=0;??? i:=2;??? while n1 do??? beginif (itrunc(sqrt(n)))and(t=0) then break;??????? if i=-1 then break;if n mod i=0 thenbegin???? inc(t);???? n:=n div i;endelsebegin???? if t0 then???? begin?????? inc(a[0].n);???????????? with a[a[0].n] do???????????? begin????????????????? n:=i;????????????????? c:=t;???????????? end;???????????? t:=0;???? end;???? i:=next[i];end;??? end;??? if t0 then??? begin????? inc