http://codeforces.com/problemset/problem/681/A
A. A Good Contest time limit per test 1 second memory limit per test 256 megabytes input standard input output standard outputCodeforces user' handle color depends on his rating — it is red if his rating is greater or equal to 2400; it is orange if his rating is less than 2400 but greater or equal to 2200, etc. Each time participant takes part in a rated contest, his rating is changed depending on his performance.
Anton wants the color of his handle to become red. He considers his performance in the rated contest to be good if he outscored some participant, whose handle was colored red before the contest and his rating has increased after it.
Anton has written a program that analyses contest results and determines whether he performed good or not. Are you able to do the same?
InputThe first line of the input contains a single integer n (1 ≤ n ≤ 100) — the number of participants Anton has outscored in this contest .
The next n lines describe participants results: the i-th of them consists of a participant handle namei and two integers beforei andafteri ( - 4000 ≤ beforei, afteri ≤ 4000) — participant's rating before and after the contest, respectively. Each handle is a non-empty string, consisting of no more than 10 characters, which might be lowercase and uppercase English letters, digits, characters «_» and «-» characters.
It is guaranteed that all handles are distinct.
OutputPrint «YES» (quotes for clarity), if Anton has performed good in the contest and «NO» (quotes for clarity) otherwise.
Examples input 3 Burunduk1 2526 2537 BudAlNik 2084 2214 subscriber 2833 2749 output YES input 3 Applejack 2400 2400 Fluttershy 2390 2431 Pinkie_Pie -2500 -2450 output NO NoteIn the first sample, Anton has outscored user with handle Burunduk1, whose handle was colored red before the contest and his rating has increased after the contest.
In the second sample, Applejack's rating has not increased after the contest, while both Fluttershy's and Pinkie_Pie's handles were not colored red before the contest.
题意:
判断Codeforces是不是红名。
使我纠结的是这代码运行后,不能够回显结果!!!提交AC。
思路:
存在某一个开始时分数不小于2400,并且小于之后的分数,即
if(be>=2400&&be<af) flag=true; Code: #include<cstdio> #include<cstring> const int MYDD=1103; int main() { int v; char name[32]; int be;//before int af;//after bool flag=false; scanf("%d",&v); for(int j=0; j<v; j++) { scanf("%s%d%d\n",name,&be,&af); if(be>=2400&&be<af) flag=true; // printf("*****\n"); } if(flag) puts("YES"); else puts("NO"); return 0; } /* By:Shyazhut */