10700 - Camel trading

[Morning]

[cpp]
#include <iostream>
using namespace std;
#define isNumber(c) (c >= '0' && c <= '9')

class Stack
{
public:
Stack();
void push(int n);
long long pop();
long long point;
long long data[32];
};
Stack::Stack()
{
point = 0;
}
void Stack::push(int n)
{
data[point++] = n;
}
long long Stack::pop()
{
return data[--point];
}

long long max(char str[128])
{
long long n = 0;
Stack *s = new Stack();
for (int i = 0;str != '\0';i++)
{
if (isNumber(str))
{
n = str - '0';
if (isNumber(str[i + 1]))
{
i++;
n = n * 10 + str - '0';
}
s->push(n);
}
else
{
if (str == '+')
{
i++;
n = str - '0';
if (isNumber(str[i + 1]))
{
i++;
n = n * 10 + str - '0';
}
n += s->pop();
s->push(n);
}
}
}
n = 1;
for (int j = 0;j < s->point;j++)
{
n *= s->data[j];
}
delete s;
return n;
}
int min(char str[128])
{
long long n = 0;
Stack *s = new Stack();
for (int i = 0;str != '\0';i++)
{
if (isNumber(str))
{
n = str - '0';
if (isNumber(str[i + 1]))
{
i++;
n = n * 10 + str[i] - '0';
}
s->push(n);
}
else
{
if (str[i] == '*')
{
i++;
n = str[i] - '0';
if (isNumber(str[i + 1]))
{
i++;
n = n * 10 + str[i] - '0';
}
n *= s->pop();
s->push(n);
}
}
}
n = 0;
for (int j = 0;j < s->point;j++)
{
n += s->data[j];
}
delete s;
return n;
}

int main()
{
int n;
char str[128] = "";
cin >> n;
cin.getline(str,128);
while(n--)
{
cin.getline(str,128);
cout << "The maximum and minimum are " << max(str) << " and " << min(str) << '.' << endl;
}
return 0;
}[/cpp]

[Junayeed]

Try this i/p

20*20*20*20*20*20*20*20*20*20*20*20

Hope this will help

[Morning]

yeah,stupid mistake
thanks so much,buddy:)

[phoenixKonquerer]

Hello there, I got WA for question 00 for volume 107.

Is there anyone out there with AC to this problem and if yes can you please supply me with some testing input data along with the correct answer to it please.

Thank you so much.

[mf]

My solution was simply to swap the priority of operators '+' and '*'. Perhaps you're getting WA if you don't use 64-bit integers

Consider this case:
20*20*20*20*20*20*20*20*20*20*20*20

[phoenixKonquerer]

Hello I took ur advise and change my int variables to unsigned long long variables but I still got a WA for my submission.

The answer to ur example is

4096000000000000

Do u have any more testing data ?

Thanks for your help.

[Dmytro Chernysh]

Yep, indeed, the answers are
The maximum and minimum are 4096000000000000 and 4096000000000000.

[emotional blind]

Junayeed,
you told that your previous output was right

which was

input

Code: Select all

20*20*20*20 

output

Code: Select all

160000 and 0.

how the "0" comes for the minimum
i think Junayeed was wrong
can anyone explain[/quote]

[Mohammad Mahmudur Rahman]

The output should be 160000 and 160000 according to my AC program.

[emotional blind]

thanks a lot

[sunny]

i don't know for what input my program fails to output correctly.
i considered the case where all 12 numbers are 20. any1 pls debug my code.


[ Code removed By Moderator ]

[Tanu]

plz give me some sample input-output for problem 10700
http://acm.uva.es/p/v107/10700.html
I don't forgot to use long long data type...
Thanks in advance...
Tan

[Rocky]

what ouput does you get for this input
1
20*20*20*20*20*20*20*20*20*20*20*20

GOOD LUCK
Rocky

[Tanu]

Yah i got it accepted...
Thanx

[Martin Macko]

printf("The maximum and minimum are %.0Lf and %.0Lf\n",max,min);

You forgot "." at the end of the output sentence.

In future, please, put your code to

Code: Select all

 tags.