CSES - Datatähti 2017 alku - Results
Submission details
Task:Kolikot
Sender:mika
Submission time:2016-10-04 21:45:47 +0300
Language:C++
Status:READY
Result:22
Feedback
groupverdictscore
#1ACCEPTED22
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.06 s1details
#2ACCEPTED0.05 s1details
#3ACCEPTED0.05 s1details
#4ACCEPTED0.07 s1details
#5ACCEPTED0.06 s1details
#60.69 s2details
#7ACCEPTED0.06 s2details
#8ACCEPTED0.06 s2details
#90.70 s2details
#100.69 s2details
#110.70 s3details
#12ACCEPTED0.07 s3details
#13ACCEPTED0.08 s3details
#140.75 s3details
#150.75 s3details
#160.73 s3details

Compiler report

input/code.cpp: In function 'void calc(int, int)':
input/code.cpp:13:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if (kolikot.size() == i) return;
                        ^

Code

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>

using namespace std;

vector<int> mahdolliset;
vector<int> kolikot;

void calc(int i, int luku)
{
	if (kolikot.size() == i) return;

	mahdolliset.push_back(luku + kolikot[i]);

	calc(i + 1, luku + kolikot[i]);
	calc(i + 1, luku);
}

int main()
{
		int count;
		cin >> count;
		
		while (count > 0)
		{
			int num;
			cin >> num;
			kolikot.push_back(num);
			mahdolliset.push_back(num);
			count--;
		}

		// jos 1 ei löydy kolikoista, on se automaattisesti pienin vastaus
		if (!(find(kolikot.begin(), kolikot.end(), 1) != kolikot.end()))
		{
			cout << 1 << endl;
			return 0;
		}

		calc(0, 0);

		/*for (auto i = mahdolliset.begin(); i != mahdolliset.end(); ++i)
			std::cout << *i << ' ';
		cout << endl;*/

		sort(mahdolliset.begin(), mahdolliset.end());

		int pienin = mahdolliset[mahdolliset.size() - 1] + 1;
		for (size_t i = mahdolliset[mahdolliset.size() - 1] + 1; i > 0; i--)
		{
			if (!(find(mahdolliset.begin(), mahdolliset.end(), i) != mahdolliset.end()))
				pienin = i;
		}

		cout << pienin << endl;
		return 0;
}

Test details

Test 1

Group: 1

Verdict: ACCEPTED

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

correct output
30

user output
30

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: ACCEPTED

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

correct output
62

user output
62

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: ACCEPTED

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

correct output
51

user output
51

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:

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

correct output
30

user output
(empty)

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)