uva14462 Age Sort

You are given the ages (in years) of all people of a country with at
least 1 year of age. You know that no individual in that country lives
for 100 or more years. Now, you are given a very simple task of
sorting all the ages in ascending order. Input There are multiple test
cases in the input le. Each case starts with an integer n (0 < n
2000000), the total number of people. In the next line, there are n
integers indicating the ages. Input is terminated with a case where n
= 0. This case should not be processed. Output For each case, print a line with n space separated integers. These integers are the ages of
that country sorted in ascending order. Warning: Input Data is pretty
big ( 25 MB) so use faster IO.

算法很简单，桶排序。
测试了一下各种输入输出方式，手写最快，80ms。cin/cout最慢，400ms。但是加了取消同步的cin/cout比scanf/prinft还快，前者只用200ms，后者用了250ms。

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int num[110];
int rd()
{
    int x=0;
    char c=getchar();
    while (c<'0'||c>'9') c=getchar();
    while (c>='0'&&c<='9')
    {
        x=x*10+c-'0';
        c=getchar();
    }
    return x;
}
int buf[15];
void wt(int x)
{
    int l=0,i;
    while (x)
    {
        buf[++l]=x%10;
        x/=10;
    }
    for (i=l;i;i--)
      putchar(buf[i]+'0');
}
int main()
{
    int n,x,i;
    bool flag;
    while ((n=rd())&&n)
    {
        memset(num,0,sizeof(num));
        while (n--)
        {
            x=rd();
            num[x]++;
        }
        flag=0;
        for (i=1;i<=100;i++)
          while (num[i])
          {
            if (flag) putchar(' ');
            flag=1;
            wt(i);
            num[i]--;
          }
        putchar('\n');
    }
}