Pagini recente » Cod sursa (job #2089762) | Cod sursa (job #2032215) | Cod sursa (job #3247100) | Cod sursa (job #2107973) | Cod sursa (job #2660843)
#include <fstream>
using namespace std;
ifstream f("dreptunghiuri.in");
ofstream g("dreptunghiuri.out");
int n, m;
int main()
{
f >> n >> m;
long long int answer = n * (n - 1) / 2 * m * (m - 1) / 2;
for(int i = 3; i <= n; i++)
{
for(int j = 3; j <= m; j++)
{
int squares = (n - i + 1) * (m - j + 1);
if(i != j)
answer = answer + squares * 2;
else
answer = answer + squares;
}
}
g << answer;
return 0;
}