Ural-1044. Lucky Tickets. Easy!(简单题)

1044. Lucky Tickets. Easy!
Time limit: 2.0 secondMemory limit: 64 MB
Background
The public transport administration of Ekaterinburg is anxious about the fact that passengers don’t like to pay for passage doing their best to avoid the fee. All the measures that had been taken (hard currency premiums for all of the chiefs, increase in conductors’ salaries, reduction of number of buses) were in vain. An advisor especially invited from the Ural State University says that personally he doesn’t buy tickets because he rarely comes across the lucky ones (a ticket is lucky if the sum of the first three digits in its number equals to the sum of the last three ones). So, the way out is found — of course, tickets must be numbered in sequence, but the number of digits on a ticket may be changed. Say, if there were only two digits, there would have been ten lucky tickets (with numbers 00, 11, …, 99). Maybe under the circumstances the ratio of the lucky tickets to the common ones is greater? And what if we take four digits? A huge work has brought the long-awaited result: in this case there will be 670 lucky tickets. But what to do if there are six or more digits?
Problem
So you are to save public transport of our city. Write a program that determines a number of lucky tickets for the given number of digits. By the way, there can’t be more than nine digits on one ticket.
Input
contains a positive even integer not greater than 9.
Output
should contain a number of tickets such that the sum of the first half of digits is equal to the sum of the second half of digits.
Sample
inputoutput
4
670

题意：有一种票被定义为幸运的,如果它编码的前半部分数字的和等于后半部分数字的和,求给定n位编码的票中幸运的票的张数。

思路：票的编码只能是偶数,且不大于9,本地机上打表水过的~~

#include <iostream>#include <cstdio>#include <cstring>#include <cmath>#include <vector>#include <map>#include <set>#include <algorithm>using namespace std;int n;int ans[10]={0,0,10,0,670,0,55252,0,4816030,0};int main(){//    freopen("in.txt","r",stdin);    while(scanf("%d",&n)!=EOF)    {        printf("%d\n",ans[n]);    }    return 0;}