infoarena

for (i=-50; i<=50; ++i)
  for (j=-50; j<=50; ++j)
    if (i*j)
      aduga -a1*i*i*i-a2*j*j*j in lista valorilor; 
for (i=-50; i<=50; ++i)
  for (j=-50; j<=50; ++j)
    for (k=-50; k<=50; ++k)
       if (i*j*k)
          daca a3*i*i*i+a4*j*j*j+a5*k*k*k se afla in lista valorilor
            nrsol=nrsol+1;

Eroare de compilare: In file included from /usr/include/c++/4.2/string:53, from /usr/include/c++/4.2/bits/locale_classes.h:47, 
from /usr/include/c++/4.2/bits/ios_base.h:47,
 from /usr/include/c++/4.2/ios:48,
 from /usr/include/c++/4.2/istream:44, 
from /usr/include/c++/4.2/fstream:45, 
from user.cpp:3:

/usr/include/c++/4.2/bits/stl_function.h:134: error: expected identifier before numeric constant 
/usr/include/c++/4.2/bits/stl_function.h:134: error: expected unqualified-id before numeric constant
/usr/include/c++/4.2/bits/stl_function.h:143: error: expected identifier before numeric constant
/usr/include/c++/4.2/bits/stl_function.h:143: error: expected unqualified-id before numeric constant 

#define plus 1
#define minus 0
#include<fstream>
#include<cstdlib>
#include<cstring>
using namespace std;


int number[2], nx[2];

void check(char str[])
{
	int i = 0, len = strlen(str);
	int i2;
	char arr[5]; bool sign;
	int side = 0;
	int temp;

	while (i<len) {
		// check sign
		if (str[i] == '-') {
			sign = minus; i++;
		}
		else if (str[i] == '+') {
			sign = plus; i++;
		}

		// get number
		i2 = 0;
		while (str[i] >= '0' && str[i] <= '9') {
			arr[i2] = str[i];
			i2++; i++;
		}
		temp = atoi(arr);
		if (sign == minus) temp*=-1;
		memset(arr, 0, 5);

		// check if x and make calculations
		if (str[i] == 'x') {
			nx[side]+=temp;
			i++;
		}
		else number[side]+=temp;

		if (str[i] == '=') {
			i++; side++;
		}
	}
}



int main()
{
	int n; long long result;
	char str[256];

	ifstream in ("ecuatii.in");
	ofstream out ("ecuatii.out");
	in>>n;

	in.getline(str, 256, '\n');

	for (int i = 0; i < n; i++) {
		memset(str, 0, 256);
		number[0] = 0; number[1] = 0;
		nx[0] = 0; nx[1] = 0;
		in.getline(str, 256, '\n');
		check(str);

		if ((nx[0] == nx[1]) && (number[0] == number[1]))
			out<<"infinit\n";

		else if ((nx[0] == nx[1]) && (number[0] != number[1]))
			out<<"imposibil\n";

		else {
			number[0] = number[0] - number[1];
			nx[0] = nx[0] - nx[1];
			result = (long long)(10000*number[0])/nx[0]*-1;

			out<<result/10000<<"."<<abs(result%10000)<<endl;
		}
	}
	out.close();
	in.close();
	return 0;


}

int search(int X){
    int key = abs(X%NMAX);
    for(vector < int >::iterator it = Hash[key].begin();it!=Hash[key].end();++it)
        if(*it == X)
            return 1;
return 0;
}

int search(int X){
    int key = abs(X%NMAX);
    int s=0;
    for(vector < int >::iterator it = Hash[key].begin();it!=Hash[key].end();++it)
        if(*it == X)
            s++;
    return s;
}