OJ Board

The problem specification state that the value of y must within the range [1, 1000], however, I discover that the test cases in the judge may have y = 0.

Thank you

Would someone give me some test case?
I think my algo is correct, I solve it as Min Cost Max Flow problem.
Here is the idea:
- The time is the cost of flowing on that edge.
- Capicity of the edge is set to K.
- While there exist an shortest augmenting path
(Use Dijkstra to find the shorest ...

I find the points of the tangent on the circle, the two equation for finding the points is:
(x - t.x) ^ 2 + (y - t.y) ^ 2 = r ^ 2
p.x ^ 2 + p.y ^ 2 = t.x ^2 + t.y ^ 2 - r ^ 2

t.x & t.y is centre of the tree,
p.x & p.y is the point of the tangent on the circle.

However, I still got WA, I don't know ...

I am getting RE,
Would someone told me what's wrong with my code?
Actually, I am using LCS only.

#include <cstdio>
#include <string>
#include <algorithm>

using namespace std;

int a[255], b[255];
int c[255][255];

int main() {
int T, idx = 0;
scanf("%d", &T);
while (T--) {
int n, p, q;
scanf ...

As title. I just solve 10806, which is a problem of finding a shortest cycle in a bi-directional graph. I would like to ask if Dijkstra + Bellman-Ford can also find the shortest cycle in directed graph.

Thank you!

Please help me...I cannot find and error in my code.

Please help me check the program, I don't know why OJ give RTE to me... I try it on both Linux and Windows, but no error occur...
Please help me... :cry:
Here is my code
#include <stdio.h>
#include <string.h>

int n;
int idx;
int row[10], col[10];
int map[100][100];
int que[100][100];

int init ...

What's wrong with it? Help me please, thank you! :D

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

using namespace std;

int dat[10];
int sto[5][2];
int s, c, cot;
double AM, IM;
double CM[5];

int init()
{ for (int i = 0; i < 10; i++)
{ dat[i ...