Back
Close

Difference of Squares

Statement

 Goal

Given an integer N, determine if there exist two integers a, b such that
a^2 - b^2 = N
Input
A single integer N.
Output
The answer: "they do" or "they don't"
Constraints
2 ≤ N ≤ 3,000
Example
Input
5
Output
they do

Game modes
FastestShortest

Test cases
3*3 - 2*2 Test
Input
5
Output
they do

5*5-4*4 Validator
Input
9
Output
they do

2 Test
Input
2
Output
they don't

Small false Validator
Input
6
Output
they don't

2*2-0*0 Test
Input
4
Output
they do

Perfect square Validator
Input
9
Output
they do

Big true Test
Input
1128
Output
they do

Big true even Validator
Input
2956
Output
they do

Big false Test
Input
1122
Output
they don't

Validator 5 Validator
Input
1722
Output
they don't

big true odd Test
Input
2003
Output
they do

Validator 6 Validator
Input
2007
Output
they do

Big true again Test
Input
2901
Output
they do

Validator 7 Validator
Input
2903
Output
they do

Solution language

Solution

Stub generator input
codingame x discord
Join the CodinGame community on Discord to chat about puzzle contributions, challenges, streams, blog articles - all that good stuff!
JOIN US ON DISCORD
Online Participants