CCC '97 S2 - Nasty Numbers - DMOJ: Modern Online Judge

CCC '97 S2 - Nasty Numbers

View as PDF

Submit solution

All submissions

Best submissions

Points: 5

Time limit: 2.0s

Memory limit: 256M

Problem type

We will call a positive integer nasty if it has at least two pairs of positive integer factors such that the difference of one pair equals the sum of the other pair.

For example, $6$ ~6~ is nasty since $6 \times 1 = 6, 2 \times 3 = 6, 6 - 1 = 2 + 3$ ; and $24$ ~24~ is also nasty since $12 - 2 = 6 + 4$ ~12 - 2 = 6 + 4~.

Write a program which accepts as input a list of positive integers and determines if each one is nasty or not.

Input Specification

The input is a list of positive integers, one per line. The first number in the list is the number of integers to be tested, and is at most $20$ ~20~. The integers to be tested are all less than $32\,001$ ~32\,001~.

Output Specification

The output should contain one line for each test value. Each line is to contain the test value and whether or not it is nasty.

Sample Input

Sample Output

6 is nasty
24 is nasty
30420 is nasty
10078 is not nasty

Comments

24

d commented on Nov. 4, 2020, 1:06 a.m.

This problem only allows the pair $(a,b)$ ~(a,b)~ if $a > 0$ ~a > 0~, $b > 0$ ~b > 0~, and $ab = n$ ~ab = n~.

Make sure you do not interpret the conditions as $a > 0$ ~a > 0~, $b > 0$ ~b > 0~, $a$ ~a~ is a factor, and $b$ ~b~ is a factor.