思路:模拟
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <stack>
#include <cmath>
#include <vector>
#include <queue>
#include <map>
#include <set>
using namespace std;
#define LL long long
#define M 102
#define DEBUG puts("It's here!")
#define INF 1<<29
#define CLS(x,v) memset(x,v,sizeof(x))
#define FOR(i,a,n) for(int i=(a);i<=(n);++i)
#define filer freopen("C:\\Users\\sq\\Desktop\\data.in","r",stdin);
#define filew freopen("C:\\Users\\sq\\Desktop\\data.out","w",stdout);
char base[10][9]={"zero","one","two","three","four","five","six","seven","eight","nine"};
char num[12][15]={"","","double","triple","quadruple","quintuple","sextuple","septuple","octuple","nonuple","decuple"};
char s[M],t[M];
vector <int> v;
void deal(char *s)
{
v.clear();
int ret,sum=0;
int len =strlen(s);
for(int i=0;i<len;i++)
{
ret=0;
while(s[i]<'0'||s[i]>'9')i++;
while(s[i]>='0'&&s[i]<='9')
{
ret=ret*10+(s[i]-'0');
i++;
}
sum+=ret;
v.push_back(sum);
}
}
void solve()
{
int j=0,cnt,len=v.size();
for(int i=1;s[i-1];i++)
{
cnt=1;
while(s[i]==s[i-1]&&j<len&&i<v[j])
{
i++;cnt++;
}
if(i==v[j])j++;
if(cnt==1)printf(" %s",base[s[i-1]-'0']);
else if(cnt>10)
{
while(cnt--)printf(" %s",base[s[i-1]-'0']);
}
else printf(" %s %s",num[cnt],base[s[i-1]-'0']);
}
}
int main()
{
int T;
scanf("%d",&T);
for(int k=1;k<=T;k++)
{
scanf("%s%s",s,t);
printf("Case #%d:",k);
deal(t);
solve();
puts("");
}
return 0;
}