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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
s831775176 | p00723 | u741801763 | 1514801543 | Python | Python3 | py | Accepted | 100 | 5640 | 700 | N = int(input())
for _ in range(N):
train = input()
result = set([])
for i in range(1,len(train)):
ft = train[:i]
bt = train[i:]
if ft + bt not in result: result.add(ft+bt)
if ft[::-1] + bt not in result : result.add(ft[::-1]+bt)
if ft + bt[::-1] not in result : resul... | p00723 |
<h1><font color="#000">Problem B:</font> <a name="section_B">Organize Your Train part II</a></h1>
<p>
RJ Freight, a Japanese railroad company for freight operations
has recently constructed exchange lines at Hazawa, Yokohama.
The layout of the lines is shown in Figure B-1.
</p>
<center>
<img src="https://judgeapi.u... | 4
aa
abba
abcd
abcde
| 1
6
12
18
| 24,096 |
s984187007 | p00723 | u023471147 | 1527041027 | Python | Python3 | py | Accepted | 70 | 5632 | 345 | m = int(input())
for k in range(m):
s = input()
strs = set([s, s[::-1]])
for i in range(1, len(s)):
f, b = s[0 : i], s[i :]
strs.add(b + f)
strs.add(f[::-1] + b[::-1])
strs.add(b + f[::-1])
strs.add(f + b[::-1])
strs.add(b[::-1] + f)
strs.add(f[::-1] +... | p00723 |
<h1><font color="#000">Problem B:</font> <a name="section_B">Organize Your Train part II</a></h1>
<p>
RJ Freight, a Japanese railroad company for freight operations
has recently constructed exchange lines at Hazawa, Yokohama.
The layout of the lines is shown in Figure B-1.
</p>
<center>
<img src="https://judgeapi.u... | 4
aa
abba
abcd
abcde
| 1
6
12
18
| 24,097 |
s048257851 | p00723 | u509278866 | 1527846576 | Python | Python3 | py | Accepted | 90 | 9132 | 1,109 | 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 = 10**9+7
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()... | p00723 |
<h1><font color="#000">Problem B:</font> <a name="section_B">Organize Your Train part II</a></h1>
<p>
RJ Freight, a Japanese railroad company for freight operations
has recently constructed exchange lines at Hazawa, Yokohama.
The layout of the lines is shown in Figure B-1.
</p>
<center>
<img src="https://judgeapi.u... | 4
aa
abba
abcd
abcde
| 1
6
12
18
| 24,098 |
s274200320 | p00723 | u739758122 | 1530098800 | Python | Python3 | py | Accepted | 90 | 5640 | 712 | i = input()
int_i = int(i)
for k in range(int_i):
arr_train = input()
len_train = len(arr_train)
last_train = []
for j in range(1, len_train):
bef_train = arr_train[:j:]
af_train = arr_train[j::]
last_train.append(bef_train+af_train)
last_train.append(bef_train[::-1]+af... | p00723 |
<h1><font color="#000">Problem B:</font> <a name="section_B">Organize Your Train part II</a></h1>
<p>
RJ Freight, a Japanese railroad company for freight operations
has recently constructed exchange lines at Hazawa, Yokohama.
The layout of the lines is shown in Figure B-1.
</p>
<center>
<img src="https://judgeapi.u... | 4
aa
abba
abcd
abcde
| 1
6
12
18
| 24,099 |
s683111621 | p00723 | u109084363 | 1359786069 | Python | Python | py | Accepted | 50 | 4288 | 504 | import sys
n = int(sys.stdin.readline())
for line in sys.stdin:
line = line.strip()
L = len(line)
cand = set()
for i in xrange(L):
head = line[:i]
tail = line[i:]
cand.add(head + tail)
cand.add(head[::-1] + tail)
cand.add(head + tail[::-1])
cand.add(head... | p00723 |
<h1><font color="#000">Problem B:</font> <a name="section_B">Organize Your Train part II</a></h1>
<p>
RJ Freight, a Japanese railroad company for freight operations
has recently constructed exchange lines at Hazawa, Yokohama.
The layout of the lines is shown in Figure B-1.
</p>
<center>
<img src="https://judgeapi.u... | 4
aa
abba
abcd
abcde
| 1
6
12
18
| 24,100 |
s821845518 | p00723 | u104911888 | 1371973798 | Python | Python | py | Accepted | 50 | 4284 | 365 | for i in range(input()):
s=raw_input()
S=set()
for j in range(1,len(s)):
S.add(s[:j]+s[j:])
S.add(s[:j][::-1]+s[j:])
S.add(s[:j]+s[j:][::-1])
S.add(s[:j][::-1]+s[j:][::-1])
S.add(s[j:]+s[:j])
S.add(s[j:][::-1]+s[:j])
S.add(s[j:]+s[:j][::-1])
S.... | p00723 |
<h1><font color="#000">Problem B:</font> <a name="section_B">Organize Your Train part II</a></h1>
<p>
RJ Freight, a Japanese railroad company for freight operations
has recently constructed exchange lines at Hazawa, Yokohama.
The layout of the lines is shown in Figure B-1.
</p>
<center>
<img src="https://judgeapi.u... | 4
aa
abba
abcd
abcde
| 1
6
12
18
| 24,101 |
s990654933 | p00723 | u621997536 | 1387553837 | Python | Python | py | Accepted | 50 | 4288 | 378 |
m = input()
for cnt in range(m):
mem = {}
s = raw_input()
for i in range(1, len(s)):
s1 = s[:i]
s2 = s[i:]
mem[s1 + s2] = True
mem[s1[::-1] + s2] = True
mem[s1 + s2[::-1]] = True
mem[s1[::-1] + s2[::-1]] = True
mem[s2 + s1] = True
mem[s2 + s1[::-1]] = True
mem[s2[::-1] + s1] =... | p00723 |
<h1><font color="#000">Problem B:</font> <a name="section_B">Organize Your Train part II</a></h1>
<p>
RJ Freight, a Japanese railroad company for freight operations
has recently constructed exchange lines at Hazawa, Yokohama.
The layout of the lines is shown in Figure B-1.
</p>
<center>
<img src="https://judgeapi.u... | 4
aa
abba
abcd
abcde
| 1
6
12
18
| 24,102 |
s864145205 | p00723 | u633068244 | 1399644419 | Python | Python | py | Accepted | 40 | 4260 | 219 | for i in range(input()):
train = raw_input()
ans = set()
for i in range(len(train)):
f = train[:i]; rf = f[::-1]
b = train[i:]; rb = b[::-1]
ans |= set([f+b,rf+b,f+rb,rf+rb,b+f,rb+f,b+rf,rb+rf])
print len(ans) | p00723 |
<h1><font color="#000">Problem B:</font> <a name="section_B">Organize Your Train part II</a></h1>
<p>
RJ Freight, a Japanese railroad company for freight operations
has recently constructed exchange lines at Hazawa, Yokohama.
The layout of the lines is shown in Figure B-1.
</p>
<center>
<img src="https://judgeapi.u... | 4
aa
abba
abcd
abcde
| 1
6
12
18
| 24,103 |
s902266673 | p00723 | u836923362 | 1595678342 | Python | Python3 | py | Accepted | 70 | 5636 | 656 | #20:45
num = int(input())
for i in range(num):
def count_pattern(prefix,suffix):
answer.add(prefix + suffix)
answer.add(prefix[::-1] + suffix)
answer.add(prefix + suffix[::-1])
answer.add(prefix[::-1] + suffix[::-1])
answer.add(suffix + prefix)
answer.add(suffix... | p00723 |
<h1><font color="#000">Problem B:</font> <a name="section_B">Organize Your Train part II</a></h1>
<p>
RJ Freight, a Japanese railroad company for freight operations
has recently constructed exchange lines at Hazawa, Yokohama.
The layout of the lines is shown in Figure B-1.
</p>
<center>
<img src="https://judgeapi.u... | 4
aa
abba
abcd
abcde
| 1
6
12
18
| 24,104 |
s744429667 | p00723 | u994684803 | 1594633582 | Python | Python3 | py | Accepted | 80 | 5632 | 467 | m = int(input())
for i in range(m):
a = str(input())
result=[]
result.append(a)
for j in range(len(a)):
m=a[:j]
mre=m[::-1]
u=a[j:]
ure=u[::-1]
result.append(m+u)
result.append(m+ure)
result.append(mre+u)
result.append(mre+ur... | p00723 |
<h1><font color="#000">Problem B:</font> <a name="section_B">Organize Your Train part II</a></h1>
<p>
RJ Freight, a Japanese railroad company for freight operations
has recently constructed exchange lines at Hazawa, Yokohama.
The layout of the lines is shown in Figure B-1.
</p>
<center>
<img src="https://judgeapi.u... | 4
aa
abba
abcd
abcde
| 1
6
12
18
| 24,105 |
s875659765 | p00723 | u742290340 | 1591689616 | Python | Python3 | py | Accepted | 70 | 5632 | 372 | n= int(input())
for _ in range(n):
a= input()
ans=set()
ans.add(a)
for i in range(len(a)):
s=a[:i]
t=a[i:]
ans.add(s[::-1]+t[::-1])
ans.add(t[::-1]+s[::-1])
ans.add(s[::-1]+t)
ans.add(t[::-1]+s)
ans.add(s+t[::-1])
ans.add(t+s[::-1])
... | p00723 |
<h1><font color="#000">Problem B:</font> <a name="section_B">Organize Your Train part II</a></h1>
<p>
RJ Freight, a Japanese railroad company for freight operations
has recently constructed exchange lines at Hazawa, Yokohama.
The layout of the lines is shown in Figure B-1.
</p>
<center>
<img src="https://judgeapi.u... | 4
aa
abba
abcd
abcde
| 1
6
12
18
| 24,106 |
s650641806 | p00723 | u921537862 | 1591613142 | Python | Python3 | py | Accepted | 80 | 5640 | 513 | import sys
sys.setrecursionlimit(10000000)
MOD = 10 ** 9 + 7
INF = 10 ** 15
def solve(S):
before = set()
for i in range(1,len(S)):
a,b = S[:i],S[i:]
ab = (a,a[::-1])
cd = (b,b[::-1])
for j in range(2):
for k in range(2):
before.add(ab[j] + cd[k])
... | p00723 |
<h1><font color="#000">Problem B:</font> <a name="section_B">Organize Your Train part II</a></h1>
<p>
RJ Freight, a Japanese railroad company for freight operations
has recently constructed exchange lines at Hazawa, Yokohama.
The layout of the lines is shown in Figure B-1.
</p>
<center>
<img src="https://judgeapi.u... | 4
aa
abba
abcd
abcde
| 1
6
12
18
| 24,107 |
s375947714 | p00723 | u515473089 | 1591605133 | Python | Python3 | py | Accepted | 70 | 5628 | 306 | m=int(input())
for i in range(m):
s=input()
ptn=set()
ptn.add(s)
for j in range(len(s)):
l=s[:j]
r=s[j:]
l_r=l[::-1]
r_r=r[::-1]
ptn.add(l+r_r)
ptn.add(l_r+r)
ptn.add(l_r+r_r)
ptn.add(r+l)
ptn.add(r+l_r)
ptn.add(r_r+l)
ptn.add(r_r+l_r)
print(len(ptn))
| p00723 |
<h1><font color="#000">Problem B:</font> <a name="section_B">Organize Your Train part II</a></h1>
<p>
RJ Freight, a Japanese railroad company for freight operations
has recently constructed exchange lines at Hazawa, Yokohama.
The layout of the lines is shown in Figure B-1.
</p>
<center>
<img src="https://judgeapi.u... | 4
aa
abba
abcd
abcde
| 1
6
12
18
| 24,108 |
s534958575 | p00723 | u299931928 | 1579782461 | Python | Python3 | py | Accepted | 80 | 5644 | 556 | # ライブラリのインポート
#import re #正規表現
import sys
#import heapq
#import collections
#import math
def main():
for x in sys.stdin:
x = x.strip("\n")
ans = set()
try:
int(x)
continue
except:
for i in range(1,len(x)):
f, e = x[:i], x[i:]
... | p00723 |
<h1><font color="#000">Problem B:</font> <a name="section_B">Organize Your Train part II</a></h1>
<p>
RJ Freight, a Japanese railroad company for freight operations
has recently constructed exchange lines at Hazawa, Yokohama.
The layout of the lines is shown in Figure B-1.
</p>
<center>
<img src="https://judgeapi.u... | 4
aa
abba
abcd
abcde
| 1
6
12
18
| 24,109 |
s616861745 | p00723 | u673194880 | 1566810299 | Python | Python3 | py | Accepted | 90 | 5656 | 3,734 | #頭から分ける場合とけつから分ける場合を考えよう
"""メモ
1142
なんかあってそう
漏れがある
#######################################
blkA_train = arr_train[0:3]
blkB_train = arr_train[3:4]
abcd
4
4
abc
d
all_list = ['abcd', 'cbad', 'dabc', 'dabc'] setなし
######################################
blkA_train = arr_train[0:2]
blkB_train = arr_train[2:5]
abcd
... | p00723 |
<h1><font color="#000">Problem B:</font> <a name="section_B">Organize Your Train part II</a></h1>
<p>
RJ Freight, a Japanese railroad company for freight operations
has recently constructed exchange lines at Hazawa, Yokohama.
The layout of the lines is shown in Figure B-1.
</p>
<center>
<img src="https://judgeapi.u... | 4
aa
abba
abcd
abcde
| 1
6
12
18
| 24,110 |
s097277880 | p00723 | u643585249 | 1565582048 | Python | Python3 | py | Accepted | 70 | 5628 | 490 | n = int(input())
for i in range(n):
s = input()
m = len(s)
ans = set()
for j in range(1, m):
head = s[0:j]
tail = s[j:m]
ans.add(head + tail)
ans.add(tail + head)
head = head[::-1]
ans.add(head + tail)
ans.add(tail + head)
tail = tail[:... | p00723 |
<h1><font color="#000">Problem B:</font> <a name="section_B">Organize Your Train part II</a></h1>
<p>
RJ Freight, a Japanese railroad company for freight operations
has recently constructed exchange lines at Hazawa, Yokohama.
The layout of the lines is shown in Figure B-1.
</p>
<center>
<img src="https://judgeapi.u... | 4
aa
abba
abcd
abcde
| 1
6
12
18
| 24,111 |
s735104799 | p00723 | u556131648 | 1562496750 | Python | Python3 | py | Accepted | 100 | 5636 | 514 | def solve(s):
ret = [s]
for i in range(len(s)+1):
ret.append(s[:i]+s[i:][::-1])
ret.append(s[:i][::-1]+s[i:])
ret.append(s[:i][::-1]+s[i:][::-1])
ret.append(s[i:]+s[:i])
ret.append(s[i:][::-1]+s[:i])
ret.append(s[i:]+s[:i][::-1])
ret.append(s[i:][::-1... | p00723 |
<h1><font color="#000">Problem B:</font> <a name="section_B">Organize Your Train part II</a></h1>
<p>
RJ Freight, a Japanese railroad company for freight operations
has recently constructed exchange lines at Hazawa, Yokohama.
The layout of the lines is shown in Figure B-1.
</p>
<center>
<img src="https://judgeapi.u... | 4
aa
abba
abcd
abcde
| 1
6
12
18
| 24,112 |
s209276353 | p00723 | u015712946 | 1561829282 | Python | Python3 | py | Accepted | 80 | 5644 | 532 | # coding: utf-8
# Your code here!
def count(train):
s = set()
for i in range(len(train)):
head = train[0:i+1]
tail = train[i+1:]
s.add(head + tail)
s.add(head + tail[::-1])
s.add(head[::-1] + tail)
s.add(head[::-1] + tail[::-1])
s.add(tail + head)
... | p00723 |
<h1><font color="#000">Problem B:</font> <a name="section_B">Organize Your Train part II</a></h1>
<p>
RJ Freight, a Japanese railroad company for freight operations
has recently constructed exchange lines at Hazawa, Yokohama.
The layout of the lines is shown in Figure B-1.
</p>
<center>
<img src="https://judgeapi.u... | 4
aa
abba
abcd
abcde
| 1
6
12
18
| 24,113 |
s568464355 | p00723 | u464321546 | 1561555811 | Python | Python3 | py | Accepted | 90 | 5656 | 878 | def main_a():
y, m, d = map(int, input().split())
a = (y - 1) // 3
b = (y - 1) % 3
c = a * 590 + 195 * b
if y % 3:
a = (m - 1) // 2
b = (m - 1) % 2
c += a * 39 + b * 20
else:
c += (m - 1) * 20
c += d - 1
print(196470 - c)
def a():
n = int(input())
... | p00723 |
<h1><font color="#000">Problem B:</font> <a name="section_B">Organize Your Train part II</a></h1>
<p>
RJ Freight, a Japanese railroad company for freight operations
has recently constructed exchange lines at Hazawa, Yokohama.
The layout of the lines is shown in Figure B-1.
</p>
<center>
<img src="https://judgeapi.u... | 4
aa
abba
abcd
abcde
| 1
6
12
18
| 24,114 |
s975269550 | p00723 | u489876484 | 1561535523 | Python | Python3 | py | Accepted | 50 | 5728 | 522 | import itertools
def main():
n = int(input())
for _ in range(n):
s = input()
ssum = set()
for i in range(len(s)):
l = s[:i]
rl = l[::-1]
r = s[i:]
rr = r[::-1]
ssum.add(l+r)
ssum.add(r+l)
ssum.add(rl+r)
... | p00723 |
<h1><font color="#000">Problem B:</font> <a name="section_B">Organize Your Train part II</a></h1>
<p>
RJ Freight, a Japanese railroad company for freight operations
has recently constructed exchange lines at Hazawa, Yokohama.
The layout of the lines is shown in Figure B-1.
</p>
<center>
<img src="https://judgeapi.u... | 4
aa
abba
abcd
abcde
| 1
6
12
18
| 24,115 |
s694597901 | p00723 | u046108504 | 1558669518 | Python | Python3 | py | Accepted | 60 | 5632 | 492 | m = int(input())
for _ in range(m):
train = input()
trains = set()
for i in range(1, len(train)):
mae = train[0:i]
ato = train[i::]
r_mae = mae[::-1]
r_ato = ato[::-1]
trains.add(mae + ato)
trains.add(ato + mae)
trains.add(mae + r_ato)
trains.a... | p00723 |
<h1><font color="#000">Problem B:</font> <a name="section_B">Organize Your Train part II</a></h1>
<p>
RJ Freight, a Japanese railroad company for freight operations
has recently constructed exchange lines at Hazawa, Yokohama.
The layout of the lines is shown in Figure B-1.
</p>
<center>
<img src="https://judgeapi.u... | 4
aa
abba
abcd
abcde
| 1
6
12
18
| 24,116 |
s072109095 | p00723 | u352394527 | 1547379719 | Python | Python3 | py | Accepted | 80 | 5620 | 372 | m = int(input())
for _ in range(m):
ss = set()
s = input()
length = len(s)
for i in range(1, length):
left = s[:i]
right = s[i:]
ss |= {left + right, left + right[::-1], left[::-1] + right, left[::-1] + right[::-1],
right + left, right + left[::-1], right[::-1] + ... | p00723 |
<h1><font color="#000">Problem B:</font> <a name="section_B">Organize Your Train part II</a></h1>
<p>
RJ Freight, a Japanese railroad company for freight operations
has recently constructed exchange lines at Hazawa, Yokohama.
The layout of the lines is shown in Figure B-1.
</p>
<center>
<img src="https://judgeapi.u... | 4
aa
abba
abcd
abcde
| 1
6
12
18
| 24,117 |
s921966794 | p00723 | u260980560 | 1542539323 | Python | Python3 | py | Accepted | 60 | 5596 | 344 | m, *S = open(0).read().split()
ans = []
for s in S:
e = {s, s[::-1]}
for x in range(1, len(s)):
X = s[:x]; Y = s[x:]
e.add(X[::-1]+Y)
e.add(X+Y[::-1])
e.add(X[::-1]+Y[::-1])
e.add(Y+X)
e.add(Y[::-1]+X)
e.add(Y+X[::-1])
ans.append("%d\n" % len(e))
open(... | p00723 |
<h1><font color="#000">Problem B:</font> <a name="section_B">Organize Your Train part II</a></h1>
<p>
RJ Freight, a Japanese railroad company for freight operations
has recently constructed exchange lines at Hazawa, Yokohama.
The layout of the lines is shown in Figure B-1.
</p>
<center>
<img src="https://judgeapi.u... | 4
aa
abba
abcd
abcde
| 1
6
12
18
| 24,118 |
s611039097 | p00723 | u598814210 | 1541671314 | Python | Python3 | py | Accepted | 70 | 5636 | 363 | m = int(input())
for _ in range(m):
s = input()
pat = set()
for i in range(1,len(s)):
f = s[:i]; r = s[i:]
pat.add(f+r)
pat.add(r+f)
pat.add(f[::-1]+r[::-1])
pat.add(r[::-1]+f[::-1])
pat.add(f+r[::-1])
pat.add(r+f[::-1])
pat.add(f[::-1]+r)
... | p00723 |
<h1><font color="#000">Problem B:</font> <a name="section_B">Organize Your Train part II</a></h1>
<p>
RJ Freight, a Japanese railroad company for freight operations
has recently constructed exchange lines at Hazawa, Yokohama.
The layout of the lines is shown in Figure B-1.
</p>
<center>
<img src="https://judgeapi.u... | 4
aa
abba
abcd
abcde
| 1
6
12
18
| 24,119 |
s786004826 | p00723 | u064170672 | 1541670670 | Python | Python3 | py | Accepted | 90 | 5628 | 369 | m = input()
for a in range(int(m)):
b = set()
s = input()
for i in range(1,len(s)):
t1 = s[:i]
t2 = s[i:]
b.add(t1+t2)
b.add(t1+t2[::-1])
b.add(t1[::-1]+t2)
b.add(t1[::-1]+t2[::-1])
b.add(t2+t1)
b.add(t2+t1[::-1])
b.add(t2[::-1]+t1)
... | p00723 |
<h1><font color="#000">Problem B:</font> <a name="section_B">Organize Your Train part II</a></h1>
<p>
RJ Freight, a Japanese railroad company for freight operations
has recently constructed exchange lines at Hazawa, Yokohama.
The layout of the lines is shown in Figure B-1.
</p>
<center>
<img src="https://judgeapi.u... | 4
aa
abba
abcd
abcde
| 1
6
12
18
| 24,120 |
s344847203 | p00726 | u260980560 | 1584811466 | Python | Python3 | py | Accepted | 60 | 6800 | 1,686 | from string import digits, ascii_uppercase
def parse(S):
S += "$"
cur = 0
res = []
def expr():
nonlocal cur
R = []; l = 0
while 1:
c = S[cur]
if c in digits:
v = number()
if S[cur] == '(':
cur += 1 # '('
... | p00726 |
<h1><font color="#000">Problem E:</font> <u>The Genome Database of All Space Life</u></h1>
<!-- end en only -->
<p>
In 2300, the Life Science Division of Federal Republic of Space starts
a very ambitious project to complete the genome sequencing of all
living creatures in the entire universe and develop the genomic
... | ABC 3
ABC 0
2(4(AB)3(XY))10C 30
1000(1000(1000(1000(1000(1000(NM)))))) 999999
0 0
| 0
A
C
M
| 24,121 |
s420663340 | p00726 | u853158149 | 1561042659 | Python | Python3 | py | Accepted | 80 | 6036 | 1,455 | from collections import defaultdict
def parse_expr(s,i,num):
if i < len(s) and f_num[s[i]]:
n,i = parse_num(s,i,num)
if s[i] == "(":
i += 1
su = 0
while i < len(s) and s[i] != ")":
e,i = parse_expr(s,i,num)
su += e
retu... | p00726 |
<h1><font color="#000">Problem E:</font> <u>The Genome Database of All Space Life</u></h1>
<!-- end en only -->
<p>
In 2300, the Life Science Division of Federal Republic of Space starts
a very ambitious project to complete the genome sequencing of all
living creatures in the entire universe and develop the genomic
... | ABC 3
ABC 0
2(4(AB)3(XY))10C 30
1000(1000(1000(1000(1000(1000(NM)))))) 999999
0 0
| 0
A
C
M
| 24,122 |
s509262623 | p00726 | u171377572 | 1560001793 | Python | Python3 | py | Accepted | 80 | 5644 | 1,072 | def string(s,i):
l = 0
while i < len(s) and s[i].isalpha():
l += 1
i += 1
return i,l
def number(s,i):
n = 0
while i < len(s) and s[i].isdigit():
n = n*10 + (ord(s[i])-ord('0'))
i += 1
return i,n
def block(s,i):
if i < len(s) and s[i].isalpha():
return string(s,i)
else:
i,n = nu... | p00726 |
<h1><font color="#000">Problem E:</font> <u>The Genome Database of All Space Life</u></h1>
<!-- end en only -->
<p>
In 2300, the Life Science Division of Federal Republic of Space starts
a very ambitious project to complete the genome sequencing of all
living creatures in the entire universe and develop the genomic
... | ABC 3
ABC 0
2(4(AB)3(XY))10C 30
1000(1000(1000(1000(1000(1000(NM)))))) 999999
0 0
| 0
A
C
M
| 24,123 |
s680744679 | p00728 | u731941832 | 1530803130 | Python | Python3 | py | Accepted | 30 | 5592 | 218 | while True:
n=int(input())
if n==0:break
a=0
mi=1145141919
ma=0
for i in range(n):
t=int(input())
mi=min(mi,t)
ma=max(ma,t)
a+=t
a-=mi+ma
print(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,124 |
s087599150 | p00728 | u946263060 | 1531212149 | Python | Python3 | py | Accepted | 20 | 5600 | 405 | while True:
number = int(input())
if number == 0:
break
point = [int(input()) for n in range(number)]
point.sort()
point.pop(0)
point.pop(-1)
sumPoint = 0
numberSub = int(number) - 3
while numberSub >= 0:
sumPoint = sumPoint + int(point[numberSub - 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,125 |
s824140935 | p00728 | u847467233 | 1531556793 | Python | Python3 | py | Accepted | 30 | 5596 | 268 | # AOJ 1147: ICPC Score Totalizer Software
# Python3 2018.7.14 bal4u
while True:
n = int(input())
if n == 0: break
s, vmin, vmax = 0, 1001, -1
for i in range(n):
a = int(input())
vmin = min(vmin, a)
vmax = max(vmax, a)
s += a
print((s-vmin-vmax)//(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,126 |
s121305489 | p00728 | u633333374 | 1535269240 | Python | Python | py | Accepted | 20 | 4636 | 155 | while 1:
n = input()
if n == 0:
break
a = []
for i in range(n):
s = input()
a.append(s)
a = sorted(a)
del a[n-1]
del a[0]
print sum(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,127 |
s942143711 | p00728 | u399287995 | 1551320764 | Python | Python3 | py | Accepted | 20 | 5608 | 329 | import sys
F = sys.stdin
Continue = True
while Continue:
N = int(F.readline().strip("\n"))
if N == 0:
Continue = False
break
else:
Score = [None] * N
for i in range(N):
Score[i] = int(F.readline().strip("\n"))
Score.sort()
print(sum(Score[1: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,128 |
s586821568 | p00728 | u328199937 | 1555773101 | Python | Python3 | py | Accepted | 30 | 5600 | 184 | while True:
n = int(input())
if n == 0:
break
s = [int(input()) for i in range(n)]
s.sort()
#print(s)
ans = sum(s[1:n - 1]) // (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,129 |
s673828867 | p00728 | u715278210 | 1556602001 | Python | Python3 | py | Accepted | 20 | 5596 | 409 | while True:
#審判の数
n = int(input())
if n == 0:
break
a = [0]*n #空いてる配列
for i in range(n): #空いてる配列に点数を入れる
s = int(input())
a[i] = s
tensu = (sum(a) - min(a) -max(a))/(len(a)-2) #一番でかい点数と一番小さい点数は一つずつ引いて平均
print(int(tensu)) #平均点！
| 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,130 |
s264981879 | p00728 | u788553535 | 1559129543 | Python | Python3 | py | Accepted | 20 | 5608 | 132 | while True:
n = int(input())
if n==0:
break
a = [int(input()) for _ in range(n)]
a.sort()
print(sum(a[1:n-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,131 |
s999859565 | p00728 | u191474223 | 1559134867 | Python | Python3 | py | Accepted | 50 | 7460 | 505 | from collections import defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue,datetime
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.st... | 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,132 |
s056809853 | p00728 | u282479278 | 1559191158 | Python | Python3 | py | Accepted | 30 | 5600 | 579 | j = 0
lists = []
flag = 0
cnt = 0
while 1:
cnt = 0
flag_max = 0
flag_min = 0
lists = []
n = int(input())
if n == 0:
break
for i in range(n):
s = int(input())
lists.append(s)
for i in range(n):
if lists[i] == max(lists):
flag_max += 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,133 |
s153727621 | p00728 | u200148444 | 1559554821 | Python | Python3 | py | Accepted | 30 | 5604 | 136 | while True:
n=int(input())
if n==0:exit()
l=[ int(input()) for i in range(n) ]
print(int((sum(l)-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,134 |
s383932820 | p00728 | u844945939 | 1412591342 | Python | Python3 | py | Accepted | 30 | 6728 | 190 | while True:
judges = int(input())
if not judges:
break
a = [int(input()) for i in range(judges)]
a.remove(max(a))
a.remove(min(a))
print(int(sum(a) / len(a))) | 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,135 |
s920127384 | p00728 | u772196646 | 1413359735 | Python | Python | py | Accepted | 20 | 4240 | 441 | while 1:
n = input()
if n == 0:
break
s = [input(), input()]
if s[0] > s[1]:
max = 0
min = 1
else:
max = 1
min = 0
for i in range(2, n):
s.append(input())
if s[i] > s[max]:
max = i
elif s[i] < s[min]:
min = 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,136 |
s066032474 | p00728 | u966364923 | 1419211831 | Python | Python3 | py | Accepted | 30 | 6720 | 178 | while True:
n = int(input())
if n == 0:
exit()
score = []
for i in range(n):
score.append(int(input()))
print(sum(sorted(score)[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,137 |
s850339288 | p00728 | u617183767 | 1420101057 | Python | Python | py | Accepted | 30 | 4680 | 590 | #! /usr/bin/env python
# -*- coding: utf-8 -*-
import os
import sys
import itertools
import math
from collections import Counter, defaultdict
class Main(object):
def __init__(self):
pass
def solve(self):
'''
insert your code
'''
while True:
n = 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,138 |
s208427643 | p00728 | u766477342 | 1420255726 | Python | Python3 | py | Accepted | 30 | 6732 | 125 | while 1:
N = int(input())
if N == 0:break
print(int(sum(sorted([int(input()) for i 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,139 |
s052901178 | p00728 | u316268279 | 1420476879 | Python | Python3 | py | Accepted | 40 | 6720 | 196 | #!/usr/bin/env python
# -*- coding: utf-8 -*-
while True:
n = int(input())
if n == 0:
break
P = [int(input()) for i in range(0,n)]
print((sum(P) - min(P) - max(P))//(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,140 |
s923867312 | p00728 | u731235119 | 1421631208 | Python | Python | py | Accepted | 20 | 4196 | 160 | n = int(raw_input())
while n != 0:
l = list()
for i in range(n):
l.append(int(raw_input()))
print int((sum(l)-max(l)-min(l)) / (n-2))
n = int(raw_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,141 |
s804119363 | p00728 | u120360464 | 1421730820 | Python | Python | py | Accepted | 20 | 4192 | 208 | # -*- coding: utf-8 -*-
n = int(raw_input())
while n != 0:
list = []
for i in range(n):
list.append(int(raw_input()))
print (sum(list)-max(list)-min(list))/(n-2)
n = int(raw_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,142 |
s062543055 | p00728 | u124909914 | 1423116516 | Python | Python3 | py | Accepted | 50 | 6808 | 286 | from math import floor
while True:
n = eval(input())
if n != 0:
ls = []
for i in range(n):
m = eval(input())
ls.append(m)
ls.remove(max(ls))
ls.remove(min(ls))
print(floor(sum(ls)/len(ls)))
else:
break | 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,143 |
s876311605 | p00728 | u104102582 | 1423196366 | Python | Python | py | Accepted | 10 | 4220 | 363 | # -*- coding: utf-8 -*-
"""
Spyder Editor
This is a temporary script file.
"""
def main(n):
mi=1000
ma=0
su=0
for i in range(n):
num = int(raw_input())
su += num
ma = max(ma, num)
mi = min(mi, num)
su -= ma + mi
print su/(n-2)
while 1:
n = int(raw_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,144 |
s321582421 | p00728 | u124909914 | 1424147806 | Python | Python3 | py | Accepted | 40 | 6808 | 306 | #!/usr/bin/python3
from math import floor
while True:
n = eval(input())
if n != 0:
ls = []
for i in range(n):
m = eval(input())
ls.append(m)
ls.remove(max(ls))
ls.remove(min(ls))
print(floor(sum(ls)/len(ls)))
else:
break | 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,145 |
s506182020 | p00728 | u124909914 | 1424152090 | Python | Python3 | py | Accepted | 40 | 6812 | 306 | #!/usr/bin/python3
from math import floor
while True:
n = eval(input())
if n != 0:
ls = []
for i in range(n):
m = eval(input())
ls.append(m)
ls.remove(max(ls))
ls.remove(min(ls))
print(floor(sum(ls)/len(ls)))
else:
break | 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,146 |
s151593110 | p00728 | u124909914 | 1424762362 | Python | Python3 | py | Accepted | 40 | 6808 | 306 | #!/usr/bin/python3
from math import floor
while True:
n = eval(input())
if n != 0:
ls = []
for i in range(n):
m = eval(input())
ls.append(m)
ls.remove(max(ls))
ls.remove(min(ls))
print(floor(sum(ls)/len(ls)))
else:
break | 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,147 |
s454764217 | p00728 | u124909914 | 1424762657 | Python | Python3 | py | Accepted | 40 | 6812 | 306 | #!/usr/bin/python3
from math import floor
while True:
n = eval(input())
if n != 0:
ls = []
for i in range(n):
m = eval(input())
ls.append(m)
ls.remove(max(ls))
ls.remove(min(ls))
print(floor(sum(ls)/len(ls)))
else:
break | 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,148 |
s882883757 | p00728 | u744114948 | 1426159546 | Python | Python3 | py | Accepted | 40 | 6720 | 165 | while True:
n = int(input())
if n == 0: break
l=[]
for _ in range(n):
l.append(int(input()))
l.sort()
print(sum(l[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,149 |
s042068143 | p00728 | u128811851 | 1432625465 | Python | Python3 | py | Accepted | 30 | 6724 | 303 | averages = []
while True:
amount = int(input())
if amount == 0:
break
scores = [int(input()) for i in range(amount)]
scores.remove(max(scores))
scores.remove(min(scores))
averages.append(sum(scores) // (amount - 2))
for i in range(len(averages)):
print(averages[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,150 |
s062193349 | p00728 | u531061483 | 1432718067 | Python | Python | py | Accepted | 20 | 4228 | 342 | # -*- coding:utf-8 -*-
#ICPC得点集計ソフトウェア
import sys
def solve(n):
nums = []
for i in xrange(n):
temp = input()
nums.append(temp)
nums.sort()
sum = 0
for i in xrange(1,n-1):
sum += nums[i]
return sum / (n-2)
if __name__ == "__main__":
while 1:
N = input()
if N == 0:
sys.exit()
else:
print solve(... | 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,151 |
s194297141 | p00728 | u998188826 | 1441280103 | Python | Python3 | py | Accepted | 30 | 7696 | 138 |
while True:
n = int(input())
if n == 0:
break
s = sorted([int(input()) for i in range(n)])
s = s[1:-1]
print(int(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,152 |
s271711209 | p00728 | u222964743 | 1450288013 | Python | Python | py | Accepted | 20 | 6288 | 275 | while True:
n = input()
if n==0:
break
list = []
for i in range(0,n):
tmp = input()
list.append(tmp)
list.sort()
list.pop()
list.pop(0)
sum = 0
for i in range(0,len(list)):
sum += list[i]
print 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,153 |
s276907234 | p00728 | u488601719 | 1451125353 | Python | Python | py | Accepted | 20 | 6240 | 280 | while True:
n = int(input())
if n == 0:
break
ma = 0
mi = 1000
s = 0
for i in range(n):
x = int(input())
if ma < x:
ma = x
if mi > x:
mi = x
s += x
print ((s - 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,154 |
s911707505 | p00728 | u440050957 | 1454176579 | Python | Python | py | Accepted | 10 | 6236 | 220 | f = True
while f:
x = raw_input()
x = int(x)
l = []
for i in range(x):
l.append(int(raw_input()))
if x == 0:
f = False
else:
print (sum(l) - min(l) - max(l)) / (len(l) - 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,155 |
s285869648 | p00728 | u766163292 | 1454818835 | Python | Python3 | py | Accepted | 60 | 10136 | 362 | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
import math
import statistics
def get_average_score(scores):
return math.floor(statistics.mean(sorted(scores)[1: -1]))
if __name__ == "__main__":
while True:
n = int(input())
if n == 0:
break
else:
print(get_aver... | 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,156 |
s549478957 | p00728 | u336892997 | 1460370760 | Python | Python | py | Accepted | 30 | 6344 | 329 | def scoring():
n = int(raw_input())
if n is 0:
return
scores = [int(raw_input()) for _ in range(n)]
scores.sort()
if len(scores) < 2:
return 0
score = sum(scores[1:-1]) / (n-2)
return score
while True:
score = scoring()
if score is None:
break
print 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,157 |
s185547354 | p00728 | u731710433 | 1462615237 | Python | Python3 | py | Accepted | 30 | 7732 | 421 | def totalize(n):
total = 0
mins, maxs = (int(input()) for _ in range(2))
if maxs < mins:
maxs, mins = mins, maxs
for _ in range(n - 2):
s = int(input())
if s < mins:
s, mins = mins, s
elif maxs < s:
s, maxs = maxs, s
total += s
return t... | 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,158 |
s813424192 | p00728 | u963402991 | 1463710286 | Python | Python3 | py | Accepted | 30 | 7644 | 233 | def score(li):
li.remove(max(li))
li.remove(min(li))
return int(sum(li) / (len(li)))
while 1:
n = int(input())
if n == 0: # ???????????¶
break
s = [int(input()) for i in range(n)]
print(score(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,159 |
s581288216 | p00728 | u797495064 | 1468868687 | Python | Python3 | py | Accepted | 40 | 7620 | 226 | r = []
while True:
n = int(input())
if n == 0:
break
p = []
for i in range(n):
p.append(int(input()))
p.remove(min(p))
p.remove(max(p))
r.append(sum(p)//len(p))
[print(i) for i in r] | 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,160 |
s956766655 | p00728 | u798803522 | 1469547798 | Python | Python3 | py | Accepted | 30 | 7628 | 252 | trial = int(input())
while True:
targ = []
for t in range(trial):
targ.append(int(input()))
targ.remove(max(targ))
targ.remove(min(targ))
print(sum(targ) // len(targ))
trial = int(input())
if trial ==0:
break | 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,161 |
s114610401 | p00728 | u146816547 | 1471336491 | Python | Python | py | Accepted | 10 | 6308 | 168 | while True:
n = int(raw_input())
if n == 0:
break
l = []
for i in range(n):
l.append(int(raw_input()))
print (sum(l) - 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,162 |
s392321733 | p00728 | u892219101 | 1473683119 | Python | Python3 | py | Accepted | 30 | 7608 | 294 | import sys
while 1:
n=int(input())
if n==0:
sys.exit()
l=[0]*n
ma=0
mi=1000
s=0
for i in range(n):
l[i]=int(input())
s+=l[i]
if l[i]>ma:
ma=l[i]
if l[i]<mi:
mi=l[i]
print ((s-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,163 |
s215217536 | p00728 | u892219101 | 1473683220 | Python | Python3 | py | Accepted | 30 | 7580 | 264 | import sys
while 1:
n=int(input())
if n==0:
sys.exit()
ma=0
mi=1000
s=0
for i in range(n):
l=int(input())
s+=l
if l>ma:
ma=l
if l<mi:
mi=l
print ((s-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,164 |
s647214672 | p00728 | u358919705 | 1474886301 | Python | Python | py | Accepted | 40 | 6272 | 161 | while True:
n = int(input())
if not n:
break
data = [int(input()) for i in range(n)]
data.sort()
print int(sum(data[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,165 |
s504856449 | p00728 | u922871577 | 1480733099 | Python | Python | py | Accepted | 10 | 6412 | 160 | while True:
n = int(raw_input())
if n == 0:
break
a = sorted([int(raw_input()) for _ in xrange(n)])
print (sum(a)-a[0]-a[-1])/(len(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,166 |
s481121864 | p00728 | u166860661 | 1480828481 | Python | Python | py | Accepted | 10 | 6340 | 287 | while True:
n = int(raw_input())
if n == 0:
break
else:
l = []
for i in range(n):
num = int(raw_input())
l.append(num)
l.sort()
l = l[1:-1]
ave = float(sum(l))/len(l)
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,167 |
s577923093 | p00728 | u660912567 | 1481234030 | Python | Python3 | py | Accepted | 40 | 7648 | 133 | while True:
n = int(input())
if not(n): break
s = sum(sorted([int(input()) for i in range(n)])[1:-1])
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,168 |
s897160437 | p00728 | u660912567 | 1481391264 | Python | Python3 | py | Accepted | 30 | 7560 | 131 | while True:
n = int(input())
if n==0: break
a = sum(sorted([int(input()) for _ in range(n)])[1:-1])//(n-2)
print(a) | 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,169 |
s390546040 | p00728 | u128892650 | 1482823089 | Python | Python3 | py | Accepted | 30 | 7560 | 289 | # coding: utf-8
while True:
n = int(input())
if n == 0:
break
t = 0
ma = 0
mi = 1000
for i in range(n):
s = int(input())
t += s
if(s > ma):
ma = s
if(s < mi):
mi = s
print((t - 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,170 |
s326440861 | p00728 | u120360464 | 1483427805 | Python | Python | py | Accepted | 10 | 6388 | 274 | #!usr/bin/env python
# -*- coding: utf-8 -*-
while True:
n = int(raw_input())
if n == 0:
break
list = []
for i in range(n):
list.append(int(raw_input()))
print (sum(list) - max(list) - min(list))/(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,171 |
s912561032 | p00728 | u633333374 | 1484404192 | Python | Python | py | Accepted | 0 | 6408 | 220 | while True:
n = int(raw_input())
if n == 0: break
else:
list = []
for i in range(n):
score = int(raw_input())
list.append(score)
list.sort();
list.pop(0);
list.pop();
x = sum(list) / (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,172 |
s451309856 | p00728 | u633333374 | 1484404534 | Python | Python | py | Accepted | 10 | 6404 | 220 | while True:
n = int(raw_input())
if n == 0: break
else:
list = []
for i in range(n):
score = int(raw_input())
list.append(score)
list.sort();
list.pop(0);
list.pop();
x = sum(list) / (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,173 |
s581030459 | p00728 | u078042885 | 1484572376 | Python | Python3 | py | Accepted | 40 | 7744 | 125 | while 1:
n=int(input())
if n==0:break
a=[int(input()) for _ in range(n)]
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,174 |
s377354100 | p00728 | u842608147 | 1484640035 | Python | Python3 | py | Accepted | 30 | 7596 | 118 | while 1:
n = int(input())
if n < 3 : break
print(sum(sorted([int(input()) for x in [0]*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,175 |
s212115311 | p00728 | u842608147 | 1484640840 | Python | Python3 | py | Accepted | 30 | 7596 | 117 | while 1:
n = int(input())
if n < 3 : break
print(sum(sorted([int(input()) for x in [0]*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,176 |
s954172329 | p00728 | u078042885 | 1484886526 | Python | Python3 | py | Accepted | 30 | 7692 | 117 | while 1:
n=int(input())
if n==0: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,177 |
s162972366 | p00728 | u078042885 | 1484886816 | Python | Python3 | py | Accepted | 20 | 7568 | 113 | while 1:
n=int(input())
if n<3:break
print((sum(sorted([int(input()) for _ in [0]*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,178 |
s870092360 | p00728 | u661290476 | 1487317410 | Python | Python3 | py | Accepted | 30 | 7644 | 151 | while True:
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,179 |
s726373845 | p00728 | u808582184 | 1487917090 | Python | Python3 | py | Accepted | 60 | 10040 | 176 | import statistics
while True:
n = int(input())
if n == 0: break
s = [int(input()) for i in range(n)]
ave = statistics.mean(sorted(s)[1:-1])
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,180 |
s706028860 | p00728 | u923668099 | 1488300006 | Python | Python3 | py | Accepted | 20 | 7636 | 243 | import sys
while 1:
n = int(sys.stdin.readline().rstrip())
if n == 0:
break
scores = [int(sys.stdin.readline().rstrip()) for i in range(n)]
ans = (sum(scores) - (max(scores) + min(scores))) // (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,181 |
s231093829 | p00728 | u901080241 | 1489312922 | Python | Python3 | py | Accepted | 30 | 7668 | 179 | while True:
n = int(input())
if n==0: break
a = []
for _ in range(n):
a.append(int(input()))
a.sort()
a.pop()
a.pop(0)
print(sum(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,182 |
s248463145 | p00728 | u206656948 | 1491293027 | Python | Python3 | py | Accepted | 20 | 7652 | 269 | import math
while(1):
n = int(input())
if (n == 0):
break
a = [int(input()) for i in range(n)]
a.sort()
del a[0]
del a[-1]
sum = 0
for i in range(n-2):
sum += a[i]
sum = math.floor(sum / (n-2))
print("%d" % sum) | 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,183 |
s064300157 | p00728 | u737543412 | 1491820898 | Python | Python3 | py | Accepted | 30 | 7420 | 258 | while True:
# num of judges
n = int(input())
if n == 0:
break
scores = []
for i in range(n):
scores.append(int(input()))
final_score = int( (sum(scores) - max(scores) - min(scores)) / (n - 2) )
print(final_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,184 |
s804186655 | p00728 | u737543412 | 1491821789 | Python | Python3 | py | Accepted | 30 | 7504 | 322 | # ????°??????¨?????§????????????????????????????????????
while True:
# n : num of judges
n = int(input())
if n == 0:
break
scores = []
for i in range(n):
scores.append(int(input()))
final_score = int( (sum(scores) - max(scores) - min(scores)) / (n - 2) )
print(final_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,185 |
s595278093 | p00728 | u371539389 | 1492050086 | Python | Python3 | py | Accepted | 30 | 7500 | 318 | while True:
n=int(input())
if n==0:
break
else:
score=[]
for i in range(n):
score.append(int(input()))
score.sort()
score.pop(0)
score.pop(-1)
sum=0
for i in range(n-2):
sum+=score[i]
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,186 |
s237670270 | p00728 | u546285759 | 1493096249 | Python | Python3 | py | Accepted | 30 | 7540 | 214 | import bisect
while True:
n = int(input())
if n == 0:
break
score = []
for _ in range(n):
s = int(input())
bisect.insort(score, s)
print(sum(score[1:-1])//(len(score)-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,187 |
s075085092 | p00728 | u131811591 | 1495018685 | Python | Python3 | py | Accepted | 20 | 7496 | 227 | # coding: utf-8
import sys
if __name__ == '__main__':
while 1:
n = int(input())
if n == 0:
break
a = [int(input()) for i in range(n)]
print((sum(a) - min(a) - max(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,188 |
s267814457 | p00728 | u650459696 | 1497193185 | Python | Python3 | py | Accepted | 30 | 7620 | 198 | import math
while True:
n = int(input())
if n == 0:
break
s = []
for i in range(n):
s.append(int(input()))
print(math.floor((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,189 |
s490671033 | p00728 | u347385753 | 1498166231 | Python | Python3 | py | Accepted | 30 | 7572 | 445 | # coding: utf-8
# Here your code !
fin = False
while fin == False:
lists = []
times = int(input())
if times == 0:
fin == True
break
else:
for i in range(times):
a = int(input())
lists.append(a)
lists.remove(max(lists))
lists.remove(min(list... | 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,190 |
s926627224 | p00728 | u777299405 | 1498645468 | Python | Python3 | py | Accepted | 30 | 7572 | 134 | while True:
n = int(input())
if n < 3:
break
print(sum(sorted([int(input()) for i 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,191 |
s078572840 | p00728 | u489396453 | 1498749189 | Python | Python3 | py | Accepted | 20 | 7560 | 347 | #-*- encoding:utf-8 -*-
import math
while 1:
n = int(input())
if n == 0:
break
max = 0
min = 9999
sum = 0
for i in range(n):
s = int(input())
if max < s:
max = s
if min > s:
min = s
sum = sum + s
ans = math.floor((sum - min - m... | 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,192 |
s934438766 | p00728 | u206656948 | 1499723238 | Python | Python3 | py | Accepted | 30 | 7668 | 314 | #-*- coding:utf-8 -*-
def judge(a,n):
a.sort()
del a[0]
del a[-1]
sum = 0
for i in range(len(a)):
sum += a[i]
return int(sum / len(a))
while(1):
n = int(input())
if (n == 0):
exit(0)
else:
a = [int(input()) for i in range(n)]
print(judge(a,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,193 |
s620735218 | p00728 | u588555117 | 1500438667 | Python | Python3 | py | Accepted | 40 | 7532 | 227 | while True:
n=int(input())
if n==0:
break
a=[]
for i in range(n):
a=a+[int(input())]
sum=0
for i in range(n):
sum+=a[i]
score=int((sum-max(a)-min(a))/(n-2))
print(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,194 |
s487496073 | p00728 | u598745142 | 1501763834 | Python | Python3 | py | Accepted | 30 | 7596 | 438 | def average(points):
sum = 0
for i in points:
sum += i
return sum / len(points)
outputs = []
while True:
num = int(input())
if num == 0:
break
points = []
for _ in range(num):
point = int(input())
points.append(point)
points = sorted(points)
points... | 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,195 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.