oj.uz

Submission #421983

# Submission time Handle Problem Language Result Execution time Memory
421983 2021-06-09T14:26:57 Z Berted Sequence (BOI14_sequence) C++14
0 / 100
 2 ms 332 KB 
#include <iostream>

using namespace std;

int N, A[100001], ans = 0;
bool same = 1;

int main()
{
	cin >> N;
	for (int i = 0; i < N; i++)
	{
		cin >> A[i];
		if (i) same |= (A[i] == A[i - 1]);
	}
	if (!same)
	{
		for (int i = 1; i <= 1000; i++)
		{
			for (int j = 0; j < N; j++)
			{
				int c = i + j;
				bool exist = 0;
				while (c) {exist |= (A[j] == c % 10); c /= 10;}
				if (!exist) {break;}
				else if (j == N - 1) {ans = i;}
			}
			if (ans) break;
		}
	}
	else
	{
		ans = A[0]; N--;
		if (!ans) ans = 10;
		while (N) {N /= 10; ans *= 10;}
	}
	
	cout << ans << "\n";
	return 0;
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 33.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Incorrect 2 ms 332 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 33.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -