C++14(g++5.4) 解法, 执行用时: 2ms, 内存消耗: 352K, 提交时间: 2020-08-26 20:57:15

#include<cstdio>

long long f[105];
int main()
{
	int n,m;
	f[1]=1;f[2]=2;f[3]=4;
	for(int i=4;i<=70;i++) f[i]=f[i-1]+f[i-2]+f[i-3];
	scanf("%d",&n);
	while(n--)
	{
		scanf("%d",&m);
		printf("%lld\n",f[m]);
	}
}

Python(2.7.3) 解法, 执行用时: 16ms, 内存消耗: 2904K, 提交时间: 2020-06-20 13:03:35

a = [1 , 1 , 2]


def main():
    n = int(raw_input())
    print a[n]
        
for i in range(3 , 71):
    a.append(a[i - 1] + a[i - 2] + a[i - 3])
t = int(raw_input())
for i in xrange(t):
    main()

pypy3(pypy3.6.1) 解法, 执行用时: 55ms, 内存消耗: 27408K, 提交时间: 2020-06-20 13:11:39

M = 1000
dp = [0] * M
dp[0] = 1
for i in range(1, M):
    for j in range(1, 4):
        if i - j >= 0:
            dp[i] += dp[i - j]
t = int(input())
for _ in range(t):
    print(dp[int(input())])

Python3(3.5.2) 解法, 执行用时: 19ms, 内存消耗: 3352K, 提交时间: 2020-07-23 16:45:50

a=int(input())
for x in range(a):
    b=int(input())
    c,d,e= 1,1,2
    for y in range(b):
        c,d,e=d,e,c+d+e
    print(c)