Guest
Login
跳过导航链接

12!配对
Time Limit:1000MS  Memory Limit:32768K

Description:

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

Input:

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

Output:

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

Sample Input:

1 10000 159667200 9696 38373635
1000000 479001600 3

Sample Output:

2

Source:

qianneng
Submit Your Solution


Zhe Jiang University Of Technology Online Programming Space Beta1.3
Designed & Developped By Jin Qiwei
Refactored By cb@zjut.edu.cn , QQ Group: 723311416  All Copyright Reserved 2006-
713