CodeForces - 29A Spit Problem【水题】

题目链接：https://codeforces.com/contest/29/problem/A

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <climits>
#include <cstring>
#include <vector>
#include <string>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <map>
#include <bitset>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
typedef double db;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> PII;
static const int INF=0x3f3f3f3f;
static const ll INFL=0x3f3f3f3f3f3f3f3f;
static const db EPS=1e-10;
static const db PI=acos(-1.0);
inline int read()
{
	int X=0; bool flag=1; char ch=getchar();
	while(ch<'0'||ch>'9') {if(ch=='-') flag=0; ch=getchar();}
	while(ch>='0'&&ch<='9') {X=(X<<1)+(X<<3)+ch-'0'; ch=getchar();}
	if(flag) return X;
	return ~(X-1);
}
inline void write(int X)
{
	if(X<0) {X=~(X-1); putchar('-');}
	if(X>9) write(X/10);
	putchar(X%10+'0');
}
static const int MAXN=100+10;
struct Camel{
    int x,d;
    void input() { scanf("%d%d",&x,&d); }
}camels[MAXN];
int n;
int main()
{
    scanf("%d",&n);
    for(int i=1;i<=n;i++) camels[i].input();
    bool flag=false;
    for(int i=1;i<=n && !flag;i++)
        for(int j=i+1;j<=n && !flag;j++)
            if(camels[i].x+camels[i].d==camels[j].x && camels[j].x+camels[j].d==camels[i].x) flag=true;
    if(flag) puts("YES");
    else puts("NO");
    return 0;
}