Cod sursa(job #555776)
Utilizator | Data | 15 martie 2011 19:23:53 | |
---|---|---|---|
Problema | Pascal | Scor | 0 |
Compilator | fpc | Status | done |
Runda | Arhiva de probleme | Marime | 0.54 kb |
var n,i,j,db,d,r:longint;
a,b:array [1..5000000] of int64;
f:text;
begin
assign(f,'pascal.in'); reset(f);
readln(f,r,d);
close(f);
a[1]:=1; a[2]:=1; n:=2;
for i:=2 to r do begin
b[1]:=1; b[n+1]:=1;
for j:=2 to n do b[j]:=a[j-1]+a[j];
a:=b;
inc(n);
end;
db:=0;
for i:=2 to n-1 do
if a[i] mod d=0 then inc(db);
assign(f,'pascal.out'); rewrite(f);
write(f,db);
close(f);
end.