HDOJ 1040 As Easy As A+B
2014-02-14 17:39
357 查看
原题链接
水题。
附ac代码:
#include <stdio.h>
#include <stdlib.h>
int cmp(const void *a, const void *b){
return *(int *)a - *(int *)b;
}
int main(){
int n, *a, i, t;
scanf("%d", &t);
while(t-- && scanf("%d", &n)){
i = n;
a = (int *)malloc(sizeof(int) *n);
while(i--)
scanf("%d", &a[i]);
qsort(a, n, sizeof(int), cmp);
for(i = 0; i != n - 1; ++i)
printf("%d ", a[i]);
printf("%d\n", a[i]);
free(a);
}
return 0;
}
水题。
附ac代码:
#include <stdio.h>
#include <stdlib.h>
int cmp(const void *a, const void *b){
return *(int *)a - *(int *)b;
}
int main(){
int n, *a, i, t;
scanf("%d", &t);
while(t-- && scanf("%d", &n)){
i = n;
a = (int *)malloc(sizeof(int) *n);
while(i--)
scanf("%d", &a[i]);
qsort(a, n, sizeof(int), cmp);
for(i = 0; i != n - 1; ++i)
printf("%d ", a[i]);
printf("%d\n", a[i]);
free(a);
}
return 0;
}
相关文章推荐
- HDOJ 1040 As Easy As A+B
- hdoj 1040 As Easy As A+B
- hdoj1040 As Easy As A+B
- hdoj 1040 As Easy As A+B(zz)
- Hdoj 1040 As Easy As A+B
- HDOJ 1040 As Easy As A+B 快排
- hdoj-1040-As Easy As A+B(解题报告)
- [水题]hdoj1040 As Easy As A+B
- (HDOJ 1040)As Easy As A+B
- HDOJ 1040 As Easy As A+B
- HDOJ 1040 As Easy As A+B
- hdoj 1040 As Easy As A+B
- hdoj 1040 As Easy As A+B 【归并排序】
- HDOJ 1040 As Easy As A+B(qsort)
- HDOJ 1040 As Easy As A+B
- (HDOJ1040)As Easy As A+B
- hdoj-1040-As Easy As A+B
- HDOJ1040 As Easy As A+B
- [HDOJ]1040. As Easy As A+B
- ACM-简单题之As Easy As A+B——hdu1040