# [BZOJ2301][HAOI2011]Problem b

## 2301: [HAOI2011]Problem b

Time Limit: 50 Sec  Memory Limit: 256 MB Submit: 5998  Solved: 2734 [Submit][Status][Discuss]

## Description

st1\:*{behavior:url(#ieooui) }

2

2 5 1 5 1

1 5 1 5 2

14

3

## HINT

100%的数据满足：1≤n≤50000，1≤a≤b≤50000，1≤c≤d≤50000，1≤k≤50000

#pragma GCC optimize("O2")
#include <cstdio>
#include <algorithm>
using namespace std;
char buf[10000000], *ptr = buf - 1;
int n = 0;
while(*++ptr < '0' || *ptr > '9');
while(*ptr <= '9' && *ptr >= '0') n = (n << 1) + (n << 3) + (*ptr++ & 15);
return n;
}
const int maxn = 50000 + 10;
bool mark[maxn] = {false};
int mu[maxn], sum[maxn];
int pri[maxn], prn = 0;
void shai(){
mu[1] = 1;
for(int i = 2; i <= 50000; i++){
if(!mark[i]){
pri[++prn] = i;
mu[i] = -1;
}
for(int j = 1; j <= prn && pri[j] * i <= 50000; j++){
mark[i * pri[j]] = true;
if(i % pri[j] == 0){
mu[i * pri[j]] = 0;
break;
}
else mu[i * pri[j]] = -mu[i];
}
}
sum[0] = 0;
for(int i = 1; i <= 50000; i++)
sum[i] = sum[i - 1] + mu[i];
}
inline int work(int n, int m){
if(n > m) swap(n, m);
int ans = 0, pos;
for(int i = 1; i <= n; i = pos + 1){
pos = min(n / (n / i), m / (m / i));
ans += (sum[pos] - sum[i - 1]) * (n / i) * (m / i);
}
return ans;
}
int main(){
fread(buf, sizeof(char), sizeof(buf), stdin);
shai();
int n = readint();
int a, b, c, d, k;
while(n--){
}