fork download 
  1. #include <iostream>
  2. #include <iomanip>
  3. #include <map>
  4. #include <set>
  5. #include <cmath>
  6. #include <vector>
  7. #include <climits>
  8. #include <string>
  9. #include <algorithm>
  10. #include <sstream>
  11. using namespace std;
  12.  
  13. vector<string> split(string haystack, string needle) {
  14.     vector<string> result;
  15.     int startPos = 0;
  16.     int foundPos = haystack.find(needle, startPos);
  17.     while (foundPos != string::npos) {
  18.         int count = foundPos - startPos;
  19.         string token = haystack.substr(startPos, count);
  20.         if (!token.empty()) {
  21.             result.push_back(token);
  22.         }
  23.         startPos = foundPos + needle.length();
  24.         foundPos = haystack.find(needle, startPos);
  25.     }
  26.     string token = haystack.substr(startPos, haystack.length() - startPos);
  27.     if (!token.empty()) {
  28.         result.push_back(token);
  29.     }
  30.     return result;
  31. }
  32.  
  33. string nameConvert(const string& name) {
  34.     const string DELIMITER = " ";
  35.     stringstream builder;
  36.     auto parts = split(name, DELIMITER);
  37.     for (auto part : parts) {
  38.         part[0] = toupper(part[0]);
  39.         transform(part.begin() + 1, part.end(), part.begin() + 1, ::tolower);
  40.         builder << part << DELIMITER;
  41.     }
  42.     return builder.str();
  43. }
  44.  
  45. string dateConvert(const string& date) {
  46.     const string DELIMITER = "/";
  47.     stringstream builder;
  48.     auto parts = split(date, DELIMITER);
  49.     builder << setw(2) << setfill('0') << parts[0] << DELIMITER;
  50.     builder << setw(2) << setfill('0') << parts[1] << DELIMITER;
  51.     builder << parts[2];
  52.     return builder.str();
  53. }
  54.  
  55.  
  56. int main() {
  57.     ios_base::sync_with_stdio(false);
  58.     cin.tie(NULL);
  59.  
  60.  
  61.     string n;cin >> n;
  62.     int k;cin >> k;
  63.  
  64.     for (int i = n.length() - 1;i >= n.length() - k;i--) {
  65.         if (n[i] == '1') {
  66.             cout << "NO";
  67.             return 0;
  68.         }
  69.     }
  70.     cout << "YES";
  71.     return 0;
  72. }
  73.  
  74.  
Success #stdin #stdout 0s 5320KB
comments (?)
stdin 
Standard input is empty
stdout 
NO
https://ideone.com/0OhB1A
language:
C++ (gcc 8.3)
created:
22 hours ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!