| Submit | All submissions | Best solutions | Back to list |
HELLO - Hello World! |
The problem is to print out "Hello World!"
Output
Hello World!
| Added by: | Mussab ElDash |
| Date: | 2012-03-24 |
| Time limit: | 1s |
| Source limit: | 50000B |
| Memory limit: | 1536MB |
| Cluster: | Cube (Intel G860) |
| Languages: | All except: ASM64 |
hide comments
|
|||||
|
2021-01-22 13:13:46
Wow! very hard problem,need DP algorithm and binary search to do it. |
|||||
|
2020-06-04 17:57:43
Java is awesome! |
|||||
|
2017-04-13 06:06:19
DP+BIT+IT+DFS+DJiskstra+Quick sort+Convex Hull+Pre Flowpush--> AC |
|||||
|
2015-10-28 09:09:17 Nallagatla Manikanta
awesome :) |
|||||
|
2015-08-27 07:26:57 ANIKET
getting runtime error(NZEC) in JS2 and python..... :( |
|||||
|
2015-08-24 20:42:17 shantanu tripathi
@asutosh.... u re missing djsiktra and rojers algorithm....otherwise in ADa one line of code |
|||||
|
2015-08-24 20:40:19 ASHUTOSH DWIVEDI
i thnk segment tree + radix sort with rabin carp will do with few optimiazations...... :) |
|||||
|
2015-05-01 10:46:28 Rajat (1307086)
I am using DP+Segment tree+binary search to solve it and getting WA. Probably the toughest on SPOJ. |
|||||
|
2013-12-24 09:21:23 maisara
guys this problem and some others are made by me and mussab to let our students practice java . we know they are silly but they are just for learning |
|||||
|
2013-07-23 04:56:05 Mostafa 36a2
Wow ! :D |
|||||
RSS