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 <algorithm>

using namespace std;

int main(int argc, char const* argv[])
{
	long long sum[5001];
	int n;

	while( cin >> n && n != 0 ){
		int input;
		for( int i = 0;i < 5001;i++ ) sum[i] = 0;
		cin >> input;
		sum[1] = input;
		for( int i = 2;i <= n;i++ ){
			cin >> input;
			sum[i] = input + sum[i - 1];
		}

		long long answer = -10000000;

		for( int i = 1;i <= n;i++ ){
			for( int j = 0;j < i;j++ ){
				answer = max( answer, sum[i] - sum[j] );
			}
		}

		cout << answer << endl;
	}

			

	return 0;
}

C++: #include "bits/stdc++.h"
using namespace std;
int main() {
	cin.tie(0); ios::sync_with_stdio(false);
	int d;
	while (cin >> d) {
		int area = 0;
		for (int x = d; x <= 600 - d;x += d) {
			area += x*x*d;
		}
		cout << area << endl;
	}
}

C++: #include <iostream>

using namespace std;

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

int main()
{
        int d;

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

        return 0;
}

C++: #include <stdio.h>

int main(void) {
  
  int d,count,s;

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

    count=0;
    s=0;

    for(;count<600;count=count+d) {
      s+=count*count*d;
    }

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

  return 0;

}

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

int main(){
	int d;

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

	return 0;
}

C++: #include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;
int main()
{
    int d, s;
    while(scanf("%d", &d) != EOF) {
        s = 0;
        for (int i = d; i <= 600; i+=d) s+= d * pow((i-d), 2);
        printf("%d\n", s);
    }
    return 0;
}

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

int f(int x){
	return x*x;
}
int main(){
	int i, n, d, S;
	while(cin >> d){
		S = 0;
		n = 600 / d;
		for (i = 1; i < n; i++) {
			S += f(i*d)*d;
		}
		cout << S << endl;
	}
	return 0;
}

C++: #include <stdio.h>

int main( void ){
    int input[ 10000 ];

    int cnt = 0;
    while( scanf( "%d",&input[cnt] ) != EOF ){ cnt++; }
    for( int c = 0;c < cnt;c++ ){
        int res = 0;
        for( int i = 0;i < 599;i++ ){
            res += input[c]*( 1+i ) * input[c];
        }
        printf( "%d\n",res );
    }
    return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;

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

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


int main(){
	for (int i = 0; i < 51; i++){
	int a;
	cin >> a;
	int b = 600 / a;
	cout << a*a*a*(b-1)*b*(2*b-1)/6<<endl;
	}

	return 0;
}

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

int main()
{
    int d, sum = 0;

    while( cin >> d )
    {
        int x = d;
        while( x <= 600 )
        {
            int y = ( x - d ) * ( x - d );      //面積の縦の値(y)は、最初のxの値で計算。dが20-0=20なら、0*20から計算を始める。
            sum += d * y;
            x += d;
        }
        cout << sum << endl;
        sum = 0;
    }
    return 0;
}

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

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

C++: #inlcude <iostream>

using namespace std;
int main(){
  int sum;
  for(int d; cin >> d; ) {
    sum = 0;
    for(int i=1; i*d<=600; i++) {
      sum += d*i*d*i*d;
    }
    cout << sum << endl;
  }
  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;
  }

C++: #include <cstdio>

using namespace std;

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

C++: //include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>

using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

//math
//-------------------------------------------
template<class T> inline T sqr(T x) {return x*x;}

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef unsigned long long ULL;

//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI  = acos(-1.0);

//clear memory
#define CLR(a) memset((a), 0 ,sizeof(a))

//debug
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

int main() {
  int x, y, n = 600;

  while(cin >> x) {
    int result = 0;
    for(int i = x; i < n; i += x) {
      y = i*i;
      result = result + x*y;
    }
    cout << result << endl;
  }
}

C++: #include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<stdio.h>
#include<cmath>
#include<vector>
#include<utility>
#include<stack>
#include<queue>

#define FOR(i, a, b) for(int i=(a);i<=(b);i++)
#define RFOR(i, a, b) for(int i=(a);i>=(b);i--)
#define MOD 1000000007

using namespace std;

int main(void) {
	int total = 0;
	int n;
	int t;
	
	while (cin >> n) {
		total = 0;
		t = 600 - n;
		while (t>0) {
			total += t*t*n;
			t -= n;
		}
		cout << total << endl;
	}
	
	return 0;
}

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

int main(){
	int i, d, x,  s;
	while(cin >> d){
		x = s = 0;
		while(x < X){
			s += (x*x) * d;
			x += d;
		}
		cout << s << endl;
	}
	return 0;
}

C++: #include <iostream>

int main()
{
        int d, s;
        while(std::cin >> d)
        {
                s = 0;
                for(int i = 1; i*d < 600; ++i)
                        s += (i*d)*(i*d)*d;
                std::cout << s << std::endl;
        } 
        return 0;
}

C++: #include <iostream>
#include <stdio.h>
#include <string>
#include <math.h>
#include <algorithm>
using namespace std;
int main(){
	int d, x, y, Y[600];
	int i, sum = 0;

	

	for(i = 0;i < 600;i++){
		Y[i] = 0;
	}
	while(cin >> d){
		for(i = 1;d*i < 600;i++){
			x = d * i;
			y = x * x;
			Y[i] = y * d;
		}
		
		for(i = 1;i < 600;i++){
			sum += Y[i];
		}
		cout << sum << endl;
	}
	return 0;
}