Search found 147 matches

by Shafaet_du
Sat Sep 25, 2010 12:42 pm
Forum: Volume 112 (11200-11299)
Topic: 11239 - Open Source
Replies: 21
Views: 7960

Re: 11239 - Open Source

STL map should solve the problem. ROBOTS me and noone LINUX isthebest isthebest noone ELECTRONIX PROJECT hateit burned hateit hateit noone C PROJECT iscool iamhere hellworld linux gui iscool me THIS IS THE LAST helloworld thisisme hopeyougetaccepted 1 0 output: C PROJECT 5 THIS IS THE LAST 3 ELECTRO...
by Shafaet_du
Thu Sep 16, 2010 8:21 pm
Forum: Volume 8 (800-899)
Topic: 869 - Airline Comparison
Replies: 7
Views: 5026

Re: 869 - Airline Comparison

Code: Select all

5

0
0

0
2
a b
b c

4
a b
b c
d e
e f
4
a e
b c
d e
e f

4
a b
b c
D e
e F
5
e D
a b
b c
E F
a c

6
a b
a c
b e
c d
g h
h i
6
a b
b e
a c
c d
d i
g h
output from my ac code:

Code: Select all

YES

NO

NO

YES

NO
I used floyd warshall to solve this. it took .004 sec.
by Shafaet_du
Sat Sep 11, 2010 10:13 pm
Forum: Volume 102 (10200-10299)
Topic: 10226 - Hardwood Species
Replies: 121
Views: 38416

Re: 10226 - Hardwood Species

1 orange orange mango biriyani icecream orange orange biriyani pine apple what the hell is this tree what the hell is this tree oak tree longest tree ever a tiny tree pine apple longest tree ever this problem is not tough you should know stl this problem is not tough a tiny tree a tiny tree you sho...
by Shafaet_du
Sat Sep 11, 2010 9:09 pm
Forum: Volume 109 (10900-10999)
Topic: 10928 - My Dear Neighbours
Replies: 13
Views: 8135

Re: 10928 - My Dear Neighbours

Too easy a problem. Dont need to make the thinks complex,just count inputs in every line,index them and find out the lowes value. then print the ouputs. Only one space will separate the outputs,which makes the problem even more easier. if you still get wa,check this IO: 2 8 2 4 3 1 2 3 2 1 3 4 1 2 3...
by Shafaet_du
Fri Sep 10, 2010 8:32 pm
Forum: Volume 113 (11300-11399)
Topic: 11352 - Crazy King
Replies: 32
Views: 12113

Re: 11352 - Crazy King

If you can pass these,you should get AC: 6 5 5 Z.... ....B ..... ..... A...Z 8 8 Z....... ....B... ........ ........ ....Z... .Z...... ........ A......Z 8 9 Z.......Z ....B.... ....Z.... ...Z..... ....Z.... .Z....Z.. ......... .....A.Z. 8 9 Z.......Z ..Z.B..Z. ....Z.... ...Z..... ....Z.... .Z....Z.....
by Shafaet_du
Fri Sep 10, 2010 12:16 pm
Forum: Volume 105 (10500-10599)
Topic: 10596 - Morning Walk
Replies: 41
Views: 14871

Re: 10596 - Morning Walk

Rubbish judge data,rubbish description. I am telling you an easy way to get ac: just check if all the vertexes have non-zero even degree,thats all. My output differs with risingsuns: 3 2 0 1 1 0 2 2 1 0 1 0 4 4 0 1 1 0 2 3 3 2 5 6 0 1 1 0 2 3 2 3 0 2 2 0 4 6 1 2 2 1 2 3 2 3 3 1 1 3 2 0 Not Possible ...
by Shafaet_du
Thu Sep 09, 2010 3:28 pm
Forum: Volume 112 (11200-11299)
Topic: 11283 - Playing Boggle
Replies: 19
Views: 8240

Re: 11283 - Playing Boggle

I have solved it after lots of effort. Here are some I/O from my ac code:

Code: Select all

2
SEVO
GOOO
BITL
OBXN

5
LOOOO
GOO
LOOV
BITLOOT
OIOO

AABB
CCDD
QQEE
DDFF
5
FEDBDBCACA
FEDBDECCAQDQD
FEDDEFF
DQCAABBDEF
CDQE
output

Code: Select all

Score for Boggle game #1: 5
Score for Boggle game #2: 23
by Shafaet_du
Tue Sep 07, 2010 5:40 pm
Forum: Volume 8 (800-899)
Topic: 897 - Anagrammatic Primes
Replies: 21
Views: 12479

Re: 897 - Anagrammatic Primes

This is a tough problem at first glance but as you sort out how to generate the primes this becomes very easy. There are only 22 anna prime but please dont copy them from here,try to generate them by your own.
by Shafaet_du
Sat Sep 04, 2010 9:08 pm
Forum: Volume 4 (400-499)
Topic: 465 - Overflow
Replies: 104
Views: 24281

Re: 465 - Overflow

take the input as string.
don't use big int(unless you use java),parse the numbers using sscanf and use LONG DOUBLE. then do what they say. be careful about input like A*0 A+-1 etc. thats all.
by Shafaet_du
Sat Sep 04, 2010 10:32 am
Forum: Volume 105 (10500-10599)
Topic: 10539 - Almost Prime Numbers
Replies: 44
Views: 24535

Re: 10539 - Almost Prime Numbers

You can solve it without binary search. so don't mess up your code with it. generate all the ALMOST PRIMES,store it in an array or vector,and iterate through it.
by Shafaet_du
Fri Sep 03, 2010 4:54 pm
Forum: Volume 5 (500-599)
Topic: 547 - DDF
Replies: 9
Views: 4578

Re: 547 - DDF

Try to pass this samples:

15 15
Input1: 15 15
Output1: 15
1 1
Input2: 1 1
Output2: 1
0 1
Input3: 0 1
Output3: 0
1 3000
Input4: 1 3000
Output4: 924 168 102 36 46 18 30 27 22 9 13 5 6 12 19 11 3 4 7 8 15
1 1
Input5: 1 1
Output5: 1
0 0
Input6: 0 0
Output6: 0
by Shafaet_du
Mon Jun 07, 2010 11:48 am
Forum: Bugs and suggestions
Topic: Remember me!!!
Replies: 0
Views: 1308

Remember me!!!

If i check "remember me" when logging in, i cant log out before maki 7-8 attempts. sometimes i needed to delete cookies to logout.

Go to advanced search