poj 2498 StuPId

//Multiply the digits from back to front (!) with repeating factors 9, 3, 7
//一定要注意上面这句话的意思，要不在进行求和的时候就会出错！ 
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;

char id[10];

int main()
{
    int tc, len, i, cur, ans, sum, tmp1, tmp2,  c = 0;
    scanf("%d", &tc);
    while (tc--){
          scanf("%s", id);
          len = strlen(id);
          sum = 0;
          c++;
          for (i = 1; i <= len; i++){
              if (id[len-i] == '?'){
                        cur = i;
              }
              else{
                    if (i%3 == 1)
                        sum += (id[len-i]-48)*9;
                    else if (i%3 == 2)
                        sum += (id[len-i]-48)*3;
                    else if (i%3 == 0)
                        sum += (id[len-i]-48)*7;
              }
          }
          for (ans = 0; ans <= 9; ans++){
              tmp1 = 0;
              if (cur%3 == 1)
                  tmp1 = ans * 9 + sum;
              else if (cur%3 == 2)
                  tmp1 = ans * 3 + sum;
              else if (cur%3 == 0)
                  tmp1 = ans * 7 + sum;
              tmp2 = tmp1 % 10;
              if (tmp2 == 0)
                  break;
          }
          id[len-cur] = ans + 48;
          printf("Scenario #%d:\n%s\n\n", c, id);
    }
    
    system("pause");
}