Contest 2: Find all factors
来源:互联网 发布:58集团 知乎 编辑:程序博客网 时间:2024/05/21 05:43
Description
Output the number of total factors of an integer.
Input
There are several lines. And each line contains a positive number N (1<=N<=9999999999999999).
Output
Output the number of total factors for each N.
For example,
Input
12
20
Output
6
6
Because 1, 2, 3, 4, 6, 12 are factors of 12.
1,2,4,5,10,20 are are factors of 20.
Sample Input
1220
Sample Output
66
HINT
#include <stdio.h>#include <math.h> int main() { long int n, i,sq; int fac=0; while (scanf("%ld",&n)!=EOF) { sq=sqrt(n); for(i=1;i<=sq;i++) { if(n%i==0) fac++; } fac*=2; float sqr=sq; if(sqr==sqrt(n)) fac--; printf("%d\n",fac); fac=0; } return 0; }
阅读全文
0 0
- Contest 2: Find all factors
- Find all prime factors of a number
- All factors of a given number
- 【summary】all about contest
- Find factors' count of a Number
- Find all arrangments
- Find All Primes
- Find All local extrema
- Leetcode: find all duplicate
- Find all palindrome substrings
- Java正则find all
- python之find all
- 448. Find All Numbers Disappeared in an Array#2(Done)
- 448. Find All Numbers Disappeared in an Array 2
- 2016 Multi-University Training Contest 2 1009It's All In The Mind
- 2016 Multi-University Training Contest 2 1009 It's All In The Mind
- 2016 Multi-University Training Contest 2 It's All In The Mind
- 2016 Multi-University Training Contest 2 1009 It's All In The Mind
- 请求报文及响应报文的结构
- 《机器学习实战》学习笔记(一)之k-近邻算法
- APP留存率多少才合格——全面解析留存率
- 九度OJ题目1003:A+B
- 【31】一个js写的爱心表白神器
- Contest 2: Find all factors
- 越来越稳!Kubernetes 1.8.0 版本发布
- 欢迎使用CSDN-markdown编辑器
- Base64
- Java使用HttpURLConnection发送Get及Post请求简单过程
- Apriori算法--关联分析算法(一)
- BIO与NIO、AIO的区别
- 7-变量高级主题2
- 简单高效的RPC框架