Kortit I

input/code.c: In function 'print_player_a_plays':
input/code.c:15:16: warning: unused variable 'played_card' [-Wunused-variable]
   15 |         int i, played_card;
      |                ^~~~~~~~~~~
input/code.c: In function 'print_player_b_plays':
input/code.c:30:16: warning: unused variable 'played_card' [-Wunused-variable]
   30 |         int i, played_card;
      |                ^~~~~~~~~~~
input/code.c: In function 'print_possible_game':
input/code.c:46:29: warning: unused variable 'i' [-Wunused-variable]
   46 |         int number_of_ties, i;
      |                             ^
input/code.c: In function 'main':
input/code.c:65:64: warning: unused variable 'player_b_points' [-Wunused-variable]
   65 |         int number_of_tests, number_of_cards, player_a_points, player_b_points, i;
      |                                                                ^~~~~~~~~~~~~~~
input/code.c:65:47: warning: unused variable 'player_a_points' [-Wunused-variable]
   65 |         int number_...

#include <stdio.h>
#include <stdlib.h>

typedef struct Game Game;

struct Game {
	int number_of_cards;
	int player_a_points;
	int player_b_points;
};

void print_player_a_plays(int number_of_cards, int number_of_ties, int player_a_points)
{
	int i, played_card;
	for (i = 1; i <= number_of_ties; i++) {
		printf("%d ", i); //may leave trailing space if all games are tied
	}
	for (i = 0; i < player_a_points; i++) {
		printf("%d ", number_of_cards - i);
	}
	for (i = 0; i < number_of_cards - number_of_ties - player_a_points; i++) {
		printf("%d ", number_of_cards - player_a_points - i);
	}
	printf("\n");
}

void print_player_b_plays(int number_of_cards, int number_of_ties, int player_a_points)
{
	int i, played_card;
	for (i = 1; i <= number_of_ties; i++) {
		printf("%d ", i); //may leave trailing space if all games are tied
	}
	for (i = 0; i < player_a_points; i++) {
		printf("%d ", player_a_points + number_of_ties - i);
	}
	for (i = 0; i < number_of_cards - number_of_ties - player_a_points; i++) {
		printf("%d ", number_of_cards - i);
	}
	printf("\n");
}


void print_possible_game(int number_of_cards, int player_a_points, int player_b_points)
{
	int number_of_ties, i;
	number_of_ties = number_of_cards - player_a_points - player_b_points;
	print_player_a_plays(number_of_cards, number_of_ties, player_a_points);
	print_player_b_plays(number_of_cards, number_of_ties, player_a_points);
}

int is_possible_game(int number_of_cards, int player_a_points, int player_b_points)
{
	if (player_a_points + player_b_points > number_of_cards) {
		return 0;
	}
	if (!player_a_points ^ !player_b_points) {
		return 0;
	}
	return 1;
}

int main(void)
{
	int number_of_tests, number_of_cards, player_a_points, player_b_points, i;
	Game *game_array, *game;
	scanf("%d", &number_of_tests);
	game_array = malloc(number_of_tests * sizeof(*game_array));
	for (i = 0; i < number_of_tests; i++) {
		game = game_array + i;
		scanf("%d%d%d", &game->number_of_cards, &game->player_a_points, &game->player_b_points);
	}
	for (i = 0; i < number_of_tests; i++) {
		game = game_array + i;
		if (!is_possible_game(game->number_of_cards, game->player_a_points, game->player_b_points)) {
			printf("NO\n");
			continue;
		}
		printf("YES\n");
		print_possible_game(game->number_of_cards, game->player_a_points, game->player_b_points);
	}
	return 0;
}

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 2, 3

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: ACCEPTED

Test 4

Group: 3

Verdict: ACCEPTED

Test 5

Group: 3

Verdict: ACCEPTED

Test 6

Group: 3

Verdict: ACCEPTED

Test 7

Group: 3

Verdict: ACCEPTED

Test 8

Group: 3

Verdict: ACCEPTED

Test 9

Group: 3

Verdict: ACCEPTED

Test 10

Group: 3

Verdict: ACCEPTED

Test 11

Group: 3

Verdict: ACCEPTED

Test 12

Group: 3

Verdict: ACCEPTED

Test 13

Group: 3

Verdict: ACCEPTED

Test 14

Group: 3

Verdict: ACCEPTED

Test 15

Group: 3

Verdict: ACCEPTED

Test 16

Group: 3

Verdict: ACCEPTED

Test 17

Group: 3

Verdict: ACCEPTED

Test 18

Group: 3

Verdict: ACCEPTED

Test 19

Group: 3

Verdict: ACCEPTED

Test 20

Group: 3

Verdict: ACCEPTED