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 <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>
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> T RoundOff(T a){ return int(a+.5-(a<0)); }
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()
{
    string name;
	int morning, afternoon;
	
	while(cin >> name >> morning >> afternoon)
	{
		cout << name << " " << morning + afternoon << " " << morning * 200 + afternoon * 300 << 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<stdio.h>
int main(void)
{
	char a;
	int s,z,i,f,g;
		while(scanf("%s %d %d",&a,&s,&z)!=EOF){
			f=s+z;
			g=(s*200)+(z*300);
			printf("%c %d %d\n",a,f,g);
			s=0;
			z=0;
			f=0;
			g=0;
		}
	return 0;
}

C++: #include <iostream>
#include <string>
using namespace std;
int keisan(int,int);
int keisanz(int,int);
int main(){
	int a,b,c;
	string str;
	int data,data2;
	for (int i=0;i<9;i++){
		cin>>str>>a>>b;
		data=keisan(a,b);
		data2=keisanz(a,b);
		cout<<str<<" "<<data<<" "<<data2<<endl;
	}
	return 0;
}
int keisan(int a,int b){
	int k=0;
	k=a+b;
	return k;
}
int keisanz(int a,int b){
	int l=0;
	l=a*200+b*300;
	return l;
}

C++: #include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>
#include <sstream>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <numeric>
#include <cmath>
#include <climits>
#include <limits>
#include <cfloat>
#include <fstream>
using namespace std;

int main()
{
//	cut here before submit 
//	freopen("testcase.hh", "r", stdin);
	map<string, pair<int, int > > t;
	string str = "";

	while (getline (cin, str ) ){

		string classname = "";
		int am = 0;
		int pm = 0;

		stringstream ss(str);
		ss >> classname >> am >> pm;

		t.insert (make_pair (classname, make_pair (am, pm ) ) );

	} // end loop

	map<string, pair<int, int > >::iterator it = t.begin();
	for (; it != t.end(); ++it){

		string cn = (*it).first;
		int am = (*it).second.first;
		int pm = (*it).second.second;
		int sum = am + pm;
		int total = 200*am + 300*pm;

		cout << cn << ' ';
		cout << sum << ' ' << total << endl;

	} // end for
		
	return 0;
}

C++: #include<stdio.h>
#include<string.h>
#include<math.h>

int main(){
	char klasse[25];
	int s,a,i,t;
	
	for(i=0;i<9;i++){
		scanf(" %s %d",klasse,&s);
		scanf("%d",&a);
		t=s*200;
		t+=a*300;
		a+=s;
		printf("%s %d %d\n",klasse,a,t);
	}
	return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <vector>
#include <utility>
#include <numeric>
#include <string>
#include <set>
#include <map>
#include <tuple>
#include <queue>
#include <stack>
#define rep(i, a, n) for(int (i) = (int)(a);(i) < (int)(n);++(i))
#define repe(i, a, n) for(int (i) = (int)(a);(i) <= (int)(n);++(i))
#define repr(i, a, n) for(int (i) = (int)(a);(i) > (int)(n);--(i))
#define reper(i, a, n) for(int (i) = (int)(a);(i) >= (int)(n);--(i))
#define SIZE(x) ((int)(x).size())
#define ALL(x) (x).begin(), (x).end()
#define RNG(x, n) &x[0], &x[n]
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define yes cout << "yes" << endl;
#define no cout << "no" << endl;
#define pb push_back
#define EPS (1e-20)
#define INF 2147483647LL
#define MOD 1000000007LL
using llint = long long;
using VI = std::vector<int>;
using PII = std::pair<int, int>;
using SI = std::set<int>;
using MII = std::map<int, int>;
using TIII = std::tuple<int, int, int>;
using namespace std;


int main(){
	string s;
	int a, b;
	rep(i, 0, 9){
		cin >> s >> a >> b;
		cout << s << ' ' << a+b << ' ' << 200*a+300*b << endl;
	}
	return 0;
}

C++: #include <iostream>
#include <string>
using namespace std;
int main(){

  int a,b,i;
  string c;

  for(i=0;i<9;i++){

    cin>>c>>a>>b;

    cout<<c<<" "<<a+b<<" "<<a*200+b*300<<endl;

  }

  return 0;

}

C++: #include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <string>
#define REP(i, n) for(int i = 0;i < n;i++)
#define ll long long
#define INF 114514
using namespace std;




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

C++: #include<iostream>
#include<string>
using namespace std;
int main() {
	string classname[9];
	int AMPM[9][2];
	for (int i = 0; i < 9; i++)
	{
		cin >> classname[i] >> AMPM[i][1] >> AMPM[i][2];
	}
	for (int i = 0; i < 9; i++)
	{
		cout << classname[i] << " " << AMPM[i][1] + AMPM[i][2] << " " << AMPM[i][1] * 200 + AMPM[i][2] * 300 << endl;
	}
	char a__;
	cin >> a__;
}

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

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

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(){
	string str;
	int m,a;

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

	return 0;
}

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