1040
来源:互联网 发布:淘宝的销量是怎么算的 编辑:程序博客网 时间:2024/04/29 17:54
As Easy As A+B
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 53206 Accepted Submission(s): 22844
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!
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.
It is guarantied that all integers are in the range of 32-int.
Output
For each case, print the sorting result, and one line one case.
Sample Input
23 2 1 39 1 4 7 2 5 8 3 6 9
Sample Output
1 2 31 2 3 4 5 6 7 8 9
说是水题,结果真是水题(#喷水),这排序太直接。
#include <cstdio>#include <cstring>#include <iostream>#include <algorithm>#define MAXN 1010using namespace std;int n;int kkke[MAXN]; int main(){freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);int t;scanf("%d",&t);while(t--){scanf("%d",&n);for(int i=0;i<n;i++)scanf("%d",&kkke[i]);sort(kkke,kkke+n);printf("%d",kkke[0]);for(int i=1;i<n;i++)printf(" %d",kkke[i]);putchar('\n');}return 0;}
0 0
- 1040
- poj 1040
- HDU 1040
- POJ-1040
- 1040水果
- hdu 1040
- hdoj 1040
- 1040错误
- PAT-1040
- hdu 1040
- sdjzu 1040
- hdu 1040
- HDU 1040
- HDOJ 1040
- Pat 1040
- LightOJ 1040
- PAT 1040
- xdoj-1040
- Android 中文API:如何安全的为APK进行签名?
- 深入Spring:自定义注解加载和使用
- jsp页面中截取字符串
- Apache HTTP Server简述
- 如何实现在一个网页中弹出多个不同的小窗口
- 1040
- AYITACM第三周周赛 E - 盒子游戏
- CodeBlocks不支持c++语言解决 iostream csdtio set map
- java的UDP服务端实现
- iOS学习笔记之四--UIView的常见属性
- ViewPager 详解(一)---基本入门
- 转载---一致性算法Paxos详解
- 怎么遍历jsonarray
- LintCode: 矩阵归零