Extreme (II)
来源:互联网 发布:linux 定时唤醒 编辑:程序博客网 时间:2024/04/30 14:25
题目链接
题意: 计算gcd(1,n)+gcd(2,n)+...+gcd(n-1, n);
解题思路:
#include<stdio.h>#include<string.h>const int MAXN=4000010;int dp[MAXN];int sum[MAXN];long long int we[MAXN];int main(){ memset(dp,0,sizeof(dp)); dp[1]=1; for(int i=2; i<MAXN; i++) { if(dp[i])continue; for(int j=i; j<MAXN; j+=i) { if(!dp[j])dp[j]=j; dp[j]=dp[j]/i*(i-1); } } for(int i=1;i<=MAXN;i++) { for(int j=2*i;j<=MAXN;j+=i) { sum[j]+=i*dp[j/i]; } } we[2]=sum[2]; for(int i=3;i<=MAXN;i++) { we[i]+=we[i-1]+sum[i]; } int N; while(~scanf("%d",&N)&&N) { printf("%lld\n",we[N]); } return 0;}
0 0
- Extreme (II)
- GCD Extreme(II) UVA11426
- uva11426GCD - Extreme (II)
- UVA11426GCD - Extreme (II)
- uva11426 GCD - Extreme (II)
- UVA 11426 - GCD - Extreme (II)
- UVA 11426 GCD - Extreme (II)
- uva 11426 GCD Extreme (II)
- UVA - 11426 GCD - Extreme (II)
- UVA:11426 GCD - Extreme (II)
- UVA 11426 GCD - Extreme (II)
- uvaoj 11426 - GCD - Extreme (II)
- UVA 11426-GCD - Extreme (II)
- UVA 11426GCD - Extreme (II)
- UVA 11426 GCD - Extreme (II)
- UVA 11426 - GCD Extreme(II)
- UVA 11426 GCD Extreme (II)
- UVA 11426 - GCD - Extreme (II) (数论)
- 蓝桥杯 入门训练 Fibonacci数列 JAVA
- GCC学习笔记(二)--静态库与共享库
- C++单利模式
- 山区修路
- GreenDao 3.1 应用
- Extreme (II)
- java中的接口(interface)
- Retrofit 的使用
- CODEVS 1166 矩阵取数游戏
- qscoj 66 ||2017 UESTC Training for Data Structures D(离线+树状数组)
- 算法设计Week9 LeetCode Algorithms Problem #121. Best Time to Buy and Sell Stock
- [leetcode]: 476. Number Complement
- HDOJ 3045 Picnic Cows(斜率优化DP)
- 原生ajax