Pagini recente » Cod sursa (job #811773) | Cod sursa (job #2871022) | Cod sursa (job #2566457) | Cod sursa (job #2482501) | Cod sursa (job #981405)
Cod sursa(job #981405)
//#include <iostream>
#include <fstream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <queue>
#include <utility>
#define ll long long int
#include <cstdio>
#define first f
#define second s
using namespace std;
ifstream cin("rez.in");
ofstream cout("rez.out");
//ios_base::sync_with_stdio(false);
ll i,ii,j,k,maxx,n,rez;
string s;
int Paralel();
int CompunNumar()
{ int nr=0;
++i;
for (;i<s.size();++i)
if (s[i]>='0'&&s[i]<='9')
nr=nr*10+(s[i]-'0');
else break;
return nr;
}
int Serie()
{
int rasp=0;
while(s[i]!=','&&s[i]!=')'&&i<s.size())
{
if (s[i]=='R')
rasp+=CompunNumar();
else rasp+=Paralel();
}
return rasp;
}
int Paralel()
{
int sum=0;
int prod=1;
++i;
while(s[i]!=')'&&i<s.size())
{
ii=Serie();
sum+=ii;
prod*=ii;
if (s[i]==',')
++i;
else {++i;return prod/sum;}
}
return 0;
}
int main()
{
//ios_base::sync_with_stdio(false);
cin>>s;
while (i<s.size())
if (s[i]=='(')
rez+=Paralel();
else rez+=Serie();
cout<<rez<<'\n';
return 0;
}