【HDOJ】1315 Basic

这道题目巨坑啊，注意__int64，int wa了一个下午。

 #include <cstdio>
 #include <cstring>
 #include <cstdlib>

 #define MAXN 105

 char vals[] = "0123456789abcdef";
 char s[MAXN];
 int l;
 bool flag;

 bool check(char ch, int base) {
     if (base <= )
         return ( ch>='' && ch<=''+base-);
     else
         return ( (ch>=''&&ch<='') || (ch>='a' && ch<'a'+base-) );
 }

 int getv(int i, int base, __int64 *v) {
     __int64 ret = ;

     while (flag && i < l) {
         if (s[i] == '#')
             break;
         if (flag)   flag = check(s[i], base);
         if (s[i] >= 'a')
             ret = ret*base + s[i]-'a'+;
         else
             ret = ret*base + s[i]-'';
         ++i;
     }

     *v = ret;
     return i;
 }

 void solve() {
     flag = true;
     l = strlen(s);

     int i = , k=;
     __int64 tmp = -, base = ;
     bool ltag = false;

     while (flag && i < l) {
         if (s[i] == '#') {
             if (!ltag) {
                 ltag = true;
                 base = tmp;
                 if (base< || base>)
                     flag = false;
             } else {
                 if (s[i-] == '#')
                     flag = false;
                 ltag = false;
             }
             ++i;
             ++k;
         } else {
             if (i && !ltag)
                 flag = false;
             i = getv(i, base, &tmp);
         }
     }

     if (k & )
         flag = false;
 }

 int main() {
     int t;

 #ifndef ONLINE_JUDGE
     freopen("data.in", "r", stdin);
     freopen("data.out", "w", stdout);
 #endif

     scanf("%d", &t);
     while (t--) {
         scanf("%s", s);
         solve();
         if (flag) {
             printf("yes\n");
         } else {
             printf("no\n");
         }
     }

     return ;
 }