2318: Balloons
内存限制：128 MB
时间限制：1.000 S
评测方式：文本比较
命题人：
提交：151
解决：26
题目描述
As we all known ,in the ACM competition,you will be given a balloon with a special color when you solve a problem.
So Liu Sir bought some balloons this time.N balloons in a row, they are marked as 1,2,3,4...N. Each time you will be given two integers a, b (a < = b), Liu Sir will color the balloons from a to b . But after N times Liu forgot how many times the ith balloon had been colored, can you help him to calculate how many times each balloon have been colored?
输入
There are muliple cases.First line there is a integer N(N<=100000).Then N lines follow.Each line contains two integers a and b.The input will be exit when N=0
输出
Each case for a line.Each line contains N integers indicates the times the ith balloon has been colored.
样例输入 复制
3
1 1
2 2
3 3
3
1 1
1 2
1 3
0样例输出 复制
1 1 1
3 2 1提示