s_id stringlengths 10 10 | p_id stringlengths 6 6 | u_id stringlengths 10 10 | date stringlengths 10 10 | language stringclasses 1
value | original_language stringclasses 11
values | filename_ext stringclasses 1
value | status stringclasses 1
value | cpu_time int64 0 100 | memory stringlengths 4 6 | code_size int64 15 14.7k | code stringlengths 15 14.7k | problem_id stringlengths 6 6 | problem_description stringlengths 358 9.83k | input stringlengths 2 4.87k | output stringclasses 807
values | __index_level_0__ int64 1.1k 1.22M |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
s650757063 | p00728 | u904289400 | 1590503089 | Python | Python3 | py | Accepted | 20 | 5600 | 258 | while True:
n=int(input())
x=[]
for i in range(n):
a=int(input())
x.append(a)
i+=1
if n==0:
break
x.sort()
sum=0
l=len(x)
for i in range(1,l-1):
sum+=x[i]
y=sum//(l-2)
print(y)
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,396 |
s192039160 | p00728 | u171326376 | 1590454143 | Python | Python3 | py | Accepted | 30 | 5596 | 355 | while True:
n = int(input())
if n == 0:
break
tensu = []
for i in range(1,n+1):
s = int(input())
tensu.append(s)
m = min(tensu)
M = max(tensu)
tensu.remove(m)
tensu.remove(M)
t = len(tensu)
sum = 0
for j in range(0,t):
sum += tensu[j]
r = s... | p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,397 |
s545398619 | p00728 | u511744190 | 1590389533 | Python | Python3 | py | Accepted | 30 | 5608 | 233 | while True:
n=int(input())
if n==0:
break
else:
a=[int(input()) for i in range(n)]
x=max(a)
y=min(a)
a.remove(x)
a.remove(y)
ave = sum(a)//len(a)
print(ave)
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,398 |
s418447457 | p00728 | u981910313 | 1590385931 | Python | Python3 | py | Accepted | 30 | 5600 | 219 |
while True:
n=int(input())
m,smin,smax=0,1000,-1
if n==0:break
for i in range(n):
s=int(input())
smin=min(smin,s)
smax=max(smax,s)
m += s
print((m-smin-smax)//(n-2))
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,399 |
s412227390 | p00728 | u470391435 | 1590381842 | Python | Python3 | py | Accepted | 20 | 5596 | 208 | while 1:
n = int(input())
if n==0:
break
lst = []
for i in range(n):
lst.append(int(input()))
lst.sort()
del lst[0]
del lst[n-2]
y=sum(lst)
print(y//(n-2))
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,400 |
s489723399 | p00728 | u994684803 | 1590326775 | Python | Python3 | py | Accepted | 30 | 5592 | 276 | while True :
n=int(input())
if n==0 :
break
i=0
b=0
ma=0
mi=1000
while i<n :
c=int(input())
if ma<c :
ma=c
if mi>c :
mi=c
b=b+c
i=i+1
print(int((b-ma-mi)/(n-2)))
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,401 |
s560576719 | p00728 | u941048039 | 1590323451 | Python | Python3 | py | Accepted | 20 | 5600 | 181 | while True:
N = int(input())
if N == 0:
break
S = [ int(input()) for i in range(N)]
S.sort()
del S[len(S) - 1]
del S[0]
print(sum(S) // len(S))
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,402 |
s336775340 | p00728 | u823642749 | 1590315745 | Python | Python3 | py | Accepted | 20 | 5624 | 353 | """
Problem A: ICPC 得点集計ソフトウェア
"""
if __name__ == '__main__':
ans = []
while(True):
n = int(input())
if n == 0:
break
l = [int(input()) for _ in range(n)]
maxi = max(l)
mini = min(l)
ans.append((sum(l) - maxi - mini)//(n-2))
print(*ans... | p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,403 |
s820640411 | p00728 | u228556128 | 1590026717 | Python | Python3 | py | Accepted | 20 | 5596 | 222 | while True:
n=int(input())
if n==0:
break
lst=[]
for i in range(n):
x=int(input())
lst.append(x)
lst.remove(min(lst))
lst.remove(max(lst))
x=sum(lst)//(n-2)
print(x)
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,404 |
s121516283 | p00728 | u322947441 | 1589941239 | Python | Python3 | py | Accepted | 20 | 5656 | 218 | import math
while True:
n = int(input())
if n == 0:
break
s=[]
for i in range(0,n):
s.append(int(input()))
s.remove(min(s))
s.remove(max(s))
print(math.floor(sum(s)/len(s)))
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,405 |
s408987308 | p00728 | u862272701 | 1589849218 | Python | Python3 | py | Accepted | 30 | 5596 | 276 | i = 0
while True:
n = int(input())
if n == 0:
break
x = 0
b = -1
c = 1001
for i in range(n):
a = int(input())
x += a
b = max(b, a)
c = min(a, c)
y = (x-b-c)//(n-2)
i += 1
print(y)
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,406 |
s453025577 | p00728 | u705625724 | 1589825432 | Python | Python3 | py | Accepted | 20 | 5600 | 259 | # coding: utf-8
# 38
while True:
n = int(input())
S = []
if n==0:
break
for i in range(n):
S.append(int(input()))
#print(S)
S.sort()
#print(S)
S.pop(0)
S.pop()
#print(S)
print(sum(S)//(n-2))
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,407 |
s262005390 | p00728 | u173393391 | 1589787151 | Python | Python3 | py | Accepted | 30 | 5592 | 235 | while True:
n=int(input())
if n==0:
break
list=[]
for x in range(n):
x=int(input())
list.append(x)
a=sum(list)
b=min(list)
c=max(list)
print((a-b-c)//(n-2))
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,408 |
s729215448 | p00728 | u325540378 | 1589786208 | Python | Python3 | py | Accepted | 30 | 5608 | 214 | ans = []
while True:
n = int(input())
if n == 0:
break
score = [int(input()) for i in range(n)]
score.sort()
ans.append(sum(score[1:-1]) // len(score[1:-1]))
for i in ans:
print(i)
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,409 |
s796820303 | p00728 | u140569607 | 1589779004 | Python | Python3 | py | Accepted | 30 | 5592 | 312 | while True:
n = int(input())
max = 0
min = 1000
sum = 0
ave = 0
if n == 0:
break
for i in range(n):
s = int(input())
sum += s
if s < min:
min = s
if max < s:
max = s
ave = (sum - min - max) // (n - 2)
print(ave)
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,410 |
s630958590 | p00728 | u895962529 | 1589778861 | Python | Python3 | py | Accepted | 20 | 5604 | 139 | while True:
n=int(input())
if n==0:
break
s=[int(input()) for i in range(n)]
print((sum(s)-min(s)-max(s))//(n-2))
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,411 |
s671857169 | p00728 | u611579581 | 1589640025 | Python | Python3 | py | Accepted | 20 | 5612 | 198 | ans = []
while True:
N = int(input())
if N == 0:
break
A = sorted([int(input()) for i in range(N)])
ans.append(sum(A[1:-1]) // (N - 2))
[print(i) for i in ans]
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,412 |
s831393840 | p00728 | u747915832 | 1589627135 | Python | Python3 | py | Accepted | 50 | 5600 | 411 | while True:
n = int(input())
slist = []
for i in range(n):
s = int(input())
slist.append(s)
if n==0:
break
for j in range(n):
for k in range(n-1,0,-1):
if slist[k-1]>slist[k]:
slist[k-1],slist[k] = slist[k],slist[k-1]
sli... | p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,413 |
s223986688 | p00728 | u884758681 | 1589611176 | Python | Python3 | py | Accepted | 20 | 5596 | 253 | while True:
n=int(input())
x=[]
for i in range(n):
s=int(input())
x.append(s)
x1=sorted(x)
if n==0:
break
else:
sum1=sum(x1)
sum1-=x1[0]+x1[n-1]
y=sum1//(n-2)
print(y)
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,414 |
s180977470 | p00728 | u593595530 | 1589573961 | Python | Python3 | py | Accepted | 30 | 5596 | 323 | p=1
num=[]
while p==1:
x=int(input())
if x==0:
break
else:
y=x
while y>0:
a=int(input())
num.append(a)
y-=1
num.sort()
del num[0]
del num[-1]
poo=sum(num)
pooh=poo//(x-2)
print(pooh)
num.clear... | p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,415 |
s736678895 | p00728 | u253463111 | 1589530254 | Python | Python3 | py | Accepted | 30 | 5596 | 228 | while True :
n=int(input())
if n==0:
break
su,amin,amax=0,1000,0
for i in range(n):
a=int(input())
amin=min(amin,a)
amax=max(amax,a)
su+=a
print((su-amin-amax)//(n-2))
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,416 |
s036862974 | p00728 | u435414815 | 1589514381 | Python | Python3 | py | Accepted | 20 | 5592 | 239 | while True :
x=int(input())
if x==0 : break
i=0
b=0
mx=0
mn=1000
while i<x :
c=int(input())
if mx<c : mx=c
if mn>c : mn=c
b=b+c
i=i+1
print(int((b-mx-mn)/(x-2)))
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,417 |
s243609841 | p00728 | u290304811 | 1589441229 | Python | Python3 | py | Accepted | 20 | 5592 | 252 | while True:
amax=-1; amin=1001; t=0
n = int(input())
if n==0:
break
for i in range(n):
a = int(input())
amax = max(amax,a)
amin = min(amin,a)
t += a
print((t-amax-amin)//(n-2))
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,418 |
s176783625 | p00728 | u647921435 | 1589432047 | Python | Python3 | py | Accepted | 30 | 5600 | 244 | while True:
n=int(input())
x=[]
if n==0:
break
else:
for i in range(n):
s=int(input())
x.append(s)
a=min(x)
b=max(x)
ave=(sum(x)-a-b)/(n-2)
print(int(ave))
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,419 |
s155591543 | p00728 | u814278309 | 1589426748 | Python | Python3 | py | Accepted | 30 | 5608 | 174 | while 1:
n = int(input())
if n == 0:
break
s = [int(input()) for i in range(n)]
s.sort()
x = sum(s) - (s[0] + s[-1])
print(x // (n - 2))
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,420 |
s717672959 | p00728 | u192469946 | 1589284825 | Python | Python3 | py | Accepted | 30 | 5600 | 152 | while True:
n = int(input())
if n == 0:
break
i = [int(input()) for i in range(n)]
print((sum(i) - min(i) - max(i)) // (n - 2))
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,421 |
s504321063 | p00728 | u988962397 | 1589186037 | Python | Python3 | py | Accepted | 30 | 5592 | 302 | while True:
n=int(input())
if n==0:
break
i=1
sum=0
max=0
min=1000
while i<=n:
a=int(input())
if max<a:
max=a
if min>a:
min=a
sum+=a
i+=1
sum=sum-max-min
print(int(sum/(n-2)))
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,422 |
s497316279 | p00728 | u395654950 | 1589182048 | Python | Python3 | py | Accepted | 30 | 5592 | 311 | # coding: utf-8
# Your code here!
while True:
min = 1000
max = 0
sum = 0
n = int(input())
if n == 0:
break
for i in range(n):
s = int(input())
if s < min:
min = s
if s > max:
max = s
sum += s
print((sum - min - max) // (n - 2) )
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,423 |
s803927266 | p00728 | u583329397 | 1589114968 | Python | Python3 | py | Accepted | 30 | 5592 | 279 | while True:
n=int(input())
max=0
min=1000
sum=0
ave=0
if n==0:
break
for i in range(n):
s=int(input())
sum+=s
if s<min:
min=s
if max<s:
max=s
ave=(sum-min-max)//(n-2)
print(ave)
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,424 |
s567953499 | p00728 | u842461513 | 1588987780 | Python | Python3 | py | Accepted | 20 | 5592 | 742 | while True: #無限に繰り返す
num = int(input()) #標準入力
if num == 0:break #入力値が0だった場合繰り返しを強制終了する
else: #0でなければ
num_list = [] #空リスト作成
for _ in range(num): #入力回繰り返す
num_list.append(int(input())) #標準入力をし、リストに加える
num_list.sort() #リストを小さい順に並べる
num_list.pop(-1) #リストの最高点を削除する
... | p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,425 |
s055452693 | p00728 | u350963229 | 1588963672 | Python | Python3 | py | Accepted | 20 | 5604 | 147 | while True:
a=int(input())
if a==0:break
x=[int(input()) for i in range(a)]
x.sort()
print((sum(x)-max(x)-min(x))//(a-2))
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,426 |
s909721425 | p00728 | u014861569 | 1588437659 | Python | Python3 | py | Accepted | 20 | 5592 | 258 | while True:
n=int(input())
if n==0:
break
s=0
y=[]
for i in range(1,n+1):
a=int(input())
y.append(a)
ymax=max(y)
ymin=min(y)
y.remove(ymax)
y.remove(ymin)
ysum=sum(y)
print(int(ysum/(n-2)))
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,427 |
s791489037 | p00728 | u037441960 | 1588062042 | Python | Python3 | py | Accepted | 30 | 5600 | 283 | while True :
n = int(input())
P = []
if n == 0 :
break
else :
for i in range(n) :
P.append(int(input()))
Ps = sorted(P)
del Ps[0]
del Ps[n - 2]
s = sum(Ps)
print(s // (n - 2))
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,428 |
s716473344 | p00728 | u206124123 | 1587098614 | Python | Python3 | py | Accepted | 40 | 6608 | 807 | from pprint import pprint as pp
from pprint import pformat as pf
import math
def get_data():
input_data = int(input())
return input_data
def make_score_list(referee_num):
score_list = [None] * referee_num
for i in range(referee_num):
score_list[i] = get_data()
return score_list
def calcul... | p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,429 |
s361341739 | p00728 | u838900850 | 1585232021 | Python | Python3 | py | Accepted | 30 | 5600 | 295 | def main():
while True:
n = int(input())
if n == 0:break
a = []
for i in range(n):
a.append(int(input()))
a.sort()
sum = 0
for i in range(1,n-1):sum+=a[i]
print(sum//(n-2))
if __name__ == '__main__':
main()
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,430 |
s984006112 | p00728 | u787764999 | 1585228927 | Python | Python3 | py | Accepted | 20 | 5596 | 168 | while True:
N = int(input())
if N == 0:
break
S = []
for i in range(N):
S.append(int(input()))
print((sum(S)-max(S)-min(S))//(N-2))
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,431 |
s201419639 | p00728 | u353888999 | 1585130358 | Python | Python3 | py | Accepted | 20 | 5604 | 254 | while 1:
n = int(input())
if n == 0:
break
point = [int(input()) for i in range(n)]
point.sort()
Sum = 0
hito = 0
for i in range(1,n-1):
Sum += point[i]
hito += 1
ans = Sum // hito
print(ans)
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,432 |
s595985394 | p00728 | u330854367 | 1583652465 | Python | Python3 | py | Accepted | 30 | 5600 | 219 | while 1:
score = []
n = int(input())
if n == 0:
break
for _ in range(n):
score.append(int(input()))
score.sort()
del score[0]
del score[-1]
print(sum(score)//len(score))
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,433 |
s838752500 | p00728 | u821608651 | 1580204644 | Python | Python3 | py | Accepted | 30 | 6032 | 891 | import sys
sys.setrecursionlimit(10 ** 6)
from bisect import *
from collections import *
from heapq import *
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def SI(): return sys.stdin.readline()[:-1]
def MI(): return map(int, sys.stdin.readline().split())
def... | p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,434 |
s366342782 | p00728 | u668489394 | 1579138538 | Python | Python3 | py | Accepted | 30 | 5596 | 288 | if __name__ == '__main__':
while True:
N = int(input())
if N == 0:
break
arr = []
for _ in range(N):
arr.append(int(input().strip()))
n = sum(arr)
n -= max(arr) + min(arr)
print(n // (N - 2))
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,435 |
s410240878 | p00728 | u829695570 | 1578084833 | Python | Python3 | py | Accepted | 20 | 5596 | 166 | while 1:
n = int(input())
if n == 0:
break
a = []
for i in range(n):
a.append(int(input()))
print((sum(a)-max(a)-min(a))//(n-2))
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,436 |
s237793669 | p00728 | u537758214 | 1570095914 | Python | Python3 | py | Accepted | 20 | 5608 | 212 | def main():
N = int(input())
while N != 0:
s = [int(input()) for i in range(N)]
s.sort()
print(sum(s[1:N-1])//(N-2))
N = int(input())
if __name__ == '__main__':
main()
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,437 |
s641142874 | p00728 | u701749469 | 1569396838 | Python | Python3 | py | Accepted | 20 | 5592 | 214 | while True:
n = int(input())
if n == 0:
break
judges = []
for i in range(n):
judges.append(int(input()))
print((sum(judges) - max(judges) - min(judges)) // (len(judges) - 2))
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,438 |
s870939021 | p00728 | u193874819 | 1569391893 | Python | Python3 | py | Accepted | 30 | 5592 | 231 | while True:
n = int(input())
if n == 0:
break
lista = []
for i in range(n):
lista.append(int(input()))
lista.sort()
lista.pop(0)
lista.pop(-1)
ave = sum(lista)//(n-2)
print(ave)
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,439 |
s887694032 | p00728 | u784856415 | 1566986982 | Python | Python3 | py | Accepted | 20 | 5616 | 478 | #import pysnooper
#import os,re,sys,operator,math,heapq,string
#from collections import Counter,deque
#from operator import itemgetter
#from itertools import accumulate,combinations,groupby,combinations_with_replacement
from sys import stdin,setrecursionlimit
#from copy import deepcopy
setrecursionlimit(10**6)
input=s... | p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,440 |
s594369638 | p00728 | u989573662 | 1563462188 | Python | Python3 | py | Accepted | 30 | 5600 | 196 | #!/usr/bin/env python3
#ICPC A
while 1:
n = int(input())
if n == 0:
break
s = [int(input()) for _ in range(n)]
s.sort()
ans = sum(s[1:n-1])/(n-2)
print(int(ans))
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,441 |
s855415101 | p00728 | u366780090 | 1563029465 | Python | Python3 | py | Accepted | 30 | 5596 | 247 | person = int(input())
while person != 0:
scores = []
for i in range(person):
scores.append(int(input()))
scores.sort()
del scores[0]
del scores[-1]
print(int(sum(scores)/len(scores)))
person = int(input())
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,442 |
s383772722 | p00728 | u681232780 | 1562913206 | Python | Python3 | py | Accepted | 20 | 5600 | 244 | while True :
num = int(input())
if num == 0 :
break
A = []
for i in range(num):
sco = int(input())
A.append(sco)
A.sort()
del A[num - 1]
del A[0]
B = int(sum(A)/(num-2))
print(B)
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,443 |
s003086692 | p00728 | u317942270 | 1562822522 | Python | Python3 | py | Accepted | 30 | 5600 | 220 | ans_list = []
while True:
n = int(input())
if n == 0:
break
s = sorted([int(input()) for _ in range(n)])
ans = sum(s[1:-1]) // (n-2)
ans_list.append(ans)
for ans in ans_list:
print(ans)
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,444 |
s317506288 | p00728 | u030858652 | 1562768135 | Python | Python3 | py | Accepted | 30 | 5652 | 764 | from math import *
while True:
a = int(input())
if a == 0: break
#print('a')
score_list = []
#max_score = 0
#min_score = 1000
for i in range(a):
score_list.append(int(input()))
#print(score_list)
max_ = max(score_list)
min_ = min(score_list)
#print('b')
ans_lis... | p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,445 |
s387544523 | p00728 | u023276896 | 1562713594 | Python | Python3 | py | Accepted | 20 | 5604 | 313 | # -*- coding: utf-8 -*-
def main():
while 1:
n = int(input())
if n == 0:
return 0
s_l = []
for _ in range(n):
s_l.append(int(input()))
ans = int((sum(s_l) - max(s_l) - min(s_l))/(n-2))
print(ans)
if __name__ == "__main__":
main()
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,446 |
s468740636 | p00728 | u556131648 | 1562345265 | Python | Python3 | py | Accepted | 30 | 5600 | 332 | def solve(n, score):
score = sorted(score)
return sum(score[1:-1])//len(score[1:-1])
def main():
ans = []
while True:
n = int(input())
if (n == 0):
break
score = [int(input()) for i in range(n)]
ans.append(solve(n, score))
for i in ans:
print... | p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,447 |
s369945828 | p00728 | u998734722 | 1562154982 | Python | Python3 | py | Accepted | 30 | 5600 | 201 | while True:
n = int(input())
if n == 0:
break
x = []
for i in range(n):
x.append(int(input()))
x = sorted(x)
x.pop(0)
x.pop(-1)
print(sum(x) // len(x))
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,448 |
s896652706 | p00728 | u506598317 | 1561785239 | Python | Python3 | py | Accepted | 30 | 5604 | 153 | while True:
n = int(input())
if n == 0:
break
s = sorted([int(input()) for i in range(n)])
s = s[1:-1]
print(sum(s)//len(s))
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,449 |
s936533364 | p00728 | u657929974 | 1561721604 | Python | Python3 | py | Accepted | 20 | 5596 | 221 | while True:
n = int(input())
if n == 0:
break
point = []
for i in range(n):
point.append(int(input()))
point.sort()
del point[0]
del point[-1]
print(sum(point) // (n - 2))
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,450 |
s939356863 | p00728 | u314166831 | 1561639184 | Python | Python3 | py | Accepted | 30 | 5748 | 2,034 | # coding=utf-8
###
### for atcorder program
###
import sys
import math
import array
# math class
class mymath:
### pi
pi = 3.14159265358979323846264338
### Prime Number
def pnum_eratosthenes(self, n):
ptable = [0 for i in range(n+1)]
plist = []
for i in range(2, n+1):
... | p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,451 |
s099358539 | p00728 | u264450287 | 1561507607 | Python | Python3 | py | Accepted | 30 | 5596 | 218 | while True:
n=int(input())
if n==0:
break
lists=[]
for i in range(n):
lists.append(int(input()))
a=max(lists)
b=min(lists)
x=int(len(lists))
average=(sum(lists)-a-b)/(x-2)
print(int(average))
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,452 |
s923414801 | p00728 | u215870135 | 1561194125 | Python | Python3 | py | Accepted | 30 | 5588 | 295 | while True:
n = int(input())
if n == 0:
break
sum_ = 0
max_ = 0
min_ = 1000
for i in range(n):
tmp = int(input())
sum_ += tmp
max_ = max(max_, tmp)
min_ = min(min_, tmp)
sum_ -= max_
sum_ -= min_
print(int(sum_/(n-2)))
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,453 |
s606017815 | p00728 | u282089342 | 1561036772 | Python | Python3 | py | Accepted | 30 | 5604 | 177 | def solve(n):
a = [int(input()) for i in range(n)]
print((sum(a)-max(a)-min(a))//(n-2))
while(True):
n = int(input())
if(n == 0):
quit()
solve(n)
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,454 |
s347609320 | p00728 | u853158149 | 1561036348 | Python | Python3 | py | Accepted | 30 | 5608 | 142 | while 1:
n = int(input())
if n == 0:
break
s = [int(input()) for i in range(n)]
print((sum(s)-max(s)-min(s))//(n-2))
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,455 |
s195761850 | p00728 | u464321546 | 1561034630 | Python | Python3 | py | Accepted | 40 | 8196 | 1,416 | #!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
def LI(): ret... | p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,456 |
s493352714 | p00728 | u595029599 | 1560693782 | Python | Python3 | py | Accepted | 30 | 5608 | 141 | while True:
n = int(input())
if not n:
break
print(sum(sorted([int(input()) for _ in range(n)])[1:-1]) // (n - 2))
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,457 |
s416339145 | p00728 | u237184581 | 1560651356 | Python | Python3 | py | Accepted | 20 | 5596 | 338 | N = int(input())
while N != 0:
total = 0
minimam = 1000
maximam = 0
for _ in range(N):
s = int(input())
total += s
minimam = min(minimam, s)
maximam = max(maximam, s)
print(int((total-minimam-maximam)/(N-2)))
... | p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,458 |
s123759729 | p00728 | u011621222 | 1560498209 | Python | Python3 | py | Accepted | 30 | 5600 | 276 | Ps = []
while True:
i = int(input())
if i == 0:
break
P = []
P.append(i)
for ii in range(i):
P.append(int(input()))
Ps.append(P)
for p in Ps:
p[0] = 0
p.sort()
p[1] = 0
p[-1] = 0
print(int(sum(p) / (len(p) - 3)))
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,459 |
s339213190 | p00728 | u135085051 | 1559997163 | Python | Python3 | py | Accepted | 20 | 5604 | 262 | # ICPC Score Totalizer Software
ans = []
while True:
n = int(input())
if n == 0:
break
point = [int(input()) for i in range(n)]
ans.append((sum(point) - max(point) - min(point)) // (n - 2))
for i in range(len(ans)):
print(ans[i])
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,460 |
s939182244 | p00728 | u884752043 | 1558493063 | Python | Python3 | py | Accepted | 20 | 5596 | 443 | def culc(num_referee):
data=[]
for i in range(num_referee):
data.append(int(input()))
data.sort()
sum_data=0
data[0]=0
data[len(data)-1]=0
#print(data)
for j in data:
sum_data=sum_data+j
avg=sum_data/(len(data)-2)
print(int(avg))
num_referee=1
while(1):
num_... | p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,461 |
s211550207 | p00728 | u945913386 | 1557758074 | Python | Python3 | py | Accepted | 20 | 5608 | 194 | n = 1
while n != 0:
n = int(input())
S = []
S = [int(input()) for _ in range(n)]
if n==0:
break
ans = (sum(S)-min(S)-max(S))/(n-2)
Ans = int(ans)
print(Ans)
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,462 |
s613221637 | p00728 | u910909659 | 1555327554 | Python | Python3 | py | Accepted | 30 | 5596 | 180 | while True:
N = int(input())
if N == 0:
break
S = []
for i in range(N):
S.append(int(input()))
a = sum(S)-max(S)-min(S)
print(int(a/(N-2)))
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,463 |
s845029229 | p00728 | u698762975 | 1555324398 | Python | Python3 | py | Accepted | 30 | 5592 | 199 | while True:
n=int(input()) #審判の数
if n==0:#入力終了
break
l=[]
s=0
for i in range(n):
j=int(input()) #得点
l.append(j)
s+=j
print((s-max(l)-min(l)) //(n-2))
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,464 |
s816156591 | p00728 | u528682978 | 1555323489 | Python | Python3 | py | Accepted | 20 | 5604 | 243 | while True:
n = int(input())
score = []
ans = 0
if n==0:
break
for i in range(n):
score.append(int(input()))
score.sort()
for i in range(1,len(score)-1):
ans+=score[i]
print(ans//(n-2))
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,465 |
s007063751 | p00728 | u026821956 | 1555323330 | Python | Python3 | py | Accepted | 20 | 5600 | 172 | while True:
N = int(input())
if N == 0:
break
L = []
for i in range(N):
L.append(int(input()))
L.sort()
A = sum(L)
print((A-L[0]-L[len(L)-1])//(N-2))
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,466 |
s238699164 | p00728 | u046108504 | 1554960268 | Python | Python3 | py | Accepted | 50 | 7004 | 217 | from statistics import mean
import math
while True:
n = int(input())
if n == 0:
break
s = [int(input()) for _ in range(n)]
s.remove(max(s))
s.remove(min(s))
print(math.floor(mean(s)))
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,467 |
s381931779 | p00728 | u990228206 | 1554810303 | Python | Python3 | py | Accepted | 30 | 5604 | 190 | while 1:
n=int(input())
if n==0:break
score=[]
for i in range(n):
score.append(int(input()))
score.sort()
score=score[1:-1]
print(sum(score)//len(score))
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,468 |
s894706731 | p00728 | u518454370 | 1553349997 | Python | Python3 | py | Accepted | 20 | 5604 | 227 | list2=[]
while True:
try:
N=int(input())
list1=[int(input()) for _ in range(N)]
list2.append(int((sum(list1)-max(list1)-min(list1))/(N-2)))
except:
break
for tmp in list2:
print(tmp)
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,469 |
s313011070 | p00728 | u386583926 | 1550381439 | Python | Python3 | py | Accepted | 20 | 5656 | 278 | import math
while True:
score = []
n = int(input())
if n == 0:
break
else:
for i in range(n):
score.append(int(input()))
score.remove(min(score))
score.remove(max(score))
print(math.floor(sum(score)/len(score)))
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,470 |
s771687915 | p00728 | u659034691 | 1546747329 | Python | Python3 | py | Accepted | 30 | 5588 | 356 | # your code goes here
n=int(input())
while n!=0:
s=int(input())
x=s
m=s
for i in range (n-1):#n-2?:?
p=int(input ())
if m>p:
# s+=m
m=p
elif x<p:
# s+=x
x=p
# else:
s+=p
# print (s)
s-=x
s-=m
s/=n-2
... | p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,471 |
s607957415 | p00728 | u717526540 | 1544761059 | Python | Python3 | py | Accepted | 20 | 5592 | 219 | while 1:
n = int(input())
if n == 0:
break
pt = []
for _ in range(n):
pt.append(int(input()))
pt.sort()
pt.pop(0)
pt.pop()
ans = int(sum(pt) / len(pt))
print(ans)
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,472 |
s345677898 | p00728 | u598814210 | 1543046852 | Python | Python3 | py | Accepted | 30 | 5604 | 134 | while True:
N=int(input())
if(N==0): break
s = [int(input()) for i in range(N)]
print(sum(sorted(s)[1:-1]) // (N-2))
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,473 |
s981300736 | p00728 | u160320718 | 1539599205 | Python | Python3 | py | Accepted | 50 | 6984 | 200 | from statistics import mean
while True:
N = int(input())
if N == 0:
break
S = []
for i in range(N):
S.append(int(input()))
S.remove(max(S))
S.remove(min(S))
print(int(mean(S)))
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,474 |
s594470653 | p00728 | u281836941 | 1512991752 | Python | Python3 | py | Accepted | 30 | 5612 | 556 | # coding: utf-8
def q0():
while True:
data=[]
n=int(input())
if n==0:
return
for i in range(n):
data.append(int(input()))
print((sum(data)-max(data)-min(data))//(n-2))
def q1():
while True:
n,r=map(int,input().split())
if n==0:
... | p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,475 |
s942382504 | p00728 | u717727327 | 1418918053 | Python | Python | py | Accepted | 20 | 4196 | 151 | while True:
n = int(raw_input())
if n == 0: break
ls = [int(raw_input()) for i in range(n)]
ls.sort()
print sum(ls[1:-1]) / (n-2)
| p00728 |
<h1><font color="#000">Problem A:</font> ICPC Score Totalizer Software</h1>
<!-- end en only -->
<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_a-1" width=300 align=left>
<!-- begin en only -->
<p>
The International Clown and Pierrot Competition (ICPC), is one of the
most distinguished and also the... | 3
1000
342
0
5
2
2
9
11
932
5
300
1000
0
200
400
8
353
242
402
274
283
132
402
523
0
| 342
7
300
326
| 24,476 |
s426743647 | p00729 | u731235119 | 1422190486 | Python | Python | py | Accepted | 100 | 8200 | 608 | while 1:
N, M = map(int,raw_input().split())
if (N,M) == (0,0):
break
r = int(raw_input())
log = [[0,[]] for i in range(M)]
time_log = [[] for i in range(M)]
for i in range(r):
t, n, m, s = map(int,raw_input().split())
if s == 1:
log[m-1][1].append(t)
log[m-1][0] += 1
else :
tmp = log[m-1][1].pop... | p00729 |
<h1><font color="#000">Problem B:</font> Analyzing Login/Logout Records</h1>
<!-- end en only -->
<p>
You have a computer literacy course in your university. In the computer
system, the login/logout records of all PCs in a day are stored in a
file. Although students may use two or more PCs at a time, no one can
lo... | 4 2
10
775 1 1 1
780 4 2 1
790 2 1 1
800 2 1 0
810 3 1 1
820 1 1 0
825 3 1 0
860 1 1 1
870 4 2 0
880 1 1 0
1
780 870 1
13 15
12
540 12 13 1
600 12 13 0
650 13 15 1
660 12 15 1
665 11 13 1
670 13 15 0
675 11 13 0
680 12 15 0
1000 11 14 1
1060 12 14 1
1060 11 14 0
1080 12 14 0
3
540 700 13
600 1000 15
1000 1200 11
1 1
2
... | 55
70
30
0
0
50
10
50
0
| 24,477 |
s124234416 | p00729 | u509278866 | 1528165071 | Python | Python3 | py | Accepted | 100 | 9224 | 1,343 | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 998244353
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF... | p00729 |
<h1><font color="#000">Problem B:</font> Analyzing Login/Logout Records</h1>
<!-- end en only -->
<p>
You have a computer literacy course in your university. In the computer
system, the login/logout records of all PCs in a day are stored in a
file. Although students may use two or more PCs at a time, no one can
lo... | 4 2
10
775 1 1 1
780 4 2 1
790 2 1 1
800 2 1 0
810 3 1 1
820 1 1 0
825 3 1 0
860 1 1 1
870 4 2 0
880 1 1 0
1
780 870 1
13 15
12
540 12 13 1
600 12 13 0
650 13 15 1
660 12 15 1
665 11 13 1
670 13 15 0
675 11 13 0
680 12 15 0
1000 11 14 1
1060 12 14 1
1060 11 14 0
1080 12 14 0
3
540 700 13
600 1000 15
1000 1200 11
1 1
2
... | 55
70
30
0
0
50
10
50
0
| 24,478 |
s592329028 | p00729 | u109084363 | 1360472201 | Python | Python | py | Accepted | 40 | 4764 | 1,182 | import sys
import collections
while True:
pc, student = map(int, sys.stdin.readline().split())
if pc == student == 0:
break
record = collections.defaultdict(list)
r = int(raw_input())
for i in xrange(r):
t, n, m, s = map(int, sys.stdin.readline().split())
record[m].appe... | p00729 |
<h1><font color="#000">Problem B:</font> Analyzing Login/Logout Records</h1>
<!-- end en only -->
<p>
You have a computer literacy course in your university. In the computer
system, the login/logout records of all PCs in a day are stored in a
file. Although students may use two or more PCs at a time, no one can
lo... | 4 2
10
775 1 1 1
780 4 2 1
790 2 1 1
800 2 1 0
810 3 1 1
820 1 1 0
825 3 1 0
860 1 1 1
870 4 2 0
880 1 1 0
1
780 870 1
13 15
12
540 12 13 1
600 12 13 0
650 13 15 1
660 12 15 1
665 11 13 1
670 13 15 0
675 11 13 0
680 12 15 0
1000 11 14 1
1060 12 14 1
1060 11 14 0
1080 12 14 0
3
540 700 13
600 1000 15
1000 1200 11
1 1
2
... | 55
70
30
0
0
50
10
50
0
| 24,479 |
s037835662 | p00730 | u328199937 | 1555834853 | Python | Python3 | py | Accepted | 100 | 6272 | 1,274 | ans_list = []
def make_pieces(w, d, s):
if w == 0 and d == 0:
print(w, d, s)
s %= (2 * w + 2 * d)
while True:
if w > s:
return [s, d], [w - s, d]
s -= w
if d > s:
return [w, s], [w, d - s]
s -= d
if w > s:
return [w - s, d],... | p00730 |
<h1><font color="#000">Problem C:</font> Cut the Cake</h1>
<!-- end en only -->
<p>
Today is the birthday of Mr. Bon Vivant, who is known as one of the greatest <i>pâtissiers</i> in the world.
Those who are invited to his birthday party are <i>gourmets</i> from around the world.
They are eager to see and eat h... | 3 5 6
1 18
2 19
1 2
3 4 1
1 1
2 1
3 1
0 2 5
0 0 0
| 4 4 6 16
1 1 1 1
10
| 24,480 |
s589970752 | p00730 | u633068244 | 1424525557 | Python | Python | py | Accepted | 60 | 4248 | 516 | while 1:
n,w,d = map(int,raw_input().split())
if w == 0: break
cake = [[w,d]]
for loop in xrange(n):
p,s = map(int,raw_input().split())
x,y = cake.pop(p-1)
s %= (x+y)
if s < x:
x1,x2 = sorted([s,x-s])
cake.append([x1,y])
cake.append([x2... | p00730 |
<h1><font color="#000">Problem C:</font> Cut the Cake</h1>
<!-- end en only -->
<p>
Today is the birthday of Mr. Bon Vivant, who is known as one of the greatest <i>pâtissiers</i> in the world.
Those who are invited to his birthday party are <i>gourmets</i> from around the world.
They are eager to see and eat h... | 3 5 6
1 18
2 19
1 2
3 4 1
1 1
2 1
3 1
0 2 5
0 0 0
| 4 4 6 16
1 1 1 1
10
| 24,481 |
s915590366 | p00730 | u633068244 | 1424525652 | Python | Python | py | Accepted | 40 | 4240 | 460 | while 1:
n,w,d = map(int,raw_input().split())
if w == 0: break
cake = [[w,d]]
for loop in xrange(n):
p,s = map(int,raw_input().split())
x,y = cake.pop(p-1)
s %= (x+y)
if s < x:
x1,x2 = sorted([s,x-s])
cake += [[x1,y],[x2,y]]
else:
... | p00730 |
<h1><font color="#000">Problem C:</font> Cut the Cake</h1>
<!-- end en only -->
<p>
Today is the birthday of Mr. Bon Vivant, who is known as one of the greatest <i>pâtissiers</i> in the world.
Those who are invited to his birthday party are <i>gourmets</i> from around the world.
They are eager to see and eat h... | 3 5 6
1 18
2 19
1 2
3 4 1
1 1
2 1
3 1
0 2 5
0 0 0
| 4 4 6 16
1 1 1 1
10
| 24,482 |
s923459665 | p00730 | u802625365 | 1474775742 | Python | Python3 | py | Accepted | 100 | 7688 | 827 | def cut(cake,s):
ret_cake = [ (-1,-1),(-1,-1) ]
w = cake[2]
h = cake[1]
s %= 2*(w+h)
if w > s:
ret_cake = [(h,s),(h,w-s)]
elif w+h > s:
ret_cake = [(s-w,w),(w+h-s,w)]
elif 2*w+h > s:
ret_cake = [(h,s-w-h),(h,2*w+h-s)]
elif 2*w+2*h > s:
ret_cake = [(s-2*w... | p00730 |
<h1><font color="#000">Problem C:</font> Cut the Cake</h1>
<!-- end en only -->
<p>
Today is the birthday of Mr. Bon Vivant, who is known as one of the greatest <i>pâtissiers</i> in the world.
Those who are invited to his birthday party are <i>gourmets</i> from around the world.
They are eager to see and eat h... | 3 5 6
1 18
2 19
1 2
3 4 1
1 1
2 1
3 1
0 2 5
0 0 0
| 4 4 6 16
1 1 1 1
10
| 24,483 |
s562212919 | p00730 | u408260374 | 1493919540 | Python | Python3 | py | Accepted | 90 | 7572 | 777 | def cut(d, w, s):
s %= 2 * (d + w)
sq = []
if 0 < s < w:
sq = [(d, s), (d, w - s)]
elif w < s < w + d:
s -= w
sq = [(s, w), (d - s, w)]
elif w + d < s < 2 * w + d:
s -= w + d
sq = [(d, s), (d, w - s)]
elif 2 * w + d < s < 2 * (w + d):
s -= 2 * w + ... | p00730 |
<h1><font color="#000">Problem C:</font> Cut the Cake</h1>
<!-- end en only -->
<p>
Today is the birthday of Mr. Bon Vivant, who is known as one of the greatest <i>pâtissiers</i> in the world.
Those who are invited to his birthday party are <i>gourmets</i> from around the world.
They are eager to see and eat h... | 3 5 6
1 18
2 19
1 2
3 4 1
1 1
2 1
3 1
0 2 5
0 0 0
| 4 4 6 16
1 1 1 1
10
| 24,484 |
s594825990 | p00730 | u408260374 | 1493919702 | Python | Python3 | py | Accepted | 80 | 7632 | 591 | def cut(d, w, s):
s %= d + w
sq = []
if 0 < s < w:
sq = [(d, s), (d, w - s)]
elif w < s < w + d:
s -= w
sq = [(s, w), (d - s, w)]
else:
assert(False)
p1, p2 = sq
if p1[0] * p1[1] > p2[0] * p2[1]:
p1, p2 = p2, p1
return [p1, p2]
while True:
N,... | p00730 |
<h1><font color="#000">Problem C:</font> Cut the Cake</h1>
<!-- end en only -->
<p>
Today is the birthday of Mr. Bon Vivant, who is known as one of the greatest <i>pâtissiers</i> in the world.
Those who are invited to his birthday party are <i>gourmets</i> from around the world.
They are eager to see and eat h... | 3 5 6
1 18
2 19
1 2
3 4 1
1 1
2 1
3 1
0 2 5
0 0 0
| 4 4 6 16
1 1 1 1
10
| 24,485 |
s912415332 | p00730 | u408260374 | 1493919780 | Python | Python3 | py | Accepted | 80 | 7600 | 567 | def cut(d, w, s):
s %= d + w
if 0 < s < w:
p1, p2 = (d, s), (d, w - s)
elif w < s < w + d:
s -= w
p1, p2 = (s, w), (d - s, w)
else:
assert(False)
if p1[0] * p1[1] > p2[0] * p2[1]:
p1, p2 = p2, p1
return [p1, p2]
while True:
N, W, D = map(int, input()... | p00730 |
<h1><font color="#000">Problem C:</font> Cut the Cake</h1>
<!-- end en only -->
<p>
Today is the birthday of Mr. Bon Vivant, who is known as one of the greatest <i>pâtissiers</i> in the world.
Those who are invited to his birthday party are <i>gourmets</i> from around the world.
They are eager to see and eat h... | 3 5 6
1 18
2 19
1 2
3 4 1
1 1
2 1
3 1
0 2 5
0 0 0
| 4 4 6 16
1 1 1 1
10
| 24,486 |
s949009448 | p00730 | u408260374 | 1493919828 | Python | Python3 | py | Accepted | 80 | 7536 | 521 | def cut(d, w, s):
s %= d + w
if 0 < s < w:
p1, p2 = (d, s), (d, w - s)
else:
s -= w
p1, p2 = (s, w), (d - s, w)
if p1[0] * p1[1] > p2[0] * p2[1]:
p1, p2 = p2, p1
return [p1, p2]
while True:
N, W, D = map(int, input().split())
if not (N | W | D):
brea... | p00730 |
<h1><font color="#000">Problem C:</font> Cut the Cake</h1>
<!-- end en only -->
<p>
Today is the birthday of Mr. Bon Vivant, who is known as one of the greatest <i>pâtissiers</i> in the world.
Those who are invited to his birthday party are <i>gourmets</i> from around the world.
They are eager to see and eat h... | 3 5 6
1 18
2 19
1 2
3 4 1
1 1
2 1
3 1
0 2 5
0 0 0
| 4 4 6 16
1 1 1 1
10
| 24,487 |
s384266799 | p00730 | u509278866 | 1529633519 | Python | Python3 | py | Accepted | 100 | 9120 | 1,378 | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 998244353
dd = [(0,-1),(1,0),(0,1),(-1,0)]
ddn = [(0,-1),(1,-1),(1,0),(1,1),(0,1),(-1,-1),(-1,0),(-1,1)]
def LI(): return [int(x) for x in sys.stdi... | p00730 |
<h1><font color="#000">Problem C:</font> Cut the Cake</h1>
<!-- end en only -->
<p>
Today is the birthday of Mr. Bon Vivant, who is known as one of the greatest <i>pâtissiers</i> in the world.
Those who are invited to his birthday party are <i>gourmets</i> from around the world.
They are eager to see and eat h... | 3 5 6
1 18
2 19
1 2
3 4 1
1 1
2 1
3 1
0 2 5
0 0 0
| 4 4 6 16
1 1 1 1
10
| 24,488 |
s090159058 | p00730 | u352394527 | 1530536254 | Python | Python3 | py | Accepted | 80 | 5632 | 525 | while True:
n, w, h = map(int, input().split())
if w == 0:
break
lst = [(w, h)]
for _ in range(n):
p, s = map(int, input().split())
wi, hi = lst.pop(p - 1)
pos = s % (wi + hi)
if pos < wi:
w1, w2 = min(pos, wi - pos), max(pos, wi - pos)
lst.append((w1, hi))
lst.append((w2, ... | p00730 |
<h1><font color="#000">Problem C:</font> Cut the Cake</h1>
<!-- end en only -->
<p>
Today is the birthday of Mr. Bon Vivant, who is known as one of the greatest <i>pâtissiers</i> in the world.
Those who are invited to his birthday party are <i>gourmets</i> from around the world.
They are eager to see and eat h... | 3 5 6
1 18
2 19
1 2
3 4 1
1 1
2 1
3 1
0 2 5
0 0 0
| 4 4 6 16
1 1 1 1
10
| 24,489 |
s168497792 | p00730 | u104911888 | 1373338655 | Python | Python | py | Accepted | 30 | 4268 | 593 | while True:
n,w,d=map(int,raw_input().split())
if n==w==d==0:break
D=[(w,d)]
for i in range(n):
p,s=map(int,raw_input().split())
p-=1
s%=D[p][0]+D[p][1]
if s>D[p][0]:
s-=D[p][0]
D.append((D[p][0],s))
D.append((D[p][0],D[p][1]-s))
... | p00730 |
<h1><font color="#000">Problem C:</font> Cut the Cake</h1>
<!-- end en only -->
<p>
Today is the birthday of Mr. Bon Vivant, who is known as one of the greatest <i>pâtissiers</i> in the world.
Those who are invited to his birthday party are <i>gourmets</i> from around the world.
They are eager to see and eat h... | 3 5 6
1 18
2 19
1 2
3 4 1
1 1
2 1
3 1
0 2 5
0 0 0
| 4 4 6 16
1 1 1 1
10
| 24,490 |
s538518243 | p00730 | u145526353 | 1595168442 | Python | Python3 | py | Accepted | 80 | 5660 | 891 | def cut(w, d, s):
mod = s % (w + d)
s = []
if mod > w:
tate = mod - w
yoko = w
tate_2 = d - (mod - w)
area = tate * yoko
area_2 = tate_2 * yoko
s.append([area, [yoko, tate]])
s.append([area_2, [yoko, tate_2]])
else:
yoko = mod
tate ... | p00730 |
<h1><font color="#000">Problem C:</font> Cut the Cake</h1>
<!-- end en only -->
<p>
Today is the birthday of Mr. Bon Vivant, who is known as one of the greatest <i>pâtissiers</i> in the world.
Those who are invited to his birthday party are <i>gourmets</i> from around the world.
They are eager to see and eat h... | 3 5 6
1 18
2 19
1 2
3 4 1
1 1
2 1
3 1
0 2 5
0 0 0
| 4 4 6 16
1 1 1 1
10
| 24,491 |
s484771348 | p00730 | u737337423 | 1594877886 | Python | Python3 | py | Accepted | 60 | 6244 | 782 | def main():
import sys
input = sys.stdin.readline
while True:
N, W, D = map(int, input().split())
if N == W == D == 0:
break
piece = [(W, D)]
for _ in [0]*N:
p, s = map(int, input().split())
w, d = piece.pop(p-1)
s %= w+d
... | p00730 |
<h1><font color="#000">Problem C:</font> Cut the Cake</h1>
<!-- end en only -->
<p>
Today is the birthday of Mr. Bon Vivant, who is known as one of the greatest <i>pâtissiers</i> in the world.
Those who are invited to his birthday party are <i>gourmets</i> from around the world.
They are eager to see and eat h... | 3 5 6
1 18
2 19
1 2
3 4 1
1 1
2 1
3 1
0 2 5
0 0 0
| 4 4 6 16
1 1 1 1
10
| 24,492 |
s923354748 | p00730 | u286314212 | 1593938632 | Python | Python3 | py | Accepted | 70 | 5620 | 509 | while True:
n,w,h = map(int,input().split())
if w == 0:
break
ls = [[w,h]]
for i in range(n):
p,s = map(int,input().split())
p -= 1
pw,ph = ls[p]
if s%(pw+ph) < pw:
s %= pw+ph
ls.extend([[min(s,pw-s),ph],[max(s,pw-s),ph]])
else:
... | p00730 |
<h1><font color="#000">Problem C:</font> Cut the Cake</h1>
<!-- end en only -->
<p>
Today is the birthday of Mr. Bon Vivant, who is known as one of the greatest <i>pâtissiers</i> in the world.
Those who are invited to his birthday party are <i>gourmets</i> from around the world.
They are eager to see and eat h... | 3 5 6
1 18
2 19
1 2
3 4 1
1 1
2 1
3 1
0 2 5
0 0 0
| 4 4 6 16
1 1 1 1
10
| 24,493 |
s878584507 | p00730 | u420455834 | 1593783949 | Python | Python3 | py | Accepted | 90 | 6100 | 1,230 | import sys
import itertools
# import numpy as np
import time
import math
import heapq
from collections import defaultdict
sys.setrecursionlimit(10 ** 7)
INF = 10 ** 9 + 7
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
# map(int, input().split())
while True:
... | p00730 |
<h1><font color="#000">Problem C:</font> Cut the Cake</h1>
<!-- end en only -->
<p>
Today is the birthday of Mr. Bon Vivant, who is known as one of the greatest <i>pâtissiers</i> in the world.
Those who are invited to his birthday party are <i>gourmets</i> from around the world.
They are eager to see and eat h... | 3 5 6
1 18
2 19
1 2
3 4 1
1 1
2 1
3 1
0 2 5
0 0 0
| 4 4 6 16
1 1 1 1
10
| 24,494 |
s581121399 | p00730 | u776243834 | 1592197152 | Python | Python3 | py | Accepted | 90 | 5656 | 1,696 | N,W,D = map(int,input().split())
while W:
cp = [[0,0,0,0] for _ in range(2*N+1)] #始点x,始点y,長さx,長さy
cp[0] = [0,0,W,D]
for time in range(N):
P,S = map(int,input().split())
P -= 1
ta = cp[P]
S %= (ta[2]+ta[3])*2
#カット処理
#面積が小さいほうが番号が小さい
#上辺
if 0 <= S < ta[2]:
if S < ... | p00730 |
<h1><font color="#000">Problem C:</font> Cut the Cake</h1>
<!-- end en only -->
<p>
Today is the birthday of Mr. Bon Vivant, who is known as one of the greatest <i>pâtissiers</i> in the world.
Those who are invited to his birthday party are <i>gourmets</i> from around the world.
They are eager to see and eat h... | 3 5 6
1 18
2 19
1 2
3 4 1
1 1
2 1
3 1
0 2 5
0 0 0
| 4 4 6 16
1 1 1 1
10
| 24,495 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.