CF 29A Spit Problem

水题

#include <iostream>

using namespace std;

int main()
{
    int n;
    int data[110][2];
    while(cin>>n)
    {
        for(int i = 0;i < n;i ++)
            cin>>data[i][0]>>data[i][1];

        int flag = 0;
        for(int i = 0;i < n;i ++)
        {
            for(int j = 0;j < n;j ++)
            {
                if(i == j) continue;
                if(data[i][0]+data[i][1] == data[j][0]&&data[j][0]+data[j][1] == data[i][0])
                {
//                    cout<<data[i][0]<<" "<<data[i][1]<<" "<<data[j][0]<<endl;
                    flag = 1;
                    break;
                }
            }
            if(flag )
                break;
        }
        if(flag)
            cout<<"YES"<<endl;
        else
            cout<<"NO"<<endl;
    }
    return 0;
}