submission_id string | problem_id string | status string | code string | input string | output string | problem_description string |
|---|---|---|---|---|---|---|
s526954183 | p00001 | Runtime Error | "\n".join(sorted([input() for i in range(10)])[:-3:-1]) | 1819
2003
876
2840
1723
1673
3776
2848
1592
922
| 3776
2848
2840
|
<H1>List of Top 3 Hills</H1>
<p>
There is a data which provides heights (in meter) of mountains. The data is only for ten mountains.
</p>
<p>
Write a program which prints heights of the top three mountains in descending order.
</p>
<H2>Input</H2>
<pre>
Height of mountain 1
Height of mountain 2
Height of mountain 3
.
.
Height of mountain 10
</pre>
<h2>Constraints</h2>
<p>
0 ≤ height of mountain (integer) ≤ 10,000
</p>
<H2>Output</H2>
<pre>
Height of the 1st mountain
Height of the 2nd mountain
Height of the 3rd mountain
</pre>
<H2>Sample Input 1</H2>
<pre>
1819
2003
876
2840
1723
1673
3776
2848
1592
922
</pre>
<H2>Output for the Sample Input 1</H2>
<pre>
3776
2848
2840
</pre>
<H2>Sample Input 2</H2>
<pre>
100
200
300
400
500
600
700
800
900
900
</pre>
<H2>Output for the Sample Input 2</H2>
<pre>
900
900
800
</pre>
|
s556369804 | p00001 | Runtime Error | import sys
input_list = list()
for i in sys.stdin.readlines():
input_list.append(int(i))
for i in sorted(input_list, reversed=True)[:3]:
print i | 1819
2003
876
2840
1723
1673
3776
2848
1592
922
| 3776
2848
2840
|
<H1>List of Top 3 Hills</H1>
<p>
There is a data which provides heights (in meter) of mountains. The data is only for ten mountains.
</p>
<p>
Write a program which prints heights of the top three mountains in descending order.
</p>
<H2>Input</H2>
<pre>
Height of mountain 1
Height of mountain 2
Height of mountain 3
.
.
Height of mountain 10
</pre>
<h2>Constraints</h2>
<p>
0 ≤ height of mountain (integer) ≤ 10,000
</p>
<H2>Output</H2>
<pre>
Height of the 1st mountain
Height of the 2nd mountain
Height of the 3rd mountain
</pre>
<H2>Sample Input 1</H2>
<pre>
1819
2003
876
2840
1723
1673
3776
2848
1592
922
</pre>
<H2>Output for the Sample Input 1</H2>
<pre>
3776
2848
2840
</pre>
<H2>Sample Input 2</H2>
<pre>
100
200
300
400
500
600
700
800
900
900
</pre>
<H2>Output for the Sample Input 2</H2>
<pre>
900
900
800
</pre>
|
s700829087 | p00001 | Runtime Error | height = []
while 1:
h = raw_input()
if h == '': break
h = int(h)
height.append(h)
height.sort(reverse=True)
for i in range(3):
print height[i] | 1819
2003
876
2840
1723
1673
3776
2848
1592
922
| 3776
2848
2840
|
<H1>List of Top 3 Hills</H1>
<p>
There is a data which provides heights (in meter) of mountains. The data is only for ten mountains.
</p>
<p>
Write a program which prints heights of the top three mountains in descending order.
</p>
<H2>Input</H2>
<pre>
Height of mountain 1
Height of mountain 2
Height of mountain 3
.
.
Height of mountain 10
</pre>
<h2>Constraints</h2>
<p>
0 ≤ height of mountain (integer) ≤ 10,000
</p>
<H2>Output</H2>
<pre>
Height of the 1st mountain
Height of the 2nd mountain
Height of the 3rd mountain
</pre>
<H2>Sample Input 1</H2>
<pre>
1819
2003
876
2840
1723
1673
3776
2848
1592
922
</pre>
<H2>Output for the Sample Input 1</H2>
<pre>
3776
2848
2840
</pre>
<H2>Sample Input 2</H2>
<pre>
100
200
300
400
500
600
700
800
900
900
</pre>
<H2>Output for the Sample Input 2</H2>
<pre>
900
900
800
</pre>
|
s634850767 | p00001 | Runtime Error | list=[]
for i in range(10):
list.append(input())
list.sort(reverse=true)
for i in range(3):
print list[i] | 1819
2003
876
2840
1723
1673
3776
2848
1592
922
| 3776
2848
2840
|
<H1>List of Top 3 Hills</H1>
<p>
There is a data which provides heights (in meter) of mountains. The data is only for ten mountains.
</p>
<p>
Write a program which prints heights of the top three mountains in descending order.
</p>
<H2>Input</H2>
<pre>
Height of mountain 1
Height of mountain 2
Height of mountain 3
.
.
Height of mountain 10
</pre>
<h2>Constraints</h2>
<p>
0 ≤ height of mountain (integer) ≤ 10,000
</p>
<H2>Output</H2>
<pre>
Height of the 1st mountain
Height of the 2nd mountain
Height of the 3rd mountain
</pre>
<H2>Sample Input 1</H2>
<pre>
1819
2003
876
2840
1723
1673
3776
2848
1592
922
</pre>
<H2>Output for the Sample Input 1</H2>
<pre>
3776
2848
2840
</pre>
<H2>Sample Input 2</H2>
<pre>
100
200
300
400
500
600
700
800
900
900
</pre>
<H2>Output for the Sample Input 2</H2>
<pre>
900
900
800
</pre>
|
s406654659 | p00001 | Runtime Error | nums = []
while True:
n = raw_input()
if not n: break
nums.append(int(n))
nums.sort(reverse=True)
for i in range(3): print nums[i] | 1819
2003
876
2840
1723
1673
3776
2848
1592
922
| 3776
2848
2840
|
<H1>List of Top 3 Hills</H1>
<p>
There is a data which provides heights (in meter) of mountains. The data is only for ten mountains.
</p>
<p>
Write a program which prints heights of the top three mountains in descending order.
</p>
<H2>Input</H2>
<pre>
Height of mountain 1
Height of mountain 2
Height of mountain 3
.
.
Height of mountain 10
</pre>
<h2>Constraints</h2>
<p>
0 ≤ height of mountain (integer) ≤ 10,000
</p>
<H2>Output</H2>
<pre>
Height of the 1st mountain
Height of the 2nd mountain
Height of the 3rd mountain
</pre>
<H2>Sample Input 1</H2>
<pre>
1819
2003
876
2840
1723
1673
3776
2848
1592
922
</pre>
<H2>Output for the Sample Input 1</H2>
<pre>
3776
2848
2840
</pre>
<H2>Sample Input 2</H2>
<pre>
100
200
300
400
500
600
700
800
900
900
</pre>
<H2>Output for the Sample Input 2</H2>
<pre>
900
900
800
</pre>
|
s125423610 | p00001 | Runtime Error | l=[]
while True:
s = raw_input()
if s=="":
break
l.append(s)
l.sort()
l.reverse()
for i in range(3):
print l.pop(0) | 1819
2003
876
2840
1723
1673
3776
2848
1592
922
| 3776
2848
2840
|
<H1>List of Top 3 Hills</H1>
<p>
There is a data which provides heights (in meter) of mountains. The data is only for ten mountains.
</p>
<p>
Write a program which prints heights of the top three mountains in descending order.
</p>
<H2>Input</H2>
<pre>
Height of mountain 1
Height of mountain 2
Height of mountain 3
.
.
Height of mountain 10
</pre>
<h2>Constraints</h2>
<p>
0 ≤ height of mountain (integer) ≤ 10,000
</p>
<H2>Output</H2>
<pre>
Height of the 1st mountain
Height of the 2nd mountain
Height of the 3rd mountain
</pre>
<H2>Sample Input 1</H2>
<pre>
1819
2003
876
2840
1723
1673
3776
2848
1592
922
</pre>
<H2>Output for the Sample Input 1</H2>
<pre>
3776
2848
2840
</pre>
<H2>Sample Input 2</H2>
<pre>
100
200
300
400
500
600
700
800
900
900
</pre>
<H2>Output for the Sample Input 2</H2>
<pre>
900
900
800
</pre>
|
s196059089 | p00001 | Runtime Error | l=[]
while True:
try:
l.append(input())
except SyntaxError:
break
l.sort(reverse = True)
for i in range(3):
print l[i] | 1819
2003
876
2840
1723
1673
3776
2848
1592
922
| 3776
2848
2840
|
<H1>List of Top 3 Hills</H1>
<p>
There is a data which provides heights (in meter) of mountains. The data is only for ten mountains.
</p>
<p>
Write a program which prints heights of the top three mountains in descending order.
</p>
<H2>Input</H2>
<pre>
Height of mountain 1
Height of mountain 2
Height of mountain 3
.
.
Height of mountain 10
</pre>
<h2>Constraints</h2>
<p>
0 ≤ height of mountain (integer) ≤ 10,000
</p>
<H2>Output</H2>
<pre>
Height of the 1st mountain
Height of the 2nd mountain
Height of the 3rd mountain
</pre>
<H2>Sample Input 1</H2>
<pre>
1819
2003
876
2840
1723
1673
3776
2848
1592
922
</pre>
<H2>Output for the Sample Input 1</H2>
<pre>
3776
2848
2840
</pre>
<H2>Sample Input 2</H2>
<pre>
100
200
300
400
500
600
700
800
900
900
</pre>
<H2>Output for the Sample Input 2</H2>
<pre>
900
900
800
</pre>
|
s899348260 | p00001 | Runtime Error | x = []
a = 1
while True:
if a != 10:
x.append(int(raw_input()))
a += 1
continue
else:
break
x.sort()
print x[9]
print x[8]
print x[7] | 1819
2003
876
2840
1723
1673
3776
2848
1592
922
| 3776
2848
2840
|
<H1>List of Top 3 Hills</H1>
<p>
There is a data which provides heights (in meter) of mountains. The data is only for ten mountains.
</p>
<p>
Write a program which prints heights of the top three mountains in descending order.
</p>
<H2>Input</H2>
<pre>
Height of mountain 1
Height of mountain 2
Height of mountain 3
.
.
Height of mountain 10
</pre>
<h2>Constraints</h2>
<p>
0 ≤ height of mountain (integer) ≤ 10,000
</p>
<H2>Output</H2>
<pre>
Height of the 1st mountain
Height of the 2nd mountain
Height of the 3rd mountain
</pre>
<H2>Sample Input 1</H2>
<pre>
1819
2003
876
2840
1723
1673
3776
2848
1592
922
</pre>
<H2>Output for the Sample Input 1</H2>
<pre>
3776
2848
2840
</pre>
<H2>Sample Input 2</H2>
<pre>
100
200
300
400
500
600
700
800
900
900
</pre>
<H2>Output for the Sample Input 2</H2>
<pre>
900
900
800
</pre>
|
s940588022 | p00001 | Runtime Error | map(lambda x: print x, sorted(map(lambda _: int(raw_input()), range(10)), reverse = True)[:3]) | 1819
2003
876
2840
1723
1673
3776
2848
1592
922
| 3776
2848
2840
|
<H1>List of Top 3 Hills</H1>
<p>
There is a data which provides heights (in meter) of mountains. The data is only for ten mountains.
</p>
<p>
Write a program which prints heights of the top three mountains in descending order.
</p>
<H2>Input</H2>
<pre>
Height of mountain 1
Height of mountain 2
Height of mountain 3
.
.
Height of mountain 10
</pre>
<h2>Constraints</h2>
<p>
0 ≤ height of mountain (integer) ≤ 10,000
</p>
<H2>Output</H2>
<pre>
Height of the 1st mountain
Height of the 2nd mountain
Height of the 3rd mountain
</pre>
<H2>Sample Input 1</H2>
<pre>
1819
2003
876
2840
1723
1673
3776
2848
1592
922
</pre>
<H2>Output for the Sample Input 1</H2>
<pre>
3776
2848
2840
</pre>
<H2>Sample Input 2</H2>
<pre>
100
200
300
400
500
600
700
800
900
900
</pre>
<H2>Output for the Sample Input 2</H2>
<pre>
900
900
800
</pre>
|
s777448728 | p00001 | Runtime Error | h = [input() for _ in xrange(10)].sort()
h[0:3] | 1819
2003
876
2840
1723
1673
3776
2848
1592
922
| 3776
2848
2840
|
<H1>List of Top 3 Hills</H1>
<p>
There is a data which provides heights (in meter) of mountains. The data is only for ten mountains.
</p>
<p>
Write a program which prints heights of the top three mountains in descending order.
</p>
<H2>Input</H2>
<pre>
Height of mountain 1
Height of mountain 2
Height of mountain 3
.
.
Height of mountain 10
</pre>
<h2>Constraints</h2>
<p>
0 ≤ height of mountain (integer) ≤ 10,000
</p>
<H2>Output</H2>
<pre>
Height of the 1st mountain
Height of the 2nd mountain
Height of the 3rd mountain
</pre>
<H2>Sample Input 1</H2>
<pre>
1819
2003
876
2840
1723
1673
3776
2848
1592
922
</pre>
<H2>Output for the Sample Input 1</H2>
<pre>
3776
2848
2840
</pre>
<H2>Sample Input 2</H2>
<pre>
100
200
300
400
500
600
700
800
900
900
</pre>
<H2>Output for the Sample Input 2</H2>
<pre>
900
900
800
</pre>
|
s695529625 | p00001 | Runtime Error | lis = []
for i in xrange(10):
lis.append(input())
for a in sorted(lis,reversed=True)[:3]:
print a | 1819
2003
876
2840
1723
1673
3776
2848
1592
922
| 3776
2848
2840
|
<H1>List of Top 3 Hills</H1>
<p>
There is a data which provides heights (in meter) of mountains. The data is only for ten mountains.
</p>
<p>
Write a program which prints heights of the top three mountains in descending order.
</p>
<H2>Input</H2>
<pre>
Height of mountain 1
Height of mountain 2
Height of mountain 3
.
.
Height of mountain 10
</pre>
<h2>Constraints</h2>
<p>
0 ≤ height of mountain (integer) ≤ 10,000
</p>
<H2>Output</H2>
<pre>
Height of the 1st mountain
Height of the 2nd mountain
Height of the 3rd mountain
</pre>
<H2>Sample Input 1</H2>
<pre>
1819
2003
876
2840
1723
1673
3776
2848
1592
922
</pre>
<H2>Output for the Sample Input 1</H2>
<pre>
3776
2848
2840
</pre>
<H2>Sample Input 2</H2>
<pre>
100
200
300
400
500
600
700
800
900
900
</pre>
<H2>Output for the Sample Input 2</H2>
<pre>
900
900
800
</pre>
|
s505424746 | p00001 | Runtime Error | #
# AIZU ONLINE JUDGE: List of Top 3 Hills
# cf. http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0001&lang=jp
#
import sys
file = sys.argv[1]
lis = open(file, "r").readlines()
lis = map((lambda x: int(x)), lis)
lis.sort()
lis.reverse()
for height in lis[0:3]:
print height | 1819
2003
876
2840
1723
1673
3776
2848
1592
922
| 3776
2848
2840
|
<H1>List of Top 3 Hills</H1>
<p>
There is a data which provides heights (in meter) of mountains. The data is only for ten mountains.
</p>
<p>
Write a program which prints heights of the top three mountains in descending order.
</p>
<H2>Input</H2>
<pre>
Height of mountain 1
Height of mountain 2
Height of mountain 3
.
.
Height of mountain 10
</pre>
<h2>Constraints</h2>
<p>
0 ≤ height of mountain (integer) ≤ 10,000
</p>
<H2>Output</H2>
<pre>
Height of the 1st mountain
Height of the 2nd mountain
Height of the 3rd mountain
</pre>
<H2>Sample Input 1</H2>
<pre>
1819
2003
876
2840
1723
1673
3776
2848
1592
922
</pre>
<H2>Output for the Sample Input 1</H2>
<pre>
3776
2848
2840
</pre>
<H2>Sample Input 2</H2>
<pre>
100
200
300
400
500
600
700
800
900
900
</pre>
<H2>Output for the Sample Input 2</H2>
<pre>
900
900
800
</pre>
|
s714685503 | p00001 | Runtime Error | import sys
file = sys.argv[1]
lis = open(file, "r").readlines()
lis = map(int, lis)
lis.sort()
lis.reverse()
for height in lis[0:3]:
print height | 1819
2003
876
2840
1723
1673
3776
2848
1592
922
| 3776
2848
2840
|
<H1>List of Top 3 Hills</H1>
<p>
There is a data which provides heights (in meter) of mountains. The data is only for ten mountains.
</p>
<p>
Write a program which prints heights of the top three mountains in descending order.
</p>
<H2>Input</H2>
<pre>
Height of mountain 1
Height of mountain 2
Height of mountain 3
.
.
Height of mountain 10
</pre>
<h2>Constraints</h2>
<p>
0 ≤ height of mountain (integer) ≤ 10,000
</p>
<H2>Output</H2>
<pre>
Height of the 1st mountain
Height of the 2nd mountain
Height of the 3rd mountain
</pre>
<H2>Sample Input 1</H2>
<pre>
1819
2003
876
2840
1723
1673
3776
2848
1592
922
</pre>
<H2>Output for the Sample Input 1</H2>
<pre>
3776
2848
2840
</pre>
<H2>Sample Input 2</H2>
<pre>
100
200
300
400
500
600
700
800
900
900
</pre>
<H2>Output for the Sample Input 2</H2>
<pre>
900
900
800
</pre>
|
s451863651 | p00001 | Runtime Error | import sys
heights = []
for line in sys.stdin:
heights.append(int(line.strip())
for height in sorted(heights, reverse=True)[:3]:
print height
sys.exit(0) | 1819
2003
876
2840
1723
1673
3776
2848
1592
922
| 3776
2848
2840
|
<H1>List of Top 3 Hills</H1>
<p>
There is a data which provides heights (in meter) of mountains. The data is only for ten mountains.
</p>
<p>
Write a program which prints heights of the top three mountains in descending order.
</p>
<H2>Input</H2>
<pre>
Height of mountain 1
Height of mountain 2
Height of mountain 3
.
.
Height of mountain 10
</pre>
<h2>Constraints</h2>
<p>
0 ≤ height of mountain (integer) ≤ 10,000
</p>
<H2>Output</H2>
<pre>
Height of the 1st mountain
Height of the 2nd mountain
Height of the 3rd mountain
</pre>
<H2>Sample Input 1</H2>
<pre>
1819
2003
876
2840
1723
1673
3776
2848
1592
922
</pre>
<H2>Output for the Sample Input 1</H2>
<pre>
3776
2848
2840
</pre>
<H2>Sample Input 2</H2>
<pre>
100
200
300
400
500
600
700
800
900
900
</pre>
<H2>Output for the Sample Input 2</H2>
<pre>
900
900
800
</pre>
|
s996613898 | p00001 | Runtime Error | print "\n".join(sorted([input() for x in xrange(10)])[:3]) | 1819
2003
876
2840
1723
1673
3776
2848
1592
922
| 3776
2848
2840
|
<H1>List of Top 3 Hills</H1>
<p>
There is a data which provides heights (in meter) of mountains. The data is only for ten mountains.
</p>
<p>
Write a program which prints heights of the top three mountains in descending order.
</p>
<H2>Input</H2>
<pre>
Height of mountain 1
Height of mountain 2
Height of mountain 3
.
.
Height of mountain 10
</pre>
<h2>Constraints</h2>
<p>
0 ≤ height of mountain (integer) ≤ 10,000
</p>
<H2>Output</H2>
<pre>
Height of the 1st mountain
Height of the 2nd mountain
Height of the 3rd mountain
</pre>
<H2>Sample Input 1</H2>
<pre>
1819
2003
876
2840
1723
1673
3776
2848
1592
922
</pre>
<H2>Output for the Sample Input 1</H2>
<pre>
3776
2848
2840
</pre>
<H2>Sample Input 2</H2>
<pre>
100
200
300
400
500
600
700
800
900
900
</pre>
<H2>Output for the Sample Input 2</H2>
<pre>
900
900
800
</pre>
|
s097979335 | p00001 | Runtime Error | from sys import stdin
x = [int(input()) for i in range(10)]
x.sort().reverse()
for i in range(3):
print(i) | 1819
2003
876
2840
1723
1673
3776
2848
1592
922
| 3776
2848
2840
|
<H1>List of Top 3 Hills</H1>
<p>
There is a data which provides heights (in meter) of mountains. The data is only for ten mountains.
</p>
<p>
Write a program which prints heights of the top three mountains in descending order.
</p>
<H2>Input</H2>
<pre>
Height of mountain 1
Height of mountain 2
Height of mountain 3
.
.
Height of mountain 10
</pre>
<h2>Constraints</h2>
<p>
0 ≤ height of mountain (integer) ≤ 10,000
</p>
<H2>Output</H2>
<pre>
Height of the 1st mountain
Height of the 2nd mountain
Height of the 3rd mountain
</pre>
<H2>Sample Input 1</H2>
<pre>
1819
2003
876
2840
1723
1673
3776
2848
1592
922
</pre>
<H2>Output for the Sample Input 1</H2>
<pre>
3776
2848
2840
</pre>
<H2>Sample Input 2</H2>
<pre>
100
200
300
400
500
600
700
800
900
900
</pre>
<H2>Output for the Sample Input 2</H2>
<pre>
900
900
800
</pre>
|
s357447994 | p00001 | Runtime Error | x = map(int, raw_input().split())
x.sort()
x.reverse()
print x[0], x[1], x[2] | 1819
2003
876
2840
1723
1673
3776
2848
1592
922
| 3776
2848
2840
|
<H1>List of Top 3 Hills</H1>
<p>
There is a data which provides heights (in meter) of mountains. The data is only for ten mountains.
</p>
<p>
Write a program which prints heights of the top three mountains in descending order.
</p>
<H2>Input</H2>
<pre>
Height of mountain 1
Height of mountain 2
Height of mountain 3
.
.
Height of mountain 10
</pre>
<h2>Constraints</h2>
<p>
0 ≤ height of mountain (integer) ≤ 10,000
</p>
<H2>Output</H2>
<pre>
Height of the 1st mountain
Height of the 2nd mountain
Height of the 3rd mountain
</pre>
<H2>Sample Input 1</H2>
<pre>
1819
2003
876
2840
1723
1673
3776
2848
1592
922
</pre>
<H2>Output for the Sample Input 1</H2>
<pre>
3776
2848
2840
</pre>
<H2>Sample Input 2</H2>
<pre>
100
200
300
400
500
600
700
800
900
900
</pre>
<H2>Output for the Sample Input 2</H2>
<pre>
900
900
800
</pre>
|
s984234428 | p00001 | Runtime Error | x = []
while True:
try:
x.append(int, raw_input())
except:
break
x.sort()
x.reverse()
print x[0], x[1], x[2] | 1819
2003
876
2840
1723
1673
3776
2848
1592
922
| 3776
2848
2840
|
<H1>List of Top 3 Hills</H1>
<p>
There is a data which provides heights (in meter) of mountains. The data is only for ten mountains.
</p>
<p>
Write a program which prints heights of the top three mountains in descending order.
</p>
<H2>Input</H2>
<pre>
Height of mountain 1
Height of mountain 2
Height of mountain 3
.
.
Height of mountain 10
</pre>
<h2>Constraints</h2>
<p>
0 ≤ height of mountain (integer) ≤ 10,000
</p>
<H2>Output</H2>
<pre>
Height of the 1st mountain
Height of the 2nd mountain
Height of the 3rd mountain
</pre>
<H2>Sample Input 1</H2>
<pre>
1819
2003
876
2840
1723
1673
3776
2848
1592
922
</pre>
<H2>Output for the Sample Input 1</H2>
<pre>
3776
2848
2840
</pre>
<H2>Sample Input 2</H2>
<pre>
100
200
300
400
500
600
700
800
900
900
</pre>
<H2>Output for the Sample Input 2</H2>
<pre>
900
900
800
</pre>
|
s839705146 | p00001 | Runtime Error | hs = []
for i in xrange(11):
hs.append(int(raw_input()))
hs.sort()
print hs[9]
print hs[8]
print hs[7] | 1819
2003
876
2840
1723
1673
3776
2848
1592
922
| 3776
2848
2840
|
<H1>List of Top 3 Hills</H1>
<p>
There is a data which provides heights (in meter) of mountains. The data is only for ten mountains.
</p>
<p>
Write a program which prints heights of the top three mountains in descending order.
</p>
<H2>Input</H2>
<pre>
Height of mountain 1
Height of mountain 2
Height of mountain 3
.
.
Height of mountain 10
</pre>
<h2>Constraints</h2>
<p>
0 ≤ height of mountain (integer) ≤ 10,000
</p>
<H2>Output</H2>
<pre>
Height of the 1st mountain
Height of the 2nd mountain
Height of the 3rd mountain
</pre>
<H2>Sample Input 1</H2>
<pre>
1819
2003
876
2840
1723
1673
3776
2848
1592
922
</pre>
<H2>Output for the Sample Input 1</H2>
<pre>
3776
2848
2840
</pre>
<H2>Sample Input 2</H2>
<pre>
100
200
300
400
500
600
700
800
900
900
</pre>
<H2>Output for the Sample Input 2</H2>
<pre>
900
900
800
</pre>
|
s381701625 | p00001 | Runtime Error | import sys
heights = []
for line in sys.stdin:
heights.append(int(line.rstrip('\n')))
for height in heights.sort()[:3]:
print height | 1819
2003
876
2840
1723
1673
3776
2848
1592
922
| 3776
2848
2840
|
<H1>List of Top 3 Hills</H1>
<p>
There is a data which provides heights (in meter) of mountains. The data is only for ten mountains.
</p>
<p>
Write a program which prints heights of the top three mountains in descending order.
</p>
<H2>Input</H2>
<pre>
Height of mountain 1
Height of mountain 2
Height of mountain 3
.
.
Height of mountain 10
</pre>
<h2>Constraints</h2>
<p>
0 ≤ height of mountain (integer) ≤ 10,000
</p>
<H2>Output</H2>
<pre>
Height of the 1st mountain
Height of the 2nd mountain
Height of the 3rd mountain
</pre>
<H2>Sample Input 1</H2>
<pre>
1819
2003
876
2840
1723
1673
3776
2848
1592
922
</pre>
<H2>Output for the Sample Input 1</H2>
<pre>
3776
2848
2840
</pre>
<H2>Sample Input 2</H2>
<pre>
100
200
300
400
500
600
700
800
900
900
</pre>
<H2>Output for the Sample Input 2</H2>
<pre>
900
900
800
</pre>
|
s379018181 | p00001 | Runtime Error | #-------------------------------------------------------------------------------
# Name: module1
# Purpose:
#
# Author: sato
#
# Created: 19/10/2013
# Copyright: (c) sato 2013
# Licence: <your licence>
#-------------------------------------------------------------------------------
def input_and_sort():
l = []
for x in input():
l.append(x)
l.sort()
return l
if __name__ == '__main__':
l = input_and_sort()
print l[0]
print l[1]
print l[2] | 1819
2003
876
2840
1723
1673
3776
2848
1592
922
| 3776
2848
2840
|
<H1>List of Top 3 Hills</H1>
<p>
There is a data which provides heights (in meter) of mountains. The data is only for ten mountains.
</p>
<p>
Write a program which prints heights of the top three mountains in descending order.
</p>
<H2>Input</H2>
<pre>
Height of mountain 1
Height of mountain 2
Height of mountain 3
.
.
Height of mountain 10
</pre>
<h2>Constraints</h2>
<p>
0 ≤ height of mountain (integer) ≤ 10,000
</p>
<H2>Output</H2>
<pre>
Height of the 1st mountain
Height of the 2nd mountain
Height of the 3rd mountain
</pre>
<H2>Sample Input 1</H2>
<pre>
1819
2003
876
2840
1723
1673
3776
2848
1592
922
</pre>
<H2>Output for the Sample Input 1</H2>
<pre>
3776
2848
2840
</pre>
<H2>Sample Input 2</H2>
<pre>
100
200
300
400
500
600
700
800
900
900
</pre>
<H2>Output for the Sample Input 2</H2>
<pre>
900
900
800
</pre>
|
s747361725 | p00001 | Runtime Error | <?php
$hi = fopen('php://stdin', "r");
$ho = fopen('php://stdout', "w");
# 空の配列を作成
$arr = array();
# 標準入力からデータをセット
for($i = 0; $i < 10; $i++)
{
fscanf($hi, "%d", $arr[]);
}
# 降順ソート
rsort($arr);
# 出力
for($i = 0; $i < 3; $i++)
{
fwrite($ho, sprintf("%d\n", $arr[$i]));
}
fclose($ho);
fclose($hi); | 1819
2003
876
2840
1723
1673
3776
2848
1592
922
| 3776
2848
2840
|
<H1>List of Top 3 Hills</H1>
<p>
There is a data which provides heights (in meter) of mountains. The data is only for ten mountains.
</p>
<p>
Write a program which prints heights of the top three mountains in descending order.
</p>
<H2>Input</H2>
<pre>
Height of mountain 1
Height of mountain 2
Height of mountain 3
.
.
Height of mountain 10
</pre>
<h2>Constraints</h2>
<p>
0 ≤ height of mountain (integer) ≤ 10,000
</p>
<H2>Output</H2>
<pre>
Height of the 1st mountain
Height of the 2nd mountain
Height of the 3rd mountain
</pre>
<H2>Sample Input 1</H2>
<pre>
1819
2003
876
2840
1723
1673
3776
2848
1592
922
</pre>
<H2>Output for the Sample Input 1</H2>
<pre>
3776
2848
2840
</pre>
<H2>Sample Input 2</H2>
<pre>
100
200
300
400
500
600
700
800
900
900
</pre>
<H2>Output for the Sample Input 2</H2>
<pre>
900
900
800
</pre>
|
s955815806 | p00001 | Runtime Error | out = []
def out.higher?(v)
return true if self.size < 3
self.each do |h|
return true if v > h
end
return false
end
def out.push(v)
if self.size < 3
self << v
return
end
min = 10000
min_i = 3
self.each_with_index do |h, i|
min, min_i = h, i if min > h
end
self[min_i] = v
end
def out.puts_desc
order = []
3.times do
max = 0
max_i = 3
self.each_with_index do |h, i|
max, max_i = h, i if max < h
end
order << max
self.delete_at(max_i)
end
order.each do |v|
puts v
end
end
10.times do |count|
num = readline.to_i
if out.higher? num
out.push num
end
end
out.puts_desc | 1819
2003
876
2840
1723
1673
3776
2848
1592
922
| 3776
2848
2840
|
<H1>List of Top 3 Hills</H1>
<p>
There is a data which provides heights (in meter) of mountains. The data is only for ten mountains.
</p>
<p>
Write a program which prints heights of the top three mountains in descending order.
</p>
<H2>Input</H2>
<pre>
Height of mountain 1
Height of mountain 2
Height of mountain 3
.
.
Height of mountain 10
</pre>
<h2>Constraints</h2>
<p>
0 ≤ height of mountain (integer) ≤ 10,000
</p>
<H2>Output</H2>
<pre>
Height of the 1st mountain
Height of the 2nd mountain
Height of the 3rd mountain
</pre>
<H2>Sample Input 1</H2>
<pre>
1819
2003
876
2840
1723
1673
3776
2848
1592
922
</pre>
<H2>Output for the Sample Input 1</H2>
<pre>
3776
2848
2840
</pre>
<H2>Sample Input 2</H2>
<pre>
100
200
300
400
500
600
700
800
900
900
</pre>
<H2>Output for the Sample Input 2</H2>
<pre>
900
900
800
</pre>
|
s889742458 | p00001 | Runtime Error | a = [0 for i in range(10)]
for i in range(10):
a[i] = int(raw_input())
a.sort().reverse()
print a[0]
print a[1]
print a[2] | 1819
2003
876
2840
1723
1673
3776
2848
1592
922
| 3776
2848
2840
|
<H1>List of Top 3 Hills</H1>
<p>
There is a data which provides heights (in meter) of mountains. The data is only for ten mountains.
</p>
<p>
Write a program which prints heights of the top three mountains in descending order.
</p>
<H2>Input</H2>
<pre>
Height of mountain 1
Height of mountain 2
Height of mountain 3
.
.
Height of mountain 10
</pre>
<h2>Constraints</h2>
<p>
0 ≤ height of mountain (integer) ≤ 10,000
</p>
<H2>Output</H2>
<pre>
Height of the 1st mountain
Height of the 2nd mountain
Height of the 3rd mountain
</pre>
<H2>Sample Input 1</H2>
<pre>
1819
2003
876
2840
1723
1673
3776
2848
1592
922
</pre>
<H2>Output for the Sample Input 1</H2>
<pre>
3776
2848
2840
</pre>
<H2>Sample Input 2</H2>
<pre>
100
200
300
400
500
600
700
800
900
900
</pre>
<H2>Output for the Sample Input 2</H2>
<pre>
900
900
800
</pre>
|
s628494874 | p00001 | Runtime Error | #!/usr/bin/python
array = []
for i in range(10):
array[i] = raw_input()
for j in range(3):
print max(array) + "\n"
array.remove(max(array)) | 1819
2003
876
2840
1723
1673
3776
2848
1592
922
| 3776
2848
2840
|
<H1>List of Top 3 Hills</H1>
<p>
There is a data which provides heights (in meter) of mountains. The data is only for ten mountains.
</p>
<p>
Write a program which prints heights of the top three mountains in descending order.
</p>
<H2>Input</H2>
<pre>
Height of mountain 1
Height of mountain 2
Height of mountain 3
.
.
Height of mountain 10
</pre>
<h2>Constraints</h2>
<p>
0 ≤ height of mountain (integer) ≤ 10,000
</p>
<H2>Output</H2>
<pre>
Height of the 1st mountain
Height of the 2nd mountain
Height of the 3rd mountain
</pre>
<H2>Sample Input 1</H2>
<pre>
1819
2003
876
2840
1723
1673
3776
2848
1592
922
</pre>
<H2>Output for the Sample Input 1</H2>
<pre>
3776
2848
2840
</pre>
<H2>Sample Input 2</H2>
<pre>
100
200
300
400
500
600
700
800
900
900
</pre>
<H2>Output for the Sample Input 2</H2>
<pre>
900
900
800
</pre>
|
s514157623 | p00001 | Runtime Error | #!/usr/bin/python
import sys
array = []
for i in range(10):
array[i] = raw_input()
for j in range(3):
print max(array) + "\n"
array.remove(max(array))
sys.exit() | 1819
2003
876
2840
1723
1673
3776
2848
1592
922
| 3776
2848
2840
|
<H1>List of Top 3 Hills</H1>
<p>
There is a data which provides heights (in meter) of mountains. The data is only for ten mountains.
</p>
<p>
Write a program which prints heights of the top three mountains in descending order.
</p>
<H2>Input</H2>
<pre>
Height of mountain 1
Height of mountain 2
Height of mountain 3
.
.
Height of mountain 10
</pre>
<h2>Constraints</h2>
<p>
0 ≤ height of mountain (integer) ≤ 10,000
</p>
<H2>Output</H2>
<pre>
Height of the 1st mountain
Height of the 2nd mountain
Height of the 3rd mountain
</pre>
<H2>Sample Input 1</H2>
<pre>
1819
2003
876
2840
1723
1673
3776
2848
1592
922
</pre>
<H2>Output for the Sample Input 1</H2>
<pre>
3776
2848
2840
</pre>
<H2>Sample Input 2</H2>
<pre>
100
200
300
400
500
600
700
800
900
900
</pre>
<H2>Output for the Sample Input 2</H2>
<pre>
900
900
800
</pre>
|
s837829729 | p00001 | Runtime Error | from sys import stdin
x = [int(input()) for i range(10)]
x.sort(reverse=True)
for i in x[:3]: print(i) | 1819
2003
876
2840
1723
1673
3776
2848
1592
922
| 3776
2848
2840
|
<H1>List of Top 3 Hills</H1>
<p>
There is a data which provides heights (in meter) of mountains. The data is only for ten mountains.
</p>
<p>
Write a program which prints heights of the top three mountains in descending order.
</p>
<H2>Input</H2>
<pre>
Height of mountain 1
Height of mountain 2
Height of mountain 3
.
.
Height of mountain 10
</pre>
<h2>Constraints</h2>
<p>
0 ≤ height of mountain (integer) ≤ 10,000
</p>
<H2>Output</H2>
<pre>
Height of the 1st mountain
Height of the 2nd mountain
Height of the 3rd mountain
</pre>
<H2>Sample Input 1</H2>
<pre>
1819
2003
876
2840
1723
1673
3776
2848
1592
922
</pre>
<H2>Output for the Sample Input 1</H2>
<pre>
3776
2848
2840
</pre>
<H2>Sample Input 2</H2>
<pre>
100
200
300
400
500
600
700
800
900
900
</pre>
<H2>Output for the Sample Input 2</H2>
<pre>
900
900
800
</pre>
|
s025229258 | p00001 | Runtime Error | from sys import stdin
x = [int(input()) for i range(10)]
x.sort(reverse=True)
for i in x[:3]: print(i) | 1819
2003
876
2840
1723
1673
3776
2848
1592
922
| 3776
2848
2840
|
<H1>List of Top 3 Hills</H1>
<p>
There is a data which provides heights (in meter) of mountains. The data is only for ten mountains.
</p>
<p>
Write a program which prints heights of the top three mountains in descending order.
</p>
<H2>Input</H2>
<pre>
Height of mountain 1
Height of mountain 2
Height of mountain 3
.
.
Height of mountain 10
</pre>
<h2>Constraints</h2>
<p>
0 ≤ height of mountain (integer) ≤ 10,000
</p>
<H2>Output</H2>
<pre>
Height of the 1st mountain
Height of the 2nd mountain
Height of the 3rd mountain
</pre>
<H2>Sample Input 1</H2>
<pre>
1819
2003
876
2840
1723
1673
3776
2848
1592
922
</pre>
<H2>Output for the Sample Input 1</H2>
<pre>
3776
2848
2840
</pre>
<H2>Sample Input 2</H2>
<pre>
100
200
300
400
500
600
700
800
900
900
</pre>
<H2>Output for the Sample Input 2</H2>
<pre>
900
900
800
</pre>
|
s812192031 | p00001 | Runtime Error | a = sorted(map(int,input().split(" ")),reverse=True)
for i in range(0,3):
print(a[i]) | 1819
2003
876
2840
1723
1673
3776
2848
1592
922
| 3776
2848
2840
|
<H1>List of Top 3 Hills</H1>
<p>
There is a data which provides heights (in meter) of mountains. The data is only for ten mountains.
</p>
<p>
Write a program which prints heights of the top three mountains in descending order.
</p>
<H2>Input</H2>
<pre>
Height of mountain 1
Height of mountain 2
Height of mountain 3
.
.
Height of mountain 10
</pre>
<h2>Constraints</h2>
<p>
0 ≤ height of mountain (integer) ≤ 10,000
</p>
<H2>Output</H2>
<pre>
Height of the 1st mountain
Height of the 2nd mountain
Height of the 3rd mountain
</pre>
<H2>Sample Input 1</H2>
<pre>
1819
2003
876
2840
1723
1673
3776
2848
1592
922
</pre>
<H2>Output for the Sample Input 1</H2>
<pre>
3776
2848
2840
</pre>
<H2>Sample Input 2</H2>
<pre>
100
200
300
400
500
600
700
800
900
900
</pre>
<H2>Output for the Sample Input 2</H2>
<pre>
900
900
800
</pre>
|
s417665400 | p00001 | Runtime Error | m=[1819,2003,876,2840,1723,1673,3776,2848,1592,922]
m.sort().reverse()
print m[0|2] | 1819
2003
876
2840
1723
1673
3776
2848
1592
922
| 3776
2848
2840
|
<H1>List of Top 3 Hills</H1>
<p>
There is a data which provides heights (in meter) of mountains. The data is only for ten mountains.
</p>
<p>
Write a program which prints heights of the top three mountains in descending order.
</p>
<H2>Input</H2>
<pre>
Height of mountain 1
Height of mountain 2
Height of mountain 3
.
.
Height of mountain 10
</pre>
<h2>Constraints</h2>
<p>
0 ≤ height of mountain (integer) ≤ 10,000
</p>
<H2>Output</H2>
<pre>
Height of the 1st mountain
Height of the 2nd mountain
Height of the 3rd mountain
</pre>
<H2>Sample Input 1</H2>
<pre>
1819
2003
876
2840
1723
1673
3776
2848
1592
922
</pre>
<H2>Output for the Sample Input 1</H2>
<pre>
3776
2848
2840
</pre>
<H2>Sample Input 2</H2>
<pre>
100
200
300
400
500
600
700
800
900
900
</pre>
<H2>Output for the Sample Input 2</H2>
<pre>
900
900
800
</pre>
|
s801849639 | p00001 | Runtime Error | mountain=[a,b,c,d,e,f,g,h,i,j]
mountain.sort()
print mountain[-1]
print mountain[-2]
print mountain[-3] | 1819
2003
876
2840
1723
1673
3776
2848
1592
922
| 3776
2848
2840
|
<H1>List of Top 3 Hills</H1>
<p>
There is a data which provides heights (in meter) of mountains. The data is only for ten mountains.
</p>
<p>
Write a program which prints heights of the top three mountains in descending order.
</p>
<H2>Input</H2>
<pre>
Height of mountain 1
Height of mountain 2
Height of mountain 3
.
.
Height of mountain 10
</pre>
<h2>Constraints</h2>
<p>
0 ≤ height of mountain (integer) ≤ 10,000
</p>
<H2>Output</H2>
<pre>
Height of the 1st mountain
Height of the 2nd mountain
Height of the 3rd mountain
</pre>
<H2>Sample Input 1</H2>
<pre>
1819
2003
876
2840
1723
1673
3776
2848
1592
922
</pre>
<H2>Output for the Sample Input 1</H2>
<pre>
3776
2848
2840
</pre>
<H2>Sample Input 2</H2>
<pre>
100
200
300
400
500
600
700
800
900
900
</pre>
<H2>Output for the Sample Input 2</H2>
<pre>
900
900
800
</pre>
|
s082637677 | p00001 | WA: Presentation Error | # -*- coding:utf-8 -*-
first = 0
second = 0
third = 0
i = 0
for i in range(0,9):
line = int(input())
if first < int(line):
third = second
second = first
first = int(line)
elif second < int(line):
third = second
second = int(line)
elif third < int(line):
third = int(line)
print()
print(first)
print(second)
print(third) | 1819
2003
876
2840
1723
1673
3776
2848
1592
922
| 3776
2848
2840
|
<H1>List of Top 3 Hills</H1>
<p>
There is a data which provides heights (in meter) of mountains. The data is only for ten mountains.
</p>
<p>
Write a program which prints heights of the top three mountains in descending order.
</p>
<H2>Input</H2>
<pre>
Height of mountain 1
Height of mountain 2
Height of mountain 3
.
.
Height of mountain 10
</pre>
<h2>Constraints</h2>
<p>
0 ≤ height of mountain (integer) ≤ 10,000
</p>
<H2>Output</H2>
<pre>
Height of the 1st mountain
Height of the 2nd mountain
Height of the 3rd mountain
</pre>
<H2>Sample Input 1</H2>
<pre>
1819
2003
876
2840
1723
1673
3776
2848
1592
922
</pre>
<H2>Output for the Sample Input 1</H2>
<pre>
3776
2848
2840
</pre>
<H2>Sample Input 2</H2>
<pre>
100
200
300
400
500
600
700
800
900
900
</pre>
<H2>Output for the Sample Input 2</H2>
<pre>
900
900
800
</pre>
|
s204545519 | p00001 | WA: Presentation Error | first = 0
second = 0
third = 0
i = 0
for i in range(0,9):
line = int(input())
if first < int(line):
third = second
second = first
first = int(line)
elif second < int(line):
third = second
second = int(line)
elif third < int(line):
third = int(line)
print()
print(first)
print(second)
print(third) | 1819
2003
876
2840
1723
1673
3776
2848
1592
922
| 3776
2848
2840
|
<H1>List of Top 3 Hills</H1>
<p>
There is a data which provides heights (in meter) of mountains. The data is only for ten mountains.
</p>
<p>
Write a program which prints heights of the top three mountains in descending order.
</p>
<H2>Input</H2>
<pre>
Height of mountain 1
Height of mountain 2
Height of mountain 3
.
.
Height of mountain 10
</pre>
<h2>Constraints</h2>
<p>
0 ≤ height of mountain (integer) ≤ 10,000
</p>
<H2>Output</H2>
<pre>
Height of the 1st mountain
Height of the 2nd mountain
Height of the 3rd mountain
</pre>
<H2>Sample Input 1</H2>
<pre>
1819
2003
876
2840
1723
1673
3776
2848
1592
922
</pre>
<H2>Output for the Sample Input 1</H2>
<pre>
3776
2848
2840
</pre>
<H2>Sample Input 2</H2>
<pre>
100
200
300
400
500
600
700
800
900
900
</pre>
<H2>Output for the Sample Input 2</H2>
<pre>
900
900
800
</pre>
|
s495929473 | p00001 | WA: Presentation Error | # -*- coding:utf-8 -*-
first = 0
second = 0
third = 0
i = 0
for i in range(0,9):
line = int(input())
if first < int(line):
third = second
second = first
first = int(line)
elif second < int(line):
third = second
second = int(line)
elif third < int(line):
third = int(line)
print(first)
print(second)
print(third)
print() | 1819
2003
876
2840
1723
1673
3776
2848
1592
922
| 3776
2848
2840
|
<H1>List of Top 3 Hills</H1>
<p>
There is a data which provides heights (in meter) of mountains. The data is only for ten mountains.
</p>
<p>
Write a program which prints heights of the top three mountains in descending order.
</p>
<H2>Input</H2>
<pre>
Height of mountain 1
Height of mountain 2
Height of mountain 3
.
.
Height of mountain 10
</pre>
<h2>Constraints</h2>
<p>
0 ≤ height of mountain (integer) ≤ 10,000
</p>
<H2>Output</H2>
<pre>
Height of the 1st mountain
Height of the 2nd mountain
Height of the 3rd mountain
</pre>
<H2>Sample Input 1</H2>
<pre>
1819
2003
876
2840
1723
1673
3776
2848
1592
922
</pre>
<H2>Output for the Sample Input 1</H2>
<pre>
3776
2848
2840
</pre>
<H2>Sample Input 2</H2>
<pre>
100
200
300
400
500
600
700
800
900
900
</pre>
<H2>Output for the Sample Input 2</H2>
<pre>
900
900
800
</pre>
|
s643886342 | p00001 | WA: Presentation Error | # -*- coding:utf-8 -*-
first = 0
second = 0
third = 0
i = 0
for i in range(0,9):
line = int(input())
if first < int(line):
third = second
second = first
first = int(line)
elif second < int(line):
third = second
second = int(line)
elif third < int(line):
third = int(line)
print()
print()
print(first)
print(second)
print(third) | 1819
2003
876
2840
1723
1673
3776
2848
1592
922
| 3776
2848
2840
|
<H1>List of Top 3 Hills</H1>
<p>
There is a data which provides heights (in meter) of mountains. The data is only for ten mountains.
</p>
<p>
Write a program which prints heights of the top three mountains in descending order.
</p>
<H2>Input</H2>
<pre>
Height of mountain 1
Height of mountain 2
Height of mountain 3
.
.
Height of mountain 10
</pre>
<h2>Constraints</h2>
<p>
0 ≤ height of mountain (integer) ≤ 10,000
</p>
<H2>Output</H2>
<pre>
Height of the 1st mountain
Height of the 2nd mountain
Height of the 3rd mountain
</pre>
<H2>Sample Input 1</H2>
<pre>
1819
2003
876
2840
1723
1673
3776
2848
1592
922
</pre>
<H2>Output for the Sample Input 1</H2>
<pre>
3776
2848
2840
</pre>
<H2>Sample Input 2</H2>
<pre>
100
200
300
400
500
600
700
800
900
900
</pre>
<H2>Output for the Sample Input 2</H2>
<pre>
900
900
800
</pre>
|
s301728987 | p00001 | WA: Presentation Error | # -*- coding:utf-8 -*-
first = 0
second = 0
third = 0
i = 0
for i in range(0,9):
line = int(input())
if first < int(line):
third = second
second = first
first = int(line)
elif second < int(line):
third = second
second = int(line)
elif third < int(line):
third = int(line)
print()
print(first)
print(second)
print(third)
exit() | 1819
2003
876
2840
1723
1673
3776
2848
1592
922
| 3776
2848
2840
|
<H1>List of Top 3 Hills</H1>
<p>
There is a data which provides heights (in meter) of mountains. The data is only for ten mountains.
</p>
<p>
Write a program which prints heights of the top three mountains in descending order.
</p>
<H2>Input</H2>
<pre>
Height of mountain 1
Height of mountain 2
Height of mountain 3
.
.
Height of mountain 10
</pre>
<h2>Constraints</h2>
<p>
0 ≤ height of mountain (integer) ≤ 10,000
</p>
<H2>Output</H2>
<pre>
Height of the 1st mountain
Height of the 2nd mountain
Height of the 3rd mountain
</pre>
<H2>Sample Input 1</H2>
<pre>
1819
2003
876
2840
1723
1673
3776
2848
1592
922
</pre>
<H2>Output for the Sample Input 1</H2>
<pre>
3776
2848
2840
</pre>
<H2>Sample Input 2</H2>
<pre>
100
200
300
400
500
600
700
800
900
900
</pre>
<H2>Output for the Sample Input 2</H2>
<pre>
900
900
800
</pre>
|
s949195875 | p00001 | WA: Presentation Error | # -*- coding:utf-8 -*-
first = 0
second = 0
third = 0
i = 0
for i in range(0,10):
line = int(input())
if first < int(line):
third = second
second = first
first = int(line)
elif second < int(line):
third = second
second = int(line)
elif third < int(line):
third = int(line)
print()
print(first)
print(second)
print(third)
exit() | 1819
2003
876
2840
1723
1673
3776
2848
1592
922
| 3776
2848
2840
|
<H1>List of Top 3 Hills</H1>
<p>
There is a data which provides heights (in meter) of mountains. The data is only for ten mountains.
</p>
<p>
Write a program which prints heights of the top three mountains in descending order.
</p>
<H2>Input</H2>
<pre>
Height of mountain 1
Height of mountain 2
Height of mountain 3
.
.
Height of mountain 10
</pre>
<h2>Constraints</h2>
<p>
0 ≤ height of mountain (integer) ≤ 10,000
</p>
<H2>Output</H2>
<pre>
Height of the 1st mountain
Height of the 2nd mountain
Height of the 3rd mountain
</pre>
<H2>Sample Input 1</H2>
<pre>
1819
2003
876
2840
1723
1673
3776
2848
1592
922
</pre>
<H2>Output for the Sample Input 1</H2>
<pre>
3776
2848
2840
</pre>
<H2>Sample Input 2</H2>
<pre>
100
200
300
400
500
600
700
800
900
900
</pre>
<H2>Output for the Sample Input 2</H2>
<pre>
900
900
800
</pre>
|
s103504590 | p00001 | WA: Presentation Error | values = []
for i in range(10):
values.append(int(input()))
top3 = []
for i in range(3):
Max = max(values)
top3.append(Max)
values.remove(Max)
print(''.join(str(x) + '\n' for x in top3)) | 1819
2003
876
2840
1723
1673
3776
2848
1592
922
| 3776
2848
2840
|
<H1>List of Top 3 Hills</H1>
<p>
There is a data which provides heights (in meter) of mountains. The data is only for ten mountains.
</p>
<p>
Write a program which prints heights of the top three mountains in descending order.
</p>
<H2>Input</H2>
<pre>
Height of mountain 1
Height of mountain 2
Height of mountain 3
.
.
Height of mountain 10
</pre>
<h2>Constraints</h2>
<p>
0 ≤ height of mountain (integer) ≤ 10,000
</p>
<H2>Output</H2>
<pre>
Height of the 1st mountain
Height of the 2nd mountain
Height of the 3rd mountain
</pre>
<H2>Sample Input 1</H2>
<pre>
1819
2003
876
2840
1723
1673
3776
2848
1592
922
</pre>
<H2>Output for the Sample Input 1</H2>
<pre>
3776
2848
2840
</pre>
<H2>Sample Input 2</H2>
<pre>
100
200
300
400
500
600
700
800
900
900
</pre>
<H2>Output for the Sample Input 2</H2>
<pre>
900
900
800
</pre>
|
s617121667 | p00001 | WA: Presentation Error | rank = sorted([int(input()) for i in range(10)], reverse=True)
print('\n'.join(map(str, rank[:3])) + '\n') | 1819
2003
876
2840
1723
1673
3776
2848
1592
922
| 3776
2848
2840
|
<H1>List of Top 3 Hills</H1>
<p>
There is a data which provides heights (in meter) of mountains. The data is only for ten mountains.
</p>
<p>
Write a program which prints heights of the top three mountains in descending order.
</p>
<H2>Input</H2>
<pre>
Height of mountain 1
Height of mountain 2
Height of mountain 3
.
.
Height of mountain 10
</pre>
<h2>Constraints</h2>
<p>
0 ≤ height of mountain (integer) ≤ 10,000
</p>
<H2>Output</H2>
<pre>
Height of the 1st mountain
Height of the 2nd mountain
Height of the 3rd mountain
</pre>
<H2>Sample Input 1</H2>
<pre>
1819
2003
876
2840
1723
1673
3776
2848
1592
922
</pre>
<H2>Output for the Sample Input 1</H2>
<pre>
3776
2848
2840
</pre>
<H2>Sample Input 2</H2>
<pre>
100
200
300
400
500
600
700
800
900
900
</pre>
<H2>Output for the Sample Input 2</H2>
<pre>
900
900
800
</pre>
|
s056240827 | p00001 | WA: Presentation Error | li2 = sorted([int(input()) for i in range(10)], reverse=True)
print()
print(li2[0])
print(li2[1])
print(li2[2])
| 1819
2003
876
2840
1723
1673
3776
2848
1592
922
| 3776
2848
2840
|
<H1>List of Top 3 Hills</H1>
<p>
There is a data which provides heights (in meter) of mountains. The data is only for ten mountains.
</p>
<p>
Write a program which prints heights of the top three mountains in descending order.
</p>
<H2>Input</H2>
<pre>
Height of mountain 1
Height of mountain 2
Height of mountain 3
.
.
Height of mountain 10
</pre>
<h2>Constraints</h2>
<p>
0 ≤ height of mountain (integer) ≤ 10,000
</p>
<H2>Output</H2>
<pre>
Height of the 1st mountain
Height of the 2nd mountain
Height of the 3rd mountain
</pre>
<H2>Sample Input 1</H2>
<pre>
1819
2003
876
2840
1723
1673
3776
2848
1592
922
</pre>
<H2>Output for the Sample Input 1</H2>
<pre>
3776
2848
2840
</pre>
<H2>Sample Input 2</H2>
<pre>
100
200
300
400
500
600
700
800
900
900
</pre>
<H2>Output for the Sample Input 2</H2>
<pre>
900
900
800
</pre>
|
s840313913 | p00001 | WA: Presentation Error | data = []
for i in range(0,10):
data.append(int(input()))
print()
data.sort()
data.reverse()
for i in range(0,3):
print(data[i])
| 1819
2003
876
2840
1723
1673
3776
2848
1592
922
| 3776
2848
2840
|
<H1>List of Top 3 Hills</H1>
<p>
There is a data which provides heights (in meter) of mountains. The data is only for ten mountains.
</p>
<p>
Write a program which prints heights of the top three mountains in descending order.
</p>
<H2>Input</H2>
<pre>
Height of mountain 1
Height of mountain 2
Height of mountain 3
.
.
Height of mountain 10
</pre>
<h2>Constraints</h2>
<p>
0 ≤ height of mountain (integer) ≤ 10,000
</p>
<H2>Output</H2>
<pre>
Height of the 1st mountain
Height of the 2nd mountain
Height of the 3rd mountain
</pre>
<H2>Sample Input 1</H2>
<pre>
1819
2003
876
2840
1723
1673
3776
2848
1592
922
</pre>
<H2>Output for the Sample Input 1</H2>
<pre>
3776
2848
2840
</pre>
<H2>Sample Input 2</H2>
<pre>
100
200
300
400
500
600
700
800
900
900
</pre>
<H2>Output for the Sample Input 2</H2>
<pre>
900
900
800
</pre>
|
s432568003 | p00002 | Wrong Answer | import math
a, b = map(int, input().split())
print(str(int(math.log10(a+b)+1)))
| 5 7
1 99
1000 999
| 2
3
4
|
<H1>Digit Number</H1>
<p>
Write a program which computes the digit number of sum of two integers <var>a</var> and <var>b</var>.
</p>
<H2>Input</H2>
<p>
There are several test cases. Each test case consists of two non-negative integers <var>a</var> and <i>b</i> which are separeted by a space in a line. The input terminates with EOF.
</p>
<h2>Constraints</h2>
<ul>
<li>0 ≤ <var>a</var>, <var>b</var> ≤ 1,000,000</li>
<li>The number of datasets ≤ 200</li>
</ul>
<H2>Output</H2>
<p>
Print the number of digits of <var>a</var> + <var>b</var> for each data set.
</p>
<H2>Sample Input</H2>
<pre>
5 7
1 99
1000 999
</pre>
<H2>Output for the Sample Input</H2>
<pre>
2
3
4
</pre>
|
s949618121 | p00002 | Wrong Answer | try:
print len(sum(map(int, raw_input().split())))
except:
pass
| 5 7
1 99
1000 999
| 2
3
4
|
<H1>Digit Number</H1>
<p>
Write a program which computes the digit number of sum of two integers <var>a</var> and <var>b</var>.
</p>
<H2>Input</H2>
<p>
There are several test cases. Each test case consists of two non-negative integers <var>a</var> and <i>b</i> which are separeted by a space in a line. The input terminates with EOF.
</p>
<h2>Constraints</h2>
<ul>
<li>0 ≤ <var>a</var>, <var>b</var> ≤ 1,000,000</li>
<li>The number of datasets ≤ 200</li>
</ul>
<H2>Output</H2>
<p>
Print the number of digits of <var>a</var> + <var>b</var> for each data set.
</p>
<H2>Sample Input</H2>
<pre>
5 7
1 99
1000 999
</pre>
<H2>Output for the Sample Input</H2>
<pre>
2
3
4
</pre>
|
s547128418 | p00002 | Wrong Answer | a, b = map(int, input().split())
c = a + b
digits = 0
while c != 0:
c = c / 10
digits += 1
print(digits)
| 5 7
1 99
1000 999
| 2
3
4
|
<H1>Digit Number</H1>
<p>
Write a program which computes the digit number of sum of two integers <var>a</var> and <var>b</var>.
</p>
<H2>Input</H2>
<p>
There are several test cases. Each test case consists of two non-negative integers <var>a</var> and <i>b</i> which are separeted by a space in a line. The input terminates with EOF.
</p>
<h2>Constraints</h2>
<ul>
<li>0 ≤ <var>a</var>, <var>b</var> ≤ 1,000,000</li>
<li>The number of datasets ≤ 200</li>
</ul>
<H2>Output</H2>
<p>
Print the number of digits of <var>a</var> + <var>b</var> for each data set.
</p>
<H2>Sample Input</H2>
<pre>
5 7
1 99
1000 999
</pre>
<H2>Output for the Sample Input</H2>
<pre>
2
3
4
</pre>
|
s948894624 | p00002 | Wrong Answer | a, b = map(int, input().split())
c = a + b
digits = 0
while c != 0:
c = int(c / 10)
digits += 1
print(digits)
| 5 7
1 99
1000 999
| 2
3
4
|
<H1>Digit Number</H1>
<p>
Write a program which computes the digit number of sum of two integers <var>a</var> and <var>b</var>.
</p>
<H2>Input</H2>
<p>
There are several test cases. Each test case consists of two non-negative integers <var>a</var> and <i>b</i> which are separeted by a space in a line. The input terminates with EOF.
</p>
<h2>Constraints</h2>
<ul>
<li>0 ≤ <var>a</var>, <var>b</var> ≤ 1,000,000</li>
<li>The number of datasets ≤ 200</li>
</ul>
<H2>Output</H2>
<p>
Print the number of digits of <var>a</var> + <var>b</var> for each data set.
</p>
<H2>Sample Input</H2>
<pre>
5 7
1 99
1000 999
</pre>
<H2>Output for the Sample Input</H2>
<pre>
2
3
4
</pre>
|
s241278523 | p00002 | Wrong Answer | a,b = map(int,input().split(" "))
print(len(str(a+b)))
| 5 7
1 99
1000 999
| 2
3
4
|
<H1>Digit Number</H1>
<p>
Write a program which computes the digit number of sum of two integers <var>a</var> and <var>b</var>.
</p>
<H2>Input</H2>
<p>
There are several test cases. Each test case consists of two non-negative integers <var>a</var> and <i>b</i> which are separeted by a space in a line. The input terminates with EOF.
</p>
<h2>Constraints</h2>
<ul>
<li>0 ≤ <var>a</var>, <var>b</var> ≤ 1,000,000</li>
<li>The number of datasets ≤ 200</li>
</ul>
<H2>Output</H2>
<p>
Print the number of digits of <var>a</var> + <var>b</var> for each data set.
</p>
<H2>Sample Input</H2>
<pre>
5 7
1 99
1000 999
</pre>
<H2>Output for the Sample Input</H2>
<pre>
2
3
4
</pre>
|
s867832056 | p00002 | Wrong Answer | def __main():
x = input()
y = input()
z = x + y
print(len(str(z)))
__main()
| 5 7
1 99
1000 999
| 2
3
4
|
<H1>Digit Number</H1>
<p>
Write a program which computes the digit number of sum of two integers <var>a</var> and <var>b</var>.
</p>
<H2>Input</H2>
<p>
There are several test cases. Each test case consists of two non-negative integers <var>a</var> and <i>b</i> which are separeted by a space in a line. The input terminates with EOF.
</p>
<h2>Constraints</h2>
<ul>
<li>0 ≤ <var>a</var>, <var>b</var> ≤ 1,000,000</li>
<li>The number of datasets ≤ 200</li>
</ul>
<H2>Output</H2>
<p>
Print the number of digits of <var>a</var> + <var>b</var> for each data set.
</p>
<H2>Sample Input</H2>
<pre>
5 7
1 99
1000 999
</pre>
<H2>Output for the Sample Input</H2>
<pre>
2
3
4
</pre>
|
s236447306 | p00002 | Wrong Answer | n = input()
n = n.split(" ")
print(n)
a = 0
for i in n:
a += int(i)
print(len(str(a)))
| 5 7
1 99
1000 999
| 2
3
4
|
<H1>Digit Number</H1>
<p>
Write a program which computes the digit number of sum of two integers <var>a</var> and <var>b</var>.
</p>
<H2>Input</H2>
<p>
There are several test cases. Each test case consists of two non-negative integers <var>a</var> and <i>b</i> which are separeted by a space in a line. The input terminates with EOF.
</p>
<h2>Constraints</h2>
<ul>
<li>0 ≤ <var>a</var>, <var>b</var> ≤ 1,000,000</li>
<li>The number of datasets ≤ 200</li>
</ul>
<H2>Output</H2>
<p>
Print the number of digits of <var>a</var> + <var>b</var> for each data set.
</p>
<H2>Sample Input</H2>
<pre>
5 7
1 99
1000 999
</pre>
<H2>Output for the Sample Input</H2>
<pre>
2
3
4
</pre>
|
s913960530 | p00002 | Wrong Answer | # -*- coding: utf-8 -*-
while True:
try:
a, b = (int(s) for s in input().split(" "))
print len(str(a + b))
except:
break
| 5 7
1 99
1000 999
| 2
3
4
|
<H1>Digit Number</H1>
<p>
Write a program which computes the digit number of sum of two integers <var>a</var> and <var>b</var>.
</p>
<H2>Input</H2>
<p>
There are several test cases. Each test case consists of two non-negative integers <var>a</var> and <i>b</i> which are separeted by a space in a line. The input terminates with EOF.
</p>
<h2>Constraints</h2>
<ul>
<li>0 ≤ <var>a</var>, <var>b</var> ≤ 1,000,000</li>
<li>The number of datasets ≤ 200</li>
</ul>
<H2>Output</H2>
<p>
Print the number of digits of <var>a</var> + <var>b</var> for each data set.
</p>
<H2>Sample Input</H2>
<pre>
5 7
1 99
1000 999
</pre>
<H2>Output for the Sample Input</H2>
<pre>
2
3
4
</pre>
|
s068470888 | p00002 | Wrong Answer | def sum_of_num(num_list):
return sum(num_list)
def calculate_digit_num(num):
z = num / 10
if z == 0:
return 1
else:
return 1 + calculate_digit_num(z)
while True:
try:
num_list = int(raw_input().split(' '))
summation = sum_of_num(num_list)
calculate_digit_sum(summation)
except:
break
| 5 7
1 99
1000 999
| 2
3
4
|
<H1>Digit Number</H1>
<p>
Write a program which computes the digit number of sum of two integers <var>a</var> and <var>b</var>.
</p>
<H2>Input</H2>
<p>
There are several test cases. Each test case consists of two non-negative integers <var>a</var> and <i>b</i> which are separeted by a space in a line. The input terminates with EOF.
</p>
<h2>Constraints</h2>
<ul>
<li>0 ≤ <var>a</var>, <var>b</var> ≤ 1,000,000</li>
<li>The number of datasets ≤ 200</li>
</ul>
<H2>Output</H2>
<p>
Print the number of digits of <var>a</var> + <var>b</var> for each data set.
</p>
<H2>Sample Input</H2>
<pre>
5 7
1 99
1000 999
</pre>
<H2>Output for the Sample Input</H2>
<pre>
2
3
4
</pre>
|
s886898573 | p00002 | Wrong Answer | def sum_of_num(num_list):
return sum(num_list)
def calculate_digit_num(num):
z = num / 10
if z == 0:
return 1
else:
return 1 + calculate_digit_num(z)
while True:
try:
num_list = raw_input().split(' ')
summation = sum_of_num(int(num_list))
calculate_digit_sum(summation)
except:
break
| 5 7
1 99
1000 999
| 2
3
4
|
<H1>Digit Number</H1>
<p>
Write a program which computes the digit number of sum of two integers <var>a</var> and <var>b</var>.
</p>
<H2>Input</H2>
<p>
There are several test cases. Each test case consists of two non-negative integers <var>a</var> and <i>b</i> which are separeted by a space in a line. The input terminates with EOF.
</p>
<h2>Constraints</h2>
<ul>
<li>0 ≤ <var>a</var>, <var>b</var> ≤ 1,000,000</li>
<li>The number of datasets ≤ 200</li>
</ul>
<H2>Output</H2>
<p>
Print the number of digits of <var>a</var> + <var>b</var> for each data set.
</p>
<H2>Sample Input</H2>
<pre>
5 7
1 99
1000 999
</pre>
<H2>Output for the Sample Input</H2>
<pre>
2
3
4
</pre>
|
s303242679 | p00002 | Wrong Answer | def sum_of_num(num_list):
return sum(num_list)
def calculate_digit_num(num):
z = num / 10
if z == 0:
return 1
else:
return 1 + calculate_digit_num(z)
while True:
try:
num_list = raw_input().split(' ')
summation = sum_of_num(int(num_list))
print calculate_digit_sum(summation)
except:
break
| 5 7
1 99
1000 999
| 2
3
4
|
<H1>Digit Number</H1>
<p>
Write a program which computes the digit number of sum of two integers <var>a</var> and <var>b</var>.
</p>
<H2>Input</H2>
<p>
There are several test cases. Each test case consists of two non-negative integers <var>a</var> and <i>b</i> which are separeted by a space in a line. The input terminates with EOF.
</p>
<h2>Constraints</h2>
<ul>
<li>0 ≤ <var>a</var>, <var>b</var> ≤ 1,000,000</li>
<li>The number of datasets ≤ 200</li>
</ul>
<H2>Output</H2>
<p>
Print the number of digits of <var>a</var> + <var>b</var> for each data set.
</p>
<H2>Sample Input</H2>
<pre>
5 7
1 99
1000 999
</pre>
<H2>Output for the Sample Input</H2>
<pre>
2
3
4
</pre>
|
s566626177 | p00002 | Wrong Answer | def calculate_digit_num(num):
z = num / 10
if z == 0:
return 1
else:
return 1 + calculate_digit_num(z)
while True:
try:
num_list = int(raw_input().split(' '))
summation = sum_of_num(sum(num_list))
print calculate_digit_num(summation)
except:
break
| 5 7
1 99
1000 999
| 2
3
4
|
<H1>Digit Number</H1>
<p>
Write a program which computes the digit number of sum of two integers <var>a</var> and <var>b</var>.
</p>
<H2>Input</H2>
<p>
There are several test cases. Each test case consists of two non-negative integers <var>a</var> and <i>b</i> which are separeted by a space in a line. The input terminates with EOF.
</p>
<h2>Constraints</h2>
<ul>
<li>0 ≤ <var>a</var>, <var>b</var> ≤ 1,000,000</li>
<li>The number of datasets ≤ 200</li>
</ul>
<H2>Output</H2>
<p>
Print the number of digits of <var>a</var> + <var>b</var> for each data set.
</p>
<H2>Sample Input</H2>
<pre>
5 7
1 99
1000 999
</pre>
<H2>Output for the Sample Input</H2>
<pre>
2
3
4
</pre>
|
s866137726 | p00002 | Wrong Answer | import math
a,b=map(int,input().split())
c=int(math.log10(a+b)+1)
print(c)
| 5 7
1 99
1000 999
| 2
3
4
|
<H1>Digit Number</H1>
<p>
Write a program which computes the digit number of sum of two integers <var>a</var> and <var>b</var>.
</p>
<H2>Input</H2>
<p>
There are several test cases. Each test case consists of two non-negative integers <var>a</var> and <i>b</i> which are separeted by a space in a line. The input terminates with EOF.
</p>
<h2>Constraints</h2>
<ul>
<li>0 ≤ <var>a</var>, <var>b</var> ≤ 1,000,000</li>
<li>The number of datasets ≤ 200</li>
</ul>
<H2>Output</H2>
<p>
Print the number of digits of <var>a</var> + <var>b</var> for each data set.
</p>
<H2>Sample Input</H2>
<pre>
5 7
1 99
1000 999
</pre>
<H2>Output for the Sample Input</H2>
<pre>
2
3
4
</pre>
|
s545046113 | p00002 | Wrong Answer | a,b=map(int,input().split())
print(len(str(a+b)))
| 5 7
1 99
1000 999
| 2
3
4
|
<H1>Digit Number</H1>
<p>
Write a program which computes the digit number of sum of two integers <var>a</var> and <var>b</var>.
</p>
<H2>Input</H2>
<p>
There are several test cases. Each test case consists of two non-negative integers <var>a</var> and <i>b</i> which are separeted by a space in a line. The input terminates with EOF.
</p>
<h2>Constraints</h2>
<ul>
<li>0 ≤ <var>a</var>, <var>b</var> ≤ 1,000,000</li>
<li>The number of datasets ≤ 200</li>
</ul>
<H2>Output</H2>
<p>
Print the number of digits of <var>a</var> + <var>b</var> for each data set.
</p>
<H2>Sample Input</H2>
<pre>
5 7
1 99
1000 999
</pre>
<H2>Output for the Sample Input</H2>
<pre>
2
3
4
</pre>
|
s271020854 | p00002 | Wrong Answer | while True:
try:
a, b = map(int, input().split())
print(len(list(a+b)))
except:
break
| 5 7
1 99
1000 999
| 2
3
4
|
<H1>Digit Number</H1>
<p>
Write a program which computes the digit number of sum of two integers <var>a</var> and <var>b</var>.
</p>
<H2>Input</H2>
<p>
There are several test cases. Each test case consists of two non-negative integers <var>a</var> and <i>b</i> which are separeted by a space in a line. The input terminates with EOF.
</p>
<h2>Constraints</h2>
<ul>
<li>0 ≤ <var>a</var>, <var>b</var> ≤ 1,000,000</li>
<li>The number of datasets ≤ 200</li>
</ul>
<H2>Output</H2>
<p>
Print the number of digits of <var>a</var> + <var>b</var> for each data set.
</p>
<H2>Sample Input</H2>
<pre>
5 7
1 99
1000 999
</pre>
<H2>Output for the Sample Input</H2>
<pre>
2
3
4
</pre>
|
s365519281 | p00002 | Wrong Answer | for i in range(3):
a, b = list(map(int, input().split()))
print(len(str(a + b)))
| 5 7
1 99
1000 999
| 2
3
4
|
<H1>Digit Number</H1>
<p>
Write a program which computes the digit number of sum of two integers <var>a</var> and <var>b</var>.
</p>
<H2>Input</H2>
<p>
There are several test cases. Each test case consists of two non-negative integers <var>a</var> and <i>b</i> which are separeted by a space in a line. The input terminates with EOF.
</p>
<h2>Constraints</h2>
<ul>
<li>0 ≤ <var>a</var>, <var>b</var> ≤ 1,000,000</li>
<li>The number of datasets ≤ 200</li>
</ul>
<H2>Output</H2>
<p>
Print the number of digits of <var>a</var> + <var>b</var> for each data set.
</p>
<H2>Sample Input</H2>
<pre>
5 7
1 99
1000 999
</pre>
<H2>Output for the Sample Input</H2>
<pre>
2
3
4
</pre>
|
s075030319 | p00002 | Wrong Answer | while True:
try:
line=raw_input()
(a,b)=line.split()
(a,b)=map(int,(a,b))
print a+b
except EOFError: break | 5 7
1 99
1000 999
| 2
3
4
|
<H1>Digit Number</H1>
<p>
Write a program which computes the digit number of sum of two integers <var>a</var> and <var>b</var>.
</p>
<H2>Input</H2>
<p>
There are several test cases. Each test case consists of two non-negative integers <var>a</var> and <i>b</i> which are separeted by a space in a line. The input terminates with EOF.
</p>
<h2>Constraints</h2>
<ul>
<li>0 ≤ <var>a</var>, <var>b</var> ≤ 1,000,000</li>
<li>The number of datasets ≤ 200</li>
</ul>
<H2>Output</H2>
<p>
Print the number of digits of <var>a</var> + <var>b</var> for each data set.
</p>
<H2>Sample Input</H2>
<pre>
5 7
1 99
1000 999
</pre>
<H2>Output for the Sample Input</H2>
<pre>
2
3
4
</pre>
|
s302344239 | p00002 | Wrong Answer | #!/usr/bin/python
#-coding:utf8-
import sys
for s in sys.stdin:
data = map(int,s.split())
print data[0]+data[1] | 5 7
1 99
1000 999
| 2
3
4
|
<H1>Digit Number</H1>
<p>
Write a program which computes the digit number of sum of two integers <var>a</var> and <var>b</var>.
</p>
<H2>Input</H2>
<p>
There are several test cases. Each test case consists of two non-negative integers <var>a</var> and <i>b</i> which are separeted by a space in a line. The input terminates with EOF.
</p>
<h2>Constraints</h2>
<ul>
<li>0 ≤ <var>a</var>, <var>b</var> ≤ 1,000,000</li>
<li>The number of datasets ≤ 200</li>
</ul>
<H2>Output</H2>
<p>
Print the number of digits of <var>a</var> + <var>b</var> for each data set.
</p>
<H2>Sample Input</H2>
<pre>
5 7
1 99
1000 999
</pre>
<H2>Output for the Sample Input</H2>
<pre>
2
3
4
</pre>
|
s850456244 | p00002 | Wrong Answer | #!/usr/bin/python
#-coding:utf8-
import sys
for s in sys.stdin:
data = map(str,s.split())
print len(data[0])+len(data[1]) | 5 7
1 99
1000 999
| 2
3
4
|
<H1>Digit Number</H1>
<p>
Write a program which computes the digit number of sum of two integers <var>a</var> and <var>b</var>.
</p>
<H2>Input</H2>
<p>
There are several test cases. Each test case consists of two non-negative integers <var>a</var> and <i>b</i> which are separeted by a space in a line. The input terminates with EOF.
</p>
<h2>Constraints</h2>
<ul>
<li>0 ≤ <var>a</var>, <var>b</var> ≤ 1,000,000</li>
<li>The number of datasets ≤ 200</li>
</ul>
<H2>Output</H2>
<p>
Print the number of digits of <var>a</var> + <var>b</var> for each data set.
</p>
<H2>Sample Input</H2>
<pre>
5 7
1 99
1000 999
</pre>
<H2>Output for the Sample Input</H2>
<pre>
2
3
4
</pre>
|
s632230156 | p00002 | Wrong Answer | num = map(int, raw_input().split())
print len(str(num[0] + num[1])) | 5 7
1 99
1000 999
| 2
3
4
|
<H1>Digit Number</H1>
<p>
Write a program which computes the digit number of sum of two integers <var>a</var> and <var>b</var>.
</p>
<H2>Input</H2>
<p>
There are several test cases. Each test case consists of two non-negative integers <var>a</var> and <i>b</i> which are separeted by a space in a line. The input terminates with EOF.
</p>
<h2>Constraints</h2>
<ul>
<li>0 ≤ <var>a</var>, <var>b</var> ≤ 1,000,000</li>
<li>The number of datasets ≤ 200</li>
</ul>
<H2>Output</H2>
<p>
Print the number of digits of <var>a</var> + <var>b</var> for each data set.
</p>
<H2>Sample Input</H2>
<pre>
5 7
1 99
1000 999
</pre>
<H2>Output for the Sample Input</H2>
<pre>
2
3
4
</pre>
|
s597603748 | p00002 | Wrong Answer | import sys, math
for line in sys.stdin:
a, b = map(int, line.split())
print(int(math.log(a + b, 10)) + 1) | 5 7
1 99
1000 999
| 2
3
4
|
<H1>Digit Number</H1>
<p>
Write a program which computes the digit number of sum of two integers <var>a</var> and <var>b</var>.
</p>
<H2>Input</H2>
<p>
There are several test cases. Each test case consists of two non-negative integers <var>a</var> and <i>b</i> which are separeted by a space in a line. The input terminates with EOF.
</p>
<h2>Constraints</h2>
<ul>
<li>0 ≤ <var>a</var>, <var>b</var> ≤ 1,000,000</li>
<li>The number of datasets ≤ 200</li>
</ul>
<H2>Output</H2>
<p>
Print the number of digits of <var>a</var> + <var>b</var> for each data set.
</p>
<H2>Sample Input</H2>
<pre>
5 7
1 99
1000 999
</pre>
<H2>Output for the Sample Input</H2>
<pre>
2
3
4
</pre>
|
s445604479 | p00002 | Wrong Answer | temp = [int(x) for x in raw_input().split()]
x = temp[0] + temp[1]
c = str(x)
print len(c) | 5 7
1 99
1000 999
| 2
3
4
|
<H1>Digit Number</H1>
<p>
Write a program which computes the digit number of sum of two integers <var>a</var> and <var>b</var>.
</p>
<H2>Input</H2>
<p>
There are several test cases. Each test case consists of two non-negative integers <var>a</var> and <i>b</i> which are separeted by a space in a line. The input terminates with EOF.
</p>
<h2>Constraints</h2>
<ul>
<li>0 ≤ <var>a</var>, <var>b</var> ≤ 1,000,000</li>
<li>The number of datasets ≤ 200</li>
</ul>
<H2>Output</H2>
<p>
Print the number of digits of <var>a</var> + <var>b</var> for each data set.
</p>
<H2>Sample Input</H2>
<pre>
5 7
1 99
1000 999
</pre>
<H2>Output for the Sample Input</H2>
<pre>
2
3
4
</pre>
|
s641009348 | p00002 | Wrong Answer | a,b=map(int,input().split(' '))
print(len(str(a+b))) | 5 7
1 99
1000 999
| 2
3
4
|
<H1>Digit Number</H1>
<p>
Write a program which computes the digit number of sum of two integers <var>a</var> and <var>b</var>.
</p>
<H2>Input</H2>
<p>
There are several test cases. Each test case consists of two non-negative integers <var>a</var> and <i>b</i> which are separeted by a space in a line. The input terminates with EOF.
</p>
<h2>Constraints</h2>
<ul>
<li>0 ≤ <var>a</var>, <var>b</var> ≤ 1,000,000</li>
<li>The number of datasets ≤ 200</li>
</ul>
<H2>Output</H2>
<p>
Print the number of digits of <var>a</var> + <var>b</var> for each data set.
</p>
<H2>Sample Input</H2>
<pre>
5 7
1 99
1000 999
</pre>
<H2>Output for the Sample Input</H2>
<pre>
2
3
4
</pre>
|
s567951415 | p00002 | Wrong Answer | #!/usr/bin/env python
# -*- coding: utf-8 -*-
a, b = map(int , input().split())
sum = a + b
print(len(str(a + b))) | 5 7
1 99
1000 999
| 2
3
4
|
<H1>Digit Number</H1>
<p>
Write a program which computes the digit number of sum of two integers <var>a</var> and <var>b</var>.
</p>
<H2>Input</H2>
<p>
There are several test cases. Each test case consists of two non-negative integers <var>a</var> and <i>b</i> which are separeted by a space in a line. The input terminates with EOF.
</p>
<h2>Constraints</h2>
<ul>
<li>0 ≤ <var>a</var>, <var>b</var> ≤ 1,000,000</li>
<li>The number of datasets ≤ 200</li>
</ul>
<H2>Output</H2>
<p>
Print the number of digits of <var>a</var> + <var>b</var> for each data set.
</p>
<H2>Sample Input</H2>
<pre>
5 7
1 99
1000 999
</pre>
<H2>Output for the Sample Input</H2>
<pre>
2
3
4
</pre>
|
s469104879 | p00002 | Wrong Answer | from math import *
sumNum = []
for i in range(0, 3):
inputNum = map(int, raw_input().split())
sumNum.append(inputNum[0] + inputNum[1])
print int(log10(sumNum[0]) + 1)
print int(log10(sumNum[1]) + 1)
print int(log10(sumNum[2]) + 1) | 5 7
1 99
1000 999
| 2
3
4
|
<H1>Digit Number</H1>
<p>
Write a program which computes the digit number of sum of two integers <var>a</var> and <var>b</var>.
</p>
<H2>Input</H2>
<p>
There are several test cases. Each test case consists of two non-negative integers <var>a</var> and <i>b</i> which are separeted by a space in a line. The input terminates with EOF.
</p>
<h2>Constraints</h2>
<ul>
<li>0 ≤ <var>a</var>, <var>b</var> ≤ 1,000,000</li>
<li>The number of datasets ≤ 200</li>
</ul>
<H2>Output</H2>
<p>
Print the number of digits of <var>a</var> + <var>b</var> for each data set.
</p>
<H2>Sample Input</H2>
<pre>
5 7
1 99
1000 999
</pre>
<H2>Output for the Sample Input</H2>
<pre>
2
3
4
</pre>
|
s209614032 | p00002 | Wrong Answer | a,b = map(int, raw_input().split())
print len(str(a+b)) | 5 7
1 99
1000 999
| 2
3
4
|
<H1>Digit Number</H1>
<p>
Write a program which computes the digit number of sum of two integers <var>a</var> and <var>b</var>.
</p>
<H2>Input</H2>
<p>
There are several test cases. Each test case consists of two non-negative integers <var>a</var> and <i>b</i> which are separeted by a space in a line. The input terminates with EOF.
</p>
<h2>Constraints</h2>
<ul>
<li>0 ≤ <var>a</var>, <var>b</var> ≤ 1,000,000</li>
<li>The number of datasets ≤ 200</li>
</ul>
<H2>Output</H2>
<p>
Print the number of digits of <var>a</var> + <var>b</var> for each data set.
</p>
<H2>Sample Input</H2>
<pre>
5 7
1 99
1000 999
</pre>
<H2>Output for the Sample Input</H2>
<pre>
2
3
4
</pre>
|
s622017788 | p00002 | Wrong Answer | #coing:UTF-8
a,b = map(int,raw_input().split())
c = a + b
print len(str(c)) | 5 7
1 99
1000 999
| 2
3
4
|
<H1>Digit Number</H1>
<p>
Write a program which computes the digit number of sum of two integers <var>a</var> and <var>b</var>.
</p>
<H2>Input</H2>
<p>
There are several test cases. Each test case consists of two non-negative integers <var>a</var> and <i>b</i> which are separeted by a space in a line. The input terminates with EOF.
</p>
<h2>Constraints</h2>
<ul>
<li>0 ≤ <var>a</var>, <var>b</var> ≤ 1,000,000</li>
<li>The number of datasets ≤ 200</li>
</ul>
<H2>Output</H2>
<p>
Print the number of digits of <var>a</var> + <var>b</var> for each data set.
</p>
<H2>Sample Input</H2>
<pre>
5 7
1 99
1000 999
</pre>
<H2>Output for the Sample Input</H2>
<pre>
2
3
4
</pre>
|
s818419328 | p00002 | Wrong Answer | #coing:UTF-8
for i in range(3):
a,b = map(int,raw_input().split())
print len(str(a+b)) | 5 7
1 99
1000 999
| 2
3
4
|
<H1>Digit Number</H1>
<p>
Write a program which computes the digit number of sum of two integers <var>a</var> and <var>b</var>.
</p>
<H2>Input</H2>
<p>
There are several test cases. Each test case consists of two non-negative integers <var>a</var> and <i>b</i> which are separeted by a space in a line. The input terminates with EOF.
</p>
<h2>Constraints</h2>
<ul>
<li>0 ≤ <var>a</var>, <var>b</var> ≤ 1,000,000</li>
<li>The number of datasets ≤ 200</li>
</ul>
<H2>Output</H2>
<p>
Print the number of digits of <var>a</var> + <var>b</var> for each data set.
</p>
<H2>Sample Input</H2>
<pre>
5 7
1 99
1000 999
</pre>
<H2>Output for the Sample Input</H2>
<pre>
2
3
4
</pre>
|
s553864929 | p00002 | Wrong Answer | #coing:UTF-8
for i in range(3):
a,b = map(int,raw_input().split())
print int(len(str(a+b))) | 5 7
1 99
1000 999
| 2
3
4
|
<H1>Digit Number</H1>
<p>
Write a program which computes the digit number of sum of two integers <var>a</var> and <var>b</var>.
</p>
<H2>Input</H2>
<p>
There are several test cases. Each test case consists of two non-negative integers <var>a</var> and <i>b</i> which are separeted by a space in a line. The input terminates with EOF.
</p>
<h2>Constraints</h2>
<ul>
<li>0 ≤ <var>a</var>, <var>b</var> ≤ 1,000,000</li>
<li>The number of datasets ≤ 200</li>
</ul>
<H2>Output</H2>
<p>
Print the number of digits of <var>a</var> + <var>b</var> for each data set.
</p>
<H2>Sample Input</H2>
<pre>
5 7
1 99
1000 999
</pre>
<H2>Output for the Sample Input</H2>
<pre>
2
3
4
</pre>
|
s245249638 | p00002 | Wrong Answer | #coing:UTF-8
for i in range(3):
a,b = map(int,raw_input().split())
print str(len(str(a+b))) | 5 7
1 99
1000 999
| 2
3
4
|
<H1>Digit Number</H1>
<p>
Write a program which computes the digit number of sum of two integers <var>a</var> and <var>b</var>.
</p>
<H2>Input</H2>
<p>
There are several test cases. Each test case consists of two non-negative integers <var>a</var> and <i>b</i> which are separeted by a space in a line. The input terminates with EOF.
</p>
<h2>Constraints</h2>
<ul>
<li>0 ≤ <var>a</var>, <var>b</var> ≤ 1,000,000</li>
<li>The number of datasets ≤ 200</li>
</ul>
<H2>Output</H2>
<p>
Print the number of digits of <var>a</var> + <var>b</var> for each data set.
</p>
<H2>Sample Input</H2>
<pre>
5 7
1 99
1000 999
</pre>
<H2>Output for the Sample Input</H2>
<pre>
2
3
4
</pre>
|
s842021609 | p00002 | Wrong Answer | import math
while True:
try:
num = input().split(" ")
num1 = int(num[0])
num2 = int(num[1])
sum_number = num[0] + num[1]
ans = int(math.log10(sum_number) + 1)
print(ans)
except:
break
| 5 7
1 99
1000 999
| 2
3
4
|
<H1>Digit Number</H1>
<p>
Write a program which computes the digit number of sum of two integers <var>a</var> and <var>b</var>.
</p>
<H2>Input</H2>
<p>
There are several test cases. Each test case consists of two non-negative integers <var>a</var> and <i>b</i> which are separeted by a space in a line. The input terminates with EOF.
</p>
<h2>Constraints</h2>
<ul>
<li>0 ≤ <var>a</var>, <var>b</var> ≤ 1,000,000</li>
<li>The number of datasets ≤ 200</li>
</ul>
<H2>Output</H2>
<p>
Print the number of digits of <var>a</var> + <var>b</var> for each data set.
</p>
<H2>Sample Input</H2>
<pre>
5 7
1 99
1000 999
</pre>
<H2>Output for the Sample Input</H2>
<pre>
2
3
4
</pre>
|
s433348482 | p00002 | Wrong Answer | import math
while(True):
try:
date=input()
date=date.split()
date=int(date[0])+int(date[1])
digit=int(math.log10(date))
print(digit)
except:
break | 5 7
1 99
1000 999
| 2
3
4
|
<H1>Digit Number</H1>
<p>
Write a program which computes the digit number of sum of two integers <var>a</var> and <var>b</var>.
</p>
<H2>Input</H2>
<p>
There are several test cases. Each test case consists of two non-negative integers <var>a</var> and <i>b</i> which are separeted by a space in a line. The input terminates with EOF.
</p>
<h2>Constraints</h2>
<ul>
<li>0 ≤ <var>a</var>, <var>b</var> ≤ 1,000,000</li>
<li>The number of datasets ≤ 200</li>
</ul>
<H2>Output</H2>
<p>
Print the number of digits of <var>a</var> + <var>b</var> for each data set.
</p>
<H2>Sample Input</H2>
<pre>
5 7
1 99
1000 999
</pre>
<H2>Output for the Sample Input</H2>
<pre>
2
3
4
</pre>
|
s941330782 | p00002 | Wrong Answer | while True:
try:
a,b=map(int, raw_input().split())
print a+b
except:
break | 5 7
1 99
1000 999
| 2
3
4
|
<H1>Digit Number</H1>
<p>
Write a program which computes the digit number of sum of two integers <var>a</var> and <var>b</var>.
</p>
<H2>Input</H2>
<p>
There are several test cases. Each test case consists of two non-negative integers <var>a</var> and <i>b</i> which are separeted by a space in a line. The input terminates with EOF.
</p>
<h2>Constraints</h2>
<ul>
<li>0 ≤ <var>a</var>, <var>b</var> ≤ 1,000,000</li>
<li>The number of datasets ≤ 200</li>
</ul>
<H2>Output</H2>
<p>
Print the number of digits of <var>a</var> + <var>b</var> for each data set.
</p>
<H2>Sample Input</H2>
<pre>
5 7
1 99
1000 999
</pre>
<H2>Output for the Sample Input</H2>
<pre>
2
3
4
</pre>
|
s207909709 | p00002 | Wrong Answer | while True:
try:
value = input().split(" ")
result = int(value[0]) * int(value[1])
print(str(result))
except EOFError:
break | 5 7
1 99
1000 999
| 2
3
4
|
<H1>Digit Number</H1>
<p>
Write a program which computes the digit number of sum of two integers <var>a</var> and <var>b</var>.
</p>
<H2>Input</H2>
<p>
There are several test cases. Each test case consists of two non-negative integers <var>a</var> and <i>b</i> which are separeted by a space in a line. The input terminates with EOF.
</p>
<h2>Constraints</h2>
<ul>
<li>0 ≤ <var>a</var>, <var>b</var> ≤ 1,000,000</li>
<li>The number of datasets ≤ 200</li>
</ul>
<H2>Output</H2>
<p>
Print the number of digits of <var>a</var> + <var>b</var> for each data set.
</p>
<H2>Sample Input</H2>
<pre>
5 7
1 99
1000 999
</pre>
<H2>Output for the Sample Input</H2>
<pre>
2
3
4
</pre>
|
s384603136 | p00002 | Wrong Answer | s=[input() for x in range(3)]
for i in range(len(s)):
print(len(str(int(s[i].split(' ')[0])+int(s[i].split(' ')[1])))) | 5 7
1 99
1000 999
| 2
3
4
|
<H1>Digit Number</H1>
<p>
Write a program which computes the digit number of sum of two integers <var>a</var> and <var>b</var>.
</p>
<H2>Input</H2>
<p>
There are several test cases. Each test case consists of two non-negative integers <var>a</var> and <i>b</i> which are separeted by a space in a line. The input terminates with EOF.
</p>
<h2>Constraints</h2>
<ul>
<li>0 ≤ <var>a</var>, <var>b</var> ≤ 1,000,000</li>
<li>The number of datasets ≤ 200</li>
</ul>
<H2>Output</H2>
<p>
Print the number of digits of <var>a</var> + <var>b</var> for each data set.
</p>
<H2>Sample Input</H2>
<pre>
5 7
1 99
1000 999
</pre>
<H2>Output for the Sample Input</H2>
<pre>
2
3
4
</pre>
|
s131119901 | p00002 | Wrong Answer | try:
s=[input() for x in range(200)]
for i in range(len(s)):
print(len(str(int(s[i].split(' ')[0])+int(s[i].split(' ')[1]))))
except EOFError:
pass | 5 7
1 99
1000 999
| 2
3
4
|
<H1>Digit Number</H1>
<p>
Write a program which computes the digit number of sum of two integers <var>a</var> and <var>b</var>.
</p>
<H2>Input</H2>
<p>
There are several test cases. Each test case consists of two non-negative integers <var>a</var> and <i>b</i> which are separeted by a space in a line. The input terminates with EOF.
</p>
<h2>Constraints</h2>
<ul>
<li>0 ≤ <var>a</var>, <var>b</var> ≤ 1,000,000</li>
<li>The number of datasets ≤ 200</li>
</ul>
<H2>Output</H2>
<p>
Print the number of digits of <var>a</var> + <var>b</var> for each data set.
</p>
<H2>Sample Input</H2>
<pre>
5 7
1 99
1000 999
</pre>
<H2>Output for the Sample Input</H2>
<pre>
2
3
4
</pre>
|
s678222340 | p00002 | Wrong Answer | a, b = map(int, input().split())
c=int(a+b)
count=0
while (c/10 != 0 ):
c=int(c/10)
count=count+1
print(count) | 5 7
1 99
1000 999
| 2
3
4
|
<H1>Digit Number</H1>
<p>
Write a program which computes the digit number of sum of two integers <var>a</var> and <var>b</var>.
</p>
<H2>Input</H2>
<p>
There are several test cases. Each test case consists of two non-negative integers <var>a</var> and <i>b</i> which are separeted by a space in a line. The input terminates with EOF.
</p>
<h2>Constraints</h2>
<ul>
<li>0 ≤ <var>a</var>, <var>b</var> ≤ 1,000,000</li>
<li>The number of datasets ≤ 200</li>
</ul>
<H2>Output</H2>
<p>
Print the number of digits of <var>a</var> + <var>b</var> for each data set.
</p>
<H2>Sample Input</H2>
<pre>
5 7
1 99
1000 999
</pre>
<H2>Output for the Sample Input</H2>
<pre>
2
3
4
</pre>
|
s264763520 | p00002 | Wrong Answer | import sys
for line in sys.stdin:
a, b = map(int, input().split())
c=int(a+b)
count=0
while (c/10 != 0 ):
c=int(c/10)
count=count+1
print(count)
else:
print('Warning: EOF occurred before "0" terminator') | 5 7
1 99
1000 999
| 2
3
4
|
<H1>Digit Number</H1>
<p>
Write a program which computes the digit number of sum of two integers <var>a</var> and <var>b</var>.
</p>
<H2>Input</H2>
<p>
There are several test cases. Each test case consists of two non-negative integers <var>a</var> and <i>b</i> which are separeted by a space in a line. The input terminates with EOF.
</p>
<h2>Constraints</h2>
<ul>
<li>0 ≤ <var>a</var>, <var>b</var> ≤ 1,000,000</li>
<li>The number of datasets ≤ 200</li>
</ul>
<H2>Output</H2>
<p>
Print the number of digits of <var>a</var> + <var>b</var> for each data set.
</p>
<H2>Sample Input</H2>
<pre>
5 7
1 99
1000 999
</pre>
<H2>Output for the Sample Input</H2>
<pre>
2
3
4
</pre>
|
s613808916 | p00002 | Wrong Answer | import sys
def solve():
a = []
for line in sys.stdin:
digit_list = line.split(' ')
new_list = []
for s in digit_list:
new_list.append(int(s))
a.append((new_list))
for j in a:
print str(sum(j)) + '\n'
if __name__ == '__main__':
solve() | 5 7
1 99
1000 999
| 2
3
4
|
<H1>Digit Number</H1>
<p>
Write a program which computes the digit number of sum of two integers <var>a</var> and <var>b</var>.
</p>
<H2>Input</H2>
<p>
There are several test cases. Each test case consists of two non-negative integers <var>a</var> and <i>b</i> which are separeted by a space in a line. The input terminates with EOF.
</p>
<h2>Constraints</h2>
<ul>
<li>0 ≤ <var>a</var>, <var>b</var> ≤ 1,000,000</li>
<li>The number of datasets ≤ 200</li>
</ul>
<H2>Output</H2>
<p>
Print the number of digits of <var>a</var> + <var>b</var> for each data set.
</p>
<H2>Sample Input</H2>
<pre>
5 7
1 99
1000 999
</pre>
<H2>Output for the Sample Input</H2>
<pre>
2
3
4
</pre>
|
s142795817 | p00002 | Wrong Answer | a, b = map(int, raw_input().split())
print len(str(a+b)) | 5 7
1 99
1000 999
| 2
3
4
|
<H1>Digit Number</H1>
<p>
Write a program which computes the digit number of sum of two integers <var>a</var> and <var>b</var>.
</p>
<H2>Input</H2>
<p>
There are several test cases. Each test case consists of two non-negative integers <var>a</var> and <i>b</i> which are separeted by a space in a line. The input terminates with EOF.
</p>
<h2>Constraints</h2>
<ul>
<li>0 ≤ <var>a</var>, <var>b</var> ≤ 1,000,000</li>
<li>The number of datasets ≤ 200</li>
</ul>
<H2>Output</H2>
<p>
Print the number of digits of <var>a</var> + <var>b</var> for each data set.
</p>
<H2>Sample Input</H2>
<pre>
5 7
1 99
1000 999
</pre>
<H2>Output for the Sample Input</H2>
<pre>
2
3
4
</pre>
|
s410992064 | p00002 | Wrong Answer | print(len(str(sum(map(int, input().split()))))) | 5 7
1 99
1000 999
| 2
3
4
|
<H1>Digit Number</H1>
<p>
Write a program which computes the digit number of sum of two integers <var>a</var> and <var>b</var>.
</p>
<H2>Input</H2>
<p>
There are several test cases. Each test case consists of two non-negative integers <var>a</var> and <i>b</i> which are separeted by a space in a line. The input terminates with EOF.
</p>
<h2>Constraints</h2>
<ul>
<li>0 ≤ <var>a</var>, <var>b</var> ≤ 1,000,000</li>
<li>The number of datasets ≤ 200</li>
</ul>
<H2>Output</H2>
<p>
Print the number of digits of <var>a</var> + <var>b</var> for each data set.
</p>
<H2>Sample Input</H2>
<pre>
5 7
1 99
1000 999
</pre>
<H2>Output for the Sample Input</H2>
<pre>
2
3
4
</pre>
|
s092797368 | p00002 | Wrong Answer | n = list(map(int, input().split()))
for i in range(0,len(n),2):
print(len(str(sum((n[i], n[i+1]))))) | 5 7
1 99
1000 999
| 2
3
4
|
<H1>Digit Number</H1>
<p>
Write a program which computes the digit number of sum of two integers <var>a</var> and <var>b</var>.
</p>
<H2>Input</H2>
<p>
There are several test cases. Each test case consists of two non-negative integers <var>a</var> and <i>b</i> which are separeted by a space in a line. The input terminates with EOF.
</p>
<h2>Constraints</h2>
<ul>
<li>0 ≤ <var>a</var>, <var>b</var> ≤ 1,000,000</li>
<li>The number of datasets ≤ 200</li>
</ul>
<H2>Output</H2>
<p>
Print the number of digits of <var>a</var> + <var>b</var> for each data set.
</p>
<H2>Sample Input</H2>
<pre>
5 7
1 99
1000 999
</pre>
<H2>Output for the Sample Input</H2>
<pre>
2
3
4
</pre>
|
s143911776 | p00002 | Wrong Answer | try:
while 1:
print(len(str(sum((input().split())))))
except Exception:
pass | 5 7
1 99
1000 999
| 2
3
4
|
<H1>Digit Number</H1>
<p>
Write a program which computes the digit number of sum of two integers <var>a</var> and <var>b</var>.
</p>
<H2>Input</H2>
<p>
There are several test cases. Each test case consists of two non-negative integers <var>a</var> and <i>b</i> which are separeted by a space in a line. The input terminates with EOF.
</p>
<h2>Constraints</h2>
<ul>
<li>0 ≤ <var>a</var>, <var>b</var> ≤ 1,000,000</li>
<li>The number of datasets ≤ 200</li>
</ul>
<H2>Output</H2>
<p>
Print the number of digits of <var>a</var> + <var>b</var> for each data set.
</p>
<H2>Sample Input</H2>
<pre>
5 7
1 99
1000 999
</pre>
<H2>Output for the Sample Input</H2>
<pre>
2
3
4
</pre>
|
s771522537 | p00002 | Wrong Answer | import math
list = []
list=map(int, raw_input().split())
sum=sum(list)
log=int(math.log10(sum) + 1)
print log | 5 7
1 99
1000 999
| 2
3
4
|
<H1>Digit Number</H1>
<p>
Write a program which computes the digit number of sum of two integers <var>a</var> and <var>b</var>.
</p>
<H2>Input</H2>
<p>
There are several test cases. Each test case consists of two non-negative integers <var>a</var> and <i>b</i> which are separeted by a space in a line. The input terminates with EOF.
</p>
<h2>Constraints</h2>
<ul>
<li>0 ≤ <var>a</var>, <var>b</var> ≤ 1,000,000</li>
<li>The number of datasets ≤ 200</li>
</ul>
<H2>Output</H2>
<p>
Print the number of digits of <var>a</var> + <var>b</var> for each data set.
</p>
<H2>Sample Input</H2>
<pre>
5 7
1 99
1000 999
</pre>
<H2>Output for the Sample Input</H2>
<pre>
2
3
4
</pre>
|
s912724831 | p00002 | Wrong Answer | import math
for i in range(3):
x,y=map(int,input().split())
print(int(math.log10(x+y))+1) | 5 7
1 99
1000 999
| 2
3
4
|
<H1>Digit Number</H1>
<p>
Write a program which computes the digit number of sum of two integers <var>a</var> and <var>b</var>.
</p>
<H2>Input</H2>
<p>
There are several test cases. Each test case consists of two non-negative integers <var>a</var> and <i>b</i> which are separeted by a space in a line. The input terminates with EOF.
</p>
<h2>Constraints</h2>
<ul>
<li>0 ≤ <var>a</var>, <var>b</var> ≤ 1,000,000</li>
<li>The number of datasets ≤ 200</li>
</ul>
<H2>Output</H2>
<p>
Print the number of digits of <var>a</var> + <var>b</var> for each data set.
</p>
<H2>Sample Input</H2>
<pre>
5 7
1 99
1000 999
</pre>
<H2>Output for the Sample Input</H2>
<pre>
2
3
4
</pre>
|
s584303274 | p00002 | Wrong Answer | a,b = input().split()
print(len(str(a + b))) | 5 7
1 99
1000 999
| 2
3
4
|
<H1>Digit Number</H1>
<p>
Write a program which computes the digit number of sum of two integers <var>a</var> and <var>b</var>.
</p>
<H2>Input</H2>
<p>
There are several test cases. Each test case consists of two non-negative integers <var>a</var> and <i>b</i> which are separeted by a space in a line. The input terminates with EOF.
</p>
<h2>Constraints</h2>
<ul>
<li>0 ≤ <var>a</var>, <var>b</var> ≤ 1,000,000</li>
<li>The number of datasets ≤ 200</li>
</ul>
<H2>Output</H2>
<p>
Print the number of digits of <var>a</var> + <var>b</var> for each data set.
</p>
<H2>Sample Input</H2>
<pre>
5 7
1 99
1000 999
</pre>
<H2>Output for the Sample Input</H2>
<pre>
2
3
4
</pre>
|
s428745719 | p00002 | Wrong Answer | a,b = map(lambda x: int(x), input().split())
print(len(str(a + b))) | 5 7
1 99
1000 999
| 2
3
4
|
<H1>Digit Number</H1>
<p>
Write a program which computes the digit number of sum of two integers <var>a</var> and <var>b</var>.
</p>
<H2>Input</H2>
<p>
There are several test cases. Each test case consists of two non-negative integers <var>a</var> and <i>b</i> which are separeted by a space in a line. The input terminates with EOF.
</p>
<h2>Constraints</h2>
<ul>
<li>0 ≤ <var>a</var>, <var>b</var> ≤ 1,000,000</li>
<li>The number of datasets ≤ 200</li>
</ul>
<H2>Output</H2>
<p>
Print the number of digits of <var>a</var> + <var>b</var> for each data set.
</p>
<H2>Sample Input</H2>
<pre>
5 7
1 99
1000 999
</pre>
<H2>Output for the Sample Input</H2>
<pre>
2
3
4
</pre>
|
s255210751 | p00002 | Wrong Answer | a,b = map(lambda x: int(x), input().split())
c = a + b
print(len(str(c))) | 5 7
1 99
1000 999
| 2
3
4
|
<H1>Digit Number</H1>
<p>
Write a program which computes the digit number of sum of two integers <var>a</var> and <var>b</var>.
</p>
<H2>Input</H2>
<p>
There are several test cases. Each test case consists of two non-negative integers <var>a</var> and <i>b</i> which are separeted by a space in a line. The input terminates with EOF.
</p>
<h2>Constraints</h2>
<ul>
<li>0 ≤ <var>a</var>, <var>b</var> ≤ 1,000,000</li>
<li>The number of datasets ≤ 200</li>
</ul>
<H2>Output</H2>
<p>
Print the number of digits of <var>a</var> + <var>b</var> for each data set.
</p>
<H2>Sample Input</H2>
<pre>
5 7
1 99
1000 999
</pre>
<H2>Output for the Sample Input</H2>
<pre>
2
3
4
</pre>
|
s761462082 | p00002 | Wrong Answer | import sys
l = []
try:
for line in sys.stdin:
a,b = map(int, line.split())
c = a + b
l.append(len(str(c)))
except:
for i in l:
print(i) | 5 7
1 99
1000 999
| 2
3
4
|
<H1>Digit Number</H1>
<p>
Write a program which computes the digit number of sum of two integers <var>a</var> and <var>b</var>.
</p>
<H2>Input</H2>
<p>
There are several test cases. Each test case consists of two non-negative integers <var>a</var> and <i>b</i> which are separeted by a space in a line. The input terminates with EOF.
</p>
<h2>Constraints</h2>
<ul>
<li>0 ≤ <var>a</var>, <var>b</var> ≤ 1,000,000</li>
<li>The number of datasets ≤ 200</li>
</ul>
<H2>Output</H2>
<p>
Print the number of digits of <var>a</var> + <var>b</var> for each data set.
</p>
<H2>Sample Input</H2>
<pre>
5 7
1 99
1000 999
</pre>
<H2>Output for the Sample Input</H2>
<pre>
2
3
4
</pre>
|
s043620180 | p00002 | Wrong Answer | a,b = map(int,input().split(" "))
print(len(str(a+b))) | 5 7
1 99
1000 999
| 2
3
4
|
<H1>Digit Number</H1>
<p>
Write a program which computes the digit number of sum of two integers <var>a</var> and <var>b</var>.
</p>
<H2>Input</H2>
<p>
There are several test cases. Each test case consists of two non-negative integers <var>a</var> and <i>b</i> which are separeted by a space in a line. The input terminates with EOF.
</p>
<h2>Constraints</h2>
<ul>
<li>0 ≤ <var>a</var>, <var>b</var> ≤ 1,000,000</li>
<li>The number of datasets ≤ 200</li>
</ul>
<H2>Output</H2>
<p>
Print the number of digits of <var>a</var> + <var>b</var> for each data set.
</p>
<H2>Sample Input</H2>
<pre>
5 7
1 99
1000 999
</pre>
<H2>Output for the Sample Input</H2>
<pre>
2
3
4
</pre>
|
s356996309 | p00002 | Wrong Answer | a,b = map(int,input().split(" "))
a = a+b
n=len(str(a))
print(n) | 5 7
1 99
1000 999
| 2
3
4
|
<H1>Digit Number</H1>
<p>
Write a program which computes the digit number of sum of two integers <var>a</var> and <var>b</var>.
</p>
<H2>Input</H2>
<p>
There are several test cases. Each test case consists of two non-negative integers <var>a</var> and <i>b</i> which are separeted by a space in a line. The input terminates with EOF.
</p>
<h2>Constraints</h2>
<ul>
<li>0 ≤ <var>a</var>, <var>b</var> ≤ 1,000,000</li>
<li>The number of datasets ≤ 200</li>
</ul>
<H2>Output</H2>
<p>
Print the number of digits of <var>a</var> + <var>b</var> for each data set.
</p>
<H2>Sample Input</H2>
<pre>
5 7
1 99
1000 999
</pre>
<H2>Output for the Sample Input</H2>
<pre>
2
3
4
</pre>
|
s349506713 | p00002 | Wrong Answer | num = map(int, raw_input().split())
import math
num = [i if i is not 0 else 1 for i in num]
print int(math.floor(math.log(num[1], 10))+1+math.floor(math.log(num[0], 10))+1) | 5 7
1 99
1000 999
| 2
3
4
|
<H1>Digit Number</H1>
<p>
Write a program which computes the digit number of sum of two integers <var>a</var> and <var>b</var>.
</p>
<H2>Input</H2>
<p>
There are several test cases. Each test case consists of two non-negative integers <var>a</var> and <i>b</i> which are separeted by a space in a line. The input terminates with EOF.
</p>
<h2>Constraints</h2>
<ul>
<li>0 ≤ <var>a</var>, <var>b</var> ≤ 1,000,000</li>
<li>The number of datasets ≤ 200</li>
</ul>
<H2>Output</H2>
<p>
Print the number of digits of <var>a</var> + <var>b</var> for each data set.
</p>
<H2>Sample Input</H2>
<pre>
5 7
1 99
1000 999
</pre>
<H2>Output for the Sample Input</H2>
<pre>
2
3
4
</pre>
|
s628060321 | p00002 | Wrong Answer | num = map(int, raw_input().split())
import math
num = [i if i is not 0 else 1 for i in num]
print int(math.floor(math.log(num[1]+num[0], 10))+1) | 5 7
1 99
1000 999
| 2
3
4
|
<H1>Digit Number</H1>
<p>
Write a program which computes the digit number of sum of two integers <var>a</var> and <var>b</var>.
</p>
<H2>Input</H2>
<p>
There are several test cases. Each test case consists of two non-negative integers <var>a</var> and <i>b</i> which are separeted by a space in a line. The input terminates with EOF.
</p>
<h2>Constraints</h2>
<ul>
<li>0 ≤ <var>a</var>, <var>b</var> ≤ 1,000,000</li>
<li>The number of datasets ≤ 200</li>
</ul>
<H2>Output</H2>
<p>
Print the number of digits of <var>a</var> + <var>b</var> for each data set.
</p>
<H2>Sample Input</H2>
<pre>
5 7
1 99
1000 999
</pre>
<H2>Output for the Sample Input</H2>
<pre>
2
3
4
</pre>
|
s686873914 | p00002 | Wrong Answer | num = map(int, raw_input().split())
import math
print int(math.floor(math.log(num[1]+num[0], 10))+1) | 5 7
1 99
1000 999
| 2
3
4
|
<H1>Digit Number</H1>
<p>
Write a program which computes the digit number of sum of two integers <var>a</var> and <var>b</var>.
</p>
<H2>Input</H2>
<p>
There are several test cases. Each test case consists of two non-negative integers <var>a</var> and <i>b</i> which are separeted by a space in a line. The input terminates with EOF.
</p>
<h2>Constraints</h2>
<ul>
<li>0 ≤ <var>a</var>, <var>b</var> ≤ 1,000,000</li>
<li>The number of datasets ≤ 200</li>
</ul>
<H2>Output</H2>
<p>
Print the number of digits of <var>a</var> + <var>b</var> for each data set.
</p>
<H2>Sample Input</H2>
<pre>
5 7
1 99
1000 999
</pre>
<H2>Output for the Sample Input</H2>
<pre>
2
3
4
</pre>
|
s451195918 | p00002 | Wrong Answer | num = map(int, raw_input().split())
import math
if num[0] is 0 and num[1] is 0:
num[0]=1
print int(math.floor(math.log(num[1]+num[0], 10))+1) | 5 7
1 99
1000 999
| 2
3
4
|
<H1>Digit Number</H1>
<p>
Write a program which computes the digit number of sum of two integers <var>a</var> and <var>b</var>.
</p>
<H2>Input</H2>
<p>
There are several test cases. Each test case consists of two non-negative integers <var>a</var> and <i>b</i> which are separeted by a space in a line. The input terminates with EOF.
</p>
<h2>Constraints</h2>
<ul>
<li>0 ≤ <var>a</var>, <var>b</var> ≤ 1,000,000</li>
<li>The number of datasets ≤ 200</li>
</ul>
<H2>Output</H2>
<p>
Print the number of digits of <var>a</var> + <var>b</var> for each data set.
</p>
<H2>Sample Input</H2>
<pre>
5 7
1 99
1000 999
</pre>
<H2>Output for the Sample Input</H2>
<pre>
2
3
4
</pre>
|
s218137005 | p00002 | Wrong Answer | all = []
for i in range(3):
sums = list(map(int, input().split(' ')))
all.append(sums)
for i in range(len(all)):
keta = str(all[i][0] + all[i][1])
print(len(list(keta)))
| 5 7
1 99
1000 999
| 2
3
4
|
<H1>Digit Number</H1>
<p>
Write a program which computes the digit number of sum of two integers <var>a</var> and <var>b</var>.
</p>
<H2>Input</H2>
<p>
There are several test cases. Each test case consists of two non-negative integers <var>a</var> and <i>b</i> which are separeted by a space in a line. The input terminates with EOF.
</p>
<h2>Constraints</h2>
<ul>
<li>0 ≤ <var>a</var>, <var>b</var> ≤ 1,000,000</li>
<li>The number of datasets ≤ 200</li>
</ul>
<H2>Output</H2>
<p>
Print the number of digits of <var>a</var> + <var>b</var> for each data set.
</p>
<H2>Sample Input</H2>
<pre>
5 7
1 99
1000 999
</pre>
<H2>Output for the Sample Input</H2>
<pre>
2
3
4
</pre>
|
s912968495 | p00002 | Wrong Answer | # -*-coding:utf-8-*-
def get_input():
while True:
try:
yield "".join(input())
except EOFError:
break
if __name__=="__main__":
array = list(get_input())
for i in range(len(array)):
temp = array[i].split()
a = int(temp[0])
b = int(temp[1])
ans = a + b
print(ans) | 5 7
1 99
1000 999
| 2
3
4
|
<H1>Digit Number</H1>
<p>
Write a program which computes the digit number of sum of two integers <var>a</var> and <var>b</var>.
</p>
<H2>Input</H2>
<p>
There are several test cases. Each test case consists of two non-negative integers <var>a</var> and <i>b</i> which are separeted by a space in a line. The input terminates with EOF.
</p>
<h2>Constraints</h2>
<ul>
<li>0 ≤ <var>a</var>, <var>b</var> ≤ 1,000,000</li>
<li>The number of datasets ≤ 200</li>
</ul>
<H2>Output</H2>
<p>
Print the number of digits of <var>a</var> + <var>b</var> for each data set.
</p>
<H2>Sample Input</H2>
<pre>
5 7
1 99
1000 999
</pre>
<H2>Output for the Sample Input</H2>
<pre>
2
3
4
</pre>
|
s490405852 | p00002 | Wrong Answer | import sys,math
for l in sys.stdin:
print(math.floor(math.log(sum(map(int,l.split())),10)+1)) | 5 7
1 99
1000 999
| 2
3
4
|
<H1>Digit Number</H1>
<p>
Write a program which computes the digit number of sum of two integers <var>a</var> and <var>b</var>.
</p>
<H2>Input</H2>
<p>
There are several test cases. Each test case consists of two non-negative integers <var>a</var> and <i>b</i> which are separeted by a space in a line. The input terminates with EOF.
</p>
<h2>Constraints</h2>
<ul>
<li>0 ≤ <var>a</var>, <var>b</var> ≤ 1,000,000</li>
<li>The number of datasets ≤ 200</li>
</ul>
<H2>Output</H2>
<p>
Print the number of digits of <var>a</var> + <var>b</var> for each data set.
</p>
<H2>Sample Input</H2>
<pre>
5 7
1 99
1000 999
</pre>
<H2>Output for the Sample Input</H2>
<pre>
2
3
4
</pre>
|
s956225798 | p00002 | Wrong Answer | import sys,math
a=[math.floor(math.log(sum(map(int,l.split())),10)+1) for l in sys.stdin]
for d in a:
print(d) | 5 7
1 99
1000 999
| 2
3
4
|
<H1>Digit Number</H1>
<p>
Write a program which computes the digit number of sum of two integers <var>a</var> and <var>b</var>.
</p>
<H2>Input</H2>
<p>
There are several test cases. Each test case consists of two non-negative integers <var>a</var> and <i>b</i> which are separeted by a space in a line. The input terminates with EOF.
</p>
<h2>Constraints</h2>
<ul>
<li>0 ≤ <var>a</var>, <var>b</var> ≤ 1,000,000</li>
<li>The number of datasets ≤ 200</li>
</ul>
<H2>Output</H2>
<p>
Print the number of digits of <var>a</var> + <var>b</var> for each data set.
</p>
<H2>Sample Input</H2>
<pre>
5 7
1 99
1000 999
</pre>
<H2>Output for the Sample Input</H2>
<pre>
2
3
4
</pre>
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.