Cod sursa(job #919179)

Utilizator okros_alexandruOkros Alexandru okros_alexandru Data 19 martie 2013 14:33:10
Problema Dreptunghiuri Scor 100
Compilator cpp Status done
Runda Lista lui wefgef Marime 1 kb
#include <fstream>
#define nmax 410
using namespace std;

long long Answer;
int N,M,Pos[nmax][nmax],Sqrt[nmax*nmax];

void init() {
	
	int i;
	
	for(i=1;i<=N||i<=M;i++)
		Sqrt[i*i]=i;
	
}
void solve() {
	
	int i,j,Delta,A,x1,x2,Nr;
	
	init();
	N--;
	M--;
	
	if(N>M)
		swap(N,M);
	
	for(i=1;i<=N;i++)
		for(j=1;j<=M;j++) {
			
			Nr=Pos[j][i];
			
			if(j>=i)
			for(A=0;A<i;A++) {
				
				Delta=j*j-4*A*(i-A);
				
				if(Delta<0 || (Delta && !Sqrt[Delta]) || (j+Sqrt[Delta])&1)
					continue;
				
				x1=(j-Sqrt[Delta])>>1;
				x2=(j+Sqrt[Delta])>>1;
				
				if(1<=x1 && x1<=j)
					Nr++;
				if(x1!=x2 && 1<=x2 && x2<=j)
					Nr++;
				
				}
			
			Pos[i][j]=Nr;
			Answer+=1LL*Nr*(N-i+1)*(M-j+1);
				
			}
		
}
void read() {
	
	ifstream in("dreptunghiuri.in");
	in>>N>>M;
	in.close();
	
}
void write() {
	
	ofstream out("dreptunghiuri.out");
	out<<Answer<<'\n';
	out.close();
	
}
int main() {
	
	read();
	solve();
	write();
	
	return 0;
	
}