RTE in ARITH2 (Simple Arithmetics II)

[Kalith]

Hi.

I'm trying to solve this problem (spoj.pl/problems/ARITH2) but i give Run Time Error and i'm not have idea

My code

#include <cstdlib>
#include <string>
#include <cstdio>
#include <cstring>
#include <vector>
#include <iostream>
#include <map>
#include <algorithm>
#include <cstdio>
#include <cctype>
#include <climits>
using namespace std;
char buffer[600], b2[600];
long long str_to_n (const char* str) {
    long long t;
sscanf (str, "%lld", &t);
return t;
}
/*
long long evaluate (vector<string> n, vector<char> o, long long res, int k = 0) {
    if (k == n.size() || k == o.size()) 
	return res;

long h = str_to_n (n[k].c_str());

if (o[k] == '+') return evaluate (n, o, res + h, k + 1);
if (o[k] == '-') return evaluate (n, o, res - h, k + 1);
if (o[k] == '*') return evaluate (n, o, res * h, k + 1);
if (o[k] == '/') return evaluate (n, o, res / h, k + 1);
}*/
int main () {
    int N;
gets (buffer);
sscanf (buffer, "%d", &N);

while (N--) {
	gets (buffer);
	gets (buffer);

	vector<string> n;
	vector<char> o;

	strcpy (b2, buffer);

	for (char* ptr = strtok (buffer, "+-/*= "); ptr != 0; n.push_back (ptr), ptr = strtok (0, "+-/*= "));
	for (char* ptr = strtok (b2, "0123456789= "); ptr != 0; o.push_back (ptr[0]), ptr = strtok (0, "0123456789= "));

	long long h = str_to_n (n[0].c_str());

	n.erase (n.begin(), n.begin() + 1);

	for (size_t i = 0; i < n.size() && i < o.size(); ++i) {

		if (o[i] == '+') h = h + str_to_n (n[i].c_str());
		else if (o[i] == '*') h = h * str_to_n (n[i].c_str());
		else if (o[i] == '/') h = h / str_to_n (n[i].c_str());
		else if (o[i] == '-') h = h - str_to_n (n[i].c_str());
	}

	printf ("%lld\n", h);
}
}

[leppyr64]

How did you come up with 600?

[Kalith]

my fault.. I got ACC

[himym_sof]

Hi, I'm trying to solve ARITH2 but getting WA , I don't know really why it is WA

this is my code :

#include <cstdlib>
#include <iostream>
#include <vector>
#include <algorithm>
#include <list>
#include <string>
#include <ios>
#include <limits>
using namespace std;
vector<char> ops;
vector<string> values;
long long conv(string x){
long long w = 0;
for(int i=0;i<x.length();i++)
w = w * 10 + (x[i]-48);    
return w;
}
int main(int argc, char *argv[])
{
   int it;
   long long sum=0;
   string m,temp="";
   cin>>it;
   for(int i=0;i<it;i++){
   cin.ignore(numeric_limits<streamsize>::max(),'\n') ;
     getline(cin , m);
     for(int j=0;j<m.length();j++){
     if(m[j]=='+' || m[j]=='-' || m[j]=='*' || m[j]=='/' || m[j]=='='){
            values.push_back(temp);
            temp="";
           if(m[j]=='+')
                ops.push_back('+');
          else if(m[j]=='-')
                ops.push_back('-');
          else if(m[j]=='*')
                ops.push_back('*');
          else if(m[j]=='/')
                ops.push_back('/');   
          else if(m[j]=='=')
                ops.push_back('=');                
             } 
    else if(m[j]==' ')
          continue;  
    else temp+=m[j];       
     }
    sum=0;
     if(!values.empty())
     sum=conv(values[0]);
    for(int k=0;k<ops.size();k++){
            if(k==0)
             continue;
		        	   if(ops[k-1]=='+')
		        		   sum+=conv(values[k]);
		        	  else if(ops[k-1]=='-')
		        		   sum-=conv(values[k]);
		        	 else  if(ops[k-1]=='*')
		        		   sum*=conv(values[k]);
		        	 else  if(ops[k-1]=='/')
		        		   sum/=conv(values[k]);
		           }
    cout<<sum<<endl;
    sum=0;
    values.clear();
    ops.clear();
   }
 return 0;
}

[SOAD_sof]

i'm getting runtime error again and again...dont know y......pls some1 help....here is my code...

#include <stdio.h>
#include <string.h>
int main ()
{
	int t;
	scanf ("%d", &t);
    while (t--) {
	char c[10000];
	int a[10000] ={0};
	char a1[10000];

	scanf ("%[^\n]s", c);
	int i, j = 0, k = 0, flag = 1;
	for (i = 0; i < strlen (c); i++) {
		if (((int)c[i] > 47 && (int)c[i] < 58) && flag == 1) {
			a[j] = (a[j] * 10) + ((int)c[i] - 48);
		} else if (c[i] == '+' || c[i] == '-' || c[i] == '*' || c[i] == '/' || c[i] == '%') {
			a1[k] = c[i];
			k++;
			flag = 2;
		} else if (c[i] == '=') {
			a1[k] = '=';
			k++;
			break;
		}
		if (flag == 2) {
			j++;
			flag = 1;
		}
	}
	
	j = 0;
	printf ("%d %d %d\n", a[0], a[1], a[2]);
	long long ans = a[0];
	while (a1[j] != '=') {
		if (a1[j] == '+') {
			ans += a[j + 1];
		} else if (a1[j] == '-') {
			ans -= a[j + 1];
		} else if (a1[j] == '*') {
			ans *= a[j + 1];
		} else if (a1[j] == '/') {
			ans /= a[j + 1];
		} else if (a1[j] == '%') {
			ans = ans % a[j + 1];
		}
		j++;
	}
	printf ("%lld\n", ans);
}
return 0;
}