UVA 644
2015-07-26 20:46
267 查看
题目的意思就是要比较两个字符串,然后判断短的字符串是否是长字符串的开口,分别输出不同的文字 中带那是读取之后要判断一次,两个字符串的长度哪一个更长 # include <stdio.h> # include <string.h> # include <stdlib.h> char one[9][11], c, *p, temp[11]; int i, j , k, l, pan = 0, n = 0; int cmp(char s1[], char s2[]) { int min, i; min = strlen(s1) > strlen(s2) ? strlen(s2) : strlen(s1); for (i = 0; i < min; i++) { if (s1[i] != s2[i]) return 1; } return 0; } int main(void) { for (i = 0; scanf("%s", one[i]) != EOF; i++) { if(one[i][0] == '9') { k = i; n++; for(l = 0; l< k-1; l++) { for(j = l + 1; j < k; j++) { if (cmp(one[l], one[j]) == 0) { pan = 1; break; } } if(pan) break; } if(pan) printf("Set %d is not immediately decodable\n", n); else printf("Set %d is immediately decodable\n", n); i = -1; pan = 0; } } return 0; }
相关文章推荐
- 1.10055 - Hashmat the brave warrior
- 2.10071 - Back to High School Physics
- 3.458 - The Decoder
- 4.694 - The Collatz Sequence
- 6.494 - Kindergarten Counting Game
- 7.490 - Rotating Sentences
- 8.414 - Machined Surfaces
- 9.488 - Triangle Wave
- A.457 - Linear Cellular Automata
- B.489 - Hangman Judge
- C.445 - Marvelous Mazes
- 1.10494 - If We Were a Child Again
- 2.424 - Integer Inquiry
- 3.10250 - The Other Two Trees
- 5.465 - Overflow
- 6.113 - Power of Cryptography
- 7.10161 - Ant on a Chessboard
- 8.621 - Secret Research
- 9.401 - Palindromes
- A.537 - Artificial Intelligence?