COM 300 Lecture Notes - Standard Streams
Document Summary
Bibi with her team aqueous compete in the biggest tournament in history. Bibi will face n team in group stage. Bibi wants to know how many possible outcomes that team. Given 1 line consists of 1 integer n - number of teams that aqueous will face. Output 1 number that describe all possible outcomes that team aqueous win at least once. Assume that w is symbol for win and l for lose. Then, for sample test case 2, there are 7 possible outcomes : lll, llw, lwl, lww, wll, wlw, wwl, www. You can use bitwise operator to solve this problem. c(cid:13) school of computer science - binus, 2019. Bibi bersama dengan tim aqueous mengikuti turnamen terbesar dalam sejarah. Bibi dan timnya akan berhadapan dengan n tim di group stage. Bibi ingin tahu ada berapa banyak kemungkinan tim aqueous menang setidaknya satu kali dalam group stage.
