OJ Board

hello
maximum time i solve this type of problem by this way


#include <stdio.h>
#include <algorithm>
#include <string>
#include <vector>

using namespace std;

struct Node {
vector <string> S;
};

vector <Node> V;

bool cmp(Node A, Node B) {
int i;
for (i = 0; i < A.S.size() && i < B.S.size ...

Thankx EmotionalBlind
i have got it..

MAP

I have solved this problem by this way

but a single if condition has confused me...

...................................

This problem takes only 1.76 seconds

but when i have changed a if conditions format then it takes 6.52 seconds
why can any body explain me ...

Hi Vahag

I have changed ur code only this part and u got AC :D

for(i=0;i<n;i++)
for(j=0;j<m;j++)
{
double l = len(gpos[i],hpos[j]);
if( l < s || (l - s) < 1e-7)
{
G[i+1][n+j+1] = 1;
}
}


for(i=1;i<=n;i++)
G[0][i] = 1;
for(j=n+1;j<=n+m;j++)
G[j][n+m+1] = 1;


Thankx ...

Try this Input
Input Output Thanks
MAP

Hi

I Have also solved this problem with Back Tracking approch. But if the Problem range is higher then my Back Tracking approch will not work.
Then maximum flow have to be considered.

Thanks
Mohiul Alam Prince

Hi rube

have you tried this input ?

Input
3 1 2 4
5 1 2 4 8 45

Thanks
MAP

Hi athlon19831

Have you checked your sample input and output. your this part is totally wrong. (when you multiply the value at that time it exceed the integer range) Try to solve this problem in another approch.

Thanks
MAP.

thank for your reply
Here is my code


#include <iostream>
#include <string>
#include <ctype.h>
#include <algorithm>
#include <string.h>
#include <stdio.h>

using namespace std;

int mark = 0;

string addition(string a, string b) {
int i;
string s;

reverse(a.begin(), a.end());
reverse(b.begin ...

Hi

I think the input limit is not more than (2^31 - 1).
i have derive a short cut form of this problem.

this is my function.

function(int N) {
int res;
res = ceil(((-1 + sqrt(1 + 4.0 * 2.0 * N))/(double)2.0));
int ans = ((((res * res) + res) /(double) 2.0));
printf("%d/%d\n", (ans - N) + 1 ...

Hi

i try to solve all kinda of problems (if it is possible for me).
but recursion is my favourite part of problem solving.
but consider ad hoc problems to be boring.

Regards,
MAP

Sohel
Thanks for your reply.

My solution has other problems i have fixed this problem and got
AC.

MAP.

Hi

I am getting wa in this problem but don't know why. I have trying to solve
this problem by this equation


(x1y2 + x2y3 + x3y4 + ............. + xny1) - (y1x2 + y2x3 + y3x4 +.......... ynx1)


can any body help me.

Here is my code

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

Hi salman

Try this input

Input

1

8
...**..*
......*.
....*...
........
........
.....*..
...**.*.
.....*..
xxxxxxxx
xxxx....
xxxx....
xxxxx...
xxxxx...
xxxxx...
xxx.....
xxxxx...

Output

001**22*
0013..*.
0001*...
00011...
00001...
00123*..
001**.*.
00123*..


for this input your output is ...

HI Salman
use insertion sort. Hope this will help you.

Thanks
MAP