HDU1040 - As Easy As A+B (简单题)
来源:互联网 发布:骚气的诗词 知乎 编辑:程序博客网 时间:2024/04/30 20:15
题目链接
- 思路
- 代码
思路
水题
代码
#include <algorithm>#include <cstdio>using namespace std;int num[1010];int main(){ int t, n; scanf("%d", &t); while(t--) { scanf("%d", &n); for(int i=0; i<n; i++) scanf("%d", num+i); sort(num, num+n); printf("%d", num[0]); for(int i=1; i<n; i++) printf(" %d", num[i]); printf("\n"); } return 0;}
0 0
- HDU1040 - As Easy As A+B (简单题)
- hdu1040 As Easy As A+B
- hdu1040 As Easy As A+B
- HDU1040 As Easy As A+B
- hdu1040 As Easy As A+B
- hdu1040 - As Easy As A+B
- hdu1040 As Easy As A+B
- HDU1040 As Easy As A+B【排序】
- hdu1040 As Easy As A+B (排序)
- hdu1040 As Easy As A+B(堆排序)
- hdu1040 As Easy As A+B(C语言)
- ACM-简单题之As Easy As A+B——hdu1040
- 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
- DOM对象和内置对象(上)
- HDU 3966 Aragorn's Story(树链剖分)
- JSON数据解析
- 【白书之路】1225 - Digit Counting 数字统计
- uva 129(困难的串)
- HDU1040 - As Easy As A+B (简单题)
- VIM 编辑器之快速入门
- KNN算法
- AppWidget简介
- 全排列和全组合
- Java线程通信练习之“生产者/消费者问题”
- 2013完美世界校招笔试题及答案
- hdoj 1002 A + B Problem II 【大数加法模板】
- 设计模式之工厂方法模式