Search found 84 matches

by vahid sanei
Sun Mar 29, 2009 8:56 am
Forum: Volume 100 (10000-10099)
Topic: 10000 - Longest Paths
Replies: 160
Views: 35997

Re: 10000 - Longest Path

Code: Select all

REMOVED 
Just I change table[101][101] to table[103][103] and got Acc 
by vahid sanei
Fri Mar 20, 2009 7:48 pm
Forum: Volume 113 (11300-11399)
Topic: 11336 - DRM
Replies: 6
Views: 4052

Re: 11336 - D: DRM

Accepted
by vahid sanei
Thu Mar 19, 2009 5:47 pm
Forum: Volume 115 (11500-11599)
Topic: 11573 - Ocean Currents
Replies: 12
Views: 3658

Re: 11573 - Ocean Currents

i cant undrestand this problem
for this case

Code: Select all

Accepted
by vahid sanei
Thu Mar 19, 2009 3:52 pm
Forum: Volume 113 (11300-11399)
Topic: 11336 - DRM
Replies: 6
Views: 4052

Re: 11336 - D: DRM

WHY i get Wrong answer :( , please give me some critical I/O
here is my code :

Code: Select all

Accepted
thanks in advance
by vahid sanei
Mon Mar 16, 2009 8:39 am
Forum: Volume 102 (10200-10299)
Topic: 10200 - Prime Time
Replies: 202
Views: 60983

Re: 10200 - Prime Time

i dont know Why i cant clean those posts , my connection have some problem , and web site resent twice my post
just i have edit , report and quota options :(
by vahid sanei
Mon Mar 16, 2009 7:16 am
Forum: Volume 102 (10200-10299)
Topic: 10200 - Prime Time
Replies: 202
Views: 60983

Re: 10200 - Prime Time

----
by vahid sanei
Mon Mar 16, 2009 7:16 am
Forum: Volume 102 (10200-10299)
Topic: 10200 - Prime Time
Replies: 202
Views: 60983

Re: 10200 - Prime Time

----
by vahid sanei
Mon Mar 16, 2009 7:16 am
Forum: Volume 102 (10200-10299)
Topic: 10200 - Prime Time
Replies: 202
Views: 60983

Re: 10200 - Prime Time

you should use

Code: Select all

double per 
instead of

Code: Select all

float per
and change this

Code: Select all

int end=sqrt(double(x))+1;
to

Code: Select all

int end=sqrt(double(x));
use eps for your ans

Code: Select all

#define eps 1e-9
cout << setprecision (2) << per + eps << endl;
by vahid sanei
Tue Mar 10, 2009 9:11 pm
Forum: Volume 115 (11500-11599)
Topic: 11585 - Nurikabe
Replies: 20
Views: 7151

Re: 11585 - Nurikabe

after check all of numbers ,nurikabe shouldn`t have dot, and for each number that should have exactly n dots
( where n is number)
by vahid sanei
Tue Mar 10, 2009 4:54 pm
Forum: Volume 115 (11500-11599)
Topic: 11585 - Nurikabe
Replies: 20
Views: 7151

Re: 11585 - Nurikabe

Code: Select all

not solved
by vahid sanei
Mon Mar 09, 2009 8:12 pm
Forum: Volume 114 (11400-11499)
Topic: 11405 - Can U Win?
Replies: 15
Views: 6581

Re: 11405 - Can U Win?

i said p , not P

--
my code doesnt pass this test case

Code: Select all

1
6
...P..P.
.K...k..
...pP..P
....pPp.
...P....
........
........
.p......
this is Yes i think
by vahid sanei
Mon Mar 09, 2009 6:21 pm
Forum: Bugs and suggestions
Topic: statistics problem Bug
Replies: 1
Views: 3000

statistics problem Bug

I can`t see statistics of problem
The link gives me Warning
Warning: Invalid argument supplied for foreach() in /var/www/localhost/htdocs/24hours/components/com_onlinejudge/onlinejudge.html.php on line 357
by vahid sanei
Mon Mar 09, 2009 6:11 pm
Forum: Volume 114 (11400-11499)
Topic: 11405 - Can U Win?
Replies: 15
Views: 6581

Re: 11405 - Can U Win?

It`s not very important if number of p(coins of his sister) be 8 or more

--
however i can`t solve this problem still ,
dfs is good method for this problem ?
by vahid sanei
Sat Mar 07, 2009 7:00 am
Forum: Volume 115 (11500-11599)
Topic: 11518 - Dominos 2
Replies: 24
Views: 8587

Re: 11518 - Dominos 2

Thanks Jan :D
by vahid sanei
Sat Mar 07, 2009 6:35 am
Forum: Volume 115 (11500-11599)
Topic: 11518 - Dominos 2
Replies: 24
Views: 8587

Re: 11518 - Dominos 2

Just think that, you can run the bfs or dfs only once. As I see that you are calling the bfs l times.
how ? :-?
if sources be different
like this:

Code: Select all

1
7 4 2
1 2
2 3
4 5
5 6
2
4
ans is 2+3=5

Go to advanced search