Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Incorrecto
|
0.003 s | 24 KBi |
#2 |
Incorrecto
|
0.008 s | 17 KBi |
#3 |
Incorrecto
|
0.004 s | 16 KBi |
#4 |
Incorrecto
|
0.006 s | 67 KBi |
#5 |
Incorrecto
|
0.004 s | 2 KBi |
#6 |
Incorrecto
|
0.006 s | 6 KBi |
#7 |
Incorrecto
|
0.005 s | 17 KBi |
#8 |
Incorrecto
|
0.004 s | 2 KBi |
#9 |
Incorrecto
|
0.003 s | 0 KBi |
#10 |
Incorrecto
|
0.005 s | 64 KBi |
#11 |
Incorrecto
|
0.006 s | 44 KBi |
#12 |
Incorrecto
|
0.004 s | 0 KBi |
#include <bits/stdc++.h> using namespace std; string ltrim(const string &); string rtrim(const string &); vector<string> split(const string &); /* * Complete the 'jumpingOnClouds' function below. * * The function is expected to return an INTEGER. * The function accepts INTEGER_ARRAY c as parameter. */ int jumpingOnClouds(vector<int> c) { for (size_t i = 0; i < c.size(); i++) { std::cout << c[i]; } std::cout << "\n"; return (0); } int main() { ofstream fout(getenv("OUTPUT_PATH")); string n_temp; getline(cin, n_temp); int n = stoi(ltrim(rtrim(n_temp))); string c_temp_temp; getline(cin, c_temp_temp); vector<string> c_temp = split(rtrim(c_temp_temp)); vector<int> c(n); for (int i = 0; i < n; i++) { int c_item = stoi(c_temp[i]); c[i] = c_item; } int result = jumpingOnClouds(c); fout << result << "\n"; fout.close(); 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; }