Ad
DonutMastervs.Kedaci

Digest word into letters (C++ Translation)

Fundamentals
Strings
Code
Diff
  • #include <string>
#include <fmt/ranges.h>

using namespace std;

string digest(const string& param) {
    string ans = "";
    if(param == "") {
        return ans;
    }
    if(param[0] == ' ') {
        ans = "   ";
    } else {
        ans = param.substr(0, 1);
    }
    for(int i = 1; i < param.length(); i++) {
        if(param[i] == ' ') {
            ans += "  ";
        } else {
            ans += " " + param.substr(i, 1);
        }
    }
    return ans;
}
    • #include <string>
    • #include <fmt/ranges.h>
    • auto digest(const std::string& param) {
    • if (param.empty()) return param; // Oh... should check there !!
    • return fmt::format("{}", fmt::join(param, " "));
    • using namespace std;
    • string digest(const string& param) {
    • string ans = "";
    • if(param == "") {
    • return ans;
    • }
    • if(param[0] == ' ') {
    • ans = " ";
    • } else {
    • ans = param.substr(0, 1);
    • }
    • for(int i = 1; i < param.length(); i++) {
    • if(param[i] == ' ') {
    • ans += " ";
    • } else {
    • ans += " " + param.substr(i, 1);
    • }
    • }
    • return ans;
    • }
DonutMastervs.Eldyj

Add numbers of an array

Code
Diff
  • #include <array>

template <std::size_t L>
long
add_arr(std::array<int, L> arr)
{
  long result = 0;
  for (int i = 0; i < arr.size(); i++) result += arr[i];
  return result;
}

template long add_arr(std::array<int, 9> arr);
    • #include <array>
    • template <std::size_t L>
    • long
    • add_arr(std::array<int, L> arr)
    • {
    • long result = 0;
    • for (int i : arr) result += i;
    • for (int i = 0; i < arr.size(); i++) result += arr[i];
    • return result;
    • }
    • template long add_arr(std::array<int, 9> arr);
DonutMastervs.KamaleshPathy

Numbers Divided by 2

Code
Diff
  • unsigned long long div2(unsigned long long a){
    return a/2;
}
    • unsigned long long div2(unsigned long long a){
    • unsigned long long ans = 0, i;
    • for (i = 1; i <= a; i++) {
    • if (i % 2){
    • continue;
    • } else {
    • ans++;
    • }
    • }
    • return ans;
    • return a/2;
    • }
DonutMastervs.Gael12321

C++ Simple Calculator

Code
Diff
  • #include <algorithm>
#include <cmath>
using namespace std;

string calculator(int a, char op, int b) {
    if(op == '+') {
      return to_string(a+b);
    } else if(op == '-') {
      return to_string(a-b);
    } else if(op == '/') {
      if(b == 0 || a == 0) {
        return "Invalid Input!";
      }
      return to_string(a/b);
    } else if(op == '*') {
      return to_string(a*b);
    } else if(op == '%') {
      if(b == 0 || a == 0) {
        return "Invalid Input!";
      }
      return to_string(a%b);
    } else {
      return "Invalid Input!";
    }
}
    • #include <ostream>
    • #include <algorithm>
    • #include <cmath>
    • using namespace std;
    • string calculator(int a, char op, int b) {
    • stringstream s;
    • switch (op) {
    • case '+': {s<<a+b; return s.str();}
    • case '-': {s<<a-b; return s.str();}
    • case '*': {s<<a*b; return s.str();}
    • case '/': {b != 0 ? s<<a/b : s<<"Invalid Input!"; return s.str();}
    • case '%': {s<<a%b; return s.str();}
    • default: return "Invalid Input!";
    • if(op == '+') {
    • return to_string(a+b);
    • } else if(op == '-') {
    • return to_string(a-b);
    • } else if(op == '/') {
    • if(b == 0 || a == 0) {
    • return "Invalid Input!";
    • }
    • return to_string(a/b);
    • } else if(op == '*') {
    • return to_string(a*b);
    • } else if(op == '%') {
    • if(b == 0 || a == 0) {
    • return "Invalid Input!";
    • }
    • return to_string(a%b);
    • } else {
    • return "Invalid Input!";
    • }
    • }
DonutMastervs.Fxh

Add numbers of an vector

Code
Diff
  • #include<bits/stdc++.h>
using namespace std;

long add_arr(vector<int> arr)
{
  long sum = 0;
  for(int i = 0; i < arr.size(); i++) {
    sum += arr[i];
  }
  return sum;
}
    • #include<bits/stdc++.h>
    • using namespace std;
    • long add_arr(vector<int> arr)
    • {
    • return std::reduce(begin(arr),end(arr));
    • long sum = 0;
    • for(int i = 0; i < arr.size(); i++) {
    • sum += arr[i];
    • }
    • return sum;
    • }