CSES - Datatähti 2017 alku - Results
Submission details
Task:Kolikot
Sender:FSMnArmosta
Submission time:2016-10-03 20:36:00 +0300
Language:Python2
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.07 s1details
#2ACCEPTED0.06 s1details
#30.06 s1details
#4ACCEPTED0.05 s1details
#50.07 s1details
#6--2details
#7ACCEPTED0.06 s2details
#8ACCEPTED0.06 s2details
#9ACCEPTED0.06 s2details
#10--2details
#110.75 s3details
#12ACCEPTED0.09 s3details
#13ACCEPTED0.13 s3details
#140.73 s3details
#150.74 s3details
#16--3details

Code

import itertools
qty = int(raw_input())
coins = sorted([int(x) for x in raw_input().split(" ")])
def viableFor(money):
result = []
for coin in coins:
if coin < money:
result.append(coin)
elif coin == money:
return [coin]
else:
return result
return result
def rm(vals, val):
result = []
skip = False
for val2 in vals:
if val2 != val:
result.append(val2)
elif val2 == val and not skip:
skip = True
return result
def findSum(money, combinations):
ln = 2
while ln < len(combinations) + 1:
c = list([sum(x) for x in list(itertools.combinations(combinations, ln))])
if money in c:
return True
ln = ln + 1
return False
if coins[0] > 1:
print("1")
else:
i = 2
maxval = sum(coins)
while i < maxval-1:
combinations = viableFor(i)
if len(combinations) == 0:
break
elif len(combinations) == 1:
pass
else:
if not findSum(i, combinations):
break
i = i + 1
print(i)

Test details

Test 1

Group: 1

Verdict:

input
10
5 3 1 4 5 1 3 2 2 3

correct output
30

user output
28

Test 2

Group: 1

Verdict: ACCEPTED

input
10
3 5 5 4 5 4 5 5 5 3

correct output
1

user output
1

Test 3

Group: 1

Verdict:

input
10
10 9 2 8 7 10 7 1 5 2

correct output
62

user output
60

Test 4

Group: 1

Verdict: ACCEPTED

input
10
7 4 6 3 9 7 4 4 7 7

correct output
1

user output
1

Test 5

Group: 1

Verdict:

input
10
8 2 1 7 9 7 5 2 4 5

correct output
51

user output
49

Test 6

Group: 2

Verdict:

input
100
3 3 1 4 2 1 2 1 3 1 2 5 1 5 1 ...

correct output
269

user output
(empty)

Test 7

Group: 2

Verdict: ACCEPTED

input
100
3 3 2 3 4 5 4 4 4 4 2 2 4 4 4 ...

correct output
1

user output
1

Test 8

Group: 2

Verdict: ACCEPTED

input
100
678 999 374 759 437 390 832 54...

correct output
1

user output
1

Test 9

Group: 2

Verdict: ACCEPTED

input
100
862 537 633 807 666 248 237 5 ...

correct output
30

user output
30

Test 10

Group: 2

Verdict:

input
100
874 302 384 920 76 28 762 163 ...

correct output
41765

user output
(empty)

Test 11

Group: 3

Verdict:

input
100000
4 2 5 3 2 3 5 2 2 2 3 4 3 3 2 ...

correct output
299640

user output
(empty)

Test 12

Group: 3

Verdict: ACCEPTED

input
100000
2 5 5 5 5 2 4 4 3 2 3 2 5 5 3 ...

correct output
1

user output
1

Test 13

Group: 3

Verdict: ACCEPTED

input
100000
98146842 766872135 84108268 28...

correct output
1

user output
1

Test 14

Group: 3

Verdict:

input
100000
932032495 1 849176169 78948957...

correct output
29970

user output
(empty)

Test 15

Group: 3

Verdict:

input
100000
35894853 796619259 699878597 4...

correct output
44965249639582

user output
(empty)

Test 16

Group: 3

Verdict:

input
100000
930494676 960662779 904422858 ...

correct output
800020001

user output
(empty)