OJ Board

Can anyone see how this returns a runtime error?
I have tried everything it seems, other inputs people have, etc. (and I have looked at other posts too), but my code is accessing memory somewhere it shouldn't be.

Thanks for anything!





Sorry, ended up being a vector which wasn't popped!!

Don ...

shouldn't you print the file name?

Thanks, Will try something else.

Why does ANSI C recognize atoi() but not itoa()?

I have good output, I believe, having rewritten this in C++, here is the output: Day #1: the longest nap starts at 15:00 and will last for 30 minutes.
Day #2: the longest nap starts at 15:00 and will last for 1 hours and 45 minutes.
Day #3: the longest nap starts at 17:15 and will last for 45 ...

I am sorting my times using shell sort and I can get my simple test cases to work, can anyone send or post or tell me of cases which would send my algorithm into a tizzy? Any input is greatly appreciated, thanks

What does this mean? You CAN'T assume, however, that the input will be in any specific order. I assume it means that possibly the times are not necessarily sequential, but, I have the following output: Day #1: the longest nap starts at 15:00 and will last for 30 minutes.
Day #2: the longest nap ...

for clarity I am posting my sample input:

<blank line>
icky
pretty
women
walking
down
the
street
meningitis
frontal
yelp
<blank line>
verbatim
greater
prettywoman
walkingdown
inging
singing
ab
ba
ab
cd
cat
bat

and my output generated:

<blank line>
e
nw
et
nt
<blank line>
aert
anow
ggiinn
ab ...

Can't seem to figure out why I get a wrong answer to this problem, I find the common letters to the words, and output the multiples of each letter occuring in both words, I output blank lines for neither word having common letters and for a blank input of the second word, IS IT POSSIBLE TO HAVE AN ...

I can't see how I might optimize this, can anyone help?

Thanks

[cpp]
#include <iostream>
#include <iterator>
#include <cstring>
#include <list>

using namespace std;

const char * FIRST = "P.", * LAST = "Erdos";

typedef struct
{
char *Name, *Init;
int Num;

} Erdi;

list < list <Erdi> > values ...

I compile and run this fine off my computer, using g++, why does UVA give me a runtime error for this? /*Learning Portuguese #10197*/
#include <iostream>
#include <cstring>
#include <cassert>
#include <string>

using namespace std;

#define PORT_O 243

class CPort
{
public:

CPort();
CPort ...

Can anyone tell me what might cause the presentation error in this code? #include <iostream>
#include <cstring>
#include <cassert>

using namespace std;

class CMines
{
public:

CMines();
CMines(char**, int, int);
~CMines();
void setRows(int);
void setCols(int);
void setBoard(char**);
int ...

Look, can anyone just tell me if a discrete state is bound by the binary size of the identity or not?

Thanks

I want to know why or how, discrete states are displayed that are larger than one byte, like the example given of 2 bytes, if I may ask how the XOR results extend?

Does each byte reflect results identical to the first byte?

Say state one has automaton value identity 9, and number of cells 5, the ...