report VI VI EN
Register | Login
  • HOME
  • PROBLEMSET
  • ROADMAP
  • COMPETITION
  • TOPIC
  • RANKING
  • GUIDE
  • MASHUP
  • ABOUT
  • CONTACT
  • Problem
  • Submit
  • Results
Solution - MarisaOJ: Marisa Online Judge

Solution

Time limit: 1000 ms
Memory limit: 256 MB
Given a positive integer $n$, count the number of sets of positive integers $x_1 < x_2 < x_3 < x_4$ such that: $$x_1+x_2+x_3+x_4=n$$ ### Input - A single line containing a positive integer $n$. ### Output - Print an integer representing the number of sets. ### Constraints - $1 \le n \le 50$. ### Example Input: ``` 10 ``` Output: ``` 1 ```
Loop
Loop
Even numbers
Factorial
Star Triangle
Folding paper
Fraction
Divisors
Complex Exponentiation
Prime number
Digit Sum
Fibonacci
Read number till eternity
Extremal
Reverse
Mushroom exchanging
Trailing zeros
Decimal to binary
Binary to decimal
Division
Solution
Topic
Basic
Rating 800
Solution (1) Solution