摘要： B. Vasya and Wrestling time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output B. Vasya and Wres 阅读全文

摘要： A. Vasya and Football time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Vasya has started 阅读全文

摘要： Fibonacci Tree Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4136 Accepted Submission(s): 1283 阅读全文

摘要： D. As Fast As Possible time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output D. As Fast As Poss 阅读全文

摘要： C. They Are Everywhere time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output C. They Are Every 阅读全文

摘要： B. Cells Not Under Attack time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output B. Cells Not U 阅读全文

摘要： A. Cards time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output A. Cards time limit per test 1 s 阅读全文

摘要： D. Soldier and Number Game time limit per test 3 seconds memory limit per test 256 megabytes input standard input output standard output D. Soldier an 阅读全文

摘要： A. Soldier and Bananas time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output A. Soldier and Ban 阅读全文

摘要： 题目描述 Description YYX家门前的街上有N(2<=N<=100000)盏路灯，在晚上六点之前，这些路灯全是关着的，六点之后，会有M(2<=m<=100000)个人陆续按下开关，这些开关可以改变从第i盏灯到第j盏灯的状态，现在YYX想知道，从第x盏灯到第y盏灯中有多少是亮着的(1<=i, 阅读全文