OJ Board

yep, I mean that

Hi,

Feeds would be such a great feature to this site. More specifically I would want a feed for upcoming contests. Thanks in advance.

This is how I am calculating the prime numbers..


//Here n is the number for which I am trying to find the primes
int x=n;
double totient = n;
int y=2;
while(x!=0) {
while(x%y!=0 && y<x) y++;
if (y>x || y==n) break;
totient *= ((double)y-1.0)/(double)y;
while(x%y==0) x=x/y;
}


For Example, a ...

I am using Euler Totien'ts function....which is timing out for some cases because it is difficult to find the prime numbers. Please give me a small hint.

Thank you

4
3.1 0.0023 0.35
0.21 0.00353 8.13
200 180.559 10.339
2.11 0.089 0.06111

We are require to find the lexicographically smallest sequence giving profit greater than 1.0 right?
Then Shouldnt the answer sequence be
1 2 3 1 ?
When we start with 1 unit of currency 1, by above sequence we end up with 2 ...

Hi,

I am a newbie around here. Is there a way I could submit my code after the contest has elapse[for practise, ofcourse].

Sorry, if this issue has been addressed elsewhere.

Thank you