Go: package main

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

var scanner = bufio.NewScanner(os.Stdin)

func nextString() string {
	scanner.Scan()
	return scanner.Text()
}

func nextInt() (int, error) {
	n, err := strconv.Atoi(nextString())
	return n, err
}

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

func main() {
	scanner.Split(bufio.ScanWords)

	for {
		d, err := nextInt()
		if err != nil {
			break
		}

		area := 0
		for i := 0; i < 600/d; i++ {
			x := i * d
			area += f(x) * d
		}
		fmt.Println(area)
	}
}

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

int main() {
    int a, b, d, sum;
    sum = 0;
    cin >> d;
    for (int i = 1; i <= 600 - d; ++i) {
        a = i * d;
        b = a * d;
        sum = sum + b;
    }
    cout << sum << endl;
    return 0;
}

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

using namespace std;

int main()
{
	int d;
	double area;
	int x;
	//int y;
	while(cin >> d)
	{
		x = 0;
		//d = 0;
		area = 0;
		while(x <= 600 - d)
		{
			area += pow(x,2.0) * d;
			x += d;
			//cout << x << endl;
		}
		printf("%ld\n",(long int)area );
		//cout << area << endl;
	}
	//cout << area << endl;
}

C++: #include <algorithm>
#include <functional>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <bitset>
#include <climits>

#define all(c) (c).begin(), (c).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define pb(e) push_back(e)
#define mp(a, b) make_pair(a, b)
#define fr first
#define sc second

const int INF=100000000;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
using namespace std;
typedef pair<int ,int > P;
typedef long long ll;

int d;
void solve() {
    int sum = 0;
    int a = 600 / d;
    rep(i,a) {
        sum += d*i*d*i*d;
    }
    cout<<sum<<endl;
}

int main() {
    while(cin>>d) {
        solve();
    }
    return 0;
}

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

int main() {
  int d, e, sum;
  while(cin >> d)
    {
      sum = 0;
      for(e = d; e < 600; e += d) sum += e*e;
      sum *= d;
      cout << sum << endl;
    }
  return 0;
}

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

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

int main () 
{
  long long ans;
  int d;
  
  while (cin >> d){
    ans = 0;
    for (int i = 1; i * d < 600; i++){
      ans += i * d * i * d * d;
    }
    cout << ans << endl;
  }

  return 0;
}

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

C++: #include <stdio.h>

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

int main() {
	int d;
	int ans;
	int i;

	while(scanf("%d", &d) != EOF) {
		ans = 0;

		for(i = 0; i < 600 / d; i++)
			ans += d * func(i * d);

		printf("%d\n", ans);
	}

	return 0;
}

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

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

C++: #include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<cassert>
#include<iterator>
#include<complex>
#include<stack>
#include<sstream>
#include<iterator>
using namespace std;
typedef  long long int lint;
typedef pair<int, int> IP;
typedef pair<lint, lint> LLP;
typedef pair<char, char>CP;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define sort(v) sort((v).begin(), (v).end())
#define reverse(v) reverse((v).begin(), (v).end())
#define upper(v,hoge) upper_bound(v.begin(),v.end(),hoge)
#define lower(v,hoge) lower_bound(v.begin(),v.end(),hoge)
#define llower(v,hoge) *lower_bound(v.begin(), v.end(), hoge)
#define lupper(v,hoge) *upper_bound(v.begin(), v.end(), hoge)

int main() {
	int D;
	while (cin >> D) {
		int ans = 0;
		int now = 0;
		while (1) {
			now += D;
			if (now == 600) {
				cout << ans << endl;
				break;
			}
			else {
				ans += D * now * now;
			}
		}
	}
}

C++: #include <stdio.h>

int main(void)
{
	int d;
	int n, i;
	int ans;
	
	n = 600;
	while (scanf("%d", &d) != EOF){
		ans = 0;
		
		for (i = 0; i < n; i += d){
			ans += (d * i * i);
		}
		
		printf("%d\n", ans);
	}
	
	return (0);
}

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

int main()
{
	int d, width;
	int s = 0;
	
	
	while(cin >> d){

		width = d;

		while(d<600){
			s += width * (d*d);

			d += width;
		}
		
		cout << s << endl;
		s = 0;
	}
	return 0;
}