Created
June 21, 2019 06:52
-
-
Save kei9327/51e1115ad884e3f05a82de3f63718ea6 to your computer and use it in GitHub Desktop.
HackerRank>Algorithm>implementation>bonAppetit
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <bits/stdc++.h> | |
using namespace std; | |
string ltrim(const string &); | |
string rtrim(const string &); | |
vector<string> split(const string &); | |
// Complete the bonAppetit function below. | |
void bonAppetit(vector<int> bill, int k, int b) { | |
int bills = 0; | |
for (int i=0; i < bill.size(); i++){ | |
bills += bill[i]; | |
} | |
int actual = (bills - bill[k]) / 2; | |
int anna_change = bill[k] / 2; | |
if (actual == b) { | |
cout << "Bon Appetit" << endl; | |
} else { | |
cout<< anna_change <<endl; | |
} | |
} | |
int main() | |
{ | |
string nk_temp; | |
getline(cin, nk_temp); | |
vector<string> nk = split(rtrim(nk_temp)); | |
int n = stoi(nk[0]); | |
int k = stoi(nk[1]); | |
string bill_temp_temp; | |
getline(cin, bill_temp_temp); | |
vector<string> bill_temp = split(rtrim(bill_temp_temp)); | |
vector<int> bill(n); | |
for (int i = 0; i < n; i++) { | |
int bill_item = stoi(bill_temp[i]); | |
bill[i] = bill_item; | |
} | |
string b_temp; | |
getline(cin, b_temp); | |
int b = stoi(ltrim(rtrim(b_temp))); | |
bonAppetit(bill, k, b); | |
return 0; | |
} | |
string ltrim(const string &str) { | |
string s(str); | |
s.erase( | |
s.begin(), | |
find_if(s.begin(), s.end(), not1(ptr_fun<int, int>(isspace))) | |
); | |
return s; | |
} | |
string rtrim(const string &str) { | |
string s(str); | |
s.erase( | |
find_if(s.rbegin(), s.rend(), not1(ptr_fun<int, int>(isspace))).base(), | |
s.end() | |
); | |
return s; | |
} | |
vector<string> split(const string &str) { | |
vector<string> tokens; | |
string::size_type start = 0; | |
string::size_type end = 0; | |
while ((end = str.find(" ", start)) != string::npos) { | |
tokens.push_back(str.substr(start, end - start)); | |
start = end + 1; | |
} | |
tokens.push_back(str.substr(start)); | |
return tokens; | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment