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<vector>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<string>
#include<sstream>
#include<cmath>
#include<numeric>
#include<map>
#include<stack>
#include<queue>
using namespace std;
int inf = 1000000000;

int main(void) {

  string s; int a, b;
  vector< pair<string, pair<int, int> > > ans;
  while( cin >> s >> a >> b ){
    bool f = false;
    for(int i=0; i<ans.size(); i++){
      if( ans[i].first == s ){
        f = true;
        ans[i].second.second += 200 * a + 300 * b;
        ans[i].second.first += a + b;
      }
    }
    if( !f ) ans.push_back( make_pair(s, make_pair(a+b, 200*a + 300*b)) );
  }
  for(int i=0; i<ans.size(); i++){
    cout << ans[i].first << " " << ans[i].second.first << " " << ans[i].second.second << endl;
  }

  return 0;
}

// EOF

C++: #include <iostream>

using namespace std;

int main()
{
    const int morning = 200;
    const int afternoon = 300;
    string str;
    int m, a;

    while (cin >> str >> m >> a) 
        cout << str << " " << m + a << " "
             << m * morning + a * afternoon << endl;

    return 0;
}

C++: #include<iostream>

using namespace std;

struct classP{
	string name;
	int gozen;
	int gogo;
	int sp;
	int price;
};

int main(){
	 
	classP A[9] = {};
	
	for(int i=0;i<9;i++) {
		
		cin >> A[i].name >> A[i].gozen >> A[i].gogo;
		
		A[i].sp = A[i].gozen + A[i].gogo;
		A[i].price = A[i].gozen * 200 + A[i].gogo * 300;
			
	} 
	for(int i=0;i<9;i++)
	cout << A[i].name << " " << A[i].sp << " "
		 << A[i].price << "\n";
	
		
  	return 0;
}

C++: #include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
//#include <utility>
#include <set>
#include <iostream>
//#include <memory>
#include <string>
#include <vector>
#include <algorithm>
//#include <functional>
#include <sstream>
//#include <deque>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
//#include <cctype>
#include <cstring>
//#include <ctime>
#include <iterator>
#include <bitset>
//#include <numeric>
//#include <list>
//#include <iomanip>

#if __cplusplus >= 201103L
#include <array>
#include <tuple>
#include <initializer_list>
#include <unordered_set>
#include <unordered_map>
#include <forward_list>

#define cauto const auto&
#else

#endif

using namespace std;


namespace{
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> > vvll, vvLL;

#define VV(T) vector<vector< T > >

template <class T>
void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){
    v.assign(a, vector<T>(b, t));
}

template <class F, class T>
void convert(const F &f, T &t){
    stringstream ss;
    ss << f;
    ss >> t;
}


#define reep(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) reep((i),0,(n))
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define F first
#define S second
#define mkp make_pair
#define RALL(v) (v).rbegin(),(v).rend()


#define MOD 1000000007LL
#define EPS 1e-8
static const int INF=1<<24;

void mainmain(){
	string s;
	while(getline(cin,s)){
		stringstream ss;
		ss<<s;
		string s1;
		ss>>s1;
		cout<<s1<<" ";
		int a,b,c=0;
		ss>>a>>b;
		cout<<a+b<<" ";
		cout<<a*200+b*300<<endl;
	}
}



}
main() try{
    mainmain();
}
catch(...){
}

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

C++: #include <iostream>
using namespace std;
/** Problem0173 : Haunted House **/
int main()
{
	int c[9]={0}, num[9];
	string n[9];
	
	for (int i=0; i<9; i++) {
		int am, pm;
		cin >> n[i] >> am >> pm;
		c[i] = am*200 + pm*300;
		num[i] = am+pm;
	}
	
	for (int i=0; i<9; i++)
		cout <<n[i] << " " << num[i] << " " << c[i] << endl;
}

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

struct Tally
{
	Tally(){}
	Tally( string s, int n, int a ) : name( s ), num( n ), amount( a ){}
	string name;
	int num;
	int amount;
};

int main()
{
	vector< Tally > v;
	for( int i = 0; i < 9; ++i ){
		string s;
		int a, b;
		cin >> s >> a >> b;
		v.push_back( Tally( s, a + b, a * 200 + b * 300 ) );
	}
	for( int i = 0; i < 9; ++i ){
		cout << v[ i ].name << " " << v[ i ].num << " " << v[ i ].amount << endl;
	}

	return 0;
}

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

C++: #include <cstdio>
#include <iostream>
using namespace std;
int main() {
    string c;
    int am, pm;
    while (cin >> c) {
        scanf("%d%d",&am,&pm);
        int resp = am + pm;
        int price = am * 200 + pm * 300;
        cout << c;
        printf(" %d %d\n", resp, price);
    }
}

C++: // Tazoe

#include <iostream>
#include <string>
using namespace std;

int main()
{
	for(int i=0; i<9; i++){
		string name;
		int am, pm;
		cin >> name >> am >> pm;

		cout << name << ' ' << am+pm << ' ' << 200*am+300*pm << '\n';
	}

	return 0;
}

C++: #include <iostream>
#include <string>
using namespace std;
int main()
{
	int n, m, i, s[9], p[9];
	string c[9];
	for (i = 0; i < 9; i++)
	{
		cin >> c[i] >> n >> m;
		s[i] = n+m;
		p[i] = n*200 + m*300;
	}
	for (i = 0; i < 9; i++)
		cout << c[i] << " " << s[i] << " " << p[i] << endl;
}

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

char s[9][17];
int a,b,sumx[9],sump[9];

int main(){
	int i;
	for( i = 0;i < 9;i++ ){
		cin >> s[i] >> a >> b;
		sumx[i] = a+b;
		sump[i] = a*200+b*300;
	}
	for( i = 0;i < 9;i++ ){
		cout << s[i] << " " << sumx[i] << " " << sump[i] << endl;
	}
	return 0;
}

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

int main() {
    for (int j = 0; j < 9; ++j) {
        string className;
        int am, pm;
        cin >> className >> am >> pm;
        cout << className << ' ' << (am+pm) << ' ' << (200*am + 300*pm) << endl;
    }
    return 0;
}

C++: #define _USE_MATH_DEFINES
#define MAX_N 1000000
#include <iostream>
#include <sstream>
#include <cmath>
#include <algorithm>
#include <queue>
#include <stack>
#include <limits>
#include <map>
#include <string>
#include <cstring>
#include <set>
#include <deque>
#include <bitset>

using namespace std;

typedef long long ll;
typedef pair<int,int> P;

static const double eps = 1e-8;

int main(){
	char name[32];
	int am,pm;
	while(~scanf("%s %d %d",name,&am,&pm)){
		printf("%s %d %d\n",name,am+pm,am*200+pm*300);
	}
}

C++: #include<iostream>
#include<math.h>
#include<vector>
#include<algorithm>
#include<cstdio>
#include <string>
#include <complex>
#include <functional>
using namespace std;
typedef pair<int,int> P;

int main(){
    string name;
    int am,pm,cnt,mo;
    int i;
    for(i=0;i<9;i++){
        cin>>name>>am>>pm;
        cnt=am+pm;
        mo=am*200+pm*300;
        cout<<name<<" "<<cnt<<" "<<mo<<endl;
    }
    return 0;
}

C++: 1a 132 243
1c 324 183
1f 93 199
2b 372 163
2c 229 293
2e 391 206
3a 118 168
3b 263 293
3d 281 102

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

int main(){
  int b,a;
  string name;

  for(int i=0;i<9;i++){
    cin >> name >> b >> a;
    cout << name << " " << b+a << " " <<  b*200+a*300 << endl;
  }
}