OJ Board

I recently started to use C/C++ and as I know most of programs that work on C also work on C++ (at least compile). Maybe you can tell me what in this program can produce CE on C++(I use Visual C++ 6 and all work). //This is problem 10714 //It's AC on C and Compilation Error on C++ (why??) #include <...

Sorry, I didn't read you code. But today I get accepted for this problem after some WAs. My mistake was that program hadn't worked with words like - sum of their "characters" is 0 and you must to find 0/0.
Realy in this case you should output clear line.

Can I use special modules in UVA problems ( for example : uses Math, SysUtils ).

I can`t understand why I get RTE. This is problem 10242 about parallelogram. [pascal]{$N+} program acm10242; {Fourth point of parallelogram} var i, j, ii, jj, n, same1, same2: integer; x, y: array [1..4] of double; v: array [1..4] of integer; x1, y1: double; procedure similar; {find 2 similar points...

Do you know about the Seat of Eratosphean???

And what answers for 1 or (-1) or 0 ???
My prog work on all inputs but WA

I changed const kolichestvo to 100000. But also WA
Maybe else mistke ...

No, my AC code contain line
[pascal] if (n=1) then writeln(n:5, ' DEFICIENT') [/pascal]
Judge suppose that you must to count only divisors that <n. And for 1 the sum of divisors will be 0. Ofcourse it DEFICIENT.

I don't know C but I know that very often mistake for this problem that 1 is DEFICIENT. Check it please.
Best regards.

First outputs for this problem: [pascal]program acm386; {a^3=b^3+c^3+d^3} begin writeln('Cube = 6, Triple = (3,4,5)'); writeln('Cube = 12, Triple = (6,8,10)'); writeln('Cube = 18, Triple = (2,12,16)'); writeln('Cube = 18, Triple = (9,12,15)'); writeln('Cube = 19, Triple = (3,10,18)'); writeln('Cube ...

Hi! I have program that give me right output for input from osan.
But judge give me WA.
One question: can I read m and n in double variable or I must to read it as string (m, n<10^101) ?

(m*m*m)mod p=(m mod p * m mod p)mod p I think you wanted to say that (m*m) mod p = (m mod p * m mod p) mod p :wink: I also as can't get AC for this problem. But my prog work on all my inputs. But I don't know what output must be for (0, 0, m) :-? My algorithm have this steps: 1) create mods: array ...

Thank you, little joey. It was realy silly mistake.
Now I`ve got AC

Thank you. As I understand you, my prog work like you say. Maybe I realy have some bug. But it is very hard to find it becouse program works well on all my inputs

Sorry, I know java very and very bad. All that I can help you is my algo: 1) read input to array a[1..n] of integer 2) create other array b[1..n] of boolean for i=1 to n-1 do if |a[i] - a[i+1]|>=n then /Not jolly/ else b[|a[i] - a[i+1]|]:=true for i=1 to n-1 if not b[i] then /Not jolly/ else {if b[i...