Barbara Bennett's Wild Numbers 
Time Limit: 2000ms, Special Time Limit:5000ms, Memory Limit:65536KB 
Total submit users: 9, Accepted users: 9 
Problem 10654 :
No special judgement

Problem description 
A
wild number is a string containing digits and question marks (like 36?1?8).
A number X matches a wild number W if they have the same length,
and every nonquestion mark character in X is equal to the character in
the same position in W (it means that you can replace a question mark
with any digit). For example, 365198
matches the wild number 36?1?8,
but 360199,
361028,
or 36128
does not. Write a program that reads a wild number W and a number X from
input, both of length n, and determines the number of ndigit
numbers that match W and are greater than X.

Input 
There
are multiple test cases in the input. Each test case consists of two lines of
the same length. The first line contains a wild number W, and the second
line contains an integer number X. The length of input lines is between 1
and 10 characters. The last line of input contains a single character #.

Output 
For
each test case, write a single line containing the number of ndigit
numbers matching W and greater than X (n is the length of W
and X).

Sample Input 
36?1?8
236428
8?3
910
?
5
#

Sample Output 
100
0
4

Problem Source 
Tehran2006

Submit
Discuss
Judge Status
Problems
Ranklist
