eolymp
bolt
Try our new interface for solving problems
Məsələlər

Калькулятор

dərc olunub 11.04.18 11:31:51

як зробить задачу heelp ОСЯЯЯ, Нестеров як її робить?

dərc olunub 11.04.18 11:33:41

Молча

dərc olunub 11.04.18 11:44:41

доброго дня, шановні співвітчизники

dərc olunub 11.04.18 11:45:19

добрий

dərc olunub 11.04.18 11:45:34

як зробити цю задачу?

dərc olunub 26.08.22 01:31:14

ADA, THANKS FOR EXPLAINS AND CODES.(JAVA,C++,PYTHON).

dərc olunub 03.01.24 20:44:00

include <bits/stdc++.h>

using namespace std;

int main() { iosbase::syncwith_stdio(0); cin.tie(0); cout.tie(0);

bool isMusbet = true;
string s, indiki, eded;
cin >> s;
int olcu = s.size(), cem = 0, ferq = 0;
for (int i = 0; i < olcu; i++) {
    if (s[i] == '-') {
        if (isMusbet) {
            cem += stoi(eded);
            eded.clear();
        } else {
            cem -= stoi(eded);
            eded.clear();
        }
        isMusbet = false;
    } else if (s[i] == '+') {
        if (isMusbet) {
            cem += stoi(eded);
            eded.clear();
        } else {
            cem -= stoi(eded);
            eded.clear();
        }
        isMusbet = true;
    } else {
        eded.push_back(s[i]);
    }
}
if(isMusbet) {
    cem += stoi(eded);
}else{
    cem -= stoi(eded);
}
cout << cem;
return 0;

}

dərc olunub 04.01.24 19:02:09
#include <iostream>
#include <string>
#include <algorithm>

#define int long long
#define all(v) v.begin(),v.end()
#define $AzH_TxdmN$ ios_base::sync_with_stdio(0);cin.tie(nullptr);cout.tie(nullptr);
using namespace std;

const int N = 3e5+7;
const int MOD = 1e9+7;

string s,curr;
int ans;

void solve()
{
    cin>>s;
    reverse(all(s));   // Reverse-Polish-Notation
    s += "+";          // To handle the calculations
    for (char ch : s)  // easier than other solutions
    {
        if (ch == '+')
            ans += stoll(curr),curr = "";
        else if (ch == '-')
            ans -= stoll(curr),curr = "";
        else
            curr = ch + curr;
    }
    cout<<ans<<'\n';
}

signed main()
{
    $AzH_TxdmN$
    int t = 1;
    //cin>>t;
    while(t--)
    {
        solve();
    }
}
dərc olunub 22.04.24 14:39:25

include <bits/stdc++.h>

using namespace std;

int main() {

bool isMusbet = true; string s, indiki, eded; cin >> s; int olcu = s.size(), cem = 0, ferq = 0; for (int i = 0; i < olcu; i++) { if (s[i] == '-') { if (isMusbet) { cem += stoi(eded); eded.clear(); } else { cem -= stoi(eded); eded.clear(); } isMusbet = false; } else if (s[i] == '+') { if (isMusbet) { cem += stoi(eded); eded.clear(); } else { cem -= stoi(eded); eded.clear(); } isMusbet = true; } else { eded.push_back(s[i]); } } if(isMusbet) { cem += stoi(eded); }else{ cem -= stoi(eded); } cout << cem; return 0;}