goolge 中国2014面试

Problem

Do you know how to read the phone numbers in English? Now let me tell you.

For example, In China, the phone numbers are 11 digits, like: 15012233444. Someone divides the numbers into 3-4-4 format, i.e. 150 1223 3444. While someone divides the numbers into 3-3-5 format, i.e. 150 122 33444. Different formats lead to different ways to read these numbers:

150 1223 3444 reads one five zero one double two three three triple four.

150 122 33444 reads one five zero one double two double three triple four.

Here comes the problem:

Given a list of phone numbers and the dividing formats, output the right ways to read these numbers.

Rules:

Single numbers just read them separately.

2 successive numbers use double.

3 successive numbers use triple.

4 successive numbers use quadruple.

5 successive numbers use quintuple.

6 successive numbers use sextuple.

7 successive numbers use septuple.

8 successive numbers use octuple.

9 successive numbers use nonuple.

10 successive numbers use decuple.

More than 10 successive numbers read them all separately.

Input

The first line of the input gives the number of test cases, T. T lines|test cases follow. Each line contains a phone number N and the dividing format F, one or more positive integers separated by dashes (-), without leading zeros and whose sum always equals the number of digits in the phone number.

Output

For each test case, output one line containing "Case #x: y", where x is the case number (starting from 1) and y is the reading sentence in English whose words are separated by a space.

Limits

1 ≤ T ≤ 100.

Small dataset

1 ≤ length of N ≤ 10.

Large dataset

1 ≤ length of N ≤ 100.

Sample

Input 
  

3
15012233444 3-4-4
15012233444 3-3-5
12223 2-3

---

Output 
 

Case #1: one five zero one double two three three triple four
Case #2: one five zero one double two double three triple four
Case #3: one two double two three

 

类型：其他 难度：1.5

题意：给出一个纯数字串和它的分割方式，按照分割方式求这串数字的读法，连续2个到10个分别读作"double","triple","quadruple","quintuple","sextuple","septuple","octuple","nonuple","decuple"，连续11个及以上分开读

分析：主要考察基础字符串处理，先从类似"3-4-5-6”字符串中提取数字，然后按照分割方式遍历数字串，记录一个数重复的次数，依次生成结果即可。感觉google笔试都比较基础，但是十分注重细节，思维的严谨，逻辑的严密很重要。

 

代码：

[cpp] view plain copy print ?

1. #include<cstdio>   
2. #include<cstring>   
3. #include<cstdlib>   
4. #include<cmath>   
5. #include<cstring>   
6. #include<string>   
7. #include<iostream>   
8. #define MIN(x,y) (x)<(y)?(x):(y)   
9. using namespace std;  
10.   
11. const int N=110;  
12. string single[10] = {"zero","one","two","three","four","five","six","seven","eight","nine"};  
13. string many[11] = {"","","double","triple","quadruple","quintuple","sextuple","septuple","octuple","nonuple","decuple"};  
14.   
15. int main()  
16. {  
17.     freopen("A-large.in","r",stdin);  
18.     freopen("A-large.out","w",stdout);  
19.       
20.     int t;  
21.     scanf("%d",&t);  
22.     for(int cnt=1;cnt<=t;cnt++)  
23.     {  
24.         char num[N];  
25.         char format_s[3*N];  
26.         int format[N];  
27.         string ans = "";  
28.           
29.         scanf("%s%s",num,format_s);  
30.           
31.         memset(format,0,sizeof(format));  
32.           
33.         char *tmp = strtok(format_s,"-");  
34.         int i,j,k;  
35.         for(i=0; tmp; i++)  
36.         {  
37.             format[i] = atoi(tmp);  
38.             //cout<<format[i]<<endl;   
39.             tmp = strtok(NULL,"-");  
40.         }  
41.           
42.         int n = i;  
43.         int sum = 0;  
44.         for(i=0; i<n; i++)  
45.         {  
46.             char now = 0;  
47.             int ct = 0;  
48.               
49.             for(j=0; j<format[i]; j++)  
50.             {  
51.                 if(now==0 || num[sum+j-1] != num[sum+j])  
52.                 {  
53.                     if(now>0)  
54.                     {  
55.                         if(ct>1 && ct<11)  
56.                         {  
57.                             ans += many[ct];  
58.                             ans += " ";  
59.                             ans += single[now-'0'];  
60.                             ans += " ";  
61.                         }  
62.                         else  
63.                         {  
64.                             for(k=0; k<ct; k++)  
65.                             {  
66.                                 ans += single[now-'0'];  
67.                                 ans += " ";  
68.                             }  
69.                         }  
70.                     }  
71.                     now = num[sum+j];  
72.                     ct = 1;  
73.                 }  
74.                 else  
75.                 {  
76.                     ct++;  
77.                 }  
78.             }  
79.             if(now>0)  
80.             {  
81.                 if(ct>1 && ct<11)  
82.                 {  
83.                     ans += many[ct];  
84.                     ans += " ";  
85.                     ans += single[now-'0'];  
86.                     ans += " ";  
87.                 }  
88.                 else  
89.                 {  
90.                     for(k=0; k<ct; k++)  
91.                     {  
92.                         ans += single[now-'0'];  
93.                         ans += " ";  
94.                     }  
95.                 }  
96.             }  
97.               
98.             sum += format[i];  
99.         }  
100.         if(ans[ans.length()-1] == ' ')  
101.         {  
102.             ans = ans.substr(0,ans.length()-1);  
103.         }  
104.           
105.         printf("Case #%d: %s\n",cnt,ans.c_str());  
106.     }