OJ_1041
来源:互联网 发布:java 抽奖系统设计 编辑:程序博客网 时间:2024/05/30 22:58
#include <iostream>#include <algorithm>using namespace std;void func(){ int n; while(cin>>n) { int a[n]; for(int i=0;i<n;i++) { cin>>a[i]; } sort(a,a+n); cout<<a[0]; for(int i=1;i<n;i++) { if(a[i]!=a[i-1]) cout<<" "<<a[i]; } cout<<endl; } }int main(int argc, char *argv[]){ //printf("Hello, world\n");func();return 0;}
去重排序,准确是先排序后去重输出
- 题目描述:
You are given an unsorted array of integer numbers. Your task is to sort this array and kill possible duplicated elements occurring in it.
- 输入:
For each case, the first line of the input contains an integer number N representing the quantity of numbers in this array(1≤N≤1000). Next N lines contain N integer numbers(one number per each line) of the original array.
- 输出:
For each case ,outtput file should contain at most N numbers sorted in ascending order. Every number in the output file should occur only once.
- 样例输入:
68 8 7 3 7 7
- 样例输出:
3 7 8
0 0
- OJ_1041
- 在C#中使用C++编写的类
- poj 1860 Currency Exchange (最短路)
- OJ_1040
- 最短路算法详解(Dijkstra/SPFA/Floyd)
- poj1328 Radar Installation(贪心)
- OJ_1041
- OJ_1042 Coincidence
- 解决Apple Mobile Device USB Driver
- Google Java Style 中文版
- Intro to Node.js
- title_test1600392641
- title_test495514488
- title_test1445144223
- title_test-256666228