AE00 - Rectangles
hide comments
Jonas Collberg:
2015-02-17 12:29:44
Better solution than O(N ^ 0.5) possible? |
|
manish kumar:
2015-02-06 10:03:58
AC at last....:)
|
|
Sajan mishra:
2015-01-19 06:26:13
Problem description is flawed, it asks for unique rectangles, but the answer is different. |
|
Parth:
2015-01-09 09:16:36
easy one....AC in one go!!!...:) |
|
Mamdouh Ahmed:
2015-01-08 12:38:36
AC on first submission,
|
|
Siddharth:
2014-12-27 12:35:43
I am getting right answer in my compiler but here I am not.I have tried exta test cases suggested by rituraj.So what should I do as I am a newbie?
|
|
Abhishek Deora:
2014-10-13 21:32:59
on ideone time for n=10000 is 0.4 sec. while here its showing tle... why is it so ? |
|
saumya:
2014-10-13 17:11:04
AC in first Go!! Thank you for the cases @rituraj... Really helped
|
|
Rohit Gurnani:
2014-10-03 21:37:06
AC in first attempt....:) |
|
Pagarwal:
2014-09-04 01:36:07
done...:) |
Added by: | Race with time |
Date: | 2009-05-03 |
Time limit: | 1s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: ERL JS-RHINO NODEJS PERL6 VB.NET |
Resource: | Algorithmic Engagements 2009 |