Problem hidden
|This problem was hidden by Editorial Board member probably because it has incorrect language|version or invalid test data, or description of the problem is not clear.|

ABR0579 - Таван тоо

n натурал тоо өгөгдөв (n ≥ 5). x1+...+x5=n болон x1 ≥ x2 ≥ x3 ≥ x4 ≥ x5 нөхцлийг хангах бүх 5 ширхэг натурал тоон хослолын тоог ол.

Input

n натурал тоо өгөгдөнө (n<300).

Output

x1 ≥ x2 ≥ x3 ≥ x4 ≥ x5 тоон хослолуудын нийт тоог хэвлэнэ.

 

Example

Input:
15

Output:
30

Тайлбар: 30 боломжийг дор жагсаав.
11 1 1 1 1
10 2 1 1 1
9 3 1 1 1
9 2 2 1 1
8 4 1 1 1
8 3 2 1 1
8 2 2 2 1
7 5 1 1 1
7 4 2 1 1
7 3 3 1 1
7 3 2 2 1
7 2 2 2 2
6 6 1 1 1
6 5 2 1 1
6 4 3 1 1
6 4 2 2 1
6 3 3 2 1
6 3 2 2 2
5 5 3 1 1
5 5 2 2 1
5 4 4 1 1
5 4 3 2 1
5 4 2 2 2
5 3 3 3 1
5 3 3 2 2
4 4 4 2 1
4 4 3 3 1
4 4 3 2 2
4 3 3 3 2
3 3 3 3 3

Нэмсэн:sw40
Огноо:2009-07-18
Хугацааны хязгаарлалт:0.100s
Эх кодын хэмжээний хязгаарлалт:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Програмчлалын хэлүүд:Бүгд дараах хэлүүдээс бусад: ASM32-GCC MAWK BC C-CLANG NCSHARP CPP14 CPP14-CLANG COBOL COFFEE D-CLANG D-DMD DART ELIXIR ERL FANTOM FORTH GOSU GRV JS-RHINO JS-MONKEY JULIA KTLN NIM NODEJS OBJC OBJC-CLANG OCT PERL6 PICO PROLOG PYPY PYPY3 PY_NBC R RACKET RUST CHICKEN SQLITE SWIFT UNLAMBDA VB.NET
Эх сурвалж:Абрамов С. А.

hide comments
2023-12-23 16:44:13
#include<stdlib.h>
#include<stdio.h>
int main() {
short int n, a = 0;
scanf("%hd", &n);
short int x[4];
for (x[0] = 1; x[0] < n - 3; x[0]++)
for (x[1] = 1; x[1] < n - 3; x[1]++)
for (x[2] = 1; x[2] < n - 3; x[2]++)
for (x[3] = 1; x[3] < n - 3; x[3]++)
for (x[4] = 1; x[4] < n - 3; x[4]++)
if (x[0] >= x[1] && x[1] >= x[2] && x[2] >= x[3] && x[3] >= x[4] && x[0] + x[1] + x[2] + x[3] + x[4] == 15)
a++;
printf("%hd", a);
return 0;
}// ene yun deer aldsan bn
2019-04-24 03:08:44
sanaa bnu
2018-08-08 06:50:52


Last edit: 2018-08-08 06:53:43
2010-09-02 10:17:23 ACHIT
programaa hamgiin baga hemjeetei bolgosonch hugatsaanii hyzgaarlalt hetersen bna geed bna
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.