OJ Board

Thank you, I've got accepted!

I have no more ideas what is wrong...
Alghoritm is simple union-find...
Can you help me?
:D
[cpp]
#include <stdio.h>
#include <assert.h>

int nr[2000];
unsigned long n;

void unionID(int what,int newID)
{
for (unsigned long i=0;i<n;i++)
{
if (nr ==what) nr = newID;
}
}

bool question(unsigned ...

Try this:

inp:
1
4
1 9 990 10

out:
970

Finaly I've got A.C, I handled multiple input incorectly...

Input:

1 1
4 4
1000 1
1233 43
234 23
434 944

Output:

1 1: 1

4 4: 1 2 3

1000 1: 433

1233 43: 277 281 283 293 307 311 313 317 331 337 347 349 353 359 367 373 379 383 389 397 401 409 419 421 431 433 439 443
449 457 461 463 467 479 487 491 499 503 509 521 523 541 547 557 563 569 571 577 587 ...

There is a strange multiple input in this problem, try to add

[cpp]scanf("%d\n",&nf);[/cpp]
at the begining and
use loop
[cpp]while (scanf("%d\n",&nGames)!=EOF)[/cpp]
after that...

Why I have presentation error, I think I handle multiple input correctly...


[cpp]
#include <stdio.h>
#include <string.h>

int tel[100000];

int ile[200000];
int ileI[200000];

int odp[50001];
int odp2[50001];

void QSort(int left, int right)
{
:wink:
}

bool getC(char z,int &c)
{
if ((z>='0 ...