uva 11462 Age Sort
2014-06-10 01:25
381 查看
输入的数据量很大,不可能把数据全部读到内存然后快排,但是数据的范围是很窄的,所以可以通过计数的方式来排序。
#include <stdio.h>
#include <string.h>
int count[101];
int main(void){
int n, i, j;
int num;
bool first_one;
//freopen("input.dat", "r", stdin);
while(scanf("%d", &n), n){
memset(count, 0, sizeof(int)*(101));
for(i=1; i<=n; i++){
scanf("%d", &num);
count[num]++;
}
first_one = true;
for(i=1; i<=100; i++){
if(count[i]){
for(j=1; j<=count[i]; j++){
if(first_one){
first_one = false;
printf("%d", i);
}
else{
printf(" %d", i);
}
}
}
}
printf("\n");
}
return 0;
}
#include <stdio.h>
#include <string.h>
int count[101];
int main(void){
int n, i, j;
int num;
bool first_one;
//freopen("input.dat", "r", stdin);
while(scanf("%d", &n), n){
memset(count, 0, sizeof(int)*(101));
for(i=1; i<=n; i++){
scanf("%d", &num);
count[num]++;
}
first_one = true;
for(i=1; i<=100; i++){
if(count[i]){
for(j=1; j<=count[i]; j++){
if(first_one){
first_one = false;
printf("%d", i);
}
else{
printf(" %d", i);
}
}
}
}
printf("\n");
}
return 0;
}
相关文章推荐
- UVA - 11462 Age Sort
- UVa Age Sort 11462(排序技巧)
- UVA - 11462 - Age Sort (高效算法!!)
- Uva-------(11462) Age Sort(计数排序)
- uva 11462 Age Sort
- UVA11462 Age Sort【基数排序/桶排序/计数排序】
- UVA-11462 Age Sort
- UVA11462-(Age sort)(计数排序)
- uva11462 - Age Sort(年龄排序)
- ( 设计高效算法 ) 年龄排序 Age Sort Uva 11462
- UVA 11462 - Age Sort(计数排序+输入外挂)
- UVA 11462 Age sort (基数排序+优化输入输出)
- UVa 11462 Age Sort 计数排序法题解
- Age Sort(UVa 11462)
- UVA 11462 Age Sort 计数排序 .
- UVA 11462 Age Sort
- 【输入输出挂】【Uva11462】Age Sort
- UVA - 11462 Age Sort
- 【输入输出挂】【Uva11462】Age Sort
- UVA 11462 Age Sort