杭电oj-1040-As Easy As A+B
来源:互联网 发布:网络推广炒作 编辑:程序博客网 时间:2024/06/05 16:13
Problem Description
These days, I am thinking about a question, how can I get a problem as easy as A+B? It is fairly difficulty to do such a thing. Of course, I got it after many waking nights.
Give you some integers, your task is to sort these number ascending (升序).
You should know how easy the problem is now!
Good luck!
Input
Input contains multiple test cases. The first line of the input is a single integer T which is the number of test cases. T test cases follow. Each test case contains an integer N (1<=N<=1000 the number of integers to be sorted) and then N integers follow in the same line.
It is guarantied that all integers are in the range of 32-int.
For each case, print the sorting result, and one line one case.
Sample Input
2
3 2 1 3
9 1 4 7 2 5 8 3 6 9
Sample Output
1 2 3
#include<string.h>
#include<stdio.h>
#include<algorithm>
#include <stdio.h>
using namespace std;
int main()
{
int a[2000],c,n;
while(scanf("%d",&c)!=EOF)
{
while(c--)
{
scanf("%d",&n);
for(int i=0;i<n;i++)
scanf("%d",&a[i]);
sort(a,a+n);
printf("%d",a[0]);
for(int i=1;i<n;i++)
printf(" %d",a[i]);
printf("\n");
}
}
return 0;
}
These days, I am thinking about a question, how can I get a problem as easy as A+B? It is fairly difficulty to do such a thing. Of course, I got it after many waking nights.
Give you some integers, your task is to sort these number ascending (升序).
You should know how easy the problem is now!
Good luck!
Input
Input contains multiple test cases. The first line of the input is a single integer T which is the number of test cases. T test cases follow. Each test case contains an integer N (1<=N<=1000 the number of integers to be sorted) and then N integers follow in the same line.
It is guarantied that all integers are in the range of 32-int.
For each case, print the sorting result, and one line one case.
Sample Input
2
3 2 1 3
9 1 4 7 2 5 8 3 6 9
Sample Output
1 2 3
1 2 3 4 5 6 7 8 9
这道题的意思是给你一个数c,然后有c个样例,然后每个样例都先输入一个数n,然后有n个数,让你把这n个数按升序排列并输出
这道题并没有什么坑点,纯粹的一道简单题,sort即可解决
代码如下
#include <iostream>#include<string.h>
#include<stdio.h>
#include<algorithm>
#include <stdio.h>
using namespace std;
int main()
{
int a[2000],c,n;
while(scanf("%d",&c)!=EOF)
{
while(c--)
{
scanf("%d",&n);
for(int i=0;i<n;i++)
scanf("%d",&a[i]);
sort(a,a+n);
printf("%d",a[0]);
for(int i=1;i<n;i++)
printf(" %d",a[i]);
printf("\n");
}
}
return 0;
}
0 0
- 杭电oj-1040-As Easy As A+B
- 杭电OJ题 1040 As Easy As A+B 解题报告
- 【杭电oj】1040 - As Easy As A+B (快排,巨水)
- 杭电 1040 As Easy As A+B
- 杭电acm 1040 As Easy As A+B
- 杭电ACM 1040 As Easy As A+B
- 杭电 HDU 1040 As Easy As A+B
- 【杭电】[1040]As Easy As A+B
- 杭电1040 As Easy As A+B
- hdu-oj 1040 As Easy As A+B
- 杭电ACM 1040 As Easy As A+B java 解读
- 杭电1040——As Easy As A+B(排序)
- 1040 As Easy As A+B
- hoj 1040 As Easy As A+B
- HDU-1040 as easy as a+b
- 1040 As Easy As A+B
- hdu 1040 As Easy As A+B
- hdu 1040 As Easy As A+B
- 黑马程序员--IO(上)
- 参考51单片机示例程序要注意的一点
- Android网络通信技术
- leetcode :二叉树的前中后序遍历
- uva152
- 杭电oj-1040-As Easy As A+B
- JAVA删除某一目录下的所有文件及文件夹(linnux环境)
- leetcode系列(43)strStr(KMP)
- 堆排序
- 学习算法第一篇:排序算法
- Minimum Path Sum
- myeclipse 下创建包提示The folder is already a source folder
- java poi 上传与下载word文件
- Android 通过WebService调用天气预报接口