hdu 4215 Number Theory?(打表)

题目：

E(N) = |{i | gcd(N, i) = 1, 1 <= i <= N}|
F(N) = |{i | N % i = 0, 1 <= i <= N}|

求有多少区间段[l,r]（1<=l<=r<=n）,满足上式，输出，

打表后，发现29以后都是10 ^-^

#include<iostream>
#include<cstdio>
using namespace std;
int main()
{int answer[31]={0,1,1,2,2,4,5,5,6,6,7,7,7,7,7,7,7,7,8,8,8,8,8,8,9,9,9,9,9,9,10};int n,c;scanf("%d",&c);for(int t=1;t<=c;t++){scanf("%d",&n);if(n<30)printf("Case %d: %d\n",t,answer[n]);elseprintf("Case %d: 10\n",t);}system("pasue");return 0;
}

打表程序：

#include<iostream>
#include<cstdio>
using namespace std;
int  gcd(int x,int y)
{return y==0?x:gcd(y,x%y);
}
int E[10000],F[10000];
int answer[10000];
int main()
{int n;while(scanf("%d",&n)!=EOF){memset(E,0,sizeof(E));memset(F,0,sizeof(F));for(int i=1;i<=n;i++){for(int j=1;j<=i;j++){if(gcd(i,j)==1)E[i]++;if(i%j==0)F[i]++;}}for(int i=1;i<=1000;i++){printf("%d ",E[i]);if(i%20==0)printf("\n");}cout<<"******************************************************************"<<endl;for(int i=1;i<=1000;i++){printf("%d ",F[i]);if(i%20==0)printf("\n");  }cout<<"*******************************************************************"<<endl;for(int t=1;t<=200;t++){int sumE,sumF,ans=0;for(int i=1;i<=t;i++){/* sumE=0;//重算了sumF=0;*/for(int j=1;j<=i;j++){/*sumE+=E[j];sumF+=F[j];if(j==2){printf("sunE=%d***sumF=%d\n\n",sumE,sumF);}if(sumE==sumF){printf("sumE=%d   sumF=%d\n",sumE,sumF);printf("j=%d   i=%d\n",j,i);ans++;}*/sumE=0;sumF=0;for(int k=j;k<=i;k++){sumE+=E[k];sumF+=F[k];/*if(sumE==sumF)//放错位置了！！！！！{printf("sumE=%d   sumF=%d\n",sumE,sumF);printf("j=%d   i=%d\n",j,i);ans++;}*/}if(sumE==sumF){/*printf("sumE=%d   sumF=%d\n",sumE,sumF);printf("j=%d   i=%d\n",j,i);*/ans++;}}}//printf("%d***\n",ans);answer[t]=ans;}for(int i=1;i<=200;i++){printf("%d  ",answer[i]);if(i%10==0)printf("\n");}}system("pause");return 0;
}

n取值为前100时，

1 1 2 2 4 5 5 6 6 7
7 7 7 7 7 7 7 8 8 8
8 8 8 9 9 9 9 9 9 10
10 10 10 10 10 10 10 10 10 10
10 10 10 10 10 10 10 10 10 10
10 10 10 10 10 10 10 10 10 10
10 10 10 10 10 10 10 10 10 10
10 10 10 10 10 10 10 10 10 10
10 10 10 10 10 10 10 10 10 10
10 10 10 10 10 10 10 10 10 10
10 10 10 10 10 10 10 10 10 10
10 10 10 10 10 10 10 10 10 10
10 10 10 10 10 10 10 10 10 10
10 10 10 10 10 10 10 10 10 10
10 10 10 10 10 10 10 10 10 10
10 10 10 10 10 10 10 10 10 10
10 10 10 10 10 10 10 10 10 10
10 10 10 10 10 10 10 10 10 10
10 10 10 10 10 10 10 10 10 10
10 10 10 10 10 10 10 10 10 10

hdu 4215 Number Theory?(打表)相关推荐

[2021CCPC威海热身赛] Number Theory (打表推公式)
题意求 ∑ k = 1 n ∑ i ∣ k ∑ j ∣ i λ ( i ) λ ( j ) \sum_{k = 1}^{n}\sum_{i \mid k} \sum_{j \mid i} \lamb ...
2016级算法第二次上机-F.ModricWang's Number Theory II
891 ModricWang's Number Theory II 思路使得序列的最大公约数不为1,就是大于等于2,就是找到一个大于等于2的数,它能够整除序列中的所有数. 考虑使得一个数d整除数组中 ...
hdu 6029 Graph Theory 【直接连线】
hdu 6029 Graph Theory [直接连线] 对于输入的a等于1 如果前面有空闲的点直接匹配否则自己变成空闲的点 a=2 的时候空闲的点加一直到最后如果没有空余的点输出ye ...
concrete maths ch4 number theory
ch4 number theory 数论研究正数的性质 1.整除 gcd lcm 扩展欧几里得. 整除求和\(\sum_{n|m}\)的几个公式.ch2的知识会很有用. 2.质数 Fundamenta ...
HDU 1005 Number Sequence
[题目] Number Sequence Time Limit: 2000/1000 MS (Jav ...
Number Theory Problem（The 2016 ACM-ICPC Asia China-Final Contest 找规律）
题目: Mr. Panda is one of the top specialists on number theory all over the world. Now Mr. Panda is in ...
NUMTRYE - Number Theory (Easy)
NUMTRYE - Number Theory (Easy) Hard 版本就是用 pollard_rho 分解质因子. f(n)=∏(pi2ei+1+1)f(n) = \prod(p_i ^{2e_ ...
Codeforces Round #628 (Div. 2) E. Ehab‘s REAL Number Theory Problem 巧妙的质因子建图
传送门文章目录题意: 思路: 题意: 给你nnn个数,每个数的因子个数不超过777个,选出最少的数使其乘积为平方数. n≤1e5n\le 1e5n≤1e5 思路: 由于因子不超过777个,所以由约 ...
HDU 4054 Number String
HDU 4054 Number String 思路: 状态:dp[i][j]表示以j结尾i的排列状态转移: 如果s[i - 1]是' I ',那么dp[i][j] = dp[i-1][j-1] + ...

hdu 4215 Number Theory?(打表)

hdu 4215 Number Theory?(打表)相关推荐

最新文章

热门文章