PKU1165 The Primes

         首先，我不得不说PKU上的数据太弱了。我的程序好像在排序答案的地方没做处理，且运行时的常数显然可以再减小一部分，代码是不完美版的。但不管怎么说，这题的大体思路我想是对的。

         这是很有想头的一道题。自己安排好搜索顺序，另外还有一堆剪枝。总之，这道题目充满了灵活性和趣味性！

program the_primes; var p:array[0..100000] of boolean; pp:array[0..10,0..10,0..10,0..10,0..10] of boolean; seat:array[0..100000] of longint; list:array[0..20000] of longint; data:array[1..5,1..5] of longint; i,j,na,nb,nc,nd,ne,tot,ss:longint; firstwrite:boolean; function checksum(i:longint):boolean; var na,nb,nc,nd,ne:longint; begin na:=i div 10000; nb:=i div 1000 mod 10; nc:=i div 100 mod 10; nd:=i div 10 mod 10; ne:=i mod 10; if na+nb+nc+nd+ne=ss then exit(true) else exit(false); end; procedure dfs(dep:longint); var p,i,k,ii,kk,nb,nc,nd,ne:longint; begin case dep of 1: begin p:=seat[data[1,1]]; while list[p] div 10000=data[1,1] do begin i:=list[p]; nb:=i div 1000 mod 10; nc:=i div 100 mod 10; nd:=i div 10 mod 10; ne:=i mod 10; if pp[nb,10,10,10,10] and pp[nc,10,10,10,10]and pp[nd,10,10,10,10] and pp[ne,10,10,10,10] then begin data[1,2]:=nb; data[1,3]:=nc; data[1,4]:=nd; data[1,5]:=ne; dfs(2); end; inc(p); end; end; 2: begin p:=seat[data[1,1]]; while list[p] div 10000=data[1,1] do begin i:=list[p]; nb:=i div 1000 mod 10; nc:=i div 100 mod 10; nd:=i div 10 mod 10; ne:=i mod 10; if pp[ne,10,10,10,data[1,5]] and pp[nb,10,10,10,10] and pp[nc,10,10,10,10] and pp[nd,10,10,10,10] and pp[ne,10,10,10,10] then begin data[2,1]:=nb; data[3,1]:=nc; data[4,1]:=nd; data[5,1]:=ne; dfs(3); end; inc(p); end; end; 3: begin p:=seat[data[2,1]]; while list[p] div 10000=data[2,1] do begin i:=list[p]; nb:=i div 1000 mod 10; nc:=i div 100 mod 10; nd:=i div 10 mod 10; ne:=i mod 10; if pp[data[5,1],10,10,nd,data[1,5]] and pp[data[1,1],nb,10,10,10] and pp[data[1,2],nb,10,10,10] and pp[data[1,3],nc,10,10,10] and pp[data[1,4],nd,10,10,10] and pp[data[1,5],ne,10,10,10] then begin data[2,2]:=nb; data[2,3]:=nc; data[2,4]:=nd; data[2,5]:=ne; dfs(4); end; inc(p); end; end; 4: begin k:=data[1,2]*10+data[2,2]; p:=seat[k]; while list[p] div 1000=k do begin i:=list[p]; nc:=i div 100 mod 10; nd:=i div 10 mod 10; ne:=i mod 10; if pp[data[5,1],nd,10,data[2,4],data[1,5]] and pp[data[3,1],nc,10,10,10] and pp[data[4,1],nd,10,10,10] and pp[data[5,1],ne,10,10,10] then begin data[3,2]:=nc; data[4,2]:=nd; data[5,2]:=ne; dfs(5); end; inc(p); end; end; 5: begin k:=data[3,1]*10+data[3,2]; p:=seat[k]; while list[p] div 1000=k do begin i:=list[p]; nc:=i div 100 mod 10; nd:=i div 10 mod 10; ne:=i mod 10; if pp[data[5,1],data[4,2],nc,data[2,4],data[1,5]] and pp[data[1,1],data[2,2],nc,10,10] and pp[data[1,3],data[2,3],nc,10,10] and pp[data[1,4],data[2,4],nd,10,10] and pp[data[1,5],data[2,5],ne,10,10] then begin data[3,3]:=nc; data[3,4]:=nd; data[3,5]:=ne; dfs(6); end; inc(p); end; end; 6: begin k:=data[1,3]*100+data[2,3]*10+data[3,3]; p:=seat[k]; while list[p] div 100=k do begin i:=list[p]; nd:=i div 10 mod 10; ne:=i mod 10; if pp[data[4,1],data[4,2],nd,10,10] and pp[data[5,1],data[5,2],ne,10,10] then begin data[4,3]:=nd; data[5,3]:=ne; dfs(7); end; inc(p); end; end; 7: begin k:=data[4,1]*100+data[4,2]*10+data[4,3]; p:=seat[k]; while list[p] div 100=k do begin i:=list[p]; nd:=i div 10 mod 10; ne:=i mod 10; if pp[data[1,1],data[2,2],data[3,3],nd,10] and pp[data[1,4],data[2,4],data[3,4],nd,10] and pp[data[1,5],data[2,5],data[3,5],ne,10] then begin data[4,4]:=nd; data[4,5]:=ne; dfs(8); end; inc(p); end; end; 8: begin k:=data[5,1]*100+data[5,2]*10+data[5,3]; p:=seat[k]; while list[p] div 100=k do begin i:=list[p]; nd:=i div 10 mod 10; ne:=i mod 10; if pp[data[1,1],data[2,2],data[3,3],data[4,4],ne] and pp[data[1,4],data[2,4],data[3,4],data[4,4],nd] and pp[data[1,5],data[2,5],data[3,5],data[4,5],ne] then begin data[5,4]:=nd; data[5,5]:=ne; if firstwrite then writeln else firstwrite:=true; for ii:=1 to 5 do begin for kk:=1 to 5 do write(data[ii,kk]); writeln; end; end; inc(p); end; end; end; end; begin assign(input,'a.in'); reset(input); assign(output,'a.out'); rewrite(output); readln(ss); readln(data[1,1]); firstwrite:=false; fillchar(p,sizeof(p),1); fillchar(pp,sizeof(pp),0); p[1]:=false; for i:=2 to 316 do if p[i] then begin j:=i*i; while j<=99999 do begin p[j]:=false; inc(j,i); end; end; tot:=0; fillchar(seat,sizeof(seat),$FF); for i:=10000 to 99999 do if p[i] and checksum(i) then begin inc(tot); list[tot]:=i; na:=i div 10000; nb:=i div 1000; nc:=i div 100; nd:=i div 10; if seat[na]=-1 then seat[na]:=tot; if seat[nb]=-1 then seat[nb]:=tot; if seat[nc]=-1 then seat[nc]:=tot; if seat[nd]=-1 then seat[nd]:=tot; seat[i]:=tot; na:=i div 10000; nb:=i div 1000 mod 10; nc:=i div 100 mod 10; nd:=i div 10 mod 10; ne:=i mod 10; pp[na,nb,nc,nd,ne]:=true; pp[na,nb,nc,nd,10]:=true; pp[na,nb,nc,10,10]:=true; pp[na,nb,10,10,10]:=true; pp[na,10,10,10,10]:=true; pp[na,10,10,10,ne]:=true; pp[na,10,10,nd,ne]:=true; pp[na,nb,10,nd,ne]:=true; end; dfs(1); close(input); close(output); end.