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 {
			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<string>
#include<vector>
#include<utility>
#include<queue>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<complex>
#define INF 2147483647
#define llINF 9223372036854775807
#define pb push_back
#define mp make_pair 
#define F first
#define S second
#define ll long long

using namespace std;
int main(){
  int a,b,c,d,e,f;
  while(cin>>a>>b>>c>>d>>e>>f,a+b+c+d+e+f){
    ll ans=100;
    ans-=(f-(e+a*5+b*3))*3;
    ans-=(a*5+b*3)*2;
    ans+=(a*15+b*15+(a*5+b*3)*15+(c)*7+d*2);
    cout<<ans<<endl;
  }
  return 0;
}

C++: #include <cstdio>
#include <utility>
using namespace std;

#define _gp(l) const auto gcu{getchar##l}; const auto pcu{putchar##l}
#ifdef __linux
_gp(_unlocked);
#else
_gp();
#endif
#define _DEF(r, n, ...) inline r n(__VA_ARGS__) noexcept
#define _T template <typename T>
#define _HT template <typename H,typename... T>
#define _OP(t) inline operator t()
struct _in {
#ifdef _GLIBCXX_STRING
	_OP(string){string s;for(char c;c=gcu(),c!=' '&&c!='\n';)s+=c;return s;}
#define _S
#endif
	_OP(char){char c=gcu();gcu();return c;}
	_OP(double){double d; scanf("%lf",&d); gcu();return d;}
	_T _OP(T){T n{},m{1},c;if((c=gcu())=='-')m=-1,c=gcu();do{n=10*n+(c-'0'),c=gcu();}while(c>='0'&&c<='9');return m*n;}
} in;
#define _SCAN(...) _DEF(bool,scan,__VA_ARGS__)
#ifdef _S
_SCAN(string &o) {int c{gcu()};if(c==EOF)return false;else{ungetc(c,stdin);string t=move(in);o=t;return true;}}
#endif
_T _SCAN(T &o) {int c{gcu()};return c==EOF?false:(ungetc(c,stdin),o=in,true);}
_HT _SCAN(H &h,T&&... t){return scan(h)&&scan(t...);}
#define _OUT(...) _DEF(void,out,__VA_ARGS__)
#define _OUTL(...) _DEF(void,outl,__VA_ARGS__)
_OUT(bool b){pcu('0'+b);}
_OUT(const char *s){while(*s)pcu(*s++);}
_OUT(char c){pcu(c);}
#ifdef _S
_OUT(string &s){for(char c:s)pcu(c);}
#endif
_T _OUT(T n){static char b[20];char *p=b;T m=n<0?pcu('-'),-1:1;
	if(!n)*p++='0';else while(n)*p++=(char)(n%10*m+'0'),n/=10;while(p!=b)pcu(*--p);}
	_OUTL(){out('\n');}
#ifdef _GLIBCXX_VECTOR
	_T _OUT(vector<T> &v){for(T &x:v)out(&x == &v[0]?"":" "),out(x);}
#endif
	_HT _OUT(H &&h, T... t){out(h);out(t...);}
	template <typename... T> _OUTL(T... t){out(t...);outl();}
	struct range{
		int e,b=0,s=1;range(int _b,int _e,int _s):e(_e),b(_b),s(_s){} range(int _b,int _e): e(_e), b(_b){} range(int _e):e(_e){}
		struct it{int v,s; it(int _v,int _s):v(_v),s(_s){} operator int()const{return v;} operator int&(){return v;}int operator*()const{return v;}
			it& operator++(){v+=s;return *this;} }; it begin(){return {b,s};} it end(){return {e,s};}};
#define times(i,n) for(int i=n;i;i--)

int main() {
	for (int b, r, g, c, s, t; b = in, r = in, g = in, c = in, s = in, t = in;)
		outl(100 + b * 95 + r * 63 + g * 7 + c * 2 + s * 3 - t * 3);
}

C++: #include <stdio.h>
#include <cmath>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>

using namespace std;

int main(){

	int big_bonus,reg_bonus,glape,cherry,star,total,coin;

	while(true){
		scanf("%d %d %d %d %d %d",&big_bonus,&reg_bonus,&glape,&cherry,&star,&total);
		if(big_bonus == 0 && reg_bonus == 0 && glape == 0 && cherry == 0 && star == 0 && total == 0)break;

		coin = 100;
		coin -= 3*(total-(5*big_bonus+3*reg_bonus+star));
		coin += 15*(big_bonus+reg_bonus);
		coin += 7*glape+2*cherry;
		coin += 13*(5*big_bonus+3*reg_bonus);

		printf("%d\n",coin);
	}

	return 0;
}

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

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

  while(1){
    cin >> b >> r >> g >> c >> s >> t;
    if(!b && !r && !g && !c && !s && !t)break;

    ans = 100;
    ans += c*2 + g*7 + r*63 + b*95 - (t-s)*3;

    cout << ans << endl;
  }
}

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

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

	while (b > 0 || r > 0 || g > 0 || c > 0 || s > 0 || t > 0) {
		cout << 100 + b * 95 + r * 63 + g * 7 + c * 2 + s * 3 - t * 3 << endl;

		cin >> b >> r >> g >> c >> s >> t;
	}

	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){
        int medal = 100;
        medal += 95*b+63*r+7*g+2*c+3*s-3*t;
        cout << medal << endl;
    }
    return 0;
}

C++: #include<iostream>

using namespace std;

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

    coin = 100;
    coin -= t * 3;//コイン投入枚数                                              
    coin += b * 5 + r * 3; //ボーナス中は投入二枚                               
    coin += (b + r) * 15;//ボーナス突入時にも15枚                               
    coin += b * 5 * 15 + r * 3 * 15;//ボーナス中は15枚                          
    coin += g * 7;
    coin += c * 2;
    coin += s * 3;

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

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

int 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 m = 100;
    m -= 3*t;
    int bornas = 5*b + 3*r;
    m += (b+r) * 15;
   
    for(int i=0;i<bornas;i++) m+=15;
    
    m +=7*g;
    m += 2*c;

    m += bornas + 3*s;

    cout << m << endl;

  }

  return 0;
}

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

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 <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cassert>
#include <iostream>
#include <cctype>
#include <sstream>
#include <string>
#include <list>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <map>
#include <utility>
#include <numeric>
#include <algorithm>
#include <iterator>
#include <bitset>
#include <complex>
#include <fstream>
#include <iomanip>
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
typedef vector<int> vint;
typedef pair<int, int> pint;
#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for(int i = x; i < n; i++)
template<class T, class C> void chmax(T& a, C b){ if(a < b) a = b; }
template<class T, class C> void chmin(T& a, C b){ if(b < a) a = b; }
template<class T, class C> pair<T, C> mp(T a, C b){ return make_pair(a, b); }

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 * 15 + r * 15 + g * 7 + c * 2 - (t - b * 5 - r * 3 - s) * 3 - (b * 5 + r * 3) * 2 + (b * 5 + r * 3) * 15 << endl;
}

C++: #include <stdio.h>
#include <iostream>

using namespace std;

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

	while (1) {
		int coin = 100;

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

C++: #include <stdio.h>
int b, r, g, c, s, t;
int main() {
	while(~scanf("%d%d%d%d%d%d", &b, &r, &g, &c, &s, &t)) {
		if(!t) break;
		printf("%d\n", b*85 + r*57 + (g-b*5-r*3)*7 + c*2 + s*1 - t);
	}
	return 0;
}