Cod sursa(job #1397345)
| Utilizator | Data | 23 martie 2015 13:56:46 | |
|---|---|---|---|
| Problema | Dreptunghiuri | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.68 kb |
#include <fstream>
using namespace std;
ifstream f("dreptunghiuri.in");
ofstream g("dreptunghiuri.out");
int N,M;
long long answer;
int main()
{
f >> N >> M;
//dreptunghiuri paralele cu axele
for (int i = 1; i < N; ++i)
{
for (int j = 1; j < M; ++j)
{
answer += (N-i)*(M-j);
}
}
//dreptunghiuri neparalele cu axele
for (int i = 1; i < N; ++i)
{
for (int j = 1; j < M; ++j)
{
if (i+j < N && i+j < M)
{
answer += (N-i-j)*(M-i-j);
}
}
}
g << answer;
f.close();
f.close();
return 0;
}
