【打CF，學演算法——三星級】Codeforces 698A Vacations (動態規劃)
In the first test Vasya can write the contest on the day number 1 and do sport on the day number 3. Thus, he will have a rest for only 2 days.
In the second test Vasya should write contests on days number 1, 3, 5 and 7, in other days do sport. Thus, he will not have a rest for a single day.
In the third test Vasya can do sport either on a day number 1 or number 2. He can not do sport in two days, because it will be contrary to the his limitation. Thus, he will have a rest for only one day.
相關推薦
【打CF，學演算法——三星級】Codeforces 698A Vacations (動態規劃)
Note In the first test Vasya can write the contest on the day number 1 and do sport on the day number 3. Thus, he will have a rest for only 2 days. In the
【打CF，學演算法——三星級】Codeforces 704A Thor (模擬)
題面： A. Thor time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Th
【打CF，學演算法——三星級】CodeForces 689B Mike and Shortcuts （最短路+spfa）
題面： B. Mike and Shortcuts time limit per test 3 seconds memory limit per test 256 megabytes input standard input output stand
【打CF，學演算法——三星級】CodeForces 513C Second price auction （進位制狀態表示）
Nowadays, most of the internet advertisements are not statically linked to a web page. Instead, what will be shown to the person opening a web page is det
【打CF，學演算法——三星級】CodeForces 701B Cells Not Under Attack （分析）
題面： B. Cells Not Under Attack time limit per test 2 seconds memory limit per test 256 megabytes input standard input output st
【打CF，學演算法——三星級】CodeForces 550D Regular Bridge （構造）
題面： D. Regular Bridge time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard
【打CF，學演算法——三星級】CodeForces 689C Mike and Chocolate Thieves （二分）
Note In the first sample case the smallest n that leads to exactly one way of stealing chocolates isn = 8, whereas the amounts of stealed chocolates are(1
【打CF，學演算法——三星級】CodeForces 645C Enduring Exodus （二分+貪心）
Note In the first sample, Farmer John can book room 3 for himself, and rooms 1 and 4 for his cows. The distance to the farthest cow is 2. Note that it is
【打CF，學演算法——三星級】CodeForces 216B Forming Teams （圖論）
題面： B. Forming Teams time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard o
【打CF，學演算法——三星級】CF Gym 100548K Last Denfence
題面： Last Defence Description Given two integers A and B. Sequence S is defined as follow:
【打CF，學演算法——二星級】CodeForces 520C DNA Alignment (構造)
題面： C. DNA Alignment time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard o
【打CF，學演算法——五星級】CodeForces 478D (dp計數)
題面： D. Red-Green Towers time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standar
【打CF，學演算法——二星級】CodeForces 237B Young Table （構造）
題面： B. Young Table time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output
【打CF，學演算法——二星級】Codeforces 22B Bargaining Table（區域和）
提交連結：CF 22B 題面： B. Bargaining Table time limit per test 2 seconds memory limit per test 256 megabytes input standard input out
【打CF，學演算法——二星級】Codeforces 705B Spider Man (簡單博弈)
Peter Parker wants to play a game with Dr. Octopus. The game is about cycles. Cycle is a sequence of vertices, such that first one is connected with the
【打CF，學演算法——二星級】CodeForces 417B Crash （水題）
During the "Russian Code Cup" programming competition, the testing system stores all sent solutions for each participant. We know that many participants u
【打CF，學演算法】CodeForces網站簡介
你應當知道的關於Codeforces的事情 Codeforces 簡稱: cf(所以談論cf的時候經常被誤會成TX的那款遊戲). 網址: codeforces.com 這是一個俄國的演算法競賽網站,由來自薩拉托夫州立大學、由Mike Mirzayanov領導
【打CF，學演算法——一星級】CodeForces 617D Polyline（水題）
There are three points marked on the coordinate plane. The goal is to make a simple polyline, without self-intersections and self-touches, such that it pa
【打CF，學演算法——一星級】CodeForces 701A Cards（水題）
題面： A. Cards time limit per test 1 second memory limit per test 256 megabytes input standar
【打CF，學演算法——一星級】CodeForces 227B Effective Approach （水題）
Once at a team training Vasya, Petya and Sasha got a problem on implementing linear search in an array. According to the boys, linear search works as foll