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<stdio.h>
int main(void)
{
	int a,s,d,f[10],h[10],i,j;
	char g[16][10];
	for(i=1;i<=9;i++){
		scanf("%s %d %d",g[i],&s,&d);
		f[i]=s*200+d*300;
		h[i]=s+d;
	}
	for(i=1;i<=9;i++){
		printf("%s %d %d\n",g[i],h[i],f[i]);
	}
	return 0;
}

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

int main() {

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

	return 0;
}

C++: // clang-format off
#include <bits/stdc++.h>
#define int long long
#define main signed main()
// #define main int main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecision(n)
#define stlice(from, to) substr(from, (to) - (from) + 1)
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
using namespace std;
using pii = pair<int, int>;
using vi = vector<int>;
using vd = vector<double>;
using vc = vector<char>;
using vb = vector<bool>;
using vs = vector<string>;
using vpii = vector<pii>;
using vvi = vector<vi>;
using vvb = vector<vb>;
using vvpii = vector<vpii>;
template<typename A> using fn = function<A>;
constexpr int INF = sizeof(int) == sizeof(long long) ? 1000000000000000000LL : 1000000000;
constexpr int MOD = 1000000007;
constexpr double PI = acos(-1);
template<typename A, typename B> bool cmin(A &a, const B &b) { return a > b ? (a = b, true) : false; }
template<typename A, typename B> bool cmax(A &a, const B &b) { return a < b ? (a = b, true) : false; }
constexpr bool odd(const int &n) { return n & 1; }
constexpr bool even(const int &n) { return !odd(n); }
void solve();
main { solve(); return 0; }
// clang-format on

void solve() {
  string s;
  int a, b;
  while (cin >> s >> a >> b) {
    cout << s << ' ' << a + b << ' ' << 200 * a + 300 * b << endl;
  }
}

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

using namespace std;

int main()
{
	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>
#include<string>
using namespace std;
struct HauntedHouse{
  int beforenoon;
  int afternoon;
  string name;
  int getTotalCustmor(){
    return beforenoon + afternoon;
  }
  int getAward(){
    return beforenoon * 200 + afternoon * 300;
  }
};
int main(){
  HauntedHouse hh[9];
  for(int i = 0; i < 9; ++i){
    cin >> hh[i].name >> hh[i].beforenoon >> hh[i].afternoon;
  }
  for(int i = 0; i < 9; ++i){
    cout << hh[i].name << ' ' <<
      hh[i].getTotalCustmor() << ' ' <<
      hh[i].getAward() << endl;
  }
  return 0;
}

C++: #include<iostream>
#include<string>
using namespace std;
int main(){
	int am,pm;
	string c;
	for(int i=0; i<9; i++){
		cin >> c >> am >> pm;
		if( (c.size() < 1 && c.size() > 15 ) || am > 400 || pm > 400) return 0;
		cout << c << " " << am+pm  << " " << 200*am+300*pm << endl;
	}
	return 0;
}

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

C++: #include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <complex>
#include <cstring>
#include <cstdlib>
#include <string>
#include <cmath>
#include <queue>
using namespace std;

#define REP(i,n) for(int i=0;i<(int)n;++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
#define INF 1<<30

int main() {
  string s;
  int a,b;
  while(cin >> s >> a >> b) {
    cout << s;
    printf(" %d %d\n", a+b, a*200+b*300);
  }
}

C++: #include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <utility>
#include <cstring>
#include <iomanip>
#include <numeric>
#include <limits>
#include <cmath>
#include <cassert>
#include <map>

using namespace std;
using ll = long long;

const int INF = 1<<30;
const int MOD = (int)1e9 + 7;
const int MAX_N = (int)1e5 + 5;
#define debug(x) cout << #x << ": " << x << endl

signed main(void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    vector<pair<string, pair<int, int>>> v;
    string name; int a, b;
    while(cin >> name >> a >> b)
    {
        v.push_back(make_pair(name, make_pair(a + b, a * 200 + b * 300)));
    }
    for(auto &&x : v)
    {
        cout << x.first << " " << x.second.first << " " << x.second.second << endl;
    }
    return 0;
}

C++: #include <stdio.h>

int main(void) {

  int am,pm;
  char class[20];

  int i;

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

    scanf("%s %d %d",class,&am,&pm);
    
    printf("%s %d %d\n",class,am+pm,am*200+pm*300);
    
  }

  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};
        int sum[9] = {0}, syu[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++) {
            sum[i] = noon[i] + after[i];
            syu[i] = (noon[i] * 200) + (after[i] * 300);
        }
        int i = 0;
        
        for (classI = classes.begin(); classI != classes.end(); classI++) {
            
            cout << *classI << " " << sum[i] << " " << syu[i] << endl;
            i++;
        }
    return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <iomanip>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;

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

C++: #include <stdio.h>
int main()
{
	char name[9][16];
	int AM[9],PM[9],sum[9],income[9];
	for(int i=0;i<9;i++){
		scanf("%s %d %d",name[i],&AM[i],&PM[i]);
		sum[i]=AM[i]+PM[i];
		income[i]=200*AM[i]+300*PM[i];
	}
	for(int i=0;i<9;i++)
		printf("%s %d %d\n",name[i],sum[i],income[i]);
	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;}