OP
OP
It shouldn't be big change [remove 'name' from class Account + change 'name' to 'id' in all pages where it's used], but it requires ~30 minutes of work (for me, as I know what is where in acc. maker, for someone else it can be few hours). I don't have time until friday, because I must write few stupid programs for studies, like that:uhm i tried, everything seemed fine until the "accounts sample db" step
where it was supposed to create the sample characters, there was simply no message.. so i kept going to the admin password step, then deleted the install files, and i tried to log in; but then i got a HTTP 500 error.
Using Uniform server btw.
i have to do something else than just follow the install steps ?
- - - Updated - - -
and i want it to work in a 9.10 server im starting with a custom client i made for it..
so yeah i can't make it in 0.2.13, i HAVE to make it in v0.2.11pl2..
or is there anyway to have a 0.2.13+ working as a 9.10 server? i don't really want to update to 9.70+.. yet (since i can't right now)
- - - Updated - - -
Query: SELECT `id`, `name`, `password`, `premdays`, `lastday`, `email`, `key`, `group_id`, `create_ip`, `create_date`, `premium_points`, `page_access`, `location`, `rlname`, `email_new`, `email_new_time`, `email_code`, `next_email`, `last_post`, `flag` FROM `accounts` WHERE `name` = '1'
SQLSTATE: 42S22
Driver code: 1054
Error message: Unknown column 'name' in 'field list'
[CPP]#include<iostream>
using namespace std;
class Element
{
public:
char value;
Element* left;
Element* right;
Element()
{
value = NULL;
left = NULL;
right = NULL;
}
};
void showTree(Element* element)
{
if(element->left)
showTree(element->left);
if(element->right)
showTree(element->right);
cout << element->value;
}
char isOneNode(Element* element)
{
if(element->left && element->right)
return 0;
else if(element->left)
return isOneNode(element->left);
else if(element->right)
return isOneNode(element->right);
else
return 1;
}
char getTheBest(Element* element)
{
char r1 = 0;
char r2 = 0;
if(!element->left && !element->right)
{
return element->value - 70;
}
else
{
if(element->left)
{
r1 = getTheBest(element->left);
}
if(element->right)
{
r2 = getTheBest(element->right);
}
}
if(r1 != 0 && r1 < 90)
{
delete element->left;
element->left = NULL;
r1 = r1 + 70;
}
if(r2 != 0 && r2 < 90)
{
delete element->right;
element->right = NULL;
r2 = r2 + 70;
}
if(r1 > r2)
{
delete element->right;
element->right = NULL;
return r1;
}
else if(r1 < r2)
{
delete element->left;
element->left = NULL;
return r2;
}
return r2;
}
int main()
{
char lastChar;
char tmpChar;
Element* root = new Element();
Element* currentNode = root;
cin >> lastChar;
while(cin >> tmpChar)
{
if(tmpChar == 'L')
{
if(currentNode->left == NULL)
{
currentNode->left = new Element();
}
currentNode = currentNode->left;
}
else if(tmpChar == 'R')
{
if(currentNode->right == NULL)
{
currentNode->right = new Element();
}
currentNode = currentNode->right;
}
else
{
currentNode->value = lastChar;
lastChar = tmpChar;
currentNode = root;
}
}
currentNode->value = lastChar;
while(!isOneNode(root))
{
cout << getTheBest(root);
}
showTree(root);
return 0;
}[/CPP]
