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 <bits/stdc++.h>

using namespace std;
using ll = long long;
using VI = vector<int>;
using VL = vector<ll>;
using VS = vector<string>;
using VB = vector<bool>;
using VVB = vector<vector<bool>>;
using VVI = vector<VI>;
using VVL = vector<VL>;
using PII = std::pair<int, int>;
using VPII = std::vector<std::pair<int, int>>;
using PLL = std::pair<ll, ll>;
using VPLL = std::vector<std::pair<ll, ll>>;
using TI3 = std::tuple<int, int, int>;
using TI4 = std::tuple<int, int, int, int>;
using TL3 = std::tuple<ll, ll, ll>;
using TL4 = std::tuple<ll, ll, ll, ll>;

#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define rep3(i, s, n, d) for (int i = (s); i < (int)(n); i += (d))
#define allpt(v) (v).begin(), (v).end()
#define allpt_c(v) (v).cbegin(), (v).cend()
#define allpt_r(v) (v).rbegin(), (v).rend()
#define allpt_cr(v) (v).crbegin(), (v).crend()

const int mod1 = 1e9 + 7, mod2 = 998244353, mod3 = 1e9 + 9;
const int mod = mod1;
const ll inf = 1e18;

const string wsp = " ";
const string tb = "\t";
const string rt = "\n";

template <typename T>
void show1dvec(const vector<T> &v)
{
    if (v.size() == 0)
        return;
    int n = v.size() - 1;
    rep(i, n) cout << v[i] << wsp;
    cout << v[n] << rt;

    return;
}

template <typename T>
void show2dvec(const vector<vector<T>> &v)
{
    int n = v.size();
    rep(i, n) show1dvec(v[i]);
}

template <typename T, typename S>
void show1dpair(const vector<pair<T, S>> &v)
{
    int n = v.size();
    rep(i, n) cout << v[i].first << wsp << v[i].second << rt;
    return;
}

template <typename T, typename S>
void pairzip(const vector<pair<T, S>> &v, vector<T> &t, vector<T> &s)
{
    int n = v.size();
    rep(i, n)
    {
        t.push_back(v[i].first);
        s.push_back(v[i].second);
    }
    return;
}

template <typename T>
void maxvec(vector<T> &v)
{
    T s = v[0];
    int n = v.size();
    rep(i, n - 1)
    {
        if (s > v[i + 1])
        {
            v[i + 1] = s;
        }
        s = v[i + 1];
    }
}

template <typename T, typename S>
bool myfind(T t, S s)
{
    return find(t.cbegin(), t.cend(), s) != t.cend();
}

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

bool iskadomatsu(int a, int b, int c)
{
    return (a != b && b != c && c != a) && ((a > b && b < c) || (a < b && b > c));
}

double euc_dist(PII a, PII b)
{
    return sqrt(pow(a.first - b.first, 2) + pow(a.second - b.second, 2));
}

VS split(string s, char c)
{
    VS ret;
    string part;
    s += c;
    rep(i, s.length())
    {
        if (s[i] == c)
        {
            ret.emplace_back(part);
            part = "";
        }
        else if (s[i] != c)
        {
            part += s[i];
        }
    }
    return ret;
}

template <typename T, typename S, typename R>
ll pow_mod(T p, S q, R mod = 1ll)
{
    ll ret = 1, r = p;
    while (q)
    {
        if (q % 2)
            ret *= r, ret %= mod;
        r = (r * r) % mod, q /= 2;
    }
    return ret % mod;
}

template <typename T, typename S>
ll pow_no_mod(T p, S q)
{
    ll ret = 1, r = p;
    while (q)
    {
        if (q % 2)
            ret *= r;
        r = (r * r), q /= 2;
    }
    return ret;
}

void make_frac_tables(VL &frac_list, VL &frac_inv_list)
{
    rep(i, frac_list.size() - 1)
    {
        frac_list[i + 1] *= frac_list[i] * (i + 1);
        frac_list[i + 1] %= mod;
        frac_inv_list[i + 1] *= frac_inv_list[i] * pow_mod(i + 1, mod - 2, mod);
        frac_inv_list[i + 1] %= mod;
    }
}

ll comb(int a, int b, const VL &frac_list, const VL &frac_inv_list)
{
    if (a < b)
        return 0;
    if (b < 0)
        return 0;
    ll ret = frac_list[a];
    ret *= frac_inv_list[b];
    ret %= mod;
    ret *= frac_inv_list[a - b];
    ret %= mod;
    return ret;
}

string transforming(string s)
{
    string ret;
    int n = s.size();
    int counter = 1;
    char chara = s[0];
    rep(i, n)
    {
        if (i == n - 1 || s[i] != s[i + 1])
        {
            ret += to_string(counter);
            ret += chara;
            chara = s[i + 1];
            counter = 1;
        }
        else
        {
            counter++;
        }
    }
    return ret;
}



int main()
{

    // cin.tie(0);
    // ios::sync_with_stdio(false);

#ifdef DEBUG
    cout << "DEBUG MODE" << endl;
    ifstream in("input.txt"); //for debug
    cin.rdbuf(in.rdbuf());    //for debug
#endif

    string s;
    int a, b;
    rep(i, 9)
    {
        cin >> s >> a >> b;
        cout << s << wsp << a + b << wsp << 200 * a + 300* b << rt;
    }

    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 %d\n",c,a+b,a*200+b*300))b=b/d?d:b;}

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

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

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

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

}

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

C++: #include<iostream>
#include<string>
using namespace std;
string S; int a, b;
int main() {
	while (cin >> S) {
		a = 0; b = 0;
		if (S == "0") { break; }
		for (int i = 1; i < S.size(); i++) {
			if (S[i] == 'A') {
				a++;
			}
			else {
				b++;
			}
		}
		if (a > b) {
			a++;
		}
		else {
			b++;
		}
		cout << a << ' ' << b << endl;
	}
}

C++: #include <iostream>
#include <string>
using namespace std;
#define rep2(x,from,to) for(int x=(from);x<(to);++(x))
#define rep(x,to) rep2(x,0,to)
int main(){
	string s;
	int am, pm;
	while(cin >> s) {
		cin >> am >> pm;
		cout << s << " " << am + pm << " " << am * 200 + pm * 300 << endl;
	}
    return 0;
}

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

using namespace std;

vector<string> classes;
vector<string>::iterator classI;

int main() {
        int noon[9] = {0}, after[9] = {0};
        classes.clear();
        string classtemp;
        
        
        for(int i = 0; i < 9; i++) {
        cin >> classtemp;
        
        cin >> noon[i] >> after[i];
        classes.push_back(classtemp);
        }
        
        for(int i = 0; i < 9; i++) {
            noon[i] *= 200;
            after[i] *= 300;
        }
        int i = 0;
        
        for (classI = classes.begin(); classI != classes.end(); classI++) {
            cout << *classI << " " << noon[i] << " " << after[i] << endl;
        }
    return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;

int main() {
    string name[9];
    int c[9], d[9];
    for (int i = 0, a, b; i < 9; i++) {
        cin >> name[i] >> a >> b;
        c[i] = a + b;
        d[i] = 200 * a + 300 * b;
    }
    for (int i = 0; i < 9; i++) {
        cout << name[i] << ' ' << c[i] << ' ' << d[i] << endl;
    }
}