Submission #1042559

---

Source Code Expand

#include<cstdio>
#include<iostream>
#include<cmath>
#include<vector>
#include<string>
#include<algorithm>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<iomanip>
#include<fstream>

#define rep(i,a,N) for(int i=0+a;i<N;i++)
#define lint long long int
#define SIZE 100005
#define pb push_back
#define MP make_pair

using namespace std;

int main(){
	lint i,o,t,j,l,s,z,ans=0;
	cin>>i>>o>>t>>j>>l>>s>>z;
	if(i%2==1)i--;
	if(j%2==1)j--;
	if(l%2==1)l--;
	ans=i+o+j+l;
	cout<<ans;
return 0;
}

Submission Info

Judge Result