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
Problem Recent Solvers40
Suggested Problems
-
713 Solvers
-
Project Euler: Problem 1, Multiples of 3 and 5
1172 Solvers
-
Flag largest magnitude swings as they occur
544 Solvers
-
Magic is simple (for beginners)
1527 Solvers
-
396 Solvers
More from this Author11
Select a Web Site
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
Select web siteYou can also select a web site from the following list:
Americas
- América Latina (Español)
- Canada (English)
- United States (English)
Europe
- Belgium (English)
- Denmark (English)
- Deutschland (Deutsch)
- España (Español)
- Finland (English)
- France (Français)
- Ireland (English)
- Italia (Italiano)
- Luxembourg (English)
- Netherlands (English)
- Norway (English)
- Österreich (Deutsch)
- Portugal (English)
- Sweden (English)
- Switzerland
- United Kingdom (English)
Problem Tags