只AC了前三个点，死活找不到哪错了。

#include<bits/stdc++.h>
using namespace std;
const int N=1e6+10,INF=0x3f3f3f3f;

int read(){
	int x=0,f=1;char ch=getchar();
	while(!isdigit(ch)){
		if(ch=='-') f=-1;
		ch=getchar();
	}
	while(isdigit(ch)) x=x*10+ch-'0',ch=getchar();
	return x*f;
}

int a,b,S,T,head[N],tot=1,pre[N],dist[N],vis[N],mf[N],flow,cost,mp[N];
struct node{
	int to,nxt,w,c;
}edge[N];
void add(int x,int y,int w,int c){
	edge[++tot].to=y;
	edge[tot].w=w,edge[tot].c=c;
	edge[tot].nxt=head[x];
	head[x]=tot;
}

bool spfa(){
	memset(dist,-0x3f,sizeof(dist)),memset(mf,0,sizeof(mf));
	queue<int> q;q.push(S),vis[S]=1,dist[S]=0,mf[S]=INF;
	while(!q.empty()){
		int t=q.front();q.pop(),vis[t]=0;
		for(int i=head[t];i;i=edge[i].nxt){
			int y=edge[i].to;
			if(dist[y]<dist[t]+edge[i].w&&edge[i].c){
				dist[y]=dist[t]+edge[i].w;
				pre[y]=i,mf[y]=min(mf[t],edge[i].c);
				if(!vis[y]) q.push(y),vis[y]=1;
			}
		}
	}
	return mf[T]>0;
}

void EK(){
	while(spfa()){
		int v=T;
		while(v!=S){
			int i=pre[v];edge[i].c-=mf[T],edge[i^1].c+=mf[T],v=edge[i^1].to;
		}
		flow+=mf[T],cost+=mf[T]*dist[T];
	}
}

int gcd(int a,int b){
	return b?gcd(b,a%b):a;
}

int main(){
	
	a=read(),b=read(),S=0,T=2*b+1;
	for(int i=1;i<=1000;i++) mp[i*i]=i;
	for(int i=a;i<=b;i++) add(S,i,0,1),add(i,S,0,0),add(i+b,T,0,1),add(T,i+b,0,0);
	for(int i=a;i<=b;i++){
		for(int j=i+1;j<=b;j++){
			if(mp[j*j-i*i]&&gcd(j,mp[j*j-i*i])==1)
				add(j,i+b,i+j,1),add(i+b,j,-(i+j),0);
		}
	}
	EK();
	cout<<flow<<" "<<cost<<endl;
	
	return 0;
}