large dimension test

large dimension test

The attached file tests dimensions >= 2^31 and also tests combinatoric factors.

AttachmentSize
Downloadapplication/zip 270270_10000.zip625.06 KB
6 posts / 0 new
Last post
For more complete information about compiler optimizations, see our Optimization Notice.

oh! 200M output file

Height is 2702700000. Greater than 2 ^ 31.

Quoting

Height is 2702700000. Greater than 2 ^ 31.

Can Height or Width be greater 2^31? My solver cann't solve it(

Quoting oshapovalov

Quoting

Height is 2702700000. Greater than 2 ^ 31.

Can Height or Width be greater 2^31? My solver cann't solve it(

Read this discussion

http://software.intel.com/en-us/forums/showthread.php?t=82594&o=a&s=lr

I thought there was some confusion on that issue, regarding the largest square and the largest problem dimension vs sign/unsigned int, so I wrote this test to make sure my solver could handle it regardless. The problem is 270270 squares of size 10000 each, so the tallest possible solution is indeed 2702700000 and the area of the rectangle is > 2^32.

Yes, I just re-read the thread to see if there was a clear answer. it seems the "problem size" won't exceed 2^32, what ever "problem size" means...sqaure size, tiled rectangle size, tiled rectangle area, number of squares in a tiling set...who knows.
Previous challenges set out these bounds clearly...I'm frustrated about the haziness of the problem bounds, and the lack of awareness that some languages simply do not offer unsigned types. In 2009, 2010, the problem descriptions were be sympathetic to this, and bounds were set at either 2^31-1 or 2^63-1 for 32-bit or 64-bit problems respectively.

Leave a Comment

Please sign in to add a comment. Not a member? Join today