[BOJ 6768] Don’t pass me the ball!

View as PDF

Submit solution

Points: 1
Time limit: 2.0s
Memory limit: 512M

Problem types
Allowed languages
Assembly, Awk, C, C++, Java, Pascal, Perl, Python, Sed, Text

A CCC soccer game operates under slightly different soccer rules. A goal is only counted if the 4 players, in order, who touched the ball prior to the goal have jersey numbers that are in strictly increasing numeric order with the highest number being the goal scorer.</p>

Players have jerseys numbered from 1 to 99 (and each jersey number is worn by exactly one player).

Given a jersey number of the goal scorer, indicate how many possible combinations of players can produce a valid goal.

입력 형식

The input will be the positive integer J (1 ≤ J ≤ 99), which is the jersey number of the goal scorer.

출력 형식

The output will be one line containing the number of possible scoring combinations that could have J as the goal scoring jersey number.

예제 입력 1

4

예제 출력 1

1

예제 입력 2

2

예제 출력 2

0

예제 입력 3

90

예제 출력 3

113564

Comments

There are no comments at the moment.