poj2109 ISBN

/*题目大意：
ISBN系统可以给一本书提供一个唯一的标识码。这种编码由10个数字组成，由左向右设为a1, a2, a3, ..., a10。一个ISBN编码是有效的，当且仅当

10 * a1 + 9 * a2 + 8 * a3 + ... + 2 * a9 + a10 ≡ 0 (mod 11)

有时a10 = 10时该ISBN编码才有效。此时最后一位记作"X"。现在给出你一个ISBN编码，然而有一位是缺损的，输入"?"。你需要求出"?"的那一位应该是什么。
*/

/*
题目注意点很多，如果？在最后，他可以是X, 在中间是0——9；我就没想到这，在这里错了好几次。
*/

#include<iostream>
using namespace std;

int main()
{
    char a[11];
    while (cin >> a)
    {
        int sum = 0, temp;
        for (int i = 0; i < 10; ++i)
        {
            if (a[i] != '?' && a[i] != 'X')
                sum += (10 - i)*(a[i] - '0');
            else if (a[i] == 'X')
                sum += 10;
            else
                temp = 10 - i;
        }
        bool judge = true;
        for (int i = 0; i < 10; ++i)
        {
            if ((sum + temp*i) % 11 == 0)
            {
                cout << i << endl;
                judge = false;
                break;
            }
        }
        if (temp == 1)
        {
            if ((sum + temp*10) % 11 == 0)
            {
                cout << 'X' << endl;
                judge = false;
            }
        }
        if (judge)
            cout << -1 << endl;
    }
    return 0;
}

/*
Description
Farmer John's cows enjoy reading books, and FJ has discovered that his cows produce more milk when they read books of a somewhat intellectual nature. He decides to update the barn library to replace all of the cheap romance novels with textbooks on algorithms and mathematics. Unfortunately, a shipment of these new books has fallen in the mud and their ISBN numbers are now hard to read.

An ISBN (International Standard Book Number) is a ten digit code that uniquely identifies a book. The first nine digits represent the book and the last digit is used to make sure the ISBN is correct. To verify that an ISBN number is correct, you calculate a sum that is 10 times the first digit plus 9 times the second digit plus 8 times the third digit ... all the way until you add 1 times the last digit. If the final number leaves no remainder when divided by 11, the code is a valid ISBN.

For example 0201103311 is a valid ISBN, since
10*0 + 9*2 + 8*0 + 7*1 + 6*1 + 5*0 + 4*3 + 3*3 + 2*1 + 1*1 = 55.

Each of the first nine digits can take a value between 0 and 9. Sometimes it is necessary to make the last digit equal to ten; this is done by writing the last digit as X. For example, 156881111X is a valid ISBN number.

Your task is to fill in the missing digit from a given ISBN number where the missing digit is represented as '?'.

Input
* Line 1: A single line with a ten digit ISBN number that contains '?' in a single position

Output
* Line 1: The missing digit (0..9 or X). Output -1 if there is no acceptable digit for the position marked '?' that gives a valid ISBN.

Sample Input

15688?111X

Sample Output

1
*/