Cod sursa(job #891150)

Utilizator tgistvanTorok Istvan tgistvan Data 25 februarie 2013 14:01:48
Problema Cifra Scor 0
Compilator fpc Status done
Runda Arhiva de probleme Marime 1.14 kb
type matrix=array[-1..11,-1..11]of longint;
     sor =array[-1..11]of longint;

var a:matrix;
    b:sor;
    i,j,n,x,o,y:longint;
    f,g:text;

begin
{0-1}
a[0,0]:=0;
a[1,1]:=1;
a[1,0]:=1;
b[0]:=1;
b[1]:=2;

{2}
a[2,1]:=2;
a[2,2]:=4;
a[2,3]:=8;
a[2,0]:=6;
b[2]:=4;
{3}
a[3,1]:=3;
a[3,2]:=9;
a[3,3]:=7;
a[3,0]:=1;
b[3]:=4;
{4}
a[4,1]:=4;
a[4,0]:=6;
b[4]:=2;
{5}
a[5,1]:=5;
a[5,0]:=5;
b[5]:=2;
{6}
a[6,1]:=6;
a[6,0]:=6;
b[6]:=2;
{7}
a[7,1]:=7;
a[7,2]:=9;
a[7,3]:=3;
a[7,0]:=1;
b[7]:=4;

{8}
a[8,1]:=8;
a[8,2]:=4;
a[8,3]:=2;
a[8,0]:=6;
b[8]:=4;
{9}
a[9,1]:=9;
a[9,0]:=1;
b[9]:=2;





assign(f,'cifra.in');reset(f);
assign(g,'cifra.out');rewrite(g);

readln(f,n);

for j:=1 to n do begin
                 readln(f,x);

                 o:=0;
                 if x>0 then begin
                 for i:=1 to x do begin
                 y:=i mod 10;
                 if y<>0 then
                 o:=o+(a[y,i mod b[y]]);
                 o:=o mod 10;
                 end;
                 end;
                 writeln(g,o);
                 end;







close(f);
close(g);

end.