OJ Board

I have submitted solution of this problem 4 - 5 times, and every time it gives verdict "Sent to judge". After 1 - 2 hour the verdict becomes blank.
Is the judge data are there or any other problem for this problem.

Hopes administrators of UVA online judge will look after it.

I am getting WA.
Please someone give the answers of these test case , stated above.

Thanx in advance.

Edit: ACCEPTED.

You have 4 primes in hand 2 , 3 , 5 , 7 and you are to divide 10 by one of them,
but you don't know by which one, you have to choose one of them randomly, if you fail to get the correct one,
you have wasted one move and you will choose another one randomly.

If you choose 2, then number of moves ...

If I am not wrong, you are not calculating expected value.
suppose n = 10,
so primes smaller than 10 are 2,3,5,7
so probability of choosing one of these number to divide 10 is 1 / 4.

so E(10) = 1/4 ( E(10) (10 is not divisible by 7) + E(10 / 5 ) + E(10) + E(10 / 2) ) + 1

Need some test cases.

Need some input output.

try this,
input: output:

when x==y output will always be 0.

ops! , Sorry for disturb

So, why this code is getting WA...

if no of pieces> 1 and no of MM == no of FF then there is a loop,
otherwise no loop.

someone give a counterexample.
waiting....

i'm getting WA!!! :oops: need some critical test cases........

#include<stdio.h>
#include<math.h>
#include<ctype.h>
#include<vector>
#include<string>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<algorithm>
#include<sstream>
#include<iostream>
using namespace std;
#define VI ...

use long long

You are not printing newline in the output properly. check out it .........
Good luck

You should get RTE not WA because of this where n can be much bigger than 2000.