[SWEA 1223] 계산기2

출처 : https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV14nnAaAFACFAYD

#include <stdio.h>

#include <algorithm>

int N, result;

char a[150];

int main()

{

for (int t = 1; t < 11;t++)

{

scanf("%d", &N); scanf("%s", a); result = 0;

int n1 = 0, n2 = 0, s1[150], s2[150];

for (int i = 0; i < N; i++) {

if (a[i] == '+') s2[n2++] = '+';

else if (a[i] == '*') {

s1[n1 - 1] = s1[n1 - 1] * (a[i + 1] - '0');

i++;

}

else s1[n1++] = a[i] - '0';

}

for (int i = 0; i<n1; i++) result += s1[i];

printf("#%d %d\n", t, result);

}

return 0;

}