Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 10504 | Accepted: 4971 |
Description
Input
Output
Sample Input
01 10 0010 0000 9 01 10 010 0000 9
Sample Output
Set 1 is immediately decodable Set 2 is not immediately decodable
Source
字符串匹配的简单题,和UVa 644(http://www.cnblogs.com/lzj-0218/p/3526656.html)完全相同
1 #include<iostream> 2 #include<cstdio> 3 #include<cstring> 4 #include<algorithm> 5 6 using namespace std; 7 8 int main() 9 { 10 int k=0,t=0; 11 char s[10][20]; 12 char input[20]; 13 bool isImm=true; 14 15 while(gets(input)) 16 { 17 if(input[0]==‘9‘) 18 { 19 k++; 20 if(isImm) 21 printf("Set %d is immediately decodable\n",k); 22 else 23 printf("Set %d is not immediately decodable\n",k); 24 isImm=true; 25 t=0; 26 } 27 else if(isImm) 28 { 29 bool diff=true; 30 for(int i=0;diff&&i<t;i++) 31 { 32 int j; 33 int len=min(strlen(s[i]),strlen(input)); 34 for(j=0;j<len;j++) 35 { 36 if(s[i][j]!=input[j]) 37 break; 38 } 39 if(j==len) 40 diff=isImm=false; 41 } 42 if(diff) 43 { 44 strcpy(s[t],input); 45 t++; 46 } 47 } 48 49 50 } 51 52 return 0; 53 }
POJ 1056 IMMEDIATE DECODABILITY
原文:http://www.cnblogs.com/lzj-0218/p/3537109.html