Submission #1692015

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i,a,b) for(int i=(a);i<(b);i++)
#define RREP(i,a,b) for(int i=(a);i>=(b);i--)
typedef long long ll; typedef long double ld;
using namespace std;
const int INF=1e9, MOD=1e9+7, around[]={0,1,1,-1,0,-1,1,0,0};
const ld PI=abs(acos(-1));
int s=0,a[5];
bool li[510]={},used[5]={};

int dfs(int now,int d){
	if(used[now]) return 0;
	if(d==3){li[s]=true; return 0;}
	used[now]=true;
	
	REP(i,0,5){
		s+=a[i];
		dfs(i,d+1);
		s-=a[i];
	}
	
	used[now]=false;
	return 0;
}
int main(){
	REP(i,0,5) cin >> a[i];
	
	REP(i,0,5){
		s=a[i];
		dfs(i,1);
	}
	
	int c=0;
	RREP(i,510,0){
		if(li[i]) c++;
		if(c==3){cout << i << endl; break;}
	}
	
	return 0;
}

Submission Info

Judge Result