算法竞赛入门经典第二版 第三章【uvaoj在线习题】Examples

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=828

Examples：

272 - TEX Quotes：

#include <stdio.h>int main(){int c,q = 1;while((c = getchar()) != EOF){if (c == '"'){printf("%s",q?"``":"''");q = !q;}else{printf("%c",c);}}return 0;}

10082 - WERTYU

#include <stdio.h>char s[] = "`1234567890-=QWERTYUIOP[]\\ASDFGHJKL;\'ZXCVBNM,./";int main(){int i,c;while((c = getchar()) != EOF){for (i = 1;s[i] && s[i] != c;i++);if (s[i]){putchar(s[i-1]);} else{putchar(c);}}return 0;}

401 - Palindromes

#include <stdio.h>#include <string.h>//string.h大写UVA不识别，报Compilation error#include <ctype.h>const char* rev = "A   3  HIL JM O   2TUVWXY51SE Z  8  ";const char* msg[] = {"not a palindrome","a regular palindrome","a mirrored string","a mirrored palindrome"};char r(char ch){if (isalpha(ch)){return rev[ch - 'A'];}return rev[ch - '0' + 25];}int main(){char s[30];while(scanf("%s",s) == 1){int len = strlen(s);int p = 1,m = 1;for(int i = 0;i < (len + 1)/2;i++){if (s[i] != s[len - 1 - i]){p = 0;}if (r(s[i]) != s[len - 1- i]){m = 0;}}printf("%s -- is %s.\n\n",s,msg[m * 2 + p]);}return 0;}

340 - Master-Mind Hints  1

#include <stdio.h>#define maxn 1010int main(){int n,a[maxn],b[maxn];int kase = 0;while(scanf("%d",&n) == 1 && n){printf("Game %d:\n",++kase);for(int i = 0;i < n;i++)scanf("%d",&a[i]);for(;;){int A = 0,B = 0;for(int i = 0;i < n;i++){scanf("%d",&b[i]);if (a[i] == b[i]){A++;}}if (b[0] == 0){break;}for(int d = 1;d <= 9;d++){int c1 = 0,c2 = 0;for(int i = 0;i < n;i++){if (a[i] == d){c1++;}if (b[i] == d){c2++;}}if (c1 < c2){B += c1;}else{B += c2;}}printf("    (%d,%d)\n",A,B-A);}}return 0;}

340 - Master-Mind Hints  2

#include <stdio.h>int main(){int i,j,f,n,A,B,a[1010],b[1010],c[1010],sum=0,num;while (scanf("%d",&n),n){++sum;printf("Game %d:\n",sum);for (i=1;i<=n;i++)scanf("%d",&a[i]);f=1;while (f){num=0;for (i=1;i<=n;i++){scanf("%d",&b[i]); c[i]=a[i]; if (b[i]==0) ++num; }if (num==n) break;A=0;B=0;for (i=1;i<=n;i++)if (c[i]==b[i]) {++A;c[i]=-1;b[i]=-1;}for (i=1;i<=n;i++){if (c[i]!=-1){for (j=1;j<=n;j++)if ((c[i]==b[j])) {++B;c[i]=-1;b[j]=-1;break;}}}printf("    (%d,%d)\n",A,B);  }}return 0;}

1583 - Digit Generator

#include <stdio.h>#include <string.h>#define maxn 100005int ans[maxn];int main(){int T,n;memset(ans,0,sizeof(ans));for(int m = 1;m < maxn;m++){int x = m,y = m;while(x > 0){y += x % 10;x /= 10;}if (ans[y] == 0 || m < ans[y]){ans[y] = m;}}scanf("%d",&T);while(T--){scanf("%d",&n);printf("%d\n",ans[n]);}return 0;}

1584 - Circular Sequence

#include <stdio.h>#include <string.h>#define maxn 105int less(const char* s,int p,int q){int n = strlen(s);for (int i = 0;i < n;i++){if (s[(p+i) % n] != s[(q + i) % n]){return s[(p + i) % n] < s[(q + i) % n];}}return 0;}int main(){int T;char s[maxn];scanf("%d",&T);while(T--){scanf("%s",s);int ans = 0;int n = strlen(s);for(int i = 1;i < n;i++){if (less(s,i,ans)){ans = i;}}for(int i = 0;i < n;i++)//VC6.0显示重定义，但UVA上若无int会导致编译错误{putchar(s[(i + ans) % n]);}putchar('\n');}return 0;}