#include <iostream> #include <vector> int findNextTierOneFinalist(int lastFinalistNumber) { std::string yesNo; int x; int iterations = 0; while(true) { iterations++; std::cin >> yesNo >> x; if(yesNo[0] == 'N') { continue; } return lastFinalistNumber + iterations; } } int findNextTierTwoFinalist(int lastFinalistNumber) { std::string yesNo; int x; int iterations = 0; while(true) { iterations++; std::cin >> yesNo >> x; if(yesNo[0] == 'N' || x >= 2) { continue; } return lastFinalistNumber + iterations; } } void skipFirstValue() { int x; std::cin >> x; } int main() { std::ios_base::sync_with_stdio(false); std::cin.tie(nullptr); std::vector<int> finalistNumbers; skipFirstValue(); finalistNumbers.reserve(20); int lastFinalistNumber = 0; for(int i = 0; i < 10; i++) { lastFinalistNumber = findNextTierOneFinalist(lastFinalistNumber); finalistNumbers.emplace_back(lastFinalistNumber); } for(int i = 0; i < 10; i++) { lastFinalistNumber = findNextTierTwoFinalist(lastFinalistNumber); finalistNumbers.emplace_back(lastFinalistNumber); } for(int i = 0; i < finalistNumbers.size(); i++) { std::cout << finalistNumbers[i]; if(i != finalistNumbers.size() - 1) { std::cout << " "; } } return 0; }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 | #include <iostream> #include <vector> int findNextTierOneFinalist(int lastFinalistNumber) { std::string yesNo; int x; int iterations = 0; while(true) { iterations++; std::cin >> yesNo >> x; if(yesNo[0] == 'N') { continue; } return lastFinalistNumber + iterations; } } int findNextTierTwoFinalist(int lastFinalistNumber) { std::string yesNo; int x; int iterations = 0; while(true) { iterations++; std::cin >> yesNo >> x; if(yesNo[0] == 'N' || x >= 2) { continue; } return lastFinalistNumber + iterations; } } void skipFirstValue() { int x; std::cin >> x; } int main() { std::ios_base::sync_with_stdio(false); std::cin.tie(nullptr); std::vector<int> finalistNumbers; skipFirstValue(); finalistNumbers.reserve(20); int lastFinalistNumber = 0; for(int i = 0; i < 10; i++) { lastFinalistNumber = findNextTierOneFinalist(lastFinalistNumber); finalistNumbers.emplace_back(lastFinalistNumber); } for(int i = 0; i < 10; i++) { lastFinalistNumber = findNextTierTwoFinalist(lastFinalistNumber); finalistNumbers.emplace_back(lastFinalistNumber); } for(int i = 0; i < finalistNumbers.size(); i++) { std::cout << finalistNumbers[i]; if(i != finalistNumbers.size() - 1) { std::cout << " "; } } return 0; } |