submission_id string | problem_id string | status string | code string | input string | output string | problem_description string |
|---|---|---|---|---|---|---|
s299820713 | p00008 | Accepted | import sys
for i in sys.stdin.readlines():
n = int(i[:-1])
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>
|
s201031545 | p00008 | Accepted | def solve(remains, num=4):
if remains > 9 * num or remains < 0:
return 0
if num == 1:
return 1
return sum(solve(remains - i, num - 1) for i in range(10))
while True:
try:
print(solve(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>
|
s018302388 | p00008 | Accepted | while True:
try:
n = int(input())
output = 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:
output = output + 1
print(str(output))
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>
|
s509378702 | p00008 | Accepted | import sys
import itertools
def main():
l = list(range(10))
while True:
data = sys.stdin.readline().strip()
if data is None or data == '':
break
num = int(data)
#print('num:', num)
cnt = 0
for elem in itertools.product(l, repeat=4):
sum = 0
for i in elem:
sum += i
if sum == num:
cnt += 1
print(cnt)
if __name__ == '__main__':
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>
|
s678269357 | p00008 | Accepted | import sys
for line in sys.stdin:
n=int(line)
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>
|
s779076417 | p00008 | Accepted | import sys
for line in sys.stdin:
n = int(line)
num = 0
for a in range(0, 10):
for b in range(0, 10):
for c in range(0, 10):
for d in range(0, 10):
if a+b+c+d == n:
num += 1
print(num) | 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>
|
s741660281 | p00008 | Accepted | import sys
for num in sys.stdin:
num = int(num)
counter = 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) == num:
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>
|
s152548252 | p00008 | Accepted | while True:
try:
n=input()
cnt = 0
for a in range(0,10):
for b in range(0,10):
for c in range(0,10):
for d in range(0,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>
|
s137984907 | p00008 | Accepted | import itertools
def combination(n):
m=0
for i in itertools.product(range(10),repeat=4):
(a,b,c,d)=i
if a+b+c+d==n:
m+=1
return m
while True:
try:
n=int(input())
print(combination(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>
|
s627881104 | p00008 | Accepted | import sys
def count_combination(n):
count = 0
for i in range(10):
for j in range(10):
for k in range(10):
l = n - (i + j + k)
if l >= 0 and l < 10:
count += 1
return count
for line in sys.stdin:
n = int(line)
print(count_combination(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>
|
s694911386 | p00008 | Accepted | import sys
dataset = sys.stdin.readlines()
for n in dataset:
n = int(n)
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>
|
s465441169 | p00008 | Accepted | # -*- coding: utf-8 -*-
import sys
def sum_intergers(n, k=4, last=True):
clip_9 = lambda x: x if x < 10 else 9
if k > 1:
c = sum_intergers(n, k=k-1, last=False)
else:
return [(s,) for s in range(clip_9(n)+1)]
ret = []
for cc in c:
sum_cc = sum(cc) # memorize
for s in range(clip_9(n-sum_cc)+1):
if not last or s+sum_cc==n:
r = [p for p in cc]
r.append(s)
ret.append(tuple(r))
return ret
def main():
ns = [int(n) for n in sys.stdin]
for n in ns:
c = len(sum_intergers(n, k=4))
print(c)
if __name__ == '__main__':
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>
|
s482293746 | p00008 | Accepted | import sys
for n in sys.stdin:
num = 0
n = int(n.replace("\n",""))
for i in range(0, 10000):
s = sum([i%10, int(i/10)%10, int(i/100)%10, int(i/1000)])
if n == s:
num += 1
print(num) | 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>
|
s411373261 | p00008 | Accepted | def sumint(n,num):
if num==2:
if n>18: return 0
else:
c=0
for i in range(10):
if 0<=n-i<10:c+=1
return c
ret=0
for i in range(10):
ret=ret+sumint(n-i,num-1)
return ret
while True:
try:n=int(input())
except:break
if n>36:print(0)
else:
print(sumint(n,4)) | 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>
|
s925578326 | p00008 | Accepted | while True:
try:
n = int(input())
c = 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 : 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>
|
s259852562 | p00008 | Accepted | import sys
for line in sys.stdin:
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)==int(line): 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>
|
s269849821 | p00008 | Accepted | import sys
for line in sys.stdin:
N = int(line)
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>
|
s121497848 | p00008 | Accepted | answermap=[0]*51
answermap[0] = 1
answermap[1] = 4
answermap[2] = 10
answermap[3] = 20
answermap[4] = 35
answermap[5] = 56
answermap[6] = 84
answermap[7] = 120
answermap[8] = 165
answermap[9] = 220
answermap[10] = 282
answermap[11] = 348
answermap[12] = 415
answermap[13] = 480
answermap[14] = 540
answermap[15] = 592
answermap[16] = 633
answermap[17] = 660
answermap[18] = 670
answermap[19] = 660
answermap[20] = 633
answermap[21] = 592
answermap[22] = 540
answermap[23] = 480
answermap[24] = 415
answermap[25] = 348
answermap[26] = 282
answermap[27] = 220
answermap[28] = 165
answermap[29] = 120
answermap[30] = 84
answermap[31] = 56
answermap[32] = 35
answermap[33] = 20
answermap[34] = 10
answermap[35] = 4
answermap[36] = 1
answermap[37] = 0
answermap[38] = 0
answermap[39] = 0
answermap[40] = 0
answermap[41] = 0
answermap[42] = 0
answermap[43] = 0
answermap[44] = 0
answermap[45] = 0
answermap[46] = 0
answermap[47] = 0
answermap[48] = 0
answermap[49] = 0
answermap[50] = 0
inputs = []
while True:
try:
inputs.append(int(input()))
except EOFError:
break
for i in inputs:
print(answermap[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>
|
s106109848 | p00008 | Accepted | import sys
[print(len([True 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 == int(x)])) for x 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>
|
s504776948 | p00008 | Accepted | import sys
[print(sum([1 if sum([a, b, c, d]) == int(x) else 0 for a in range(10) for b in range(10) for c in range(10) for d in range(10)])) for x 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>
|
s266732542 | p00008 | Accepted | while True:
try:
n = int(input())
except:
break
s = 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:
s += 1
print(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>
|
s878018494 | p00008 | Accepted | while True:
try:
n = int(input())
Num = 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:
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>
|
s688201443 | p00008 | Accepted | def rec(i,n):
r=0
if i==4:
return 1 if n==0 else 0
for m in range(10):
r+=rec(i+1,n-m)
return r
while True:
try:
n=int(input())
print(rec(0,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>
|
s160808241 | p00008 | Accepted |
memo=[[0]*51 for i in range(5)]
def rec(i,n):
if memo[i][n]!=0:
return memo[i][n]
if i==4:
return 1 if n==0 else 0
for m in range(10):
memo[i][n]+=rec(i+1,n-m)
return memo[i][n]
while True:
try:
n=int(input())
print(rec(0,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>
|
s284522512 | p00008 | Accepted | memo=[[-1]*51 for i in range(5)]
def rec(i,n):
if memo[i][n]!=-1:
return memo[i][n]
r=0
if i==4:
return 1 if n==0 else 0
for m in range(10):
r+=rec(i+1,n-m)
memo[i][n]=r
return r
while True:
try:
n=int(input())
print(rec(0,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>
|
s752576838 | p00008 | Accepted | from collections import deque
import sys
def solve(n, target):
""" 0-9?????§?????°???n???????¶?????????¨??§???target??????????????????????????? """
if n <= 1:
if 0 <= target <=9:
Q.append(target)
return target
else:
return None
else:
for i in range(10):
res = solve(n - 1, target - i)
Q = deque()
if __name__ == '__main__':
# ??????????????\???
for line in sys.stdin:
target = int(line)
result = solve(4, target)
print(len(Q))
Q.clear() | 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>
|
s778116591 | p00008 | Accepted | import sys
values = []
for line in sys.stdin:
values.append(int(line))
for v in values:
ans = [1 for i in range(10) for j in range(10) for k in range(10) for l in range(10) if v == 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>
|
s824796120 | p00008 | Accepted | r = range
while True:
try:
n = int(input())
ans = []
ans = [(a,b,c,d) for a in r(10) for b in r(10) for c in r(10) for d in r(10) if a+b+c+d==n and (a,b,c,d) not in ans]
print(len(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>
|
s464196875 | p00008 | Accepted | import sys
p = [0] * 51
v = 0
for i in range(10):
p[i] = p[36-i] = (i+3)*(i+2)*(i+1)//6
for i in range(10,19):
p[i] = p[36-i] = (i+1)*(i+2)*(i+3)//6 - 2*(i-9)*(i-8)*(i-7)//3
for i in sys.stdin:
print(p[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>
|
s792283578 | p00008 | Accepted | import sys
p = [0] * 51
for i in range(10):
p[i] = p[36-i] = (i+3)*(i+2)*(i+1)//6
for i in range(10,19):
p[i] = p[36-i] = (i+1)*(i+2)*(i+3)//6 - 2*(i-9)*(i-8)*(i-7)//3
for i in sys.stdin:
print(p[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>
|
s590785373 | p00008 | Accepted | import sys
p = [0] * 51
for i in range(19):
p[i] = p[36-i] = (i+3)*(i+2)*(i+1)//6 - max(2*(i-9)*(i-8)*(i-7)//3,0)
for i in sys.stdin:
print(p[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>
|
s279924814 | p00008 | Accepted | import sys
def getsum(n):
if n > 36: return 0
else:
i = n if n < 19 else 36-n
return (i+3)*(i+2)*(i+1)//6 - max(2*(i-9)*(i-8)*(i-7)//3,0)
for i in sys.stdin:
print(getsum(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>
|
s492362451 | 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+k+j+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>
|
s951804760 | p00008 | Accepted | # -*- coding:utf-8 -*-
import sys
x = [0]*51
for a in range(10):
for b in range(10):
for c in range(10):
for d in range(10):
x[a+b+c+d] += 1
array = []
for i in sys.stdin:
array.append(i)
for k in range(len(array)):
n = array[k]
print(x[int(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>
|
s391559155 | 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>
|
s619904159 | p00008 | Accepted | import sys
while True:
n = sys.stdin.readline()
if not n: break
n = int(n.rstrip())
count=0
for a in range(10):
for b in range(10):
for c in range(10):
if 0 <= n-a-b-c and n-a-b-c <= 9:
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>
|
s624323176 | p00008 | Accepted | while True:
try:
cnt = 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:
cnt = cnt + 1
print(str(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>
|
s270753030 | p00008 | Accepted | import sys
import itertools
for line in sys.stdin:
n = int(line)
cnt = 0;
for element in itertools.product(range(10), repeat=4):
if sum(element) == 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>
|
s845872727 | p00008 | Accepted | #!/usr/bin/env python
# -*- conding: utf-8 -*-
import itertools
import sys
import math
for line in sys.stdin.readlines():
n = int(line.strip())
if n > 36:
print(0)
continue
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 and d <= 9:
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>
|
s765640781 | p00008 | Accepted | #!/usr/bin/env python
# -*- conding: utf-8 -*-
import itertools
import sys
import math
for line in sys.stdin.readlines():
n = int(line.strip())
if n > 36:
print(0)
continue
elif n == 36:
print(1)
continue
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 and d <= 9:
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>
|
s910376974 | p00008 | Accepted | #!/usr/bin/env python
# -*- conding: utf-8 -*-
import sys
for line in sys.stdin.readlines():
n = int(line.strip())
if n > 36:
print(0)
continue
elif n == 36:
print(1)
continue
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 and d <= 9:
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>
|
s308744670 | p00008 | Accepted | while True:
try:
num=int(input())
except:
break
sum=0
Range=10
for a in range(Range):
for b in range(Range):
for c in range(Range):
for d in range(Range):
if num==a+b+c+d:
sum+=1
print(sum) | 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>
|
s587318634 | p00008 | Accepted | import sys
import math as mas
x=[0]*60
for i in range(10):
for j in range(10):
for k in range(10):
for l in range(10):
x[i+j+k+l]+=1
for i in sys.stdin:
print(x[int(i)])
# a,b=map(int,i.split())
# print(gcd(a,b),lcm(a,b)) | 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>
|
s826982429 | p00008 | Accepted | import sys
from collections import defaultdict
from itertools import product
d = defaultdict(int)
for x in product(range(10), repeat=4):
d[sum(x)] += 1
for s in sys.stdin:
print(d[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>
|
s475079406 | p00008 | Accepted | while True:
try:
n = 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 = 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>
|
s307702918 | p00008 | Accepted | # -*- coding: utf-8 -*-
import sys
import os
import math
lst = sys.stdin.readlines()
#print(lst)
for s in lst:
cnt = 0
target_val = int(s)
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 == target_val:
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>
|
s288362854 | p00008 | Accepted | import sys
for n in sys.stdin:
n = int(n)
ct = 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:
ct += 1
print (ct) | 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>
|
s469141885 | p00008 | Accepted | import sys
def count(number) :
Ranges = [(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 == number]
return len(Ranges)
for make in sys.stdin : print(count(int(make))) | 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>
|
s768894653 | p00008 | Accepted | for _ in range(50):
try:
n = int(input()) # 1 <= n <= 50
ans =set()
for a in range(10):
if (n - a) >= 1:
for b in range(10):
if(n - a -b) >= 1:
for c in range(10):
if(n - a - b - c) >= 1:
for d in range(10):
if(n - a - b - c - d) == 0:
ans.add("{},{},{},{}".format(a,b,c,d))
ans.add("{},{},{},{}".format(b,c,d,a))
ans.add("{},{},{},{}".format(c,d,a,b))
ans.add("{},{},{},{}".format(d,a,b,c))
print(len(ans))
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>
|
s442846100 | p00008 | Accepted | import sys
for line in sys.stdin:
num = int(line)
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 == num:
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>
|
s450198514 | p00008 | Accepted | import sys
import math
for line in sys.stdin:
N = int(line.rstrip())
count = 0
for i0 in range(10):
for i1 in range(10):
for i2 in range(10):
for i3 in range(10):
if sum([i0,i1,i2,i3]) == N:
count += 1
break
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>
|
s680920588 | p00008 | Accepted | combi = []
for i in range(0, 51):
combi.append(0)
for a in range(0, 10):
for b in range(0, 10):
for c in range(0, 10):
for d in range(0, 10):
combi[a+b+c+d] += 1
while True:
try:
n = int(raw_input())
print combi[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>
|
s930852276 | 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>
|
s099222929 | p00008 | Accepted | import sys
for line in sys.stdin:
n = int(line)
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
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>
|
s930449618 | p00008 | Accepted | import sys
t = [0 for i in range(10000)]
c = 0
for i in range(10):
for j in range(10):
for k in range(10):
for l in range(10):
t[c] = i + j + k + l
c += 1
for line in sys.stdin:
print(t.count(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>
|
s619163049 | p00008 | Accepted | import sys
t = [0 for i in range(10000)]
c = 0
for i in range(10):
for j in range(10):
for k in range(10):
for l in range(10):
t[c] = i + j + k + l
c += 1
for line in sys.stdin:
n = int(line)
print(t.count(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>
|
s423551356 | p00008 | Accepted | import sys
t = [None for i in range(10000)]
c = 0
for i in range(10):
for j in range(10):
for k in range(10):
for l in range(10):
t[c] = i + j + k + l
c += 1
for line in sys.stdin:
print(t.count(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>
|
s590686976 | p00008 | Accepted | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
import sys
def main():
for line in sys.stdin:
n = int(line)
cnt = 0
for a in range(0,10):
for b in range(0,10):
for c in range(0,10):
for d in range(0,10):
if a+b+c+d==n: cnt += 1
print(cnt)
if __name__ == "__main__": 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>
|
s014954438 | p00008 | Accepted | def main():
import sys
table = [0]*51
for a in range(10):
for b in range(10):
for c in range(10):
for d in range(10):
table[a+b+c+d] += 1
for line in sys.stdin:
n = int(line)
print(table[n])
if __name__ == '__main__':
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>
|
s197695794 | p00008 | Accepted | from itertools import product
import sys
a = []
for line in sys.stdin:
a.append(int(line.strip()))
p = list(product(range(0, 10), range(0, 10), range(0, 10), range(0, 10)))
for n in a:
cnt = 0;
for e in p:
if sum(e) == 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>
|
s590337996 | p00008 | Accepted | import sys
for n in sys.stdin:
print(len([0 for a in range(10)for b in range(10)for c in range(10)for d in range(10) if int(n)==a+b+c+d])) | 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>
|
s051560315 | p00008 | Accepted | import sys
def count(n):
k = 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:
k += 1
return k
for line in sys.stdin:
print(count(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>
|
s174522165 | p00008 | Accepted | import fileinput
for n in fileinput.input():
n = int(n)
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>
|
s679404238 | p00008 | Accepted | import sys
for user in sys.stdin:
n = int(user)
num = 0
for a in range(10):
for b in range(10):
for c in range(10):
for d in range(10):
if(n == a + b + c + d):
num += 1
print(num) | 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>
|
s250646691 | p00008 | Accepted | import sys
import itertools as it
num = [i for i in range(0,10)]
line = sys.stdin.readlines()
for n in line:
n = int(n)
count = 0
for i in it.product(num, repeat=4):
if sum(i) == 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>
|
s013081306 | p00008 | Accepted | import sys
def main():
istr = sys.stdin.read()
wi = list(map(int,istr.splitlines()))
for n in wi:
""" ????????? """
cnt = 0
for a in range(10):
for b in range(10):
for c in range(10):
for d in range(10):
x = a + b + c + d
if x == n:
cnt += 1
elif x > n:
break
print(cnt)
if __name__ == '__main__':
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>
|
s076761595 | p00008 | Accepted | import sys
import itertools
v = list(range(10))
for line in sys.stdin:
n = int(line)
res = 0
for i in itertools.product(v, repeat=4):
sum = 0
for y in i:
sum += y
if sum == n:
res += 1
print(res) | 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>
|
s138776929 | p00008 | Accepted | while 1:
try:
count=0
x=int(input())
for i in reversed(range(10)):
if 0<=x-i<=27:
for j in reversed(range(10)):
if 0<=x-i-j<=18:
for z in reversed(range(10)):
if 0<=x-i-j-z<=9:
for y in reversed(range(10)):
if x-i-j-z-y==0:
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>
|
s475260173 | p00008 | Accepted | # Aizu Problem 0008: Sum of 4 Integers
#
import sys, math, os
# read input:
PYDEV = os.environ.get('PYDEV')
if PYDEV=="True":
sys.stdin = open("sample-input.txt", "rt")
def sum4(n):
ans = 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:
ans += 1
return ans
mem = {}
for line in sys.stdin:
n = int(line)
if n in mem:
print(mem[n])
else:
ans = sum4(n)
mem[n] = ans
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>
|
s797775949 | p00008 | Accepted | while True:
try:
n = int(raw_input())
except EOFError:
break
ans = 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:
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>
|
s187616619 | p00008 | Accepted | import sys
for l in sys.stdin:
n = int(l)
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>
|
s141899721 | p00008 | Accepted | anss=[]
while True:
try:
ans=0
goal=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==goal:
ans+=1
anss.append(ans)
except:
break
for ans in anss:
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>
|
s352664963 | p00008 | Accepted | import sys
for line in sys.stdin:
count = 0
n = int(line)
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) | 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>
|
s394029782 | p00008 | Accepted | import sys
def rec(j,s):
if s > n:
return 0
if s == n:
return 1
if j == 0:
return 0
v = 0
for i in range(10):
v += rec(j-1, s + i)
return v
n = sys.stdin.readline()
while n:
n = int(n)
print(rec(4,0))
n = sys.stdin.readline() | 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>
|
s210758588 | p00008 | Accepted | x=[0]*51
for a in range(10):
for b in range(10):
for c in range(10):
for d in range(10):
x[a+b+c+d]+=1
while True:
try:
print(x[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>
|
s349472727 | p00008 | Accepted | t = 0
while t == 0:
p = 0
try:
n = int(input())
except:
break
else:
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):
p += 1
print(p) | 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>
|
s262067758 | p00008 | Accepted | num = []
while True:
try:
num.append(int(input()))
except EOFError:
break
for i in num:
s = set()
for a in range(10):
if i-a > 27:
continue
for b in range(10):
if i-a-b > 18:
continue
for c in range(10):
if i-a-b-c > 9:
continue
elif i-a-b-c < 0:
break
else:
s.add(str(a)+str(b)+str(c)+str(i-a-b-c))
print(len(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>
|
s794860949 | p00008 | Accepted | import sys
import itertools
def countcombi(n):
r = 0
p = list(itertools.product(range(0,10),repeat = 4))
for tmp in p:
if sum(tmp) == n:
r += 1
return r
if __name__ == '__main__':
for line in sys.stdin:
n = (int)(line)
print(countcombi(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>
|
s104241331 | p00008 | Accepted | # -*-coding:utf-8
#????????????????????°
import fileinput
def main():
for line in fileinput.input():
tokens = list(map(int, line.strip().split()))
number = tokens[0]
ans = 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) == number):
ans += 1
print(ans)
if __name__ == '__main__':
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>
|
s095801391 | p00008 | Accepted | import sys
#from me.io import dup_file_stdin
#@dup_file_stdin
def solve():
for s in map(int,sys.stdin):
results=set()
for a in range(10):
for b in range(10):
for c in range(10):
d = s-a-b-c
if d<0:break
if d<=9: results.add((a,b,c,d))
print(len(results))
solve() | 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>
|
s236317241 | p00008 | Accepted | # coding=utf-8
def making_n(usable_numbers: int, target: int) -> int:
if usable_numbers == 1:
if 0 <= target <= 9:
return 1
return 0
count = []
for i in range(10):
count.append(making_n(usable_numbers - 1, target - i))
return sum(count)
if __name__ == '__main__':
while True:
try:
n = int(input())
except EOFError:
break
print(making_n(4, 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>
|
s264667732 | p00008 | Accepted | while True:
try:
n = int(input())
c = 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: 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>
|
s609653175 | p00008 | Accepted | # coding: utf-8
while True:
try:
n = int(raw_input())
cnt = 0
for i in range(10):
for j in range(10):
for k in range(10):
if n-i-j-k >= 0 and n-i-j-k <= 9:
#print("{:}-{:}-{:}-{:}={:}".format(n,i,j,k,n-i-j-k))
cnt += 1
print cnt
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>
|
s432047213 | p00008 | Accepted | while True:
try:
sum = 0
n = int(raw_input())
for a in range(10):
for b in range(10):
for c in range(10):
for d in range(10):
#print a , b, c, d
#print n
if (a+b+c+d == n):
sum += 1
print sum
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>
|
s868425631 | p00008 | Accepted | import sys
answer = [0] * 51
for a in range(10):
for b in range(10):
for c in range(10):
for d in range(10):
answer[a + b + c + d] += 1
for line in sys.stdin:
try:
print(answer[int(line)])
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>
|
s106893394 | p00008 | Accepted | while True:
try:
num = 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==num:
count+=1
print(int(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>
|
s153120972 | p00008 | Accepted | while True:
try:
n = int(input())
except:
break
ans = 0
for a in range(10):
for b in range(10):
for c in range(10):
d = n - (a + b + c)
ans += 0 <= d <= 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>
|
s984393531 | p00008 | Accepted | while True:
try:
n = int(input())
except:
break
ans = 0
table = [[a,b,c,d] for a in range(10) for b in range(10) for c in range(10) for d in range(10)]
for abcd in table:
ans += sum(abcd) == n
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>
|
s530594549 | p00008 | Accepted | def get_input():
while True:
try:
yield ''.join(input())
except EOFError:
break
N = list(get_input())
for l in range(len(N)):
n = int(N[l])
ans = 0
for a in range(min(n+1,10)):
for b in range(min(n+1-a,10)):
for c in range(min(n+1-a-b,10)):
for d in range(min(n+1-a-b-c,10)):
if a+b+c+d == n:
#print(a,b,c,d)
ans = 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>
|
s825608271 | p00008 | Accepted | while True:
try:n=int(input())
except:break
ans=0
for i in range(10):
for j in range(10):
for f in range(10):
for e in range(10):
if i+j+f+e==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>
|
s326280280 | p00008 | Accepted | import sys
for e in sys.stdin:
e=int(e);n=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==e:n+=1
print(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>
|
s788280744 | p00008 | Accepted | import sys
for e in sys.stdin:
x=range(10)
print(sum([1 for a in x for b in x for c in x for d in x if a+b+c+d==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>
|
s296709952 | p00008 | Accepted | import sys
for e in sys.stdin:
n=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==int(e):n+=1
print(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>
|
s141831825 | p00008 | Accepted | import sys
for e in sys.stdin:
e=int(e);x=range(10)
print(sum([1 for a in x for b in x for c in x for d in x if a+b+c+d==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>
|
s422396125 | p00008 | Accepted | import sys
a=[0]*51
for i in range(19):
a[i]=a[36-i]=(i+3)*(i+2)*(i+1)//6-max(2*(i-9)*(i-8)*(i-7)//3,0)
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>
|
s750542633 | p00008 | Accepted | import sys
a=[0]*51;x=range(10)
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==i])
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>
|
s993956777 | p00008 | Accepted | import sys
a=[0]*51;x=range(10)
for i in range(51):
a[i]=sum([1 for p in x for q in x for r in x for s in x if p+q+r+s==i])
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>
|
s715905073 | p00008 | Accepted | import sys
a=[0]*51
for i in range(10):a[i]=a[36-i]=(i+3)*(i+2)*(i+1)//6
for i in range(10,19):a[i]=a[36-i]=(i+3)*(i+2)*(i+1)//6-a[i-10]*4
for e in map(int,sys.stdin):print(a[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>
|
s054737202 | p00008 | Accepted | import sys
a=[0]*51
for i in range(19):
a[i]=a[36-i]=(i+3)*(i+2)*(i+1)//6-[0,a[i-10]*4][i>9]
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>
|
s696719873 | p00008 | Accepted | import sys
a=[0]*51
for i in range(19):a[i]=a[36-i]=(i+3)*(i+2)*(i+1)//6-[0,a[i-10]*4][i>9]
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>
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.