1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85

#include <iostream>
#include <cstdio>
#include <queue>
#include <cmath>
using namespace std;
const int INF = 1<<30;
typedef long long LL;
int getint() {
	int r = 0, k = 1; char c = getchar();
	for (; '0' > c || c > '9'; c = getchar()) if (c == '-') k = -1;
	for (; '0' <= c && c <= '9'; c = getchar()) r = r * 10 - '0' + c;
	return r * k;
}
struct edge_type {
	int to, next, r, c;
} edge[100005];
int S, T, N, M, dis[10005], a[10005], pre[10005], cnte = 1, h[10005];
bool vis[10005];
queue<int> Q;
void ins(int u, int v, int f, int c) {
	edge[++cnte].to = v;
	edge[cnte].next = h[u];
	h[u] = cnte;
	edge[cnte].r = f;
	edge[cnte].c = c;
	edge[++cnte].to = u;
	edge[cnte].next = h[v];
	h[v] = cnte;
	edge[cnte].r = 0;
	edge[cnte].c = -c;
}
bool SPFA(int &flow, int &cost) {
	for (int i = S; i <= T; ++i) dis[i] = INF, vis[i] = false;
	pre[S] = 0; dis[S] = 0; vis[S] = true; a[S] = INF;
	Q.push(S);
	int now;
	while (!Q.empty()) {
		now = Q.front(); Q.pop();
		vis[now] = false;
		for (int i = h[now]; i; i = edge[i].next) {
			if (!edge[i].r) continue;
			if (dis[edge[i].to] > dis[now] + edge[i].c) {
				dis[edge[i].to] = dis[now] + edge[i].c;
				a[edge[i].to] = min(a[now], edge[i].r);
				pre[edge[i].to] = i;
				if (!vis[edge[i].to]) {
					vis[edge[i].to] = true;
					Q.push(edge[i].to);
				}
			}
		}
	}
	if (dis[T] == INF) return false;
	flow += a[T];
	cost += a[T] * dis[T];
	for (now = T; now != S; now = edge[pre[now]^1].to) {
		edge[pre[now]].r -= a[T];
		edge[pre[now]^1].r += a[T];
	}
	return true;
}
int MCMF() {
	int flow = 0, cost = 0;
	while (SPFA(flow, cost));
	printf("%d %d", flow/2, -cost/2);
}
int gcd(int x, int y) {
	if (y == 0) return x;
	return gcd(y, x % y);
}
bool check(int x, int y) {
	int z = sqrt(x*x-y*y);
	return (gcd(z, y) == 1 && z*z==x*x-y*y);
}
int main() {
	N = getint(); M = getint();
	S = 0; T = 2016;
	for (int i = N; i <= M; ++i) {
		ins(S, i, 1, 0);
		ins(i+1005, T, 1, 0);
		for (int j = N; j < i; ++j) if (check(i, j)) { ins(i, j+1005, 1, -i-j); ins(j, i+1005, 1, -i-j); }
	}
	MCMF();
	return 0;
}