uva10214

最新推荐文章于 2020-03-14 22:42:54 发布

醉江楼

最新推荐文章于 2020-03-14 22:42:54 发布

阅读量866

点赞数

分类专栏：题解

本文链接：https://blog.csdn.net/AQ14AQ1/article/details/50624755

版权

题解专栏收录该内容

40 篇文章 0 订阅

订阅专栏

/**********
author:chanjun2016
email:15755396353@163.com
***********/

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <algorithm>

using namespace std;

#define INF = 0x3f3f3f3f

const int maxa = 2000;
const int maxb = 2e6;

int phi[maxa + 10];
int vis[maxa + 10];

void init(){
	phi[1] = 1;
	for (int i = 2; i <= maxa; ++i){
		if (!phi[i]){
			for (int j = i;j <= maxa; j += i){
				if (!phi[j]){
					phi[j] = j;
				}
				phi[j] = phi[j] / i * (i - 1);
			}
		}
	}
	
}

int gcd(int a,int b){
	if (!b){
		return a;
	}
	return gcd(b,a % b);
}

int main(){

	init();
	long long a,b;
	while (scanf("%lld%lld",&a,&b),a && b){
		long long ans = 0;
		for (int i = 1; i <= a; ++i){
			ans += (b / i) * phi[i];
			
			for(int j =  b / i * i + 1; j <= b ; ++j){
				if (gcd(i,j) == 1){
					++ans;
				}
			}
			
		}
		printf("%.7f\n", 1.0 * (ans * 4 + 4) / (double)((2 * a + 1) * (2 * b + 1) - 1));
	}
	
	return 0;
}