Module: Nombor Catalan


Problem

2 /2


Beza

Problem

Cetak perbezaan antara bilangan pokok binari dengan daun N dan bilangan partition N-gon ke dalam segi tiga.
 
Input
Input ialah nombor tunggal - N (\(1 <= N <= 10\))
 
Output
Cetak satu nombor - perbezaan yang diingini
 

 

Contoh

 

time 1000 ms
memory 256 Mb
Rules for program design and list of errors in automatic problem checking

Teacher commentary

Your Program

Attach a file with the source code of the program:

or select a programming language and type your program

Auto

       

Program check result To check the solution of the problem, you need to register or log in!

# Input Output
1 1 0