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>
using namespace std;

int main()
{
  int d;
  int n;
  long square[600], s;
  int max=0;
  int i;

  square[0]=0;
  while(cin>>d){
    n=600/d-1;
    if(max<n){
      for(i=max+1; i<=n; i++){
        square[i]=square[i-1]+i*i;
      }
      max=n;
    }
    s=square[n]*d*d*d;
    printf("%ld\n", s);
  }

  return 0;
}

C++: #include<iostream>

using namespace std;

int main() {
	int d;
	while (cin >> d) {
		int total = 0, tmp = d;
		for (d; 600 - d > 0; d += tmp) {
			total += tmp * d*d;
		}
		cout << total << endl;
	}
}

C++: #include <cstdio>
#include <algorithm>
#include <stack>
#include <cmath>
using namespace std;

#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 llong long long

int main() {
  int d;
  while(scanf("%d", &d) != EOF) {
    int s = 0;
    FOR(i,1,600/d) {
      s += d*(int)pow(i*d,2);
    }
    printf("%d\n",s);
  }
  return 0;
}

C++: #include<iostream>
#include<cstdio>
using namespace std;
int main()
{
    int w;
    while(scanf("%d",&w) && w)
    {

        int i;
        long long area = 0;
        for(i=w;i<600;i+=w)
        {
            area += w*i*i;
        }
        printf("%lld\n",area);
    }

}

C++: #include<stdio.h>
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
/*
long long int tks(long long int D,long long int ans){
	int y=D;
	ans+=D*D*y;
	
	


}
*/
int main(){
	
	
	int D=0;
	
	while(cin>>D){
long long int ans=0;
int y=0;
	while(1){
		y+=D;
		if(y>=600)break;
		ans+=y*y*D;
	}
	cout<<ans<<endl;}
	return 0;
}

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

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

C++: #include <iostream>

using namespace std;

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

	while(cin >> d){

	for(int i=0; i<600/d; i++){
	sum = sum + d * (i*d)*(i*d);
	}
	cout << sum << endl;
	}

}

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

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

C++: #include<bits/stdc++.h>
#include<vector>
#include<list>
#include<stack>
#include<queue>
#include<algorithm>
using namespace std;


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

        printf("%ld\n",ans);
    }
    return 0;
}

C++: #include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <deque>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <bitset>
#include <algorithm>
#include <numeric>
#include <complex>
#include <functional>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>

using namespace std;

#define dump(n) cout<<"# "<<#n<<"="<<(n)<<endl
#define debug(n) cout<<__FILE__<<","<<__LINE__<<": #"<<#n<<"="<<(n)<<endl
#define repi(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,n) repi(i,0,n)
#define iter(c) __typeof((c).begin())
#define tr(c,i) for(iter(c) i=(c).begin();i!=(c).end();i++)
#define allof(c) (c).begin(),(c).end()
#define mp make_pair

typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;

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

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

int d, s;

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

C++: #include <stdio.h>

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

int main(){
	int d,s;

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

	return 0;
}

C++: #include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;

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

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

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

typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int> > vii;
#define rrep(i, m, n) for(int (i)=(m); (i)<(n);  (i)++)
#define erep(i, m, n) for(int (i)=(m); (i)<=(n); (i)++)
#define  rep(i, n)    for(int (i)=0; (i)<(n);  (i)++)
#define  rev(i, n)    for(int (i)=(n)-1; (i)>=0; (i)--)
#define vrep(i, c)    for(__typeof((c).begin())i=(c).begin(); i!=(c).end(); i++)
#define  ALL(v)       (v).begin(), (v).end()
#define mp            make_pair
#define pb            push_back
template<class T1, class T2> inline void minup(T1& m, T2 x){ if(m>x) m=static_cast<T2>(x); }
template<class T1, class T2> inline void maxup(T1& m, T2 x){ if(m<x) m=static_cast<T2>(x); }

#define INF 1000000000
#define MOD 1000000007
#define EPS 1E-12

int dx;

int main()
{
  while(cin >> dx){
    int res = 0;
    for(int d=dx; d<600; d+=dx) res += dx * d * d;
    cout << res << endl;
  }

  return 0;
}

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

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

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

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

C++: #include <iostream>

using namespace std;

int main(void) {
	int d;

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

C++: #include <iostream>
using namespace std;
int d;
int f(int x){
    return x*x;
}
int solve(){
    int r=0;
    for(int i=0; i*d<600; i++){
        r += f(i*d)*d;
    }
    return r;
}
signed main(){
    while(cin >> d){
        cout << solve() << endl;
    }
}

C++: #include <stdio.h>

int
main(void)
{
	char line[80];
	int d;

	while (fgets(line, sizeof line, stdin)) {
		if (sscanf(line, "%d", &d) == 1) {
			int s = 0;
			for (int i = 1; d*i <= 600 - d; i++) {
				s += (d*i)*(d*i) * d;
			}
			printf("%d\n", s);
		}
	}

	return 0;
}

C++: #include <iostream>

using namespace std;

int h(int d) {
	return d*d;
}

int s(int d) {
	int n = 600/d; bool plus = (600%d==0 ? 0 : 1);
	int ret = 0;
	for (int i=1; i<n; i++) ret += d*h(i*d);
	if (plus) ret += d*h(600-d);
	return ret;
}

int main() {
	int d;
	
	while (cin >> d) {
		cout << s(d) << endl;
	}
		
	return 0;
}

C++: #include <iostream>
#include <string>
#include <cctype>
#include <cmath>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <map> // pair
#include <set>
#define MAXSIZE 200000
#define PI 3.141592653589
using namespace std;

template<typename T>
T add(T a,T b){
  return a+b;
}

namespace A
{
  int f(void){
    return 1;
  }
}

int main(){
  int d;

  while (std::cin >> d) {
    int sum=0;
    for(int i=1;i<600/d;i++){
      sum+=d*i*d*i*d;
    }

    std::cout << sum << '\n';
  }

}

C++: while gets
	a=c=$_.to_i
	b=0
	while c<600
		b+=c*c*a
		c+=a
	end
	puts b	
end

C++: main(d){for(;~scanf("%d",&d);printf("%d00\n",d*=d-6e2))d-=600;}