Submission #73392239


Source Code Expand

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

int cmp(const void* x, const void* y) {
	char a = *(const char*)x, b = *(const char*)y;
	return (a > b) - (a < b);
}

int main(void) {
	char X[16];
	int len;
	if (scanf("%15s", X) != 1) return 1;
	len = (int)strlen(X);
	qsort(X, len, sizeof(*X), cmp);
	if (X[0] == '0') {
		int i;
		char t;
		for (i = 1; X[i] == '0'; i++);
		if (i < len) {
			t = X[i];
			X[i] = X[0];
			X[0] = t;
		}
	}
	puts(X);
	return 0;
}

Submission Info

Submission Time
Task B - Permute to Minimize
User mikecat
Language C23 (GCC 14.2.0)
Score 200
Code Size 501 Byte
Status AC
Exec Time 1 ms
Memory 1740 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 3
AC × 17
Set Name Test Cases
Sample 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt
All 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 01_test_00.txt, 01_test_01.txt, 01_test_02.txt, 01_test_03.txt, 01_test_04.txt, 01_test_05.txt, 01_test_06.txt, 01_test_07.txt, 01_test_08.txt, 01_test_09.txt, 01_test_10.txt, 01_test_11.txt, 01_test_12.txt, 01_test_13.txt
Case Name Status Exec Time Memory
00_sample_00.txt AC 1 ms 1592 KiB
00_sample_01.txt AC 1 ms 1620 KiB
00_sample_02.txt AC 0 ms 1576 KiB
01_test_00.txt AC 0 ms 1620 KiB
01_test_01.txt AC 0 ms 1568 KiB
01_test_02.txt AC 0 ms 1600 KiB
01_test_03.txt AC 0 ms 1596 KiB
01_test_04.txt AC 0 ms 1592 KiB
01_test_05.txt AC 0 ms 1740 KiB
01_test_06.txt AC 0 ms 1684 KiB
01_test_07.txt AC 0 ms 1620 KiB
01_test_08.txt AC 0 ms 1612 KiB
01_test_09.txt AC 0 ms 1576 KiB
01_test_10.txt AC 0 ms 1684 KiB
01_test_11.txt AC 0 ms 1624 KiB
01_test_12.txt AC 0 ms 1588 KiB
01_test_13.txt AC 0 ms 1624 KiB