CSES - Datatähti 2016 alku

Submission details
Task:	Kirjat
Sender:	Destroy();
Submission time:	2015-10-08 19:13:39 +0300
Language:	C++
Status:	READY
Result:	43

Feedback
group	verdict	score
#1	ACCEPTED	18
#2	ACCEPTED	25
#3	TIME LIMIT EXCEEDED	0

Test results
test	verdict	time	group
#1	ACCEPTED	0.06 s	1	details
#2	ACCEPTED	0.05 s	1	details
#3	ACCEPTED	0.06 s	1	details
#4	ACCEPTED	0.05 s	1	details
#5	ACCEPTED	0.05 s	1	details
#6	ACCEPTED	0.06 s	1	details
#7	ACCEPTED	0.06 s	1	details
#8	ACCEPTED	0.05 s	1	details
#9	ACCEPTED	0.06 s	1	details
#10	ACCEPTED	0.05 s	1	details
#11	ACCEPTED	0.06 s	1	details
#12	ACCEPTED	0.06 s	1	details
#13	ACCEPTED	0.05 s	1	details
#14	ACCEPTED	0.05 s	1	details
#15	ACCEPTED	0.05 s	1	details
#16	ACCEPTED	0.05 s	1	details
#17	ACCEPTED	0.07 s	1	details
#18	ACCEPTED	0.06 s	1	details
#19	ACCEPTED	0.05 s	1	details
#20	ACCEPTED	0.06 s	1	details
#21	ACCEPTED	0.05 s	2	details
#22	ACCEPTED	0.06 s	2	details
#23	ACCEPTED	0.05 s	2	details
#24	ACCEPTED	0.06 s	2	details
#25	ACCEPTED	0.06 s	2	details
#26	ACCEPTED	0.06 s	2	details
#27	ACCEPTED	0.06 s	2	details
#28	ACCEPTED	0.05 s	2	details
#29	ACCEPTED	0.05 s	2	details
#30	ACCEPTED	0.06 s	2	details
#31	ACCEPTED	0.06 s	2	details
#32	ACCEPTED	0.05 s	2	details
#33	ACCEPTED	0.06 s	2	details
#34	ACCEPTED	0.06 s	2	details
#35	ACCEPTED	0.06 s	2	details
#36	ACCEPTED	0.05 s	2	details
#37	ACCEPTED	0.06 s	2	details
#38	ACCEPTED	0.06 s	2	details
#39	ACCEPTED	0.07 s	2	details
#40	ACCEPTED	0.06 s	2	details
#41	ACCEPTED	0.05 s	3	details
#42	ACCEPTED	0.05 s	3	details
#43	ACCEPTED	0.06 s	3	details
#44	ACCEPTED	0.06 s	3	details
#45	ACCEPTED	0.06 s	3	details
#46	ACCEPTED	0.05 s	3	details
#47	ACCEPTED	0.06 s	3	details
#48	ACCEPTED	0.05 s	3	details
#49	ACCEPTED	0.05 s	3	details
#50	ACCEPTED	0.06 s	3	details
#51	ACCEPTED	0.06 s	3	details
#52	ACCEPTED	0.06 s	3	details
#53	ACCEPTED	0.05 s	3	details
#54	ACCEPTED	0.05 s	3	details
#55	ACCEPTED	0.05 s	3	details
#56	TIME LIMIT EXCEEDED	--	3	details
#57	TIME LIMIT EXCEEDED	--	3	details
#58	TIME LIMIT EXCEEDED	--	3	details
#59	TIME LIMIT EXCEEDED	--	3	details
#60	TIME LIMIT EXCEEDED	--	3	details

Code

#include <iostream>
#include <string>
#include <set>
#include <array>

using namespace std;

int uolevi[100000];
int maija[100000];
int vastaus[100000];
set<int> luvut;
set<int> poistetut;
set<int> palautus;

int main()
{
	int n;
	cin >> n;

	for (int i = 0; i < n; i++)
	{
		cin >> uolevi[i];
	}

	for (int i = 0; i < n; i++)
	{
		cin >> maija[i];
	}

	for (int i = 1; i < n + 1; i++)
	{
		luvut.insert(i);
	}
	auto palautus = luvut;

	/*	if (uolevi[n - 1] != maija[0])
		{
			vastaus[0] = uolevi[n - 1];
			luvut.erase(uolevi[n - 1]);

			if (maija[n - 1] != uolevi[1])
			{
				vastaus[1] = maija[n - 1];
				luvut.erase(maija[n - 1]);
			}
			else
			{
				if (uolevi[2] != maija[n - 1])
				{
					vastaus[2] = maija[n - 1];
					luvut.erase(maija[n - 1]);
				}
			}
		}
		else
		{
			if (maija[n - 1] != uolevi[0])
			{
				vastaus[0] = maija[n - 1];
				luvut.erase(maija[n - 1]);

				if (maija[n - 2] != uolevi[1] && n > 4)
				{
					vastaus[1] = maija[n - 2];
					luvut.erase(maija[n - 2]);
				}
				else
				{
					if (uolevi[n - 2] != maija[1] && n > 4)
					{
						vastaus[1] = uolevi[n - 2];
						luvut.erase(uolevi[n - 2]);
					}
				}
			}
			else
			{
				vastaus[0] = uolevi[n - 2];
				luvut.erase(uolevi[n - 2]);

				vastaus[1] = uolevi[n - 1];
				luvut.erase(uolevi[n - 1]);

				if (maija[n - 1] != uolevi[2])
				{
					vastaus[2] = maija[n - 1];
					luvut.erase(maija[n - 1]);
				}
				else
					if (maija[n - 2] != uolevi[2] && n > 4)
					{
						vastaus[2] = maija[n - 2];
						luvut.erase(maija[n - 2]);
					}
			}
		}
		{ --- VANHAA ---
			if (uolevi[n - 1] != maija[1])
			{
				vastaus[1] = uolevi[n - 1];
				luvut.erase(uolevi[n - 1]);

				if (maija[n - 1] != uolevi[0])
				{
					vastaus[0] = maija[n - 1];
					luvut.erase(maija[n - 1]);
				}
				else
				{
					if (maija[n - 1] != uolevi[2])
					{
						vastaus[2] = maija[n - 1];
						luvut.erase(maija[n - 1]);
					}
				}
			}
		}

		bool aOn = false;
		bool bOn = false;

		for (int i = 0; i < 3; i++)
		{
			if (vastaus[i] <= 0)
			{
				int a = uolevi[i];
				if (luvut.find(a) != luvut.end())
				{
					luvut.erase(a);
					aOn = true;
				}

				int b = maija[i];
				if (luvut.find(b) != luvut.end())
				{
					luvut.erase(b);
					bOn = true;
				}

				set<int>::iterator c = luvut.begin();
				vastaus[i] = *c;
				luvut.erase(vastaus[i]);

				if (aOn)
				{
					luvut.insert(a);
					aOn = false;
				}
				if (bOn)
				{
					luvut.insert(b);
					bOn = false;
				}
			}
		}  */

		int yritys = 0;

			for (int i = 0; i < n; i++)
			{
				int random = 0;
				set<int>::iterator c = luvut.begin();
				if (luvut.size() > 1)
				{
					random = rand() % luvut.size();
					advance(c, random);
				}

				if (uolevi[i] != *c && maija[i] != *c)
				{
					//cout << "valitaan: " << *c << "kohdassa: " << i << '\n';
					yritys = 0;
					vastaus[i] = *c;
					//poistetut.insert(*c);
					luvut.erase(*c);
				}
				else
				{
					yritys += 1;
					if (yritys == 5) // || luvut.size() == 0) miksi luvut.size?
					{
						//copy(palautus.begin(), palautus.end(), inserter(luvut, luvut.begin()));
						yritys = 0;
						if (n > 5000)
						{
							for (int j = 0; j < i; j++)
							{
								if (uolevi[j] != *c && maija[j] != *c)
								{
									if (uolevi[j] != maija[i] && maija[j] != uolevi[i])
									{
										int a = vastaus[j];
										vastaus[j] = *c;
										vastaus[i] = a;
										luvut.erase(*c);
										i++;
										break;
									}
								}
							}
						}
						else
						{
							//auto luvut = palautus;
							copy(palautus.begin(), palautus.end(), inserter(luvut, luvut.begin()));
							i = 0;
						}
					}
					i -= 1;
				}
			}
	//	}


	/*int j = 0;

	for (int i = 0; i < n/2; n++)
	{
		if (uolevi[0 + i] == maija[n - 1 - j])
		{
			if (maija[0 + i] == uolevi[n - 1 - j])
			{
				j++;
				if (luvut.find(uolevi[n - 1 - j]) != luvut.end())
				{

				}
			}
		}
	}*/

	/*if (uolevi[n - 1] != maija[0])
	{
		vastaus[0] = uolevi[n - 1];
		luvut.erase(uolevi[n - 1]);

		if (maija[n - 1] != uolevi[1])
		{
			vastaus[1] = maija[n - 1];
			luvut.erase(maija[n - 1]);
		}
		else
		{
			vastaus[2] = maija[n - 1];
			luvut.erase(maija[n - 1]);
		}
	}
	else
	{
		if (uolevi[n - 1] != maija[1])
		{
			vastaus[1] = uolevi[n - 1];
			luvut.erase(uolevi[n - 1]);

			if (maija[n - 1] != uolevi[0])
			{
				vastaus[0] = maija[n - 1];
				luvut.erase(maija[n - 1]);
			}
			else
			{
				vastaus[2] = maija[n - 1];
				luvut.erase(maija[n - 1]);
			}
		}
	}

	bool aOn = false;
	bool bOn = false;

	for (int i = 0; i < 3; i++)
	{
		if (vastaus[i] < 0)
		{
			int a = uolevi[i];
			if (luvut.find(a) != luvut.end())
			{
				luvut.erase(a);
				aOn = true;
			}

			int b = maija[i];
			if (luvut.find(b) != luvut.end())
			{
				luvut.erase(b);
				bOn = true;
			}

			auto c = luvut.begin();
			vastaus[i] = *c;
			luvut.erase(vastaus[i]);

			if (aOn)
			{
				luvut.insert(a);
				aOn = false;
			}
			if (bOn)
			{
				luvut.insert(b);
				bOn = false;
			}
		}
	}

	for (int i = 3; i < n; i++)
	{
		for (auto x : luvut) {
			cout << x;
		}
		cout << '\n';

		int a = uolevi[i];
		if (luvut.find(a) != luvut.end())
		{
			aOn = true;
		}
		luvut.erase(a);

		for (auto x : luvut) {
			cout << x;
		}
		cout << '\n';

		int b = maija[i];
		if (luvut.find(b) != luvut.end())
		{
			bOn = true;
		}
		luvut.erase(b);

		for (auto x : luvut) {
			cout << x;
		}
		cout << '\n';

		auto c = luvut.begin();
		vastaus[i] = *c;
		luvut.erase(vastaus[i]);

		for (auto x : luvut) {
			cout << x;
		}
		cout << '\n';

		if (aOn)
		{
			luvut.insert(a);
			aOn = false;
		}
		if (bOn)
		{
			luvut.insert(b);
			bOn = false;
		}

		for (auto x : luvut) {
			cout << x;
		}
		cout << '\n';
	}*/

	for (int i = 0; i < n; i++)
	{
		if(i < n - 1)
			cout << vastaus[i] << ' ';
		else
			cout << vastaus[n-1] << '\n';
	}

	cin.get();
	cin.get();

	return 0;
	//cout << endl;
}

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
`3 2 1 3 3 2 1` view save

correct output
`1 3 2` view save

user output
`1 3 2` view save

Test 2

Group: 1

Verdict: ACCEPTED

input
`4 2 1 4 3 1 4 3 2` view save

correct output
`4 3 2 1` view save

user output
`3 2 1 4` view save

Test 3

Group: 1

Verdict: ACCEPTED

input
`4 4 3 2 1 3 1 4 2` view save

correct output
`1 2 3 4` view save

user output
`1 2 3 4` view save

Test 4

Group: 1

Verdict: ACCEPTED

input
`4 3 4 2 1 2 3 1 4` view save

correct output
`1 2 4 3` view save

user output
`1 2 4 3` view save

Test 5

Group: 1

Verdict: ACCEPTED

input
`4 4 1 3 2 2 3 1 4` view save

correct output
`1 4 2 3` view save

user output
`3 2 4 1` view save

Test 6

Group: 1

Verdict: ACCEPTED

input
`5 5 1 3 2 4 3 4 2 1 5` view save

correct output
`2 3 4 5 1` view save

user output
`4 3 1 5 2` view save

Test 7

Group: 1

Verdict: ACCEPTED

input
`5 4 2 3 5 1 3 5 2 1 4` view save

correct output
`1 4 5 2 3` view save

user output
`2 1 4 3 5` view save

Test 8

Group: 1

Verdict: ACCEPTED

input
`5 1 4 3 2 5 4 3 1 5 2` view save

correct output
`3 2 5 1 4` view save

user output
`2 5 4 3 1` view save

Test 9

Group: 1

Verdict: ACCEPTED

input
`5 5 3 2 1 4 4 2 1 3 5` view save

correct output
`1 4 5 2 3` view save

user output
`3 5 4 2 1` view save

Test 10

Group: 1

Verdict: ACCEPTED

input
`5 4 3 5 1 2 5 1 3 2 4` view save

correct output
`2 5 1 4 3` view save

user output
`2 5 4 3 1` view save

Test 11

Group: 1

Verdict: ACCEPTED

input
`5 5 1 3 2 4 2 5 4 3 1` view save

correct output
`3 4 2 1 5` view save

user output
`4 3 1 5 2` view save

Test 12

Group: 1

Verdict: ACCEPTED

input
`5 5 4 2 1 3 2 3 5 4 1` view save

correct output
`3 1 4 5 2` view save

user output
`1 2 3 5 4` view save

Test 13

Group: 1

Verdict: ACCEPTED

input
`5 1 5 2 4 3 5 1 4 3 2` view save

correct output
`3 2 5 1 4` view save

user output
`2 4 3 1 5` view save

Test 14

Group: 1

Verdict: ACCEPTED

input
`5 5 3 4 2 1 3 5 2 1 4` view save

correct output
`1 2 3 4 5` view save

user output
`1 4 3 5 2` view save

Test 15

Group: 1

Verdict: ACCEPTED

input
`5 4 5 3 2 1 3 2 1 4 5` view save

correct output
`5 3 2 1 4` view save

user output
`1 4 2 5 3` view save

Test 16

Group: 1

Verdict: ACCEPTED

input
`10 4 9 1 10 6 8 7 2 3 5 8 5 7 3 1 6 4 10 2 9` view save

correct output
`3 1 9 2 4 7 8 6 5 10` view save

user output
`7 1 5 6 9 4 3 8 10 2` view save

Test 17

Group: 1

Verdict: ACCEPTED

input
`10 6 10 8 2 3 5 7 1 4 9 4 1 2 10 5 6 9 3 8 7` view save

correct output
`5 7 1 3 9 2 4 10 6 8` view save

user output
`7 9 10 4 1 8 3 6 5 2` view save

Test 18

Group: 1

Verdict: ACCEPTED

input
`10 8 2 9 10 1 6 4 7 3 5 3 8 4 5 6 7 9 10 1 2` view save

correct output
`1 6 8 9 5 4 10 3 2 7` view save

user output
`2 7 5 8 10 3 1 4 6 9` view save

Test 19

Group: 1

Verdict: ACCEPTED

input
`10 6 3 8 9 5 7 4 10 1 2 8 9 10 1 3 6 2 7 4 5` view save

correct output
`5 1 6 2 8 10 7 3 9 4` view save

user output
`1 7 9 5 2 4 10 8 6 3` view save

Test 20

Group: 1

Verdict: ACCEPTED

input
`10 8 3 5 6 2 10 4 7 1 9 4 7 8 10 5 2 6 1 9 3` view save

correct output
`1 5 7 3 10 6 9 4 2 8` view save

user output
`7 1 3 5 8 4 9 6 2 10` view save

Test 21

Group: 2

Verdict: ACCEPTED

input
`3 3 2 1 1 3 2` view save

correct output
`2 1 3` view save

user output
`2 1 3` view save

Test 22

Group: 2

Verdict: ACCEPTED

input
`4 2 3 1 4 1 4 3 2` view save

correct output
`3 2 4 1` view save

user output
`3 2 4 1` view save

Test 23

Group: 2

Verdict: ACCEPTED

input
`4 2 4 3 1 4 1 2 3` view save

correct output
`3 2 1 4` view save

user output
`3 2 1 4` view save

Test 24

Group: 2

Verdict: ACCEPTED

input
`4 4 1 2 3 1 3 4 2` view save

correct output
`3 2 1 4` view save

user output
`3 2 1 4` view save

Test 25

Group: 2

Verdict: ACCEPTED

input
`4 2 1 3 4 4 3 2 1` view save

correct output
`3 4 1 2` view save

user output
`1 2 4 3` view save

Test 26

Group: 2

Verdict: ACCEPTED

input
`5 2 5 3 1 4 4 2 1 5 3` view save

correct output
`5 4 2 3 1` view save

user output
`3 4 5 2 1` view save

Test 27

Group: 2

Verdict: ACCEPTED

input
`5 1 4 3 2 5 5 2 4 1 3` view save

correct output
`4 5 2 3 1` view save

user output
`4 3 1 5 2` view save

Test 28

Group: 2

Verdict: ACCEPTED

input
`5 1 4 2 3 5 2 3 1 5 4` view save

correct output
`4 5 3 1 2` view save

user output
`3 5 4 1 2` view save

Test 29

Group: 2

Verdict: ACCEPTED

input
`5 4 5 2 3 1 5 3 1 2 4` view save

correct output
`1 2 3 4 5` view save

user output
`2 4 3 1 5` view save

Test 30

Group: 2

Verdict: ACCEPTED

input
`5 3 2 1 5 4 5 4 3 1 2` view save

correct output
`4 5 2 3 1` view save

user output
`2 5 4 3 1` view save

Test 31

Group: 2

Verdict: ACCEPTED

input
`5 5 3 1 2 4 3 2 4 1 5` view save

correct output
`4 5 2 3 1` view save

user output
`1 5 3 4 2` view save

Test 32

Group: 2

Verdict: ACCEPTED

input
`5 5 4 1 2 3 1 5 3 4 2` view save

correct output
`2 3 4 5 1` view save

user output
`4 3 2 5 1` view save

Test 33

Group: 2

Verdict: ACCEPTED

input
`5 1 4 5 3 2 3 5 2 4 1` view save

correct output
`5 1 3 2 4` view save

user output
`2 1 3 5 4` view save

Test 34

Group: 2

Verdict: ACCEPTED

input
`5 3 4 2 1 5 1 5 3 4 2` view save

correct output
`2 3 4 5 1` view save

user output
`2 1 5 3 4` view save

Test 35

Group: 2

Verdict: ACCEPTED

input
`5 2 3 1 5 4 5 4 2 1 3` view save

correct output
`1 2 3 4 5` view save

user output
`3 5 4 2 1` view save

Test 36

Group: 2

Verdict: ACCEPTED

input
`1000 63 72 78 267 740 551 517 698 6...` view save

correct output
`26 926 267 321 385 444 968 690...` view save

user output
`384 666 904 304 234 186 772 22...` view save

Test 37

Group: 2

Verdict: ACCEPTED

input
`1000 954 273 839 263 331 161 938 51...` view save

correct output
`1 2 3 4 5 6 7 8 9 10 11 12 13 ...` view save

user output
`384 666 904 304 234 186 772 22...` view save

Test 38

Group: 2

Verdict: ACCEPTED

input
`1000 740 142 781 837 759 392 582 14...` view save

correct output
`111 291 702 70 561 469 707 897...` view save

user output
`384 666 904 304 234 186 772 22...` view save

Test 39

Group: 2

Verdict: ACCEPTED

input
`1000 960 550 210 529 691 277 63 975...` view save

correct output
`716 604 535 519 27 204 574 592...` view save

user output
`384 666 904 304 234 186 772 22...` view save

Test 40

Group: 2

Verdict: ACCEPTED

input
`1000 371 772 197 202 504 931 4 46 6...` view save

correct output
`26 926 267 321 385 444 968 690...` view save

user output
`384 666 904 304 234 186 772 22...` view save

Test 41

Group: 3

Verdict: ACCEPTED

input
`3 1 2 3 3 1 2` view save

correct output
`2 3 1` view save

user output
`2 3 1` view save

Test 42

Group: 3

Verdict: ACCEPTED

input
`4 4 2 3 1 2 3 1 4` view save

correct output
`1 4 2 3` view save

user output
`3 1 4 2` view save

Test 43

Group: 3

Verdict: ACCEPTED

input
`4 2 1 4 3 4 3 1 2` view save

correct output
`1 2 3 4` view save

user output
`3 4 2 1` view save

Test 44

Group: 3

Verdict: ACCEPTED

input
`4 1 4 2 3 2 3 4 1` view save

correct output
`3 2 1 4` view save

user output
`3 2 1 4` view save

Test 45

Group: 3

Verdict: ACCEPTED

input
`4 2 1 4 3 1 3 2 4` view save

correct output
`4 2 3 1` view save

user output
`4 2 3 1` view save

Test 46

Group: 3

Verdict: ACCEPTED

input
`5 3 1 5 2 4 5 4 2 1 3` view save

correct output
`1 2 3 4 5` view save

user output
`4 3 1 5 2` view save

Test 47

Group: 3

Verdict: ACCEPTED

input
`5 2 1 5 3 4 5 3 2 4 1` view save

correct output
`4 5 3 1 2` view save

user output
`1 4 3 2 5` view save

Test 48

Group: 3

Verdict: ACCEPTED

input
`5 5 1 4 3 2 3 5 1 2 4` view save

correct output
`1 2 3 4 5` view save

user output
`4 3 2 5 1` view save

Test 49

Group: 3

Verdict: ACCEPTED

input
`5 2 4 1 3 5 3 5 4 1 2` view save

correct output
`5 1 3 2 4` view save

user output
`4 3 2 5 1` view save

Test 50

Group: 3

Verdict: ACCEPTED

input
`5 5 2 3 4 1 2 1 4 3 5` view save

correct output
`1 4 5 2 3` view save

user output
`4 3 1 5 2` view save

Test 51

Group: 3

Verdict: ACCEPTED

input
`5 4 1 5 3 2 2 4 1 5 3` view save

correct output
`1 2 3 4 5` view save

user output
`3 5 4 2 1` view save

Test 52

Group: 3

Verdict: ACCEPTED

input
`5 3 1 5 2 4 1 4 2 3 5` view save

correct output
`5 2 1 4 3` view save

user output
`4 3 1 5 2` view save

Test 53

Group: 3

Verdict: ACCEPTED

input
`5 1 4 5 3 2 4 2 3 5 1` view save

correct output
`5 3 2 1 4` view save

user output
`2 3 4 1 5` view save

Test 54

Group: 3

Verdict: ACCEPTED

input
`5 1 4 5 2 3 4 2 3 1 5` view save

correct output
`2 3 4 5 1` view save

user output
`2 3 4 5 1` view save

Test 55

Group: 3

Verdict: ACCEPTED

input
`5 4 5 3 2 1 5 3 4 1 2` view save

correct output
`1 2 5 3 4` view save

user output
`2 4 1 5 3` view save

Test 56

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`100000 74620 99226 537 63830 13777 69...` view save

correct output
`44158 25720 84658 90057 99607 ...` view save

user output
(empty)

Test 57

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`100000 67665 19864 90761 58104 38796 ...` view save

correct output
`1 2 3 4 5 6 7 8 9 10 11 12 13 ...` view save

user output
(empty)

Test 58

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`100000 63021 24161 40379 69157 89616 ...` view save

correct output
`4913 70683 13897 99969 66725 3...` view save

user output
(empty)

Test 59

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`100000 31500 70052 90949 56812 73871 ...` view save

correct output
`47064 17335 15460 80797 56435 ...` view save

user output
(empty)

Test 60

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`100000 39127 4446 57817 67459 53741 8...` view save

correct output
`96591 75698 82505 59416 72144 ...` view save

user output
(empty)

Datatähti 2016 alku

Kirjat

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Test 21

Test 22

Test 23

Test 24

Test 25

Test 26

Test 27

Test 28

Test 29

Test 30

Test 31

Test 32

Test 33

Test 34

Test 35

Test 36

Test 37

Test 38

Test 39

Test 40

Test 41

Test 42

Test 43

Test 44

Test 45

Test 46

Test 47

Test 48

Test 49

Test 50

Test 51

Test 52

Test 53

Test 54

Test 55

Test 56

Test 57

Test 58

Test 59

Test 60

Tasks

Submissions (Destroy();)