1077 Kuchiguse （20 分）

1077 Kuchiguse （20 分）

The Japanese language is notorious（臭名昭著） for its sentence ending particles. Personal preference of such particles can be considered as a reflection of the speaker's personality. Such a preference is called "Kuchiguse" and is often exaggerated（夸张的） artistically in Anime and Manga. For example, the artificial sentence ending particle "nyan~" is often used as a stereotype（模式化观念） for characters with a cat-like personality:

Itai nyan~ (It hurts, nyan~)Ninjin wa iyada nyan~ (I hate carrots, nyan~)

Now given a few lines spoken by the same character, can you find her Kuchiguse?

Input Specification:

Each input file contains one test case. For each case, the first line is an integer N (2≤N≤100). Following are N file lines of 0~256 (inclusive) characters in length, each representing a character's spoken line. The spoken lines are case sensitive.

Output Specification:

For each test case, print in one line the kuchiguse of the character, i.e., the longest common suffix of all N lines. If there is no such suffix（后缀）, write ​​nai​​.

Sample Input 1:

3Itai nyan~Ninjin wa iyadanyan~uhhh nyan~

Sample Output 1:

nyan~

Sample Input 2:

3Itai!Ninjinnwaiyada T_TT_T

Sample Output 2:

nai

参考代码：

//Kuchiguse#include#includechar str[100][260];int minlen = 256;int num = 0;int main(int argc, char const *argv[]){ int N; scanf("%d", &N); getchar(); for (int i = 0; i < N; ++i) { fgets(str[i], 261, stdin); int len = strlen(str[i]) - 1; if(len < minlen) minlen = len; for (int j = 0; j < len / 2; ++j) { char temp = str[i][j]; str[i][j] = str[i][len - j - 1]; str[i][len - j - 1] = temp; } } for (int i = 0; i < minlen; ++i) { char temp = str[0][i]; bool same = true; for (int j = 1; j < N; ++j) { if(temp != str[j][i]){ same = false; break; } } if(same) num++; else break; } if(num == 0){ printf("nai"); }else{ for (int i = num - 1; i >= 0; --i) { printf("%c", str[0][i]); } } printf("\n"); return 0;}

参考代码2:

#include#includechar str[100][260];int minlen = 256;int num = 0;int k ;void reverse(char str[][260]){ int len = strlen(str[k]) - 1; if(len < minlen) minlen = len; for (int j = 0; j < len / 2; ++j) { char temp = str[k][j]; str[k][j] = str[k][len - j - 1]; str[k][len - j - 1] = temp; }}int main(int argc, char const *argv[]){ int N; scanf("%d", &N); getchar(); for (k = 0; k < N; ++k) { fgets(str[k], 261, stdin); reverse(str); // int len = strlen(str[i]) - 1; // if(len < minlen) minlen = len; // for (int j = 0; j < len / 2; ++j) // { // char temp = str[i][j]; // str[i][j] = str[i][len - j - 1]; // str[i][len - j - 1] = temp; // } } for (int i = 0; i < minlen; ++i) { char temp = str[0][i]; bool same = true; for (int j = 1; j < N; ++j) { if(temp != str[j][i]){ same = false; break; } } if(same) num++; else break; } if(num == 0){ printf("nai"); }else{ for (int i = num - 1; i >= 0; --i) { printf("%c", str[0][i]); } } printf("\n"); return 0;}

参考代码3:

#include#includechar str[100][260];int minlen = 256;int num = 0;void reverse(char str[]){ int len = strlen(str) - 1; if(len < minlen) minlen = len; for (int j = 0; j < len / 2; ++j) { char temp = str[j]; str[j] = str[len - j - 1]; str[len - j - 1] = temp; }}int main(int argc, char const *argv[]){ int N; scanf("%d", &N); getchar(); for (int i = 0; i < N; ++i) { fgets(str[i], 261, stdin); reverse(str[i]); } for (int i = 0; i < minlen; ++i) { char temp = str[0][i]; bool same = true; for (int j = 1; j < N; ++j) { if(temp != str[j][i]){ same = false; break; } } if(same) num++; else break; } if(num == 0){ printf("nai"); }else{ for (int i = num - 1; i >= 0; --i) { printf("%c", str[0][i]); } } printf("\n"); return 0;}

版权声明：本文内容由网络用户投稿，版权归原作者所有，本站不拥有其著作权，亦不承担相应法律责任。如果您发现本站中有涉嫌抄袭或描述失实的内容，请联系我们jiasou666@gmail.com 处理，核实后本网站将在24小时内删除侵权内容。