Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
)

var sc = bufio.NewScanner(os.Stdin)

func main() {
	for sc.Scan() {
		d, _ := strconv.Atoi(sc.Text())
		var area int
		for i := 1; i*d < 600; i++ {
			area += d * (d * i) * (d * i)
		}
		fmt.Println(area)
	}
}

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

int f(int x)
{
  return x * x;
}

int main(void)
{
  int a=0, i, d;

  scanf("%d", &d);

  for(i=1; i < 600/d; i++)
  {
    a = d * f(d*i) + a;
  }

  printf("%d", a);

  return 0;
}

C++: #include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (int i = int(n); i >= 0; i--)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define repic(i, a, b) for (int i = int(a); i <= int(b); i++)
#define each(x, y) for (auto &x : y)
#define all(a) (a).begin(), (a).end()
#define bit(b) (1ll << (b))

using namespace std;

using i32 = int;
using i64 = long long;
using u64 = unsigned long long;
using f80 = long double;
using vi32 = vector<i32>;
using vi64 = vector<i64>;
using vu64 = vector<u64>;
using vf80 = vector<f80>;
using vstr = vector<string>;

inline void yes() { cout << "Yes" << '\n'; exit(0); }
inline void no() { cout << "No" << '\n'; exit(0); }
inline i64 gcd(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); if (a % b == 0) return b; return gcd(b, a % b); }
inline i64 lcm(i64 a, i64 b) { return a / gcd(a, b) * b; }
inline u64 xorshift() { static u64 x = 88172645463325252ull; x = x ^ (x << 7); return x = x ^ (x >> 9); }
void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(16); solve(); return 0; }
template <typename T> class pqasc : public priority_queue<T, vector<T>, greater<T>> {};
template <typename T> class pqdesc : public priority_queue<T, vector<T>, less<T>> {};
template <typename T> inline void amax(T &x, T y) { if (x < y) x = y; }
template <typename T> inline void amin(T &x, T y) { if (x > y) x = y; }
template <typename T> inline T power(T x, i64 n, T e = 1) { T r = e; while (n > 0) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; }
template <typename T> istream& operator>>(istream &is, vector<T> &v) { each(x, v) is >> x; return is; }
template <typename T> ostream& operator<<(ostream &os, vector<T> &v) { rep(i, v.size()) { if (i) os << ' '; os << v[i]; } return os; }
template <typename T, typename S> istream& operator>>(istream &is, pair<T, S> &p) { is >> p.first >> p.second; return is; }
template <typename T, typename S> ostream& operator<<(ostream &os, pair<T, S> &p) { os << p.first << ' ' << p.second; return os; }

void solve() {
  int n;
  while (cin >> n) {
    int ans = 0;
    for (int i = 0; i < 600; i += n) {
      ans += i * i * n;
    }
    cout << ans << '\n';
  }
}

C++: <?php  
///$r = trim(fgets(STDIN))
while(fscanf(STDIN, "%d", $r)){  
	$sum = 0;
	for($i = 0; $i < 600; $i+=$r){
		$sum+=($i*$i)*$r;
	}
	echo $sum;
}
?>

C++: /*
　　　　 ∧＿∧　にっぽんちゃちゃちゃ
　／＼（　・∀・）／ヽ
（ ●　と　　　つ　● ）　にっぽんちゃちゃちゃ
　＼/⊂、 ノ　　＼ノ
　　　　　し'
*/
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define repone(i,n) for(int i=1;i<(int)(n);++i)
#define repo(i,o,n) for(int i=o;i<(int)(n);++i)
#define Rep(j,n) for(int j=0;j<(int)(n);++j)
#define Repo(j,o,n) for(int j=o;j<(int)(n);++j)
#define Repone(j,n) for(int j=1;j<(int)(n);++j)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define int long long
#define MOD 1000000007
#define INF 9223372036854775807

signed main()
{
int x=0,y=0,z=0,w=0,n=0,d=0;
while(std::cin >> d){
  for(int i=1;i*d<=600-d;i++){
    y+=(i*d)*(i*d)*d;
  }
  std::cout << y<< '\n';
  y=0;
}
}

C++: #include <cstdio>
#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 <complex>
#include <stack>
#include <queue>
using namespace std;
static const double EPS = 1e-5;
typedef long long ll;
#define FOR(i,n) for(i=0;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)

int main(){
	int d;
	for(;cin>>d;){
		int r=0;
		for(int i=0;i<600;i+=d){
			r+=d*i*i;
		}
		cout<<r<<endl;
	}
	return 0;
}

C++: #include<iostream>

using namespace std;

int main(){
	int d;
	int i, I = 0;

	while(cin >> d){
		for(i=d;i<600;i+=d){
			I += (i * i) * d;
		}
		cout << I << endl;
		I = 0;
	}

	return 0;
}

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

int main()
{
 int d;
 while(cin>>d)
 {
   for(int i=1;i*d<d;++i)
   {
     f=0;
     f=d*(d*i)*(d*i);
    }
    cout<<f<<endl;
   }
   return 0;
   cin.get();
  }

C++: #include <iostream>
#include <cstdio>
#include <cmath>

using namespace std;

int area(int d) {
	return d*pow(d,2);
}

int main() {
	int d;
	while (scanf("%d", &d) != EOF) {
		int sum = 0;
		for (int i=d; i<600; i+=d) {
			sum += area(i);
		}
		cout << sum << endl;
	}
}

C++: #include<iostream>
using namespace std;
int main(){
    long long int d,num=0;
    while(cin >> d){
        num = 0;
        for(int i=d;i<600;i+=d){
            num+=i*i*d;
        }
        cout << num << endl;
    }
    return 0;
}

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

int main(){
int a=0,b=0;
int d;
while(cin>>d){
	a=0;
	b=0;
for(int i=0;i<600/d;i++){
b+=a*a;
a+=d;
}
cout<<b*d<<endl;
}
}

C++: #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<ctime>
#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<memory>
#include<functional>

#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)
#define INF 999999999
using namespace std;

typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<double> vd;
typedef pair<int, int> pii;
typedef pair<long, long> pll;
typedef long long ll;

int dy[] = { 0, 0, 1, -1, 0 };
int dx[] = { 1, -1, 0, 0, 0 };

int Integral(int d){
	int w, h, s;

	w = d; 
	s = 0;
	
	while (w != 600){
		h = w*w;
		s += d*h;
		w += d;
	}

	return s;
}

int main(){
	ios::sync_with_stdio(false);
	int n;

	while (cin >> n){
		printf("%d\n", Integral(n));
	}
}

C++: // 2011/06/17 Tazoe

#include <iostream>
using namespace std;

int main()
{
	while(true){
		int d;
		cin >> d;
		if(cin.eof())
			break;

		int sum = 0;
		for(int i=1; i<600/d; i++)
			sum += i*d*i*d*d;

		cout << sum << endl;
	}

	return 0;
}

C++: while (a=c=gets.to_i)>0
b=0
while c<600
b+=c*c*a
c+=a
end
puts b
end