Go: package main

import (
	"bufio"
	"os"
	"strings"
	"strconv"
	"fmt"
)

var scanner = bufio.NewScanner(os.Stdin)

func main() {
	for scanner.Scan() {
		buf := strings.Split(scanner.Text(), " ")
		a, _ := strconv.Atoi(buf[0])
		b, _ := strconv.Atoi(buf[1])
		c, _ := strconv.Atoi(buf[2])
		d, _ := strconv.Atoi(buf[3])
		e, _ := strconv.Atoi(buf[4])
		f, _ := strconv.Atoi(buf[5])
		if a == 0 && b == 0 && c == 0 && d == 0 && e == 0 && f == 0 {
			break
		}
		fmt.Println(100-((5*a+3*b)*2)-(f-5*a-3*b-e)*3+15*a+15*b+15*(5*a+3*b)+c*7+d*2)
	}
}

C++: #include <iostream>
#include <algorithm>
#include <cassert>
using namespace std;

int main() {
	int B, R, G, C, S, T;
	for(;cin >> B >> R >> G >> C >> S >> T, B || R || G || C || S || T;) {
		int coin = 100;
		
		coin += 2 * C;
		coin += 7 * G;
		coin += 15 * R;
		coin += 15 * B;

		coin += 3 * R * (15 - 2);
		coin += 5 * B * (15 - 2);

		T -= S;
		T -= 5 * B + 3 * R;

		coin -= 3 * T;

		cout << coin << endl;
	}
	return 0;
}

C++: #include<iostream>

using namespace std;

int main(){
  int b,r,g,s,c,t;
  while(cin >> b >> r >> g >> c >> s >> t&&t){
    int ans = 100-3*t+3*s+2*c+7*g+15*b+80*b+15*r+16*3*r;
    cout << ans << endl;
  }
  return 0;
  }

C++: #include<iostream>
#include<climits>
#include<math.h>
#include<vector>
#include<algorithm>
#include<cstdio>
#include <string>
#include <complex>
#include <functional>
using namespace std;
typedef pair<int,int> P;
double dat[100][100];
int dp[6][1010];//動的計画法
int prime[10000001];
char str[1010][1010];
vector<pair<int,int> > pc[100001];
int ABS(int a){return max(a,-a);}
int main(){
   int coin;
   int b,r,g,c,s,t;
   while(cin>>b>>r>>g>>c>>s>>t,b+r+g+c+s+t){
       coin=100;
       coin+=15*(b+r)+13*(b*5+r*3)+7*g+2*c-(t-5*b-3*r-s)*3;
       cout<<coin<<endl;
   }
    return 0;
}

C++: #include <iostream>

using namespace std;

 int main(void) {

	 int b, r, g, c, s, t;

	 while (1){
		 cin >> b >> r >> g >> c >> s >> t;
		 if (b == 0 && r == 0 && g == 0 && c == 0 && s == 0 && t == 0) break;
		 cout << 100 - (b * 5 + r * 3) * 2 - (t - b * 5 - r * 3) * 3 + b * 15 + r * 15 + b * 15 * 5 + r * 15 * 3 + g * 7 + c * 2 + s * 3 << endl;
	 }

	 return 0;
	
}

C++: #include<iostream>
using namespace std;

int main(){
  int b,r,g,c,s,t;

  while(cin >> b >> r >> g >> c >> s >> t){
    int m = 100; // Ã£ÂÂ¡Ã£ÂÂÃ£ÂÂ«
    if(t == 0) return 0;
    m += -3*b + 15*b + 5*b*13;
    t -= b + 5*b;
    m += -3*r + 15*r + 3*r*13;
    t -= r + 3*r;
    m += -3*g + 7*g;
    t -= g;
    m += -c;
    t -= c;
    m += -3*s;
    t -= 2*s;
   m += -3*t;
	
    cout << m << endl;
  }

}

C++: #include<vector>
#include<list>
#include<algorithm>
#include<iostream>
#include<string>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
using namespace std;
int main(){
  int b,r,g,c,s,t;
  while(cin>>b>>r>>g>>c>>s>>t&&b+r+g+c+s+t)
    cout<<100+b*80+r*54+g*7+c*2+s*3-(t-b*5-r*3)*3<<endl;
  return 0;
}

C++: #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <cstring>
#include <cmath>
#include <queue>
#include <map>
#include <set>
using namespace std;

#define rep(i,n) for(int i=0; i<n; i++)
#define FOR(i,s,n) for(int i=s; i<n; i++)
#define ALL(x) x.begin(), x.end()
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;

int main() {
	int b, r, g, c, s, t;
	while(cin >> b >> r >> g >> c >> s >> t, b||r||g||c||s||t) {
		int coin = 100;
		t -= (s + b*5 + r*3);
		coin -= t*3;
		coin += 15*b + 15*r + 7*g + 2*c;
		coin += 13*(5*b + 3*r);
		cout << coin << endl;
	}
	return 0;
}

C++: #include<string>
#include<vector>
#include<algorithm>
#include<iostream>
using namespace std;
int main(){
    int b,r,g,c,s,t;
    while(cin>>b>>r>>g>>c>>s>>t){
        if(b||r||g||c||s||t);else break;
        int br=b*5+r*3;
        t-=br;
        int ans=100;
        ans-=3*(t-s)+2*(br);
        ans+=g*7;
        ans+=br*15;
        ans+=c*2;
        ans+=(b+r)*15;
        cout<<ans<<endl;
    }
    return 0;
}

C++: main(b,r,g,c,s,t){
	for(;~scanf("%d%d%d%d%d%d",&b,&r,&g,&c,&s,&t)&&t;)printf("%d\n",b*95+r*63+g*7-c+(s+c-t)*3+100);
}

C++: #include <iostream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
#include <numeric>
#include <cstring>
#include <cmath>

using namespace std;

int main(int argc, char *argv[]) {
  int big_b, regular_b, grape, cherry, star, total;
  while (true) {
    int medal = 100;
    cin >> big_b >> regular_b >> grape >> cherry >> star >> total;
    if (total == 0)
      break;
    medal += big_b * (15 + 15 * 5);
    medal += regular_b * (15 + 15 * 3);

    //grape -= big_b * 5 + regular_b * 3;                                                                                                         
    medal += grape * 7;

    medal += cherry * 2;

    total -= star;
    medal -= star * 0;
    total -= big_b * 5 + regular_b * 3;
    medal -= (big_b * 5 + regular_b * 3) * 2;

    medal -= total * 3;

    cout << medal << endl;
  }
  return 0;
}

C++: #include <iostream>

using namespace std;

int main()
{
    int b, r, g, c, s, t;

    while (cin >> b >> r >> g >> c >> s >> t) {
        if (b + r + g + c + s + t == 0)
            break;

        cout << 100 + 2 * c + 7 * g + 95 * b + 63 * r + 3 * s - 3 * t << endl;
    }

    return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;

int main(){
	int a,b,c,d,e,f;
	while(cin>>a>>b>>c>>d>>e>>f){
		if(a==0&&b==0&&c==0&&d==0&&e==0&&f==0)break;
		
		int sum=100;
		int im=f-e-(a*5)-(b*3);
		im+=(a+b);
		sum-=im;
		sum+=(a*5*15);
		sum+=(b*3*15);
		sum+=c*7;
		sum+=d*2;
		cout<<sum<<endl;
		}
		return 0;
	}
//-105

C++: #include<stdio.h>
int main(void){
int b,r,g,c,s,t;

while(scanf("%d%d%d%d%d%d",&b,&r,&g,&c,&s,&t),b+r+g+c+s+t){
point=100;
point+=(b*6+r*4)*15+g*7+c*2+s*3;
point-=(b*5+r*3)*2+(t-b*5-r*3)*3;
printf("%d\n",point);
}
return 0;}

C++: #include <iostream>
using namespace std;

int main(){
    int b, r, g, c, s, t;
    while(cin >> b >> r >> g >> c >> s >> t, b||r||g||c||s||t){
        int result = 100 + b*5*15 + r*3*15 + (b+r)*15 + g*7 + c*2
            - (t-s-(5*b+3*r))*3 - (5*b+3*r)*2;
        cout << result << endl;
    }
    return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <complex>
#include <cstring>
#include <cstdlib>
#include <string>
#include <cmath>
#include <queue>
using namespace std;

#define REP(i,n) for(int i=0;i<(int)n;++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
const int INF = 1<<29;

int main() {
  int b,r,g,c,s,t;
  while(cin >> b>>r>>g>>c>>s>>t,b||r||g||c||s||t) {
    int res = 100 + b * 15 + r*15 + g*7 + c*2;
    int bonus = b*5 + r*3;
    res += 15 * bonus;
    res -= (t - s - bonus) * 3 + bonus * 2;
    cout << res << endl;
  }
}

C++: #include <iostream>

using namespace std;

main(){
  int b, r, g, c, s, t;
  while(1){
    cin >> b >> r >> g >> c >> s >> t;
    if(b==0 && r==0 && g==0 && c==0 && s==0 && t==0) break;

    int sum=0;

    t-=s;
    int bo=b*5+r*3;
    t-=bo;
    sum-=t*3;
    sum-=bo*2;
    sum+=bo*15;
    sum+=b*15+r*15+g*7+c*2+100;

    cout << sum << endl;
  }
  return 0;
}

C++: #include <iostream>

using namespace std;

int main() {
	int b, r, g, c, s, t;
	while (cin >> b >> r >> g >> c >> s >> t) {
		if (b == 0 && r == 0 && g == 0 && c == 0 && s == 0 && t) break;
		int point = 100;
		point += b * 15;
		point += (b*5) * 16;
		point += r * 15;
		point += (r*3) * 16;
		point += g * 7;
		point += c * 2;
		point += s * 3;
		point -= t * 3;

		cout << point << endl;
	}
	return 0;
}