|
||||||||
Time Limit: 1.0 second Memory Limit: 1 000 KB Tyomitch calls the number with 2N digits (without leading zeroes) "interesting", if it's divisible by both the number formed from its first N digits and the number formed from its last N digits. For example, 1020 is "interesting" (divisible by 10 and 20) and 2005 is not. Tyomitch wants to know how many "interesting" 2N-digit numbers exist. You are to help him. InputInput contains an integer N (1 ≤ N ≤ 10000). OutputOutput the number of "interesting" 2N-digit numbers. Sample Input1 Sample Output14 Hint11, 12, 15, 22, 24, 33, 36, 44, 48, 55, 66, 77, 88, 99. Problem Author: Alexander Ipatov Problem Source: Petrozavodsk summer training camp, August 2005. Print Statistic Discuss Submit |
||||||||
|