Pagini recente » Cod sursa (job #1176187) | Cod sursa (job #1538870) | Cod sursa (job #1024916) | Cod sursa (job #29530) | Cod sursa (job #3125616)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("vopsea.in");
ofstream out("vopsea.out");
int n,r[41],g[41],a[41],mx,sr,sg,sa,s[41],m;
long long suma;
void verifica(int k)
{
int i;
sa=0;
sg=0;
sr=0;
for(i=1; i<=k; i++)
{
sa+=a[s[i]];
sg+=g[s[i]];
sr+=r[s[i]];
}
if(sa==sg&&sg==sr)
if(sa>mx)
mx=sa;
}
void back(int k)
{
int i;
for(i=s[k-1]+1; i<=n; i++)
{
s[k]=i;
if(k==m)
{verifica(k);
break;}
else back(k+1);
}
}
int main()
{
f>>n;
for(int i=1; i<=n; i++)
f>>r[i]>>g[i]>>a[i];
m=n;
while(m>=1)
{
back(1);
m--;
}
out<<3*mx;
return 0;
}