1108
来源:互联网 发布:java程序设计教程 编辑:程序博客网 时间:2024/06/11 15:11
题目描述
Paula and Tai are couple. There are many stories between them. The day Paula left by airplane, Tai send one message to telephone 2200284, then, everything is changing… (The story in “the snow queen”).
After a long time, Tai tells Paula, the number 220 and 284 is a couple of friends number, as they are special, all divisors of 220’s sum is 284, and all divisors of 284’s sum is 220. Can you find out there are how many couples of friends number less than 10,000. Then, how about 100,000, 200,000 and so on.
The task for you is to find out there are how many couples of friends number in given closed interval [a,b]。
输入
There are several cases.
Each test case contains two positive integers a, b(1<= a <= b <=500,000).
Proceed to the end of file.
输出
For each test case, output the number of couples in the given range. The output of one test case occupied exactly one line.
样例输入
1 1001 1000
样例输出
01
提示
6 is a number whose sum of all divisors is 6. 6 is not a friend number, these number is called Perfect Number.
来源
辽宁省赛2010
打表代码:
#include<stdio.h>#include<string.h>int a[5000010];int main() { int i,j; int c=5000010; a[0] = a[1] = 1; memset(a,0,sizeof(a)); for(i = 2; i<=c; i++){ a[i]++;//每个数都有1这个因子 for(j = 2*i; j <= c; j += i){ ans[j] += i;//因为不算本身,所以从2*i开始,+i就是3*i,以此类推,把所有i的倍数加上i这个因子 } } int k=0; for(i = 2; i <= c; i++){ if(a[i] <= c && i == a[a[i]] && i < a[i]){//i,a[i]都在500000以内 printf(" %d , %d , ",i,a[i]); k++; if(k%4==0) puts("\n"); } }}
实现程序:
#include <stdio.h>int a[]={220,284,1184,1210,2620,2924,5020,5564,6232,6368,10744,10856,12285,14595,17296,18416,63020,76084,66928,66992,67095,71145,69615,87633,79750,88730,100485,124155,122265,139815,122368,123152,141664,153176,142310,168730,171856,176336,176272,180848,185368,203432,196724,202444,280540,365084,308620,389924,319550,430402,356408,399592,437456,455344,469028,486178};int main(){ int c,d,i; while(~scanf("%d %d",&c,&d)) { int ans=0; for(i=0;i<56;i+=2) { if(c<=a[i] && a[i+1]<=d) ans++; } printf("%d\n",ans); } return 0;}
- 1108
- 1108
- 1108
- 1108
- 1108
- 1108
- problem 1108
- 过去。。。1108
- 1108 最小公倍数
- 1108\1109
- 1108: 最小公倍数
- hdu 1108
- 1108 最小公倍数
- HDU 1108
- spoj 1108
- ural 1108
- HDU-1108
- [1108]:最小公倍数
- eclipse搭建Android开发环境遇到的坑
- poj 3321 Apple Tree
- jmeter接口自动化测试之一:jmeter+maven+eclipse搭建
- 触摸屏驱动函数分析(基于普通设备)
- Struts之国际化
- 1108
- 在Spring MVC框架下配置双(多)数据源
- C/S架构对服务器的影响
- chnsCompute和chnsPyramid
- Linux上vi(vim)编辑器使用教程
- mongo 图形客户端解决无法添加拷贝数据库问题
- 摘要MVP概念初识
- 监听软键盘打开或关闭触发动作
- Linux shell getopts 笔记