【HDOJ】1924 CIVIC DILL MIX

简单字符串。

 #include <cstdio>
 #include <cstring>

 #define MAXN 55
 char srca[MAXN], cas[MAXN], sums[MAXN];

 inline int getVal(char ch) {
     switch (ch) {
     case 'I': return ;
     case 'V': return ;
     case 'X': return ;
     case 'L': return ;
     case 'C': return ;
     case 'D': return ;
     case 'M': return ;
     default:  return ;
     }
 }

 int R2I(char str[]) {
     int i, len = strlen(str);
     int val = ;
     for (i=; i<len; ++i) {
         if (str[i]=='C' && (str[i+]=='D'||str[i+]=='M'))
             val -= ;
         else if (str[i]=='X' && (str[i+]=='L'||str[i+]=='C'))
             val -= ;
         else if (str[i]=='I' && (str[i+]=='X'||str[i+]=='V'))
             val -= ;
         else
             val += getVal(str[i]);
     }
     return val;
 }

 void f1(int *p, int *q, char str[], int a, int b, char ca, char cb, char cc) {
     int x = *p, t=a/;
     int i = *q;
     if (x >= a) {
         x -= a;
         str[i++] = ca;
         str[i++] = cc;
     }
     if (x >= b) {
         x -= b;
         str[i++] = cb;
     }
     if (x >= (a-b)) {
         x -= (a-b);
         str[i++] = ca;
         str[i++] = cb;
     }
     while (x >= t) {
         str[i++] = ca;
         x -= t;
     }
     *p = x;
     *q = i;
 }

 void I2R(int x, char str[]) {
     int i = ;
     while (x >= ) {
         str[i++] = 'M';
         x -= ;
     }
     f1(&x, &i, str, , , 'C', 'D', 'M');
     f1(&x, &i, str, , , 'X', 'L', 'C');
     f1(&x, &i, str, , , 'I', 'V', 'X');
     str[i] = '\0';
 }

 int main() {
     int c;
     int n, case_n = ;

     while(scanf("%d", &n)!=EOF && n) {
         c = ;
         while (n--) {
             scanf("%s", srca);
             c += R2I(srca);
         }
         I2R(case_n, cas);
         I2R(c, sums);
         printf("Case %s: %s\n", cas, sums);
         ++case_n;
     }

     return ;
 }