Cody

Problem 1732. GJam: 2013 Rd1a Bullseye Painting - Large Numbers

Solution 1543799

Submitted on 30 May 2018 by J. S. Kowontan
  • Size: 28
  • This is the leading solution.
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Solve This Problem View on Solution Map

Test Suite

Test Status Code Input and Output
1   Pass
tic r=uint64(308436464205151562); pmax=uint64(1850618785230909388); rings=solve_rings(r,pmax); assert(isequal(rings,3),sprintf('rings=%i, Expected 3',rings))
2   Pass
r=uint64(760961177192651897); pmax=uint64(1521922354385303795); rings=solve_rings(r,pmax); assert(isequal(rings,1),sprintf('rings=%i, Expected 1',rings))
3   Pass
r=uint64(1); pmax=uint64(2000000000000000000); rings=solve_rings(r,pmax); assert(isequal(rings,999999999),sprintf('rings=%i, Expected 999999999',rings))
4   Pass
r=uint64(1000); pmax=uint64(2000000000000000000); rings=solve_rings(r,pmax); assert(isequal(rings,999999500),sprintf('rings=%i, Expected 999999500',rings))
5   Pass
r=uint64(3); pmax=uint64(1243678947483597075); rings=solve_rings(r,pmax); assert(isequal(rings,788567988),sprintf('rings=%i, Expected 788567988',rings))
6   Pass
r=uint64(432); pmax=uint64(1800692162794074077); rings=solve_rings(r,pmax); assert(isequal(rings,948865465),sprintf('rings=%i, Expected 948865465',rings)) toc

Elapsed time is 0.245184 seconds.

Suggested Problems

More from this Author246

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!