Preparando MOJI

Triangular numbers

2000ms 262144K

Description:

A triangular number is the number of dots in an equilateral triangle uniformly filled with dots. For example, three dots can be arranged in a triangle; thus three is a triangular number. The n-th triangular number is the number of dots in a triangle with n dots on a side. . You can learn more about these numbers from Wikipedia (http://en.wikipedia.org/wiki/Triangular_number).

Your task is to find out if a given integer is a triangular number.

Input:

The first line contains the single number n (1 ≤ n ≤ 500) — the given integer.

Output:

If the given integer is a triangular number output YES, otherwise output NO.

Sample Input:

1

Sample Output:

YES

Sample Input:

2

Sample Output:

NO

Sample Input:

3

Sample Output:

YES

Informação

Codeforces

Provedor Codeforces

Código CF47A

Tags

brute forcemath

Submetido 0

BOUA! 0

Taxa de BOUA's 0%

Datas 09/05/2023 08:28:44

Relacionados

Nada ainda