Pagini recente » Cod sursa (job #2001370) | Cod sursa (job #1773436) | Cod sursa (job #1829564) | Cod sursa (job #2332090) | Cod sursa (job #2867488)
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define dbg(x) cout << #x <<": " << x << "\n";
using ll = long long;
class InP {
FILE *fin;
char *buff;
int sp;
public:
InP(const char *p) {
fin = fopen(p, "r");
buff = new char[4096]();
sp = 4095;
}
~InP() {
fclose(fin);
}
char read_ch() {
sp++;
if (sp == 4096) {
fread(buff, 1, 4096, fin);
sp = 0;
}
return buff[sp];
}
InP &operator >>(int &n) {
char c;
int sgn = 1;
while (!isdigit(c = read_ch()) && c != '-');
if (c == '-') {
n = 0;
sgn = -1;
}
else n = c - '0';
while (isdigit(c = read_ch()))
n = n * 10 + c - '0';
n = n * sgn;
return *this;
}
InP &operator >>(ll &n) {
char c;
int sgn = 1;
while (!isdigit(c = read_ch()) && c != '-');
if (c == '-') {
n = 0;
sgn = -1;
}
else n = c - '0';
while (isdigit(c = read_ch()))
n = n * 10LL + c - '0';
n = n * sgn;
return *this;
}
InP &operator >> (char &n) {
n = read_ch();
// while ((n = read_ch()) != '\n' && n != ' ');
return *this;
}
};
class OuP {
FILE *fout;
char *buff;
int sp;
public:
OuP(const char *p) {
fout = fopen(p, "w");
buff = new char[50000];
sp = 0;
}
~OuP() {
fwrite(buff, 1, sp, fout);
fclose(fout);
}
void write_ch(char c) {
if (sp == 50000) {
fwrite(buff, 1, sp, fout);
sp = 0;
}
buff[sp++] = c;
}
OuP &operator <<(int n) {
if (n <= 9)
write_ch(n + '0');
else {
*(this) << (n / 10);
write_ch(n % 10 + '0');
}
return *this;
}
OuP &operator <<(ll n) {
if (n <= 9)
write_ch(n + '0');
else {
*(this) << (n / 10);
write_ch(n % 10 + '0');
}
return *this;
}
OuP &operator <<(char c) {
write_ch(c);
return *this;
}
OuP &operator <<(const char *c) {
while (*c) {
write_ch(*c);
c++;
}
return *this;
}
};
// InP fin("sortaret.in");
// OuP fout("sortaret.out");
ifstream fin("evaluare.in");
ofstream fout("evaluare.out");
string s;
int i = 1;
int n;
int termen();
int factor();
int eval() {
int r = termen();
while (s[i] == '+' || s[i] == '-')
{
if (s[i] == '+') {
++i;
r += termen();
}
else if (s[i] == '-') {
++i;
r -= termen();
}
}
return r;
}
int termen() {
int r = factor();
while (s[i] == '*' || s[i] == '/') {
if (s[i] == '*') {
++i;
r *= factor();
}
else if (s[i] == '/') {
++i;
r /= factor();
}
}
return r;
}
int factor() {
int r;
if (s[i] == '(') {
i++;
r = eval();
i++;
}
else {
r = 0;
while (isdigit(s[i])) {
r = r * 10 + s[i++] - '0';
}
}
return r;
}
int main() {
fin >> s;
n = s.size();
s = "#" + s;
fout << eval();
// fin.close();
// fout.close();
return 0;
}