3530 - Product Of 3 Factors 3530 - Product Of 3 Factors 3530 - Product Of 3 Factors

Statistics Sub: 127 | AC: 65 | AC%: 51,18 | Score: 2,30
Created by Codefights.com
Added by frankr (2016-02-22)
Limits
Total Time: 10000 MS | Test Time: 1000 MS |Memory: 32 MB | Output: 64 MB | Size: 9 KB
Enabled languages
Available in

Description

Given an integer number N you must calculate in how many ways we can express N as a product of 3 factors. For example if N = 4 we have 6 ways:
  • 4 = 4 * 1 * 1;
  • 4 = 1 * 4 * 1;
  • 4 = 1 * 1 * 4;
  • 4 = 2 * 2 * 1;
  • 4 = 2 * 1 * 2;
  • 4 = 1 * 2 * 2.
Given an integer number N you must calculate in how many ways we can express N as a product of 3 factors. For example if N = 4 we have 6 ways:
  • 4 = 4 * 1 * 1;
  • 4 = 1 * 4 * 1;
  • 4 = 1 * 1 * 4;
  • 4 = 2 * 2 * 1;
  • 4 = 2 * 1 * 2;
  • 4 = 1 * 2 * 2.
Given an integer number N you must calculate in how many ways we can express N as a product of 3 factors. For example if N = 4 we have 6 ways:
  • 4 = 4 * 1 * 1;
  • 4 = 1 * 4 * 1;
  • 4 = 1 * 1 * 4;
  • 4 = 2 * 2 * 1;
  • 4 = 2 * 1 * 2;
  • 4 = 1 * 2 * 2.

Input specification

In the first line the integer N (1 <= N <= 10^9).
In the first line the integer N (1 <= N <= 10^9).
In the first line the integer N (1 <= N <= 10^9).

Output specification

Output the requested number of ways.
Output the requested number of ways.
In the first line the integer N (1 <= N <= 10^9).

Sample input

10

Sample output

9

Hint(s)

http://coj.uci.cu/24h/
http://coj.uci.cu/24h/
http://coj.uci.cu/24h/

Recommendation

We have carefully selected several similar problems: 1000 | 3378 | 3377 | 1049 | 1494 | 1028