OJ Board

I want some case tests.

For all the tests here and in other topics of this problem, my code get the correct answer.

Thank you!

The problem is greater than I thought!
So, I really have no idea how to do this?

Can you help me mf?
TY.

What is WRONG?


#include <stdio.h>
#include <math.h>

int main()
{
long long int cases = 1, i, l, h, k, exponent;
double mantissa, result;

while ( scanf ("%lld %lld %lld", &l, &h, &k ) == 3 && ( l != -1 || h != -1 || k != -1 ) )
{
mantissa = 0.0;
for ( i = l; i <= h; i++ )
mantissa ...

This problem will be here soon, so, how can I output in C a number in this format:

0.ddddddedddddddddd

examples:
0.149143e0000000011
0.406971e0000000118

I need this to make the Problem E - Series of Powers - of the running contest.

At the moment of my question: http://online-judge.uva.es ...

How can I output in C a number in this format:

0.ddddddedddddddddd

examples:
0.149143e0000000011
0.406971e0000000118

I need this to make the Problem E - Series of Powers - of the running contest.

At the moment of my question: http://online-judge.uva.es/contest/data ... set/e.html

winkle, the mistake is that you forgot to do (length = len) when (n == 0).
Then, you may pass the wrong value of length to draw_digits.

TY mf, but I've resolve this problem and i'm still get WA.
And I don't know why!!
Please, anyone can help me?


#include <stdio.h>

#define MAX(A, B) ( (A) > (B) ? (A) : (B) )

int main()
{
int i, estudantes, media, troca, trocaMenor, trocaMaior, vetor[1005];
double total, valor, aux, mediaAux ...

I really don't understand this output.

My output gives:


10.00
11.99
1.10
2407.10
5.00
0.00
0.01
3991.11
0.01
2.25
4.73
0.02


Only the 4th case is different, but I think that mine is correct!
Why is the answer 2407.09?

My algorithm calculated that the amount beetween median and the lower ...

Thank you by the answers!

How to do prime factorization efficiently? Well, I don't know, I just go through primes in order, nothing fancy, and it usually works fine.

Yes, I understand your point, but the question is:

Do you have a list of the primes to do this? Until which number? If not, how can you "go through primes ...

I'm not understanding how to compute this problem.

Could anybody feel a general explanation of what should be done?

I know the Euler's totient function, but I don't have idea of how implements it in an efficient way.

Thank you.

The correct output:

Code: Select all

Case #1: The encoding string is aabbaa.

Your code outputs one 'a' less.

Martin, my output for this case it's the same that yours, "aabbaa".
Test again and look... What is wrong?
Anyone knows?

Thank you!

I really don't know where is the mistake... Could anyone explain me?

Thank you Martin!! Now AC! The mistake was only one wrong comparison...

Why WA? The output is perfect with the input we have here...