OJ Board

Hi Igor9669,

I think you assumed that deletion commands are given in ascending order and your program fails when deletion commands are given out of order..

try this input:
q 0
q 1
q 2
d 1000240
d 1000070
d 1000090
q 0
q 1

the correct output for the input above is:
4
10
16
3
7

I've used Fermat's Factorization in my code, but unfortunately I'm getting Wrong Answer. I've tested my program with big primes and semiprimes in range and it works well. It's a little confusing too, because my code consumes just about 30 miliseconds on UVa's judge (I'm not sure my code is really ...

Thanks alot misof, you are a real guru

My two favourite games are :

• Little Fighter 2 (v1.9)
  N (ninja -- it's a fabulous flash game)

Download and play them, You will enjoy them..

Mine is:
BASIC, Pascal, C, C++, VC, Delphi, Java, PHP, BrainF**k, BashScript, Haskell, JavaScript, Assembly

I don't know why this gets compile error, I found out that OJ gives compile error just when I use find function on a class templated set like the code below, can anyone help me out how can I use the find function on set...


#include <set>
#include <iostream>

using namespace std;

class Test ...

Hi !
I've done all of the hints above in my code
but i'm still getting WA ,
can anyone help me with some test cases,
thank further.....

Hi Navid,

Test this input to your program, it should generate the output
below which my Accepted Code generated.
Hope you figure out your problem with this test cases. :D

Input :

\s3.4a\sb\s.5c\s100.d\s12e
\*\b no translation should occur *\\ \b*\s3.*\*
/i/b/s\bb\ii\ss ...