OJ Board

thanks but...
i think that the row 10 isn't accesible from the row 1, why am i wrong?
the same with 2 and 11
and the result of your sequence is 15,
maybe i don't understand correctly the exercise, plz help me.

Can anybody post the output for this input please? thanks for advance

12 14
1 2 2 1 1 1 1 1 1 1 1 1 1 2
1 1 2 2 1 1 1 1 1 1 1 1 1 1
1 1 1 2 2 1 1 1 1 1 1 1 1 1
1 1 1 1 2 2 1 1 1 1 1 1 1 1
1 1 1 1 1 2 2 1 1 1 1 1 1 1
1 1 1 1 1 1 2 2 1 1 1 1 1 1
1 1 1 1 1 1 1 2 2 1 1 1 1 1
1 1 1 1 1 1 1 1 2 2 1 1 1 1 ...

Hi, can anybody posts inputs an outputs please? tanks for advance

Bloks of NxNxN ....

your input is a bad input

(sorry my english is poor, i know my answer is poor too )

but i think u r right in general

i'm trying to solve this problem using the Floyd-Warshall algorithm, but jufge replies me TLE anyway, can anybody helpp me plz? thx a lot
this is my code:
[cpp]


/* @JUDGE_ID: xxxxxxx 104 C++ */
/* @BEGIN_OF_SOURCE_CODE */

//#import <iostream>
#include <iostream>
#include <utility>
#include ...

hi, i have problems with my code, judge always replies me WA, can anybody helps me plz??

(sorry about my english)

first i try to solve the diophantic equation, if there are any solutions, the solution of the problem is the size of the subset of values of x and y when x and y are non_negatives ...

hi, can anybody tell me what is the output for this input plz?:

2
0 0 0 2
0 0 2 0
0 0
0

thx :-)

and... well. this is my code, can u check it too plz? :-P thx again

PD: sorry about my english

[cpp]

#include <iostream>
#include <vector>
#include <utility>
#include <math.h>
#include <algorithm ...

4
0 0
0 1
1 1
1 0

hi everybody, i'm trying to solve the problem 218 but judge always replies me WA, this is my code and my tests:

[cpp]
/* @JUDGE_ID: xxxxxxx 218 C++ */
/* @BEGIN_OF_SOURCE_CODE */

#include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
#include <math.h>
#include <stdio.h ...

well,
first i must sort the points, thx, but i'm WA again, can anybody test again my code? :-(
[cpp]

#include <iostream>
#include <vector>
#include <utility>
#include <math.h>
#include <map>
#include <stdio.h>
#include <algorithm>
using namespace std;

long double dist2(pair<int,int> x, pair<int ...

first of all sorry about my english .. :-P

well, i try to solve this problem using the next permutation funcion too, but judge always rpelies me WA and i can't see my mistake, can anybody help me plz? thx a lot

[cpp]

#include <iostream>
#include <vector>
#include <utility>
#include <math.h ...

thx a lot, i don't think about whitespaces in the string

never mind

sorry, my english is poor and i don't understand any question...
for 12 5
why the output is 3 and 6
3 and 2 is not correct?
1*(3^1) + 2*(3^0) = 5
5*(2^0) = 5 too
can anyboy explain me plz? thx

i'm sure that my solution is correct but obiously i'm wrong, hehe
[cpp]

/* @BEGIN_OF_SOURCE_CODE */

#include <iostream>
#include <vector>
#include <map>
#include <utility>
using namespace std;

map<pair<int,int>, bool> memDyn;
map<pair<int,int>, bool>::iterator it;
vector<vector<char> > board(200 ...