前面的题目废话好多啊 ヾ(❀●◡●)ノ滴~儿童卡
每次的羊数都满足关系: an = 2 * (a(n-1) - 1)
#include<stdio.h>
int main()
{
int score[31];
int m , n;
score[1] = 4;
for(int i=2; i<31; i++)
score[i] = (score[i-1] - 1) * 2;
scanf("%d" , &n);
for(int i=0; i<n; i++)
{
scanf("%d" , &m);
printf("%d\n" , score[m]);
}
return 0;
}