題意：兩串數據，如果出現a[I]!=b[I],輸出rated，
否則看是否遞減，是：輸出maybe，否：輸出unrated。
思路：按題意模擬就好，英語題
代碼：
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=1e6+10;
const int mod=1e9;
struct node
{
int x;
int y;
}w[maxn];
int main()
{
int n;
while(~scanf("%d",&n))
{
bool flag=0;
for(int i=0;i<n;i++)
{
scanf("%d%d",&w[i].x,&w[i].y);
if(w[i].x!=w[i].y)
flag=1;
}
if(flag!=0)
{
printf("rated\n");
continue;
}
for(int i=1;i<n;i++)
if(w[i].y>w[i-1].y)
{
flag=1;
break;
}
if(flag!=0)
printf("unrated\n");
else
printf("maybe\n");
}
return 0;
}
題目：
Is it rated?
Here it is. The Ultimate Question of Competitive Programming, Codeforces, and Everything. And you are here to answer it.
Another Codeforces round has been conducted. No two participants have the same number of points. For each participant, from the top to the bottom of the standings, their rating before and after the round is known.
It's known that if at least one participant's rating has changed, then the round was rated for sure.
It's also known that if the round was rated and a participant with lower rating took a better place in the standings than a participant with higher rating, then at least one round participant's rating has changed.
In this problem, you should not make any other assumptions about the rating system.
Determine if the current round is rated, unrated, or it's impossible to determine whether it is rated of not.
Input
The first line contains a single integer n (2 ≤ n ≤ 1000) — the number of round participants.
Each of the next n lines contains two integers aiand bi (1 ≤ ai, bi ≤ 4126) — the rating of the i-th participant before and after the round, respectively. The participants are listed in order from the top to the bottom of the standings.
Output
If the round is rated for sure, print "rated". If the round is unrated for sure, print "unrated". If it's impossible to determine whether the round is rated or not, print "maybe".
Examples
Input
6 3060 3060 2194 2194 2876 2903 2624 2624 3007 2991 2884 2884
Output
rated
Input
4 1500 1500 1300 1300 1200 1200 1400 1400
Output
unrated
Input
5 3123 3123 2777 2777 2246 2246 2246 2246 1699 1699
Output
maybe
Note
In the first example, the ratings of the participants in the third and fifth places have changed, therefore, the round was rated.
In the second example, no one's rating has changed, but the participant in the second place has lower rating than the participant in the fourth place. Therefore, if the round was rated, someone's rating would've changed for sure.
In the third example, no one's rating has changed, and the participants took places in non-increasing order of their rating. Therefore, it's impossible to determine whether the round is rated or not.