Cod sursa(job #918842)
| Utilizator | Data | 19 martie 2013 10:11:15 | |
|---|---|---|---|
| Problema | Dirichlet | Scor | 8 |
| Compilator | fpc | Status | done |
| Runda | Arhiva de probleme | Marime | 0.58 kb |
var n,i,j:longint;
a,b:array[1..1000000]of int64;
begin
assign(input,'dirichlet.in'); reset(input);
assign(output,'dirichlet.out'); rewrite(output);
read(n);
if n = 1 then
write('1')
else
begin
for i := 1 to n do
a[i] := i;
for i := 2 to n do
begin
for j := 1 to i-1 do
b[j] := 0; //pune 0
for j := i to n do
b[j] := a[j] + b[j-1]; //completeaza linie
for j := 1 to n do a[j] := b[j] ; // transfer linie
end;
write(b[n]);
end;
close(input);
close(output);
end.
