字符串
冰阔落
Stay hungry, Stay foolish, Stop when you are perfect.
展开
-
UVA 401 (暑假-字符串(1) -A - Palindromes)
#include #include #include int main() { int kong,i,j,n,p,len,t; char st[1000],st1[1000]; double I,U,P,sum; scanf("%d",&n); gets(st); for (p=1;p<=n;p++) { gets(st); I=-1; U=-1; P=-1; len=strlen(st)原创 2014-07-08 21:02:10 · 1529 阅读 · 0 评论 -
UVA 10815 (暑假-字符串(2) -D - Andy's First Dictionary)
#include #include #include int cmp_string(const void *a, const void *b) { return strcmp((char *)a, (char *)b); } int main() { char str[210], word[150010][50] = {0}; int n; int count = 0; whi原创 2014-07-27 16:12:09 · 1622 阅读 · 0 评论 -
UVA 10115 (暑假-字符串(2) -F - Automatic Editing)
#include #include int main() { char str[30][300], str1[700], str2[700]; int n; while (scanf("%d", &n) && n != 0) { getchar(); for (int i = 0; i < n*2; i++) gets(str[i]); ge原创 2014-07-08 21:09:55 · 1753 阅读 · 0 评论 -
UVA 644 (暑假-字符串(2)-E - Immediate Decodability)
#include #include #include int main() { char str[100][100]; int num = 0; for (int i = 0; gets(str[i]); i++) { if (str[i][0] == '9') { int kong = 0; for (int j = 0; j < i; j++) { if原创 2014-07-27 19:07:14 · 1576 阅读 · 0 评论 -
UVA 537 (暑假-字符串(1) -D - Artificial Intelligence?)
#include #include #include int main() { int kong,i,j,n,p,len,t; char st[1000],st1[1000]; double I,U,P,sum; scanf("%d",&n); gets(st); for (p=1;p<=n;p++) { gets(st); I=-1; U=-1; P=-1; len=strlen(st)原创 2014-07-08 20:59:21 · 1645 阅读 · 0 评论 -
UVA 10878 (暑假-字符串(2) -C - Decode the tape)
#include #include int main() { int i, sum, count=0, len, j=0; char str[30]; gets(str); while ( gets(str) && str[0] != '_') { len = strlen(str); // puts(str); sum = 0; // printf ("\n%d原创 2014-07-08 21:08:14 · 1731 阅读 · 0 评论 -
UVA 10010 (暑假-字符串(2) -A - Where's Waldorf?)
#include #include #define MAX 21 #define MAX2 51 int main() { int count, i, m, n, j, k, len, r, s1, s2, x, y, kong = 0, count2; char str[MAX2][MAX2], str2[MAX][MAX2]; scanf("%d", &count);原创 2014-07-08 21:05:21 · 1513 阅读 · 0 评论 -
UVA 10361 (暑假-字符串(1) -C - Automatic Poetry)
#include #include int main() { int t; scanf("%d", &t); getchar(); while (t--) { char s1[200], s2[200]; gets(s1); gets(s2); int len = strlen(s1); for (int i = 0; i < len; i++) { if原创 2014-07-27 14:29:02 · 1583 阅读 · 0 评论 -
UVA 409 (暑假-字符串(2) -B - Excuses, Excuses!)
#include #include int main() { int MAX = 0; char str[25][25], str1[25][25]; char str2[25][1700], str3[25][1700]; int m, n, t = 0; //输入数据 while (scanf("%d%d", &m, &n) != EOF) { MAX =原创 2014-07-08 21:06:54 · 1565 阅读 · 0 评论