fork(1) download
  1. #include <iostream>
  2. #include <iostream>
  3. #include <map>
  4. #include <set>
  5. #include<algorithm>
  6. #include <iterator>
  7. using namespace std;
  8.  
  9. int main() {
  10. set<string> candidatesSize2;
  11. candidatesSize2.insert("b b");
  12. candidatesSize2.insert("a b");
  13. candidatesSize2.insert("b c");
  14. candidatesSize2.insert("c b");
  15. candidatesSize2.insert("bd");
  16. candidatesSize2.insert("d b");
  17. candidatesSize2.insert("b e");
  18. candidatesSize2.insert("d c");
  19. candidatesSize2.insert("ce");
  20.  
  21. const bool is_in = candidatesSize2.find("bbb") != candidatesSize2.end();
  22. if(is_in)
  23. cout<<"true";
  24. // your code goes here
  25. return 0;
  26. }
Success #stdin #stdout 0.01s 5388KB
stdin
Standard input is empty
stdout
Standard output is empty