Problem My approach was to keep the multiplication factors in stack and pop them when a bracket ends
code
Please Help I am unable to find the mistake
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
Help in third problem of google kickstart round B
Problem My approach was to keep the multiplication factors in stack and pop them when a bracket ends
//JSD
#include<iostream>
#include<map>
#include<stack>
#define ll long long
#define Maxx (long long)1e9
using namespace std;
void solve(int test){
string s;
cin>>s;
int n=s.length();
stack<int> st;
int factor=1;
map<char, int > m;
for(int i=0;i<n;i++){
if(isdigit(s[i])){
st.push(int(s[i]-'0'));
factor*=int(s[i]-'0');
}
if(s[i]==')'){
int x=st.top();
st.pop();
factor/=x;
}
if(isalpha(s[i])){
m[s[i]]+=factor;
}
}
ll x=0,y=0;
x=(x+m['S'])%Maxx;
x=(x-m['N']+Maxx)%Maxx;
y=(y+m['E'])%Maxx;
y=(y-m['W']+Maxx)%Maxx;
cout<<"Case #"<<test<<": "<<y+1<<" "<<x+1<<"\n";
}
int main(){
ll t;
cin>>t;
int test=1;
while(t--){
solve(test);
test++;
}
return 0;
}
Please Help I am unable to find the mistake
Name |
---|