Home Web Board ProblemSet Standing Status Statistics
long long输出请使用 %lld服务器的python版本为3.4
Problem C: 五队-长春-Python交易

## Problem C: 五队-长春-Python交易

Time Limit: 1 Sec  Memory Limit: 32 MB
Submit: 38  Solved: 19
[Submit][Status][Web Board]

## Description

Python Trade (Python交易) is a trend nowadays, and the rule is simple and naive: buyers must pay exactly the price, higher or lower is not acceptable.
Little Dingding is involved in a python trade. He has three kinds of coins: ￥1,￥5,￥10,the number of these coin is given as ().
The price is not known yet. Little Dingding only knows that the price is a positive integer. So he wonders how many situations that he can finish the trade?

## Input

There are multiple test cases. Given () as described before in one line. Process to end of file.

## Output

Print the number of situations under which little Dingding can finish the trade.

## Sample Input

1 1 1
5 5 5
0 0 0

## Sample Output

7
80
0


## HINT

[Submit][Status][Web Board]