HDU1.3.8 As Easy As A+B
来源:互联网 发布:nginx linux内核优化 编辑:程序博客网 时间:2024/05/17 20:12
就是排序,输出格式有点蛋疼,必须是每个数之间都有空格,但是最后一个数后不能有空格
代码如下:
#include <cstdio>#include <iostream>#include <algorithm>#include <vector>using namespace std;int a[1001];int main(){int T;cin>>T;while(T--){int N;scanf("%d",&N);for(int i=1;i<=N;i++)scanf("%d",&a[i]);sort(a+1,a+N+1);printf("%d",a[1]);for(int i=2;i<=N;i++)printf(" %d",a[i]);printf("\n");}return 0;}
0 0
- HDU1.3.8 As Easy As A+B
- hdu1.3.8 As Easy As A+B
- As easy as A+B
- As Easy As A+B
- As Easy As A+B
- As Easy As A+B
- As Easy As A+B
- As Easy As A+B
- As Easy As A+B
- As Easy As A+B
- As Easy As A+B
- As Easy As A+B
- As Easy As A+B
- As Easy As A+B
- ACM 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
- linux下的NetworkManager服务,解决service network restart 闲置网卡报错问题
- Oracle VM VirtualBox VBoxDD.Dll GetLastError=1790 错误处理方法
- Linux系统命令及Shell脚本学习笔记一:Linux简介
- MySQL触发器、存储过程、自定义函数、视图 常用SQL
- iOS私有API之wifi扫描和wifi连接
- HDU1.3.8 As Easy As A+B
- 南邮 OJ 1916 贲神的故事2
- 白盒测试的作用
- mysql中自定义函数编程
- java中Collections.sort排序详解
- Web前端开发大系概览 (迄今为止最全的互联网前端开发技术栈)
- HDU2.1.1 最小公倍数
- IOS TableView详解(一)
- [区间合并,优化] hdu5358多校联合 第六场 First one