Codeforces Round #164 (Div. 2) C. Beautiful Sets of Points

题目：http://codeforces.com/contest/268/problem/C

思路：输出最大正方形副对角线的整数点坐标

#include <iostream>

using namespace std;

int main()
{
    int x,y;
    cin>>x>>y;
    cout<<min(x,y)+1<<endl;
    for(int i=min(x,y);i>=0;i--)
    {
        cout <<i<<" "<<min(x,y)-i<<endl;
    }
    return 0;
}