OJ Board

I tried to solve the problem in the following way:
create the suffix array of the string -> sort in lexicographic order ->
check the prefixes of the prefixes of succesive terms, and print the best.

My output is correct the the huge test data provided in a previous post,
but still I am getting WA ...

I am trying to solve it with the greedy approach, that it was described before,
but till now I have a lot of WA.
I used both ways for the tables, unsorted and sorted according to the capacity.

Is there any special case I have to consider?
The boundary conditions are correct?
Should the ...

Can someone explain why the output for
is and not
Thanks in advance for any reply.

I follow the strategy that it was written above.

1.calculate all primes till 5000000 and at the same time filling a sieve with almost odd numbers,
2 when reading from the input n, calculating the sum till n

I received about 10-20 times TLE.
I have no idea how to make it faster.
Thanks in advance ...

I can not understand something in this problem.

the problem states that
" You can take K different elements from them to make a group " and
"Two groups will be different if there is at least one element which is not common to both" ,
so, I assume that when I find for 2nd time some number I will ...

I can not figure out with my poor english what means in the problem explanation the phrase:

"...This display must start in column 1, and will not exceed the width of an 80-character line...."

that we will take as a fact that the output lines will be less than 80 characters, or that we should take ...

Hi.
it seems that I have an unsolvable problem with 10099.
The algorithm seems simple but I'm receiving WA continously.
Can someone take a look at my code?
Thanks in advance for any suggestion,
grazyna

Thanks Jan for your reply and your nice explanation.
Everything is clear now , and it should be long time ago,
if I was more carefull. I misunderstood the problem, and I was so sure that I didn't bother myself to read the problem...

I just got accepted assuming according to the advices of the forum that from 19 -> 162 Stan is winning. But still I think that judge is wrong on this problem...

I read all the posts and I can not find where is the fault in my logic:

I read that is considered corect that from 18 -> 162 Stan wins.

Let them choose 50: Stan of course starts with 2. (Otherwise he looses since Ollie will return 81.) Ollie responds with 4. Stan now will return 8 or 36. In any ...

Thanx for reply.
It was stupid from me that I didn't consider the powers in 1 .
I am AC now.

I am trying to solve 107 using long long and I am getting WA.
should I use double , since the problem clarifies that it has to do with integers?

more over I saw in the forum the sample input 11 10 ,
with the output 1 21.

Is it valid input? As far as for the input pair a b there should be ...

I receive runtime error with the message :
Your program has died with signal 8 (SIGFPE). Meaning:

Floating point exception

Before crash, it ran during 0.000 seconds.
for the following code:

Thx everybody who tried. I found my stupid mistake


I don't see any illegal division. Thanks in advance ...

I read all the posts about the problem. I considered the extra pennies , extreme cases etc. I am affraid that I miss something essential about c++ programming and portability. Thanks in advance for any help.

/* @JUDGE_ID: xx 10137 C++ "The Trip" */

#include <iostream>

#include <iomanip>

using ...

Thanks jakabjr. I just started to learn C++ and I was afraid that there was some deep language problem.