oj.uz

Submission #105626

# Submission time Handle Problem Language Result Execution time Memory
105626 2019-04-13T18:38:36 Z luciocf Sequence (BOI14_sequence) C++14
9 / 100
 10 ms 384 KB 
#include <bits/stdc++.h>

using namespace std;

const int maxn = 1e3+10;

int n;
int a[maxn];

int brute(void)
{
	for (int j = 1; j <= 1000; j++)
	{
		int v = j;	
		bool deu = 1;

		for (int i = 0; i < n; i++)
		{
			int aux = v;
			bool ok = 0;

			while (aux > 0)
			{
				if (aux%10 == a[i]) ok = 1;
				aux /= 10;
			}

			if (!ok) deu = 0;

			v++;
		}

		if (deu) return j;
	}
}

int main(void)
{
	scanf("%d", &n);

	for (int i = 0; i < n; i++)
		scanf("%d", &a[i]);

	if (n <= 1000)
	{
		printf("%d\n", brute());
		return 0;
	}

	int x = 1;
	for (int i = 0; i <= 20; i++)
	{
		if (x >= n)
		{
			if (a[0] == 0) printf("1");
			printf("%d", a[0]);
			for (int j = 1; j <= i; j++) printf("0");
			printf("\n");

			return 0;
		}

		x *= 10;
	}
}

Compilation message

sequence.cpp: In function 'int brute()':
sequence.cpp:35:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
sequence.cpp: In function 'int main()':
sequence.cpp:39:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
  ~~~~~^~~~~~~~~~
sequence.cpp:42:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &a[i]);
   ~~~~~^~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 4 ms 256 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 9 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 9 ms 256 KB Output is correct
15 Correct 10 ms 256 KB Output is correct

Subtask #2
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 6 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 4 ms 256 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Incorrect 8 ms 384 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

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

Subtask #4
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Incorrect 3 ms 256 KB Output isn't correct
6 Halted 0 ms 0 KB -