154162025-02-19 13:07:56markfsibianKombináció (50)cpp17Wrong answer 7/501ms316 KiB
#include <iostream>
#include <vector>

using namespace std;

vector<int> vonj(vector<int> v, int ind, int base)
{
	if (v[ind] == 0)
	{
		v[ind] = base;
		return vonj(v, ind - 1, base);
	}
	else
	{
		v[ind] = v[ind] - 1;
		return v;
	}
}

vector<int> adj(vector<int> v, int ind, int base)
{
	if (v[ind] == base)
	{
		v[ind] = 0;
		return adj(v, ind - 1, base);
	}
	else
	{
		v[ind] = v[ind] + 1;
		return v;
	}
}

void pr(vector<int> v)
{
	for (auto& e : v)
		cout << e << " ";
}

int main()
{
	int base, n;
	cin >> base >> n;
	vector<int> v;
	int t;
	for (int i = 1; i <= n; ++i)
	{
		cin >> t;
		v.push_back(t);
	}
	pr(vonj(v, n - 1, base));
	cout << endl;
	pr(adj(adj(v, n - 1, base), n - 1, base));
}
SubtaskSumTestVerdictTimeMemory
base7/50
1Wrong answer0/01ms316 KiB
2Wrong answer0/01ms316 KiB
3Runtime error0/21ms316 KiB
4Partially correct1/21ms316 KiB
5Wrong answer0/21ms316 KiB
6Wrong answer0/21ms316 KiB
7Wrong answer0/21ms316 KiB
8Wrong answer0/21ms316 KiB
9Wrong answer0/21ms316 KiB
10Wrong answer0/41ms316 KiB
11Wrong answer0/41ms316 KiB
12Partially correct2/41ms316 KiB
13Partially correct2/41ms316 KiB
14Wrong answer0/41ms316 KiB
15Partially correct2/41ms316 KiB
16Wrong answer0/61ms316 KiB
17Wrong answer0/61ms316 KiB