Search found 55 matches

by alu_mathics
Fri Sep 24, 2004 9:25 pm
Forum: Volume 7 (700-799)
Topic: 796 - Critical Links
Replies: 54
Views: 22877

one more think. should it be like : if(L[v] > d ) { if(v > u) bridges++; graph [v] = 2; } or, if(L[v] > d ) { if(v > u) { bridges++; graph [v] = 2; } }
by alu_mathics
Fri Sep 24, 2004 8:52 pm
Forum: Volume 7 (700-799)
Topic: 796 - Critical Links
Replies: 54
Views: 22877

Try with this.
input

Code: Select all

2
0 (1) 1
1 (0) 0

1
0 (1) 1
Output

Code: Select all

1 critical links
1 - 0

0 critical links
by alu_mathics
Fri Sep 24, 2004 7:14 pm
Forum: Volume 100 (10000-10099)
Topic: 10092 - The Problem with the Problem Setter
Replies: 31
Views: 12747

i thing you should not do that

list[s][count[s]++] = i;
//list[count++] = s;

change it to
list[s][count[s]++] = i;
list[count++] = s;

Hope you will get ac for that.Oh one thing , set max = 1022
by alu_mathics
Tue Sep 21, 2004 4:58 am
Forum: Algorithms
Topic: How to find bridges in directeg graph ??
Replies: 7
Views: 2128

10199 - articulation point
796 - bridge
by alu_mathics
Sat Sep 18, 2004 7:14 pm
Forum: Algorithms
Topic: How to find bridges in directeg graph ??
Replies: 7
Views: 2128

http://www.geocities.com/aftabysl/point.htm

try with this
hope it helps you.
by alu_mathics
Sat Sep 18, 2004 7:02 pm
Forum: Volume 7 (700-799)
Topic: 706 - LCD Display
Replies: 221
Views: 36307

1 8 0 8 8 0 4 007 0 1234 0 0 - | | - | | - -------- | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | -------- ---- ---- ---- | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | ---- ----
by alu_mathics
Sat Sep 18, 2004 6:48 pm
Forum: Volume 100 (10000-10099)
Topic: 10070 - Leap Year or Not Leap Year and ...
Replies: 233
Views: 54893

try with this 2000 3600 4515 2001 22000 22055 22220 330000 330015 330220 456464484515645448647512343674234567564234564784234564754742345647424564 456464484515645448647512343674234567564234564784234564754742345647424565 456464484515645448647512343674234567564234564784234564754742345647424566 45646448...
by alu_mathics
Sat Sep 18, 2004 6:39 pm
Forum: Volume 100 (10000-10099)
Topic: 10000 - Longest Paths
Replies: 160
Views: 37174

Try to use bfs or floyd warshall.
I think bfs will be better.
by alu_mathics
Fri Sep 17, 2004 9:07 pm
Forum: Volume 101 (10100-10199)
Topic: 10194 - Football (aka Soccer)
Replies: 119
Views: 37906

MatH
math

should be treated as same.
Hope you got it.
by alu_mathics
Fri Sep 17, 2004 11:15 am
Forum: Volume 101 (10100-10199)
Topic: 10194 - Football (aka Soccer)
Replies: 119
Views: 37906

do u think that this is sufficient?

return (strcmp ((char *)a, (char *)b));

Notice that should the tie-breaker be the lexographic order, it must be done case insenstive.

hope this will help you.
by alu_mathics
Wed Jun 09, 2004 10:47 am
Forum: Volume 104 (10400-10499)
Topic: 10419 - Sum-up the Primes
Replies: 51
Views: 17203

Thanks any way.I got this problem A.C. one month ago using dp.But the problem is that my backtrack solution gives W.A.
by alu_mathics
Tue Jun 08, 2004 8:24 pm
Forum: Volume 101 (10100-10199)
Topic: 10139 - Factovisors
Replies: 80
Views: 27447

For my w.a. solution i have to change the long data into long long. Formula: The number of occurence of a prime factor in n! is summation (floor(n/pow(f,i))) where i=1,2,3.... and pow(f,i)<=n; while calculating the value of pow(f,i) my previous code gives data overflow.Do you consider that case?Hope...
by alu_mathics
Mon Jun 07, 2004 10:11 am
Forum: Volume 101 (10100-10199)
Topic: 10139 - Factovisors
Replies: 80
Views: 27447

After rejudge i get w.a. I change all the long data into long long and finally got A.C.
by alu_mathics
Sat May 22, 2004 10:14 am
Forum: Volume 100 (10000-10099)
Topic: 10044 - Erdos Numbers
Replies: 102
Views: 40260

I have a faster one that always gives WA and I don't understand why.
You can send me that part.i will try to figure out.
by alu_mathics
Fri May 21, 2004 12:05 am
Forum: Volume 100 (10000-10099)
Topic: 10044 - Erdos Numbers
Replies: 102
Views: 40260

Thanks to PER

Thanks PER.
My first solution gave me W.A.
After a long period of time (may be 6 months :o ) i just read your message (the input section) and finally got A.C. :D without using STL.
To CDiMa i consider whitespace as ' ' , '\t' && '\r'.
hope this will help you.

Go to advanced search