結果
| 問題 |
No.490 yukiソート
|
| コンテスト | |
| ユーザー |
tails
|
| 提出日時 | 2017-03-10 22:39:12 |
| 言語 | C (gcc 13.3.0) |
| 結果 |
AC
|
| 実行時間 | 11 ms / 2,000 ms |
| コード長 | 251 bytes |
| コンパイル時間 | 141 ms |
| コンパイル使用メモリ | 29,568 KB |
| 実行使用メモリ | 5,376 KB |
| 最終ジャッジ日時 | 2024-06-24 10:07:47 |
| 合計ジャッジ時間 | 1,179 ms |
|
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 34 |
コンパイルメッセージ
main.c:1:1: warning: data definition has no type or storage class
1 | a[5000];
| ^
main.c:1:1: warning: type defaults to 'int' in declaration of 'a' [-Wimplicit-int]
main.c:2:1: warning: return type defaults to 'int' [-Wimplicit-int]
2 | main(n,i,p,q,t){
| ^~~~
main.c: In function 'main':
main.c:2:1: warning: type of 'n' defaults to 'int' [-Wimplicit-int]
main.c:2:1: warning: type of 'i' defaults to 'int' [-Wimplicit-int]
main.c:2:1: warning: type of 'p' defaults to 'int' [-Wimplicit-int]
main.c:2:1: warning: type of 'q' defaults to 'int' [-Wimplicit-int]
main.c:2:1: warning: type of 't' defaults to 'int' [-Wimplicit-int]
main.c:3:9: warning: implicit declaration of function 'scanf' [-Wimplicit-function-declaration]
3 | scanf("%d",&n);
| ^~~~~
main.c:1:1: note: include '<stdio.h>' or provide a declaration of 'scanf'
+++ |+#include <stdio.h>
1 | a[5000];
main.c:3:9: warning: incompatible implicit declaration of built-in function 'scanf' [-Wbuiltin-declaration-mismatch]
3 | scanf("%d",&n);
| ^~~~~
main.c:3:9: note: include '<stdio.h>' or provide a declaration of 'scanf'
main.c:16:17: warning: implicit declaration of function 'printf' [-Wimplicit-function-declaration]
16 | printf("%d ",a[i]);
| ^~~~~~
main.c:16:17: note: include '<stdio.h>' or provide a declaration of 'printf'
main.c:16:17: warning: incompatible implicit declaration of built-in function 'printf' [-Wbuiltin-declaration-mismatch]
main.c:16:17: note: include '<stdio.h>' or provide a declaration of 'printf'
ソースコード
a[5000];
main(n,i,p,q,t){
scanf("%d",&n);
for(i=0;i<n;++i){
scanf("%d",a+i);
}
for(i=1;i<n*2-3;++i){
for(p=0;p<n;++p){
q=i-p;
if(p<q&&q<n&&a[p]>a[q]){
t=a[p];a[p]=a[q];a[q]=t;
}
}
}
for(i=0;i<n;++i){
printf("%d ",a[i]);
}
}
tails