Submission #432770


Source Code Expand

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
 
#define INF 1000000000
#define M 1000000007
 
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))

int compare( const void *x, const void *y){
	return strcmp( * (char **) x, * (char **) y);
}

int main() {
	int i,j;
	char S[5];
	char dictionary[25][3];
	char *sorted_dictionary[25];
	int N;
	int r, c;
	int turn = 1;
	
	scanf("%s", S);
	scanf("%d", &N);
	
	for(i=0;i<5;i++) {
		for(j=0;j<5;j++) {
			dictionary[i*5+j][0] = S[i];
			dictionary[i*5+j][1] = S[j];
			dictionary[i*5+j][2] = '\0';
			
			sorted_dictionary[i*5+j] = dictionary[i*5+j];
		}
	}
	
	qsort(sorted_dictionary, 25, sizeof( char *), compare);
	
	printf("%s\n", sorted_dictionary[N-1]);
	
	return 0;
}

Submission Info

Submission Time
Task A - 25個の文字列
User Lhaplus
Language C (GCC 4.9.2)
Score 100
Code Size 808 Byte
Status AC
Exec Time 25 ms
Memory 800 KB

Compile Error

./Main.c: In function ‘main’:
./Main.c:25:2: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%s", S);
  ^
./Main.c:26:2: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &N);
  ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 3
AC × 33
Set Name Test Cases
Sample sample-01.txt, sample-02.txt, sample-03.txt
All test-01.txt, test-02.txt, test-03.txt, test-04.txt, test-05.txt, test-06.txt, test-07.txt, test-08.txt, test-09.txt, test-10.txt, test-11.txt, test-12.txt, test-13.txt, test-14.txt, test-15.txt, test-16.txt, test-17.txt, test-18.txt, test-19.txt, test-20.txt, test-21.txt, test-22.txt, test-23.txt, test-24.txt, test-25.txt, test-26.txt, test-27.txt, test-28.txt, test-29.txt, test-30.txt, sample-01.txt, sample-02.txt, sample-03.txt
Case Name Status Exec Time Memory
sample-01.txt AC 22 ms 708 KB
sample-02.txt AC 21 ms 708 KB
sample-03.txt AC 21 ms 744 KB
test-01.txt AC 21 ms 792 KB
test-02.txt AC 21 ms 800 KB
test-03.txt AC 22 ms 796 KB
test-04.txt AC 21 ms 796 KB
test-05.txt AC 22 ms 652 KB
test-06.txt AC 21 ms 792 KB
test-07.txt AC 22 ms 744 KB
test-08.txt AC 21 ms 796 KB
test-09.txt AC 21 ms 704 KB
test-10.txt AC 23 ms 708 KB
test-11.txt AC 21 ms 748 KB
test-12.txt AC 23 ms 800 KB
test-13.txt AC 21 ms 792 KB
test-14.txt AC 24 ms 704 KB
test-15.txt AC 21 ms 796 KB
test-16.txt AC 21 ms 800 KB
test-17.txt AC 21 ms 672 KB
test-18.txt AC 21 ms 800 KB
test-19.txt AC 21 ms 796 KB
test-20.txt AC 24 ms 652 KB
test-21.txt AC 21 ms 708 KB
test-22.txt AC 25 ms 780 KB
test-23.txt AC 21 ms 792 KB
test-24.txt AC 23 ms 800 KB
test-25.txt AC 21 ms 800 KB
test-26.txt AC 21 ms 704 KB
test-27.txt AC 22 ms 648 KB
test-28.txt AC 23 ms 800 KB
test-29.txt AC 21 ms 792 KB
test-30.txt AC 22 ms 792 KB