Cody

Problem 2057. persistant sum

Created by Ted in Community

There will be 9 tests for this problem.

In each test you will be provided with 2 integers n=[n1,n2], where n2 is equal to the test number.

Your code should return n1*(remainder(n2/n3)+2) +remainder(n2/n3+1)

Solution Stats

78.13% Correct | 21.88% Incorrect
Last solution submitted on May 14, 2019