Go: package main

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

var scanner = bufio.NewScanner(os.Stdin)

func main() {
	for i := 0; i < 9; i++ {
		scanner.Scan()
		buf := strings.Split(scanner.Text(), " ")
		name := buf[0]
		am, _ := strconv.Atoi(buf[1])
		pm, _ := strconv.Atoi(buf[2])
		visitor := am + pm
		income := am*200 + pm*300
		fmt.Printf("%s %d %d\n", name, visitor, income)
	}
}

C++: #include <iostream>
#include <string>
using namespace std;
int main(){
	string name[500];
	int a[500],b[500];
	int i=0;
	while(cin >> name[i] >> a[i] >> b[i] )
		i++;
	int n=i;
	for( i=0 ; i<n ; i++ )
		cout << name[i] <<" "<<a[i]+b[i]<<" "<<(a[i]*200)+(b[i]*300)<<endl;
	return 0;
}

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

int main() {
	string str[9]; int a[9]; long b[9];
	for(int i=0;i<9;i++){
		int tmp; long TMP;
		cin >> str[i] >> tmp >> TMP ;
		a[i]=tmp+TMP;
		b[i]=tmp*200+TMP*300;
	}
	for(int i=0;i<9;i++) cout << str[i] << ' ' << a[i] << ' ' << b[i] << '\n' ;
}

C++: #include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define RFOR(i,a,b) for(int i=(b) - 1;i>=(a);i--)
#define REP(i,n) for(int i=0;i<(n);i++)
#define RREP(i,n) for(int i=n-1;i>=0;i--)

#define PB push_back
#define INF INT_MAX/3
#define ALL(a) (a).begin(),(a).end()
#define CLR(a) memset(a,0,sizeof(a))

typedef long long int ll;

using namespace std;

int main(){
    REP(i,9){
	string name;
	int p,t1,t2;
	cin >> name >> t1 >> t2;
	printf("%s %d %d\n",name.c_str(),t1+t2,t1*200+t2*300);
    }
    return 0;
}

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

#define rep(i,n) for(int (i)=0; (i)<(int)(n); ++(i))
#define foreach(c,i) for(__typeof((c).begin()) i=(c).begin();i!=(c).end();i++)

int main() {
  string cls;
  int am, pm;
  rep (i,9) {
    cin >> cls >> am >> pm;
    cout << cls << " " << am + pm << " " << am * 200 + pm * 300 << endl;
  }
  return 0;
}

C++: #include <iostream>
#include <vector>
#include <string>
using namespace std;
typedef pair<int, int> P;

void solve()
{
	vector<P> Num(9);
	vector<string> str(9);

	for(int i = 0; i < 9; ++i)
	{
		cin >> str[i] >> Num[i].first >> Num[i].second;
	}
	for(int i = 0; i < 9; ++i)
	{
		cout << str[i] << " " << Num[i].first + Num[i].second << " " << Num[i].first * 200 + Num[i].second * 300 << endl;
	}
}

int main()
{
	solve();
	return(0);
}

C++: #include<cstdio>
int a,b,d=400;int main(){for(char c[d];~scanf("%s%d%d",c,&a,&b);a=a/d?d:a,printf("%s %d %d00\n",c,a+b,a*2+b*3))b=b/d?d:b;}

C++: #include<bits/stdc++.h>
using namespace std;
int main(void)
{
	int i,j,k,n,s1,s2;
	char name[16];
	for(i=0;i<9;i++) {
		cin>>name>>s1>>s2;
		cout<<name<<" "<<s1+s2<<" "<<(s1*200)+(s2*300)<<endl;
	}
	return 0;
}

C++: #include <iostream>

int main()
{
	std::string name; int am, pm;
	while (std::cin >> name >> am >> pm) {
		std::cout << name << " " << am + pm << " " << 200*am + 300*pm << std::endl;
	}
	return 0;
}

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

int main(){
  string classes[1111];
  int mo,af;
  int to[1111],money[1111];
  for(int i=0;i<9;i++){
    cin >> classes[i];
    cin >> mo >> af;
    to[i] = mo + af;
    money[i] = mo*200 + af*300;
  }
  for(int i=0;i<9;i++){
    cout << classes[i] << " " << to[i] << " " << money[i] << endl;;
  }
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
#include <string>

using namespace std;

int main(){

	string str;
	int a,b;
	while(cin>>str>>a>>b){
		cout<<str<<" "<<a+b<<" "<<a*200+b*300<<endl;
	}

	return 0;
}

C++: 
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <memory>
#include <string>

#include <algorithm>
#include <complex>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#include <bitset>

using namespace std;

#ifdef _MSC_VER
#define __typeof__ decltype
#define strtok_r strtok_s
#endif

#define ITER(c)             __typeof__((c).begin())
#define FOREACH(it, c)      for (ITER(c) it=(c).begin(); it != (c).end(); ++it)
#define RITER(c)            __typeof__((c).rbegin())
#define RFOREACH(it, c)     for (RITER(c) it=(c).rbegin(); it != (c).rend(); ++it)
#define REP(i, n)           REPEAT(i, 0, n)
#define RREP(i, n)          RREPEAT(i, 0, n)
#define REPEAT(i, k, n)     for(int i = (k); i < ((k)+(n)); ++i)
#define RREPEAT(i, k, n)    for(int i = (k)+(n)-1; i >= (k); --i)
#define FROMTO(i,f,t)       for(int i = f; i < t; i++)
#define ALL(c)              (c).begin(), (c).end()
#define LLPOW(p1,p2)        ((ll)pow((double)(p1), (int)p2))
#define ESIZEOF(A)          (sizeof(A)/sizeof((A)[0]))
#define CIN_NO_SYNC         do { cin.tie(0); ios_base::sync_with_stdio(false); } while(0)
#define GETSTR(p)           fgets((p), sizeof(p), stdin)
#define CHOMP(p)            do{ char *_q = (p) + strlen(p)-1; if(*_q == '\n' || *_q == '\r') *_q = 0; } while(0)
#define FILL(m,v)           memset(m, v, sizeof(m))
#define mp                  make_pair
#define pb                  push_back
template<class _T> _T MAX(_T p1,_T p2){return (p1>p2)?p1:p2;} 
template<class _T> _T MIN(_T p1,_T p2){return (p1<p2)?p1:p2;} 
template <class _Tv> inline string join(const _Tv &v,string sep=" "){
    ostringstream s;FOREACH(it,v){if(it!=v.begin())s<<sep;s<<*it;};return s.str();
}

typedef long long ll;
typedef unsigned long long ull;
typedef double D;
typedef complex<D> P;
typedef vector<int> VI;
typedef vector<VI> VVI;
#define X real()
#define Y imag()
#define EPS (1e-9)
#define DEQ(p1,p2) (abs((p1)-(p2)) < EPS)

#ifdef _DEBUG
template<class _Tv> inline void _prfe(const char *_n,const _Tv _c,bool _p=false){
    ITER(_c) _it=_c.begin();
    if(_p){cout<<_n<<" = ["<<endl;for(;_it!=_c.end();++_it)cout<<"    "<<*_it<<endl;cout<<"]"<<endl; }
    else{cout<<_n<<" = [ ";if(_c.size()){cout<<*_it++;for(;_it!=_c.end();++_it)cout<<", "<<*_it;}cout<<" ]"<<endl; }
}
ostream &operator<<(ostream &os, const pair<int,int> &p){return(os<<"("<<p.first<<","<<p.second<<")");}
#define pf printf
#define pr(n) do{cout<<#n" = "<<(n)<<endl;}while(0)
#define prfe(n) _prfe(#n, n)
#define prfep(n) _prfe(#n, n, true)
#define dbgchk(n) do{if(n)throw;}while(0)
#else
#define pf(...) /* */
#define pr(...) /* */
#define prfe(...) /* */
#define prfep(...) /* */
#define dbgchk(...) /* */
#endif

int main(){
    string s; int n,m;
    while(cin >> s >> n >> m){
        cout << s << " " << n+m << " " << n*200+m*300 << endl;
    }
    return 0;
}

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

int main() {
  string s;
  int a, b;
  ostringstream os;
  for (int i = 0; i < 9; i++) {
    cin >> s >> a >> b;
    os << s << " " << a + b << " " << a * 200 + b * 300 << "\n";
  }
  cout << os.str();
}

C++: #include <iostream>
#include<string>
using namespace std;
 
int main() {
    string moji;
    int a,b,i;
    for(i=0;i<9;i++){
        cin>>moji;
        cin>>a>>b;
        cout<<moji<<" "<<a+b<<" "<<a*200+b*300<<endl;
    }
    return 0;
}

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

int main() {
	while (1) {
		string a; int b, c;
		cin >> a >> b >> c;
		if (cin.fill())break;
		cout << a << " " << b + c <<" "<< b * 200 + c * 300 << endl;
	}
}

C++: include<cstdio>
int a,b,d=400;int main(){for(char c[d];~scanf("%s%d%d",c,&a,&b);a=a/d?d:a,printf("%s %d %d\n",c,a+b,a*200+b*300))b=b/d?d:b;}

C++: #include<stdio.h>
int main()
{
	char s[16];
	int a,b,i;
	for(i=0;i<9;i++){
		scanf("%s%d%d",s,&a,&b);
		printf("%s %d %d\n",s,a+b,a*200+b*300);
	}
	return 0;
}