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 <bits/stdc++.h>
using namespace std ;

#define pb(n) push_back(n)
#define fi first
#define se second
#define all(r) (r).begin(),(r).end()
#define gsort(st,en) sort((st),(en),greater<int>())
#define vmax(ary) *max_element(all(ary))
#define vmin(ary) *min_element(all(ary))
#define debug(x) cout<<#x<<": "<<x<<endl
#define fcout(n) cout<<fixed<<setprecision((n))
#define scout(n) cout<<setw(n)
#define vary(type,name,size,init) vector< type> name(size,init)

#define rep(i,n) for(int i = 0; i < (int)(n);++i)
#define REP(i,a,b) for(int i = (a);i < (int)(b);++i)
#define repi(it,array) for(auto it = array.begin(),end = array.end(); it != end;++it)
#define repa(n,array) for(auto &n :(array))

using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using dict = map<string,int>;
using pii = pair<int,int> ;

const int mod = 1000000007;
constexpr int imax = ((1<<30)-1)*2+1 ;
constexpr int inf = 100000000;
constexpr double PI = acos(-1.0) ;
double eps = 1e-10 ;
const int dy[] = {-1,0,1,0};
const int dx[] = {0,-1,0,1};

inline bool value(int x,int y,int w,int h){
  return (x >= 0 && x < w && y >= 0 && y < h);
}

template<typename T>
void Unique(vector<T> &v){
  sort(all(v));
  v.erase(unique(all(v)),v.end());
}

template<typename T>
T ston(string& str, T n){
  istringstream sin(str) ;
  T num ;
  sin >> num ;
  return num ;
}

void Ans(bool f){
  if(f) cout << "YES"<<endl;
  else cout << "NO"<<endl;
}

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  ll b,r,g,c,s,t;
  while(cin >> b >> r >> g >> c >> s >> t){
    if(b+r+g+c+s+t == 0) break;
    ll ans = 100;
//     ll X = t - (b + r + g + c + s +(b+r) * 5);
    ans += b*15;
    ans += r * 15;
    ans += g * 7;
    ans += c * 2;
    ans += 15 * (b * 5 + r * 3);
    ll a = 3 *( t - s - b * 5 -r * 3) ;
    ll c = 2 * (b * 5 + r*3);
    ans -= a+c;
    cout << ans << endl;
  }
  return 0;
}

C++: #include <iostream>
using namespace std;
int main(){
  int b,r,g,c,s,t,now,cnt;
  while(1){
    cin >> b >> r >> g >> c >> s >> t;
    if(b==0&&r==0&&g==0&&c==0&&s==0&&t==0) break;
    now=100;
    now=now-t*3+(b*5+r*3)+s*3;
    now=now+b*15+b*5*15+r*15+r*3*15+g*7+c*2;
    cout << now << endl;
  }
  return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
int main()
{
    int big,regu,nob,ci,su,t;
    while(cin>>big>>regu>>nob>>ci>>su>>t,big,regu,nob,ci,su,t)
        cout<<100+ci*2+nob*7+regu*60+big*90-(t-su)*3+big*5+regu*3<<endl;

}

C++: #include <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>

#define mp       make_pair
#define pb       push_back
#define all(x)   (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define repi(i,a,b) for(int i = (a); i < (b); i++)

using namespace std;

typedef    long long          ll;
typedef    unsigned long long ull;
typedef    vector<bool>       vb;
typedef    vector<int>        vi;
typedef    vector<vb>         vvb;
typedef    vector<vi>         vvi;
typedef    pair<int,int>      pii;

const int INF=1<<29;
const double EPS=1e-9;

const int dx[]={1,0,-1,0},dy[]={0,-1,0,1};

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

C++: #include<stdio.h>
int main(){
	int a,b,c,d,e,f;
	while(scanf("%d%d%d%d%d%d",&a,&b,&c,&d,&e,&f),a+b+c+d+e+f){
		printf("%d\n",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<bits/stdc++.h>
using namespace std;
main(){
  while(1){
    long long b,r,g,c,s,t;
    cin>>b>>r>>g>>c>>s>>t;
    if(b==0&&r==0&&g==0&&c==0&&s==0&&t==0) break;
    t-=s;
    long long medal=100;
    medal+=g*7+c*2-(g+c)*3;
    t-=(c+g);
    long long bonus=b*5+r*3;
    medal+=(b+r)*15+bonus*13-(b+r)*3;
    t-=(b+r+bonus);
    medal-=t*3;
    cout<<medal<<endl;
  }
}

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

int main(){
  int i,j,b,r,g,c,s,t,ans;
  while(1){
    cin >> b >> r >> g >> c >> s >> t;
    if(!b && !r && !g && !c && !s && !t) break;

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

    cout << ans << endl;

  }
  return 0;
}

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

C++: #include <iostream>
#include <complex>
#include <sstream>
#include <string>
#include <algorithm>
#include <deque>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <vector>
#include <set>
#include <limits>
#include <cstdio>
#include <cctype>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <ctime>
using namespace std;
#define REP(i, j) for(int i = 0; i < (int)(j); ++i)
#define FOR(i, j, k) for(int i = (int)(j); i < (int)(k); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define REVERSE(v) reverse((v).begin(), (v).end())
typedef complex<double> P;

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

C++: #include <iostream>

using namespace std;

int main() {

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

	while(cin >> b >> r >> g >> c >> s >> t) {
		if(b==0&&r==0&&g==0&&c==0&&s==0&&t==0)
			break;
		m=100;
		m+=80*b+54*r+7*g+2*c;
		t-=(s+5*b+3*r);
		m-=3*t;

		cout << m << endl;
		
	}

	return 0;

}

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

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

C++: #include<stdio.h>
#include<algorithm>
#include<iostream>
using namespace std;

int main(){ 

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

  while(1){

    int bonus;      //ボーナスタイムの数
    int use_coin;   //回すために使ったコインの枚数
    int lost_turn;  //獲得コインが0だった回数
    int profits;    //利益

    scanf("%d %d %d %d %d %d",&b,&r,&g,&c,&s,&t);

    if(t==0)break;

    /*損したコインの枚数を計算する*/
    
    /*総プレイ回数の内ボーナスタイムの数を調べる*/
    bonus=b*5+r*3;

    /*総プレイ回数の内獲得が0だった回数を調べる*/
    lost_turn=t-(bonus+b+r+g+c+s);

    /*回すのに使ったコインの枚数を計算*/
    use_coin=lost_turn*3;

    /*利益を計算*/
    profits=100+b*12+r*12+bonus*13+g*4-c;

    /*差し引いた額を出力*/
    printf("%d\n",profits-use_coin);

  }

  return 0;
}