OJ Board

Thanks a lot. I had yellow and blue confused. I got AC

well, no one seems to want to reply to my message so i'll get to a more practical issue at hand:

how am i supposed to handle the case where c1 == c2 ? what am i to output.

I'm also curious as to why this program may have different answers, i.e. why is the checkmark blue? i did a little sketching ...

Ok.
The problem clearly states this:


A city will never be paired with itself in a query.


So I wrote a little program to see if the judge abides by this rule:

[cpp]
#include <iostream>
#include <string>

using namespace std;

bool connect[50][50];

int main()
{
int M,N;
cin >> M >> N ...

hmmm... couldn't your teacher possibly stumble upon this board?

anyhow, if it's an assignment, I doubt anyone will help you.
If you have to do any three problems, browse through them and try to find the easiest ones. I mean, you have a month to do this. :roll:

Hell, you might even find some ...

(1+N)^x=a
N^x=b

where a and b are the input and N has the meaning as described in the problem statement.


Thanks for the reply,
I've already derived those equations and my program uses the property.
I've also handled every special case i could think of (i.e. N=1, etc.)

I was wondering if ...

someone please help, this program is driving me absolutely nuts. I've spent so many hours on it....

thank you for your reply, i found my problem already

btw, can you take a look at my post for 107 now ? lol

Hi
I'm a beginner and it would be greatly appreciated if someone could tell me what the mistake in the following program is:

[cpp]

#include <iostream>
#include <cmath>

using namespace std;

typedef unsigned long long u64;
typedef long double ld;

ld round(ld number)
{
return (fmod(number, 1 ...

found my problem.

Hi, i believe that my algorithm works.
however, I was wondering if someone could tell me how many pythagorean triples there are between 1 and 25 (inclusive).

ie. my program says the following:

3 4 5
8 6 10
8 15 17
5 12 13
12 16 20
7 24 25

which seems reasonable. but, there are only 15 distinct ...