oj.uz

답안 #105666

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
105666 2019-04-13T19:30:29 Z luciocf 수열 (BOI14_sequence) C++14
0 / 100
 3 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;
	}
	return -1;
}

void solve_9(void)
{
	if (n == 1)
	{
		printf("9\n");
		return;
	}

	for (int i = 2; i <= 20; i++)
	{
		int x = 1;
		for (int j = 1; j <= i; j++)
			x *= 10;

		x--; x /= 9;

		if (x >= n)
		{
			for (int j = 1; j < i; j++)
				printf("8");
			printf("9\n");
			return;
		}
	}
}

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

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

	if (a[0] == 9)
	{
		//solve_9();
		printf("88889\n");
		return 0;
	}

	int x = 1;
	for (int i = 0; i <= 20; i++)
	{
		if (a[i] == 0)
		{
			int val = x*10-1;
			val /= 9;

			if (val >= n)
			{
				printf("10");
				for (int j = 1; j <= i; j++) printf("0\n");
				printf("\n");

				return 0;
			}
		}
		else if (x >= n)
		{
			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 main()':
sequence.cpp:66:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
  ~~~~~^~~~~~~~~~
sequence.cpp:69:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &a[i]);
   ~~~~~^~~~~~~~~~~~~

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Incorrect 3 ms 384 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -