結果
| 問題 | No.8032 Unavailability of Inequality Signs |
| コンテスト | |
| ユーザー |
|
| 提出日時 | 2018-10-19 16:11:09 |
| 言語 | C (gcc 13.3.0) |
| 結果 |
AC
|
| 実行時間 | 1 ms / 2,000 ms |
| コード長 | 444 bytes |
| コンパイル時間 | 133 ms |
| コンパイル使用メモリ | 28,288 KB |
| 実行使用メモリ | 5,248 KB |
| 最終ジャッジ日時 | 2024-11-17 18:03:56 |
| 合計ジャッジ時間 | 925 ms |
|
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 7 |
コンパイルメッセージ
main.c: In function 'main':
main.c:9:9: warning: implicit declaration of function 'scanf' [-Wimplicit-function-declaration]
9 | scanf("%d", &N);
| ^~~~~
main.c:1:1: note: include '<stdio.h>' or provide a declaration of 'scanf'
+++ |+#include <stdio.h>
1 | int compare(const void *x, const void *y)
main.c:9:9: warning: incompatible implicit declaration of built-in function 'scanf' [-Wbuiltin-declaration-mismatch]
9 | scanf("%d", &N);
| ^~~~~
main.c:9:9: note: include '<stdio.h>' or provide a declaration of 'scanf'
main.c:15:45: warning: implicit declaration of function 'puts' [-Wimplicit-function-declaration]
15 | if (tmp[0][0] == tmp[0][1]) puts("=");
| ^~~~
main.c:15:45: note: include '<stdio.h>' or provide a declaration of 'puts'
main.c:17:25: warning: implicit declaration of function 'qsort' [-Wimplicit-function-declaration]
17 | qsort(tmp[1], 2, sizeof(int), compare);
| ^~~~~
main.c:18:53: warning: implicit declaration of function 'printf' [-Wimplicit-function-declaration]
18 | if (tmp[0][0] == tmp[1][0]) printf("%c\n", 60);
| ^~~~~~
main.c:18:53: note: include '<stdio.h>' or provide a declaration of 'printf'
main.c:18:53: warning: incompatible implicit declaration of built-in function 'printf' [-Wbuiltin-declaration-mismatch]
main.c:18:53: note: include '<stdio.h>' or provide a declaration of 'printf'
main.c:19:30: warning: incompatible implicit declaration of built-in function 'printf' [-Wbuiltin-declaration-mismatch]
19 | else printf("%c\n", 62);
| ^~~~~~
main.c:19:30: note: include '<stdio.h>' or provide a declaration of 'printf'
ソースコード
int compare(const void *x, const void *y)
{
return *(int*)x - *(int*)y;
}
int main(void)
{
int N, tmp[2][2], i, j;
scanf("%d", &N);
for (i = N; i; --i) {
for (j = 2; j; --j) {
scanf("%d", &tmp[0][j % 2]);
tmp[1][j % 2] = tmp[0][j % 2];
}
if (tmp[0][0] == tmp[0][1]) puts("=");
else {
qsort(tmp[1], 2, sizeof(int), compare);
if (tmp[0][0] == tmp[1][0]) printf("%c\n", 60);
else printf("%c\n", 62);
}
}
return 0;
}