Cod sursa(job #3208370)
Utilizator | Georgescu David davidgeo123 | Data | 28 februarie 2024 13:40:16 |
---|---|---|---|
Problema | Ecuatie | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.63 kb |
#pragma GCC optimize("O3", "Ofast", "unroll-loops")
#include <bits/stdc++.h>
using namespace std;
unordered_map<int,int> m;
int main()
{
ifstream cin("eqs.in");
ofstream cout("eqs.out");
int a1,a2,a3,a4,a5;
cin>>a1>>a2>>a3>>a4>>a5;
for(int i=-50; i<=50; i++)
if(i)
for(int j=-50; j<=50; j++)
if(j)
++m[a1*i*i*i+a2*j*j*j];
int suma=0;
for(int i=-50; i<=50; i++)
if(i)
for(int j=-50; j<=50; j++)
if(j)
for(int k=-50; k<=50; k++)
if(k)
suma+=m[-a3*i*i*i-a4*j*j*j-a5*k*k*k];
cout<<suma;
return 0;
}