OJ Board

I cant understand why i got RE?
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<vector>
#include<queue>
#include<stack>
using namespace std;

#define MAXV 300
#define WHITE 0
#define GRAY 1
#define BLACK 2
#define NIL -1
#define INF -99

int color[MAXV+1];
int discover[MAXV+1];
int ...

Thank you again.
You help me a lot.got AC.

Thank you.I got accepted.

it seems all right.but got WA.
Can anyone help?

oh sorry for delay.
i use turbo C and visual C++ compiler.
2 or 3 days ago i knew how to compile in gcc compiler.

I tried all post and get correct answers but judge gave me WA.
I tried a lot.......
Can anyone help?

I checked all i/o that i got from previous topic.
But i m getting WA.Can anyone help?

i think my math is correct.but it got WA.please help me.
need i/o . so that i can fix my problem.
it does not output -0.000.but for what input it does not work?

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

#define M 1e-8

void main()
{
double x1,x2,y1,y2,r1,r2,p,m,n,a,b,c,h1,h2,k1,k2,t ...

thank you. but can you give me some extra input output,like
-5 3
1 3
3 1
-25 6
0 2
2 0

more like this. in question says: To ensure uniqueness, make bn > 1.
can you explain with example?

can anyone give me huge input/output for this problem.

yeh.i found my bug , i have to use long long in bigmod() function.

Is there anyone to help me.
code deleted.
although it outputs correctly judge says wrong answer.please help.

thank you very much for your attention.
Is there anybody to give me more suggestion or code?

The code is accepted but how can i make it faster.Please help me.

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

#define MAX 5000
#define P 46401

long factor[MAX];
long prime[P];
long p[MAX];

void main()
{
long n,count,i;
long j;

/*freopen("in.txt","r",stdin);*/
prime[0]=prime[1]=1;

for(i=2; i ...