ac1005.pas

同济大学 Online在线题库 AC源代码合集 程序设计竞赛必看资料

program tju1005;
const
  maxn=50;
var
  a:array[-1..maxn]of longint;
  i:byte;
begin
  a[1]:=1;
  for i:=2 to maxn do
    a[i]:=a[i-1]+a[i-3];
  repeat
    read(i);
    writeln(a[i]);
  until seekeof;
end.