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.h>
#include<cstdio>
#define NN 1000

using namespace std;

int main(){
  int i,j,n,go[NN],ggo[NN],sum[NN],kane1[NN],kane2[NN],kei[NN];
  char clas[NN][NN];
  
  
  
  

  
  for(i=0;i<9;i++){
  cin >> clas[i]  >> go[i] >> ggo[i];
    sum[i]=go[i]+ggo[i]; //nyuujougoukei
    kane1[i]=go[i]*200;
    kane2[i]=ggo[i]*300;
    kei[i]=kane1[i]+kane2[i];
  }

  for(i=0;i<9;i++){
    cout << clas[i]<< " " << sum[i] << " "<< kei[i] << endl;
  }
  
  
  
  

}

C++: #include<iostream>

using namespace std;

int main(){
	char name[10][16]={'\0'};
	int gozen[10]={0},gogo[10]={0};
	const int payGozen=200,payGogo=300;
	
	for(int i=0;i<9;i++){
		cin>>name[i]>>gozen[i]>>gogo[i];
	}
	
	for(int i=0;i<9;i++){
		cout<<name[i]<<" "<<gozen[i]+gogo[i]<<" "<<
			  payGozen*gozen[i]+payGogo*gogo[i]<<endl;
	}
}

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

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

C++: #include<iostream>
#include<string>
using namespace std;
string S;
int a, b;
int main() {
	while (cin >> S >> a >> b) {
		cout << S << ' ' << a + b << ' ' << a * 200 + b * 300 << endl;
	}
}

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

#define rep(i,j,k) for(int i=j;i<k;i++)
#define Sort(x) sort((x).begin(),(x).end())
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define vi vector<int>
#define INF 1000000000
#define MOD 1000000009
#define pb push_back
#define MP make_pair
typedef long long ll;
typedef std::pair<int,int> pii;
int dx[4]={0,1,0,-1},dy[4]={1,0,-1,0};

using namespace std;


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

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

using namespace std;

int main()
{
	char buf[32];
	int am, pm;
	while (scanf(" %s %d %d", buf, &am, &pm) != EOF)
		printf("%s %d %d\n", buf, am+pm, 200*am+300*pm);

	return 0;
}

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

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

#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)

using namespace std;

typedef long long ll;

int main()
{
	vector<string> s;
	vector<pair<int,int> > v;

	rep(i,9)
	{
		string temp;
		int a,b;
		cin >> temp >> a >> b;

		s.push_back(temp);
		v.push_back(make_pair(a,b));
	}

	rep(i,9)
	{
		cout << s[i] << " " << v[i].first + v[i].second << " " << v[i].first*200 + v[i].second*300 << endl;
	}

	
	return 0;
}

C++: #include<iostream>
#include<string>
using namespace std;
string S;
int a, b;
int main() {
	while (cin >> S >> a >> b) {
		cout << S << ' ' << a + b << ' ' << a * 200 + b * 300 << endl;
	}
}

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

int main() {
  std::string s;
  int a, b;

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

  return 0;
}

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

using namespace std;

int main() {
    string tmp;
    int am, pm;
    while (cin >> tmp >> am >> pm) {
        cout << tmp << ' ' << am + pm << ' ' << am * 200 + pm * 300 << endl;
    }
    return 0;
}

C++: using namespace std;

int main(int argc, char const* argv[])
{
	string name;
	int a,b;

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

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

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

C++: // 2011/08/16 Tazoe

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

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

	return 0;
}

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

int main(){
  string s;
  int x, y;
  for (int i = 0; i < 9; i++) {
    std::cin >> s >> x >> y;
    std::cout << s << " " << x + y << " " << 200*x + 300*y << std::endl;
  }
  return 0;
}

C++: #include <iostream>
#include <fstream>
#include <typeinfo>
#include <vector>
#include <cmath>
#include <set>
#include <map>
#include <string>
#include <algorithm>
#include <cstdio>
#include <queue>
#include <iomanip>
#include <cctype>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<P> vp;
typedef vector<vp> vvp;
typedef pair<int,P> pip;
typedef vector<pip> vip;
const int inf=1<<25;
const double pi=acos(-1);
const double eps=1e-8;
const vi emp;

string s;
int a,b;

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

C++: #include<cstdio>
#include<iostream>
using namespace std;
int main(void){
	int i,n[9][2],a,b;
	char str[9][16];
	for(i=0;i<9;i++){
		cin>>str[i];
		cin>>a;
		cin>>b;
		n[i][0]=a+b;
		n[i][1]=a*200+b*300;
	}
	for(i=0;i<9;i++){
		printf("%s %d %d\n",str[i],n[i][0],n[i][1]);
	}
	return 0;
}

C++: #include<iostream>
#include<iomanip>
#include<algorithm>
#include<array>
#include<bitset>
#include<cassert>
#include<cctype>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<functional>
#include<limits>
#include<list>
#include<map>
#include<numeric>
#include<set>
#include<stack>
#include<string>
#include<sstream>
#include<unordered_map>
#include<queue>
#include<vector>
using namespace std;

//#define int long long
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;

#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(a) (a).begin(),(a).end()
#define dump(o) {cerr<<#o<<" "<<o<<endl;}
#define dumpc(o) {cerr<<#o; for(auto &e:(o))cerr<<" "<<e;cerr<<endl;}
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
const int MOD = 1e9 + 7;

signed main() {
	for (string s; cin >> s;) {
		int a, b; cin >> a >> b;
		cout << s << " " << a + b << " " << a * 200 + b * 300 << endl;
	}
	return 0;
}

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

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

  while(cin >> str >> b >> a){
    cout << str << ' ' << b+a << ' ' << b*200+a*300 << endl;
  }

  return 0;
}

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