Welcome To SDIBT ACM-ICPC Online Judge

VIRTUAL JUDGE Recent Contest F.A.Qs Forum Home ProblemSet Status Ranklist Contest LoginRegister Exam
Problem 1143. -- 12!配对

12!配对

Time Limit: 1 Sec  Memory Limit: 64 MB
Submit: 119  Solved: 66
[Submit][Status][Forum]

Description

找出输入数据中所有两两相乘的积为12!的个数。

Input

输入数据中含有一些整数n(1≤n<2^32)。

Output

输出所有两两相乘的积为12!的个数。

Sample Input

1 10000 159667200 9696 38373635
1000000 479001600 3

Sample Output

2

HINT

Source

[Submit][Status][Forum]

HOME Back

한국어 中文 English
All Copyright Reserved 2008-2010 SDIBT TEAM
GPL2.0 2003-2010 HUSTOJ Project TEAM
Anything about the Problems, Please Contact Admin:admin