思路:
如题
#include <iostream>
#include <cstdio>
#include <string.h>
#include <queue>
#include <cmath>
#include <algorithm>
#include <map>
typedef long long int lli;
using namespace std;
int a[7] = {0,0,0,1,8,35,32};
int main(){
int t;
cin>>t;
int n;
int ncase = 0;
int ans = 0;
while(t--){
ncase++;
scanf("%d",&n);
if(n <= 6)
printf("Case #%d: %d\n",ncase,a[n]);
else
printf("Case #%d: %d\n",ncase,n*5);
}
}