submission_id string | problem_id string | status string | code string | input string | output string | problem_description string |
|---|---|---|---|---|---|---|
s591757975 | p00008 | Accepted | for line in open(0).readlines():
N = int(line)
lim = min(9, N)
ans = 0
if 0 <= N <= 36:
for a in range(0, lim+1):
for b in range(0, lim+1):
for c in range(0, lim+1):
d = N - a - b - c
if 0 <= d <= lim:
ans += 1
print(ans)
| 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s275806245 | p00008 | Accepted |
while True:
try:
count=0
num = int(input())
for a in range(10):
for b in range(10):
for c in range(10):
for d in range(10):
if a+b+c+d ==num:
count+=1
print(count)
except EOFError:
break
| 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s798408442 | p00008 | Accepted | while 1:
try:
n = int(input())
count = 0
for a in range(10):
for b in range(10):
for c in range(10):
for d in range(10):
if a + b + c + d == n:
count += 1
print(count)
except EOFError:
break
| 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s127051053 | p00008 | Accepted | while True:
try:
cnt =0
a = int(input())
for i in range(10):
for j in range(10):
for k in range(10):
for l in range(10):
if i+j+k+l == a:
cnt += 1
print(cnt)
except:
break
| 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s798823325 | p00008 | Accepted | while True:
try:
count = 0
n = int(input())
for a in range(10):
for b in range(10):
for c in range(10):
d = n - a - b - c
if (d >= 0 and d <= 9):
count += 1
print(count)
except EOFError:
break
| 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s323596466 | p00008 | Accepted | import itertools
try:
while True:
n = int(input())
count = 0
for a, b, c, d in itertools.product(range(10), repeat=4):
if a + b + c + d == n:
count += 1
print(count)
except Exception as _:
pass
| 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s240836469 | p00008 | Accepted | while True:
try:
i = 0
a = list(map(int,input().split()))
for x in range(10):
for y in range(10):
for z in range(10):
for s in range(10):
if a[0]==(x+y+z+s):
i = i+1
else:
pass
print(i)
except EOFError:
break
| 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s488215816 | p00008 | Accepted | output = 0
try:
while True:
n = int(input())
a = 0
while a < 10 :
b = 0
while b < 10 :
c = 0
while c < 10 :
d = 0
while d < 10 :
if a + b + c + d == n :
output += 1
d += 1
c += 1
b += 1
a += 1
print(output)
output = 0
except EOFError:
pass
| 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s969400133 | p00008 | Accepted | while 1:
try:
n = int(input())
except:break
ans = 0
for i in range(0,10):
for j in range(0,10):
for k in range(0,10):
for l in range(0,10):
if i + j + k + l == n:
ans += 1
print(ans)
| 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s787268589 | p00008 | Accepted | import sys
for line in sys.stdin:
n = int(line)
cnt = 0
for a in range(10):
for b in range(10):
for c in range(10):
for d in range(10):
if a + b + c + d == n:
cnt += 1;
print(cnt)
| 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s570402281 | p00008 | Accepted | import sys; print("\n".join(str(sum(1 for n in [int(in_n)] for a in range(10) for b in range(a, a+10) for c in range(b, b+10) for d in range(c, c+10) if d == n)) for in_n in sys.stdin))
| 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s440994127 | p00008 | Accepted | while True :
try :
n = int(input())
except :
break
S = [(0, 0, 0, 0) for i in range(10000)]
s = 0
for a in range(10) :
for b in range(10) :
for c in range(10) :
for d in range(10) :
if(a + b + c + d == n) :
S[s] = (a, b, c, d)
s += 1
else :
pass
S = set(S)
print(len(S) - 1)
| 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s944732659 | p00008 | Accepted | from itertools import product
while True:
try:
total = int(input())
c = 0
for t in product(range(10),repeat=4):
if total == sum(t):
c += 1
print(c)
except:
break
| 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s217008112 | p00008 | Accepted | while True:
try:
n = int(input())
num = 0
for a in range(10):
for b in range(10):
for c in range(10):
for d in range(10):
if (a + b + c + d == n):
num += 1
print(num)
except EOFError:
break
| 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s015331184 | p00008 | Accepted | while 1:
try:
count = 0
n = int(input())
for a in range(10):
for b in range(10):
for c in range(10):
for d in range(10):
if a + b + c + d == n:
count += 1
print(count)
except:
break
| 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s708006245 | p00008 | Accepted | import sys
try:
while True:
n = int(input())
res = 0
for i in range(10):
for j in range(10):
for k in range(10):
for m in range(10):
if i + j + k + m == n:
res += 1
print(res)
except Exception:
sys.exit()
| 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s895452239 | p00008 | Accepted | a = [0 for i in range(51)]
for i in range(10):
for j in range(10):
for k in range(10):
for l in range(10):
a[i + j + k + l] += 1
while True:
try:
n = int(input())
print(a[n])
except EOFError:
break
| 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s507590470 | p00008 | Accepted | e=[0]*51
for a in range(10):
for b in range(10):
for c in range(10):
for d in range(10):
e[sum([a,b,c,d])]+=1
while 1:
try:
print(e[int(input())])
except:
break
| 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s972251868 | p00008 | Accepted | ans = [0 for i in range(51)]
for i in range(10):
for j in range(10):
for k in range(10):
for l in range(10):
ans[i+j+k+l] += 1
#for i in range(50+1):
# print(i, ans[i])
while True:
try:
print(ans[int(input())])
except EOFError:
break
| 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s081048800 | p00008 | Accepted | while True:
try:
n = int(input())
count = 0
for a in range(10):
for b in range(10):
for c in range(10):
for d in range(10):
if a+b+c+d==n:
count += 1
print(count)
except EOFError:
break
| 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s226972538 | p00008 | Accepted | import sys
r = range(10)
for l in sys.stdin: print(len([[a,b,c,d]for a in r for b in r for c in r for d in r if a+b+c+d==int(l)]))
| 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s173091477 | p00008 | Accepted | import itertools
try:
while(True):
n = int(input())
cnt = 0
rng = range(10)
for i,j,k,l in itertools.product(rng,rng,rng,rng):
if i + j + k + l == n:
cnt = cnt + 1
print(cnt)
except:
pass
| 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s187747913 | p00008 | Accepted |
while True:
try:
n = int(input())
ans =0
for a in range(10):
for b in range(10):
for c in range(10):
for d in range(10):
if a+b+c+d==n:
ans=ans+1
print(ans)
except:
break
| 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s739513730 | p00008 | Accepted | while True:
try:
n = int(input())
ans =0
for a in range(10):
for b in range(10):
for c in range(10):
for d in range(10):
if a+b+c+d==n:
ans=ans+1
print(ans)
except:
break
| 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s119898218 | p00008 | Accepted | while True:
try:
n=int(input())
except:
break
cnt=0
for i in range(10):
for j in range(10):
for k in range(10):
for l in range(10):
if i+j+k+l==n:
cnt+=1
print(cnt)
| 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s412345148 | p00008 | Accepted | import itertools
import sys
com = [0] * 51
r10 = range(10)
for a,b,c,d in itertools.product(r10,r10,r10,r10):
com[a+b+c+d] += 1
for line in sys.stdin.readlines():
print(com[int(line)])
| 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s099418100 | p00008 | Accepted | import sys
if __name__ == '__main__':
for n in sys.stdin:
cnt = 0
for i in range(10):
for j in range(10):
for k in range(10):
for l in range(10):
if i+j+k+l == int(n):
cnt +=1
print(cnt)
| 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s089923946 | p00008 | Accepted | a = [0 for i in range(51)]
for i in range(10):
for j in range(10):
for k in range(10):
for l in range(10):
a[i + j + k + l] += 1
while True:
try:
n = int(input())
print(a[n])
except EOFError:
break
| 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s922094289 | p00008 | Accepted | while True:
try:
n = int(input())
counter = 0
for o in range(10):
for p in range(10):
for q in range(10):
for r in range(10):
if (o + p + q + r) == n:
counter = counter + 1
print(counter)
except:
break
| 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s406974569 | p00008 | Accepted | while True:
try:
n=int(input())
count=0
for i in range(10):
for j in range(10):
for k in range(10):
for l in range(10):
if (i+j+k+l)==n:
count=count+1
print(count)
except EOFError:
break
| 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s916457770 | p00008 | Accepted | while True:
try:
inVal = int(input())
count = 0;
for a in range(10):
for b in range(10):
for c in range(10):
for d in range(10):
if a + b + c + d == inVal:
count = count + 1
print(count)
except EOFError:
break
| 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s409324128 | p00008 | Accepted | import sys
for line in sys.stdin:
n = int(line)
cnt = 0
for i in range(0, 10):
for j in range(0, 10):
for k in range(0, 10):
for p in range(0, 10):
if i+j+k+p == n:
cnt += 1
break
if i+j+k == n: break
if i+j == n: break
if i == n: break
print cnt
| 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s931175021 | p00008 | Accepted | def wa(n):
count=0
for i in range(10):
for j in range(10):
for k in range(10):
for l in range(10):
if n==i+j+k+l:
count +=1
elif n<i+j+k+l:
break
return count
while True:
try:
n=int(input())
print(wa(n))
except:break
| 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s797223853 | p00008 | Accepted | while True:
counter = 0
try:
n = int(input())
except EOFError:
break
for a in range(10):
for b in range(10):
for c in range(10):
for d in range(10):
if a+b+c+d == n:
counter += 1
print(counter)
| 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s581816337 | p00008 | Accepted | while 1:
try:
n=int(input())
i=0
for a in range(10):
for b in range(10):
for c in range(10):
for d in range(10):
if a+b+c+d==n:i+=1
print(i)
except:break
| 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s748709492 | p00008 | Accepted | def calc(n, x):
# n個の数(0~9)の和でxが作れるかどうかを判別する
if n == 1:
if x <= 9:
return 1
else:
return 0
else:
num = 0
for i in range(10):
if x-i < 0:
continue
num += calc(n-1, x-i)
return num
while True:
try:
print(calc(4, int(input())))
except:
exit(0)
| 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s802869669 | p00008 | Accepted | try:
while True:
n=int(input())
cnt=0
for a,b,c,d in [(a,b,c,d) for a in range(10) for b in range(10) for c in range(10) for d in range(10)]:
if a+b+c+d==n:
cnt+=1
print(cnt)
except EOFError:
pass
| 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s768140276 | p00008 | Accepted | if __name__ == '__main__':
while True:
try:
n = int(input())
counter = 0
for a in range(10):
for b in range(10):
for c in range(10):
for d in range(10):
if a + b + c + d == n:
counter += 1
print(counter)
except EOFError:
break
| 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s716785144 | p00008 | Accepted | import sys
n = [0]*51
for i in range(10):
for j in range(10):
for k in range(10):
for l in range(10):
n[i+j+k+l] += 1
for i in sys.stdin:
print(n[int(i)])
| 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s024283853 | p00008 | Accepted | def count(a):#関数「count」を定義
count = 0
if a<=36:
for i in range(10):#()内は0から一つ前までの数
for j in range(10):
for k in range(10):
for l in range(10):
if i+j+k+l==a:
count +=1
print(count)
while True:
try:
a=int(input())
count(a)
except EOFError:
break
| 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s796420937 | p00008 | Accepted | while True:
try:
n = int(input())
except EOFError:
break
if n>36:
print(0)
continue
ret=0
for a in range(10):
for b in range(10):
for c in range(10):
for d in range(10):
if a+b+c+d==n:
ret+=1
print(ret)
| 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s850389041 | p00008 | Accepted | while True:
try:
sum = int(input())
result = 0
for i in range(10):
for j in range(10):
for k in range(10):
for l in range(10):
if i+j+k+l == sum:
result+=1
print(result)
except EOFError:
break
| 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s679472909 | p00008 | Accepted | import sys
for line in sys.stdin:
n = int(line)
cnt = 0
for a in range(10):
for b in range(10):
for c in range(10):
for d in range(10):
if a + b + c + d == n:
cnt += 1;
print(cnt)
| 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s084693261 | p00008 | Accepted | import sys
def comb(n):
count = 0
for i in range(10):
for j in range(10):
for k in range(10):
for l in range(10):
if i+j+k+l == n:
count += 1
continue
return count
while True:
line = sys.stdin.readline()
if not line: break
n = int(line.rstrip('\r\n'))
print(comb(n))
| 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s468414930 | p00008 | Accepted | def count(n):
cnt = 0
for a in range(10):
for b in range(10):
for c in range(10):
for d in range(10):
if a + b + c + d == n:
cnt += 1
print(cnt)
while True:
try:
n = int(input())
count(n)
except EOFError:
break
| 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s068219139 | p00008 | Accepted | while(1):
try:
n = int(input())
except:
break
cnt = 0
for a in range(10):
for b in range(10):
for c in range(10):
d = n - a - b - c
if 0 <= d < 10:
cnt += 1
print(cnt)
| 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s264290449 | p00008 | Accepted | import itertools
while True:
try:
n = int(input())
ans = 0
for val in itertools.product(range(10), repeat=4):
if sum(val) == n:
ans += 1
print(ans)
except:
break
| 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s005988991 | p00008 | Accepted | while(True):
try:
N = int(input())
m = 0
for i in range(10):
for j in range(10):
for k in range(10):
for l in range(10):
if i+j+k+l == N:
m += 1
print(m)
except:
break
| 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s000722393 | p00008 | Accepted | ans = []
while True :
try :
N = int(input())
used = []
cnt = 0
for a in range(10) :
for b in range(10) :
for c in range(10) :
for d in range(10) :
if a + b + c + d == N :
cnt += 1
print(cnt)
except :
break
| 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s350607129 | p00008 | Accepted | while True:
try:
n = int(input())
results = []
for i in range(10):
for j in range(10):
for k in range(10):
for l in range(10):
results.append( n == sum([i, j, k, l]) )
print(len(list(filter(lambda x:x==True, results))))
except:
break
| 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s165566214 | p00008 | Accepted | import sys
for line in sys.stdin:
n = int(line)
count = 0
for i in range(0, 10):
for j in range(0, 10):
for k in range(0, 10):
for l in range(0, 10):
if i + j + k + l == n:
count += 1
print(count)
| 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s738138248 | p00008 | Accepted | num = [0 for i in range(51)]
for a in range(10):
for b in range(10):
for c in range(10):
for d in range(10):
num[a+b+c+d] += 1
while 1:
try:
print(num[int(input())])
except:
break
| 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s559270008 | p00008 | Accepted | ss = int(input())
r = 10
while 1:
cnt = 0
for a in range(r):
for b in range(r):
for c in range(r):
for d in range(r):
if a+b+c+d==ss: cnt+=1
print(cnt)
try: ss = int(input())
except EOFError: break
| 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s273576601 | p00008 | Accepted | while True:
try:
n = int(raw_input())
judge = 0
for i in range(10):
for j in range(10):
for k in range(10):
if -1 < n - i - j - k < 10:
judge += 1
print judge
except EOFError:
break
| 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s864371902 | p00008 | Runtime Error | import itertools
l = [1,2,3,4,5,6,7,8,9]
while True:
try:
N = int(raw_input())
res = 0
for element in itertools.combinations_with_replacement(l,5):
if sum(element) == N:
res += 1
print res
except EOFError:
break | 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s302037688 | p00008 | Runtime Error | while(True):
a = 0
n = int(input())
if n > 36:
print(0)
continue
elif n==36:
print(1)
continue
b = n
for i in range(10):
if n-i==0:
a=a+1
#print("(%d,0,0,0)"%(i))
break
for j in range(10):
if n-i-j==0:
a=a+1
#print("(%d,%d,0,0)"%(i,j))
break
for k in range(10):
b = n-i-j-k
if b>=0 and b<=9:
a=a+1
#print("(%d,%d,%d,%d)"%(i,j,k,b))
continue
elif b > 9:
continue
else:
break
print(a) | 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s598229111 | p00008 | Runtime Error | while(True):
a = 0
n = int(input())
if n > 36:
print(0)
continue
elif n==36:
print(1)
continue
b = n
for i in range(10):
if n-i==0:
a=a+1
#print("(%d,0,0,0)"%(i))
break
for j in range(10):
if n-i-j==0:
a=a+1
#print("(%d,%d,0,0)"%(i,j))
break
for k in range(10):
b = n-i-j-k
if b>=0 and b<=9:
a=a+1
#print("(%d,%d,%d,%d)"%(i,j,k,b))
continue
elif b > 9:
continue
else:
break
print(a)
return 0 | 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s452630748 | p00008 | Runtime Error | def get_input():
while True:
try:
yield ''.join(raw_input())
except EOFError:
break
ar = [0] * 50
for i in range(10):
for j in range(10):
for k in range(10):
for l in range(10):
ar[i + j + k + l] += 1
for a in list(get_input()):
print ar[int(a)] | 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s393968672 | p00008 | Runtime Error | import sys
s=[0]*51
for a in range(10):
for b in range(10):
for c in range(10):
for d in range(10):
s[a+b+c+d]+=1
for l in sys.stdin:print x[int(l)] | 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s009128651 | p00008 | Runtime Error | while 1:
try:
n=int(raw_input())
except EOFError:
break
print len(=[1 for i in range(10) for j in range(10) for k in range(10) for l in range(10) if i+j+k+l==n] | 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s476011156 | p00008 | Runtime Error | #! /usr/bin/env python
n = int(raw_input())
x = 0
i = rge(10)
for a in i:
for b in i:
for c in i:
for d in i:
if a + b + c + d == n:
x = x + 1
print x | 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s310744340 | p00008 | Runtime Error | import itertools
c = list(itertools.product(range(10), repeat=4))
if __name__ == '__main__':
for line in sys.stdin.readlines():
print sum([l for l in c if int(n) == sum(l)]) | 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s879542444 | p00008 | Runtime Error | import itertools
import sys
c = list(itertools.product(range(10), repeat=4))
if __name__ == '__main__':
for line in sys.stdin.readlines():
print sum([l for l in c if int(n) == sum(l)]) | 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s544675012 | p00008 | Runtime Error | import itertools
import sys
c = list(itertools.product(range(10), repeat=4))
for line in sys.stdin.readlines():
print sum([l for l in c if int(n) == sum(l)]) | 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s254413614 | p00008 | Runtime Error | import itertools
import sys
c = list(itertools.product(range(10), repeat=4))
if __name__ == '__main__':
for n in sys.stdin.readlines():
print sum([l for l in c if int(n) == sum(l)]) | 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s958163709 | p00008 | Runtime Error | import itertools
import sys
c = list(itertools.product(range(10), repeat=4))
for n in sys.stdin.readlines():
print sum([l for l in c if int(n) == sum(l)]) | 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s859519603 | p00008 | Runtime Error | import itertools
import sys
c = list(itertools.product(range(10), repeat=4))
for n in sys.stdin.readlines():
print sum([l for l in c if int(n.strip()) == sum(l)]) | 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s098292050 | p00008 | Runtime Error | import itertools
import sys
c = list(itertools.product(range(10), repeat=4))
for n in sys.stdin.readline():
print sum([l for l in c if int(n) == sum(l)]) | 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s251813370 | p00008 | Runtime Error | import sys
for n in sys.stdin.readline():
ret = 0
for a in xrange(10):
for b in xrange(10):
for c in xrange(10):
for d in xrange(10):
if a+b+c+d == int(n):
ret += 1
print ret | 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s165813827 | p00008 | Runtime Error | def count(num):
l1=[]
for a in range (10):
for b in range(10):
for c in range (10):
for d in range (10):
l1.append([a,b,c,d])
l1=list(filter(lambda x: sum(x)==num,l1))
return(len(l1))
while 1==1:
print(count(int(input()))) | 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s046982758 | p00008 | Runtime Error | def count(num):
l1=[]
for a in range (10):
for b in range(10):
for c in range (10):
for d in range (10):
l1.append([a,b,c,d])
l1=list(filter(lambda x: sum(x)==num,l1))
return(len(l1))
import sys
length=len(sys.stdin.readlines())
for i in range (length):
print(count(int(input()))) | 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s112392142 | p00008 | Runtime Error | import sys
for line in sys.stdin.readline():
line.strip()
a=int(line)
if a<37:
cnt=0
for i in xrange(0,10):
for j in xrange(0,10):
for k in xrange(0,10):
for l in xrange(0,10):
if i+j+k+l==a:
cnt+=1
print cnt
else:
print 0 | 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s044394695 | p00008 | Runtime Error | # -*- coding: utf-8 -*-
import sys
sum = [0]*37
for a in range(10):
for b in range(10):
for c in range(10):
for d in range(10):
sum[a+b+c+d] += 1
for line in sys.stdin:
print sum[int(line)] | 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s316396301 | p00008 | Runtime Error | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
def main(num):
if num >= 19:
num = 19 - num + 17
res = 1
gro1 = 3
for i in range(8):
if i == num:
return res
if i == 0:
gro2 = 3
else:
gro2 += 1
res += gro1
gro1 += gro2
for i in range(8,19):
if i == num:
return res
gro2 -= 3
res += gro1
gro1 += gro2
if __name__ == '__main__':
while True:
try:
num = int(input())
except:
return
else:
print(main()) | 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s148718399 | p00008 | Runtime Error | while 1:
n=int(input())
cnt=0
for i in range(10):
for j in range(10):
for k in range(10):
for l in range(10):
if i+j+k+l==n:
cnt=cnt+1
print(cnt) | 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s249037198 | p00008 | Runtime Error | while True:
n = int(input())
counter = 0
for a in range(10):
for b in range(10):
for c in range(10):
for d in range(10):
if a + b + c + d == n:
counter += 1
print(counter) | 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s526833714 | p00008 | Runtime Error | while True:
try:
n = int(input())
c = 0
for i in range(1,10):
for j in range(1,10):
for k in range(1,10):
for l in range(1,10):
if i+j+k+l == n : c+=1
print(c)
exception:
break | 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s830560034 | p00008 | Runtime Error | import sys
for line in sys.stdin:
N = int(raw_input())
ans = 0
for a in xrange(10):
for b in xrange(10):
for c in xrange(10):
for d in xrange(10):
if a+b+c+d == D:
ans += 1
print ans | 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s167024940 | p00008 | Runtime Error | import sys
for line in sys.stdin:
N = int(raw_input())
ans = 0
for a in xrange(10):
for b in xrange(10):
for c in xrange(10):
for d in xrange(10):
if a+b+c+d == N:
ans += 1
print ans | 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s136150405 | p00008 | Runtime Error | againstN = [0]*50
for a in range(0,10):
for b in range(0,10):
for c in range(0,10):
for d in range(0,10):
againstN[a+b+c+d] += 1
inputs=[]
while True:
try:
inputs.append(int(input()))
except EOFError:
break
for i in inputs:
print(againstN[i]) | 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s752482986 | p00008 | Runtime Error | import sys
values = []
for line in sys.stdin:
values.append(int(line))
ans = [1 for i in range(10) for j in range(10) for k in range(10) for l in range(10) if n == i + j + k + l]
print(ans.count(1)) | 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s350166040 | p00008 | Runtime Error | import sys
a=[]
for num in sys.stdin:
a.append(num)
for i in a:
time=0
if n<=18:
for i in range(n+1):
if i<=9:
if n-i<=9:
time+=(i+1)*(n-i+1)
else:
time+=(i+1)*(19-n+i)
else:
time+=(19-i)*(n-i+1)
elif n>18 and n<=36:
for i in range(37-n):
pre=i+n-18
if pre<=9
time+=(pre+1)*(19-n+pre)
else:
if n-pre<=9:
time+=(19-pre)*(n-pre+1)
else:
time+=(19-pre)*(19-n+pre)
print time | 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s804029198 | p00008 | Runtime Error | import sys
a=[]
for num in sys.stdin:
a.append(num)
for i in a:
time=0
if n<=18:
for i in range(n+1):
if i<=9:
if n-i<=9:
time+=(i+1)*(n-i+1)
else:
time+=(i+1)*(19-n+i)
else:
time+=(19-i)*(n-i+1)
elif n>18 and n<=36:
for i in range(37-n):
pre=i+n-18
if pre<=9:
time+=(pre+1)*(19-n+pre)
else:
if n-pre<=9:
time+=(19-pre)*(n-pre+1)
else:
time+=(19-pre)*(19-n+pre)
print time | 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s502516570 | p00008 | Runtime Error | import sys
from itertools import product
num = 4
l = [0] * (9*num + 1)
for x in map(sum, product(range(10), repeat=num)):
l[x] += 1
for s in sys.stdin:
print(l[int(s)]) | 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s305697002 | p00008 | Runtime Error | import sys
a=[]
for i in sys.stdin
ini=input()
a.append(ini)
for i in a:
count=0
for j in range(10):
if j<=i and i-j<=27:
for k in range(10):
if k<=i-j and i-j-k<=18:
if i-j-k<=9:
count+=i-j-k+1
else:
count+=19-i+j+k
print count | 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s937506015 | p00008 | Runtime Error | import sys
a=[]
for i in sys.stdin:
ini=input()
a.append(ini)
for i in a:
count=0
for j in range(10):
if j<=i and i-j<=27:
for k in range(10):
if k<=i-j and i-j-k<=18:
if i-j-k<=9:
count+=i-j-k+1
else:
count+=19-i+j+k
print count
??? | 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s484690035 | p00008 | Runtime Error | import sys
a=[]
for i in sys.stdin:
ini=input()
a.append(ini)
for i in a:
count=0
for j in range(10):
if j<=i and i-j<=27:
for k in range(10):
if k<=i-j and i-j-k<=18:
if i-j-k<=9:
count+=i-j-k+1
else:
count+=19-i+j+k
print count
| 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s798438242 | p00008 | Runtime Error | import sys
a=[]
for i in sys.stdin:
a.append(i)
for i in a:
count=0
for j in range(10):
if j<=i and i-j<=27:
for k in range(10):
if k<=i-j and i-j-k<=18:
if i-j-k<=9:
count+=i-j-k+1
else:
count+=19-i+j+k
print count | 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s877490465 | p00008 | Runtime Error | import sys
a = []
for line in sys.stdin:
a.append(line)
for i in a:
count=0
for j in range(10):
if j<=i and i-j<=27:
for k in range(10):
if k<=i-j and i-j-k<=18:
if i-j-k<=9:
count+=i-j-k+1
else:
count+=19-i+j+k
print count | 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s815271683 | p00008 | Runtime Error | import sys
c = [0 for i in range(37)]
for i in range(10):
for j in range(10):
for k in range(10):
for l in range(10):
c[i+j+k+l] += 1
for line in sys.stdin:
print(c[int(line)]) | 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s863786717 | p00008 | Runtime Error | import sys
c = [0 for i in range(37)]
for i in range(10):
for j in range(10):
for k in range(10):
for l in range(10):
t = i + j + k + l
c[t] += 1
for line in sys.stdin:
print(c[int(line)]) | 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s511899550 | p00008 | Runtime Error | import sys
c = [0 for i in range(37)]
for i in range(10):
for j in range(10):
for k in range(10):
for l in range(10):
c[i+j+k+l] += 1
for line in sys.stdin:
n = int(line)
print(c[n]) | 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s141875216 | p00008 | Runtime Error | import sys
import math
def case(a,b):
return math.factorial(a+b)/(math.factorial(a)*math.factorial(b))
while True:
try:
if n >= 37:
print('0')
elif n >= 10 and n <= 36:
print(case(n,4)-case(n-10,3))
else:
print(case(n,4))
except EOFError:
break | 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s217051865 | p00008 | Runtime Error | import sys
for e in sys.stdin:
e=int(e);x=range(10);ff=0
ff+=1 for a in x for b in x for c in x for d in x if a+b+c+d==e
print (ff)
| 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s876336704 | p00008 | Runtime Error | import sys
a=[0]*51
for i in range(51):
a[i]=sum([1 for a in x for b in x for c in x for d in x if a+b+c+d==e]))
for e in sys.stdin:
print(a[int(e)])
| 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s836878369 | p00008 | Runtime Error | for line in sys.stdin:
ans = 0
n = int(line)
for a in range(10):
for b in range(10):
for c in range(10):
if 0 <= n-a-b-c <= 9:
ans += 1
print(ans)
| 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s936448951 | p00008 | Runtime Error | ans = []
for line in sys.stdin:
answ = 0
n = int(line)
for a in range(10):
for b in range(10):
for c in range(10):
if 0 <= n-a-b-c <= 9:
answ += 1
ans.append(answ)
for i in ans:
print(i)
| 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s847411414 | p00008 | Runtime Error | ans = []
for line in sys.stdin:
answ = 0
try:
n = int(line)
except:
break
for a in range(10):
for b in range(10):
for c in range(10):
if 0 <= n-a-b-c <= 9:
answ += 1
ans.append(answ)
print(*ans,sep="\n")
| 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s891060230 | p00008 | Runtime Error | import itertools
while True:
try: n=int(input())
except EOEError: break
ans=0
for (i,j,k) in itertools.product(range(10),range(10),range(10)):
ans+=(0<=n-(i+j+k)<=9)
print(ans)
| 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
s292447032 | p00008 | Runtime Error | lst=[0 for i in range(50)]
for a in range(10):
for b in range(10):
for c in range(10):
for d in range(10):
lst[a+b+c+d] += 1
while i:
try:
print(lst[int(input())])
except:
break
| 35
1
| 4
4
|
<H1>Sum of 4 Integers</H1>
<p>
Write a program which reads an integer <var>n</var> and identifies the number of combinations of <var>a, b, c</var> and <var>d</var> (0 ≤ <var>a, b, c, d</var> ≤ 9) which meet the following equality:<br>
<br>
<var>a + b + c + d = n</var><br>
<br>
For example, for <var>n</var> = 35, we have 4 different combinations of (<var>a, b, c, d</var>): (<var>8, 9, 9, 9</var>), (<var>9, 8, 9, 9</var>), (<var>9, 9, 8, 9</var>), and (<var>9, 9, 9, 8</var>).
</p>
<H2>Input</H2>
<p>
The input consists of several datasets. Each dataset consists of <var>n</var> (1 ≤ <var>n</var> ≤ 50) in a line. The number of datasets is less than or equal to 50.
</p>
<H2>Output</H2>
<p>
Print the number of combination in a line.
</p>
<H2>Sample Input</H2>
<pre>
35
1
</pre>
<H2>Output for the Sample Input</H2>
<pre>
4
4
</pre>
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.