Go: package main

import "fmt"

func main() {
	var d int
	for {
		v, _ := fmt.Scan(&d)
		if v == 0 {
			break
		}
		sum := 0
		for i := 0; i < 600/d; i++ {
			sum += d*d*i*d*i
		}
		fmt.Println(sum)
	}
}

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

using namespace std;

int main(){
  const int x = 600;
  int d,area=0,height=0,width;
  cin >> width;

  d = x/width;

  for(int i=0; i<d; i++){
    height = (width*i)*(width*i);
    area+=height*width;
  }
  cout << area << endl;
  return 0;
}

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

int main(){
	int d, ans = 0, n;
	while(cin >> d){
		ans = pow(d, 3);
		n = 600 / d - 1;
		ans *= n*(n+1)*(2*n+1) / 6;
		cout << ans << endl;
	}
	return 0; 
}

C++: #include<stdio.h>

using namespace std;

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

C++: #include <iostream>

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

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

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

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

int main()
{
	int d;
	while(cin >> d){
		int S = 0;

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

		cout << S << endl;

	}
	return 0;
}

C++: #include <stdio.h>

int f(int);

int main()
{
	int d,total;

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

	return 0;
}

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

C++: #include <iostream>
using namespace std;
int main() {
  int d;
  cin >> d;

  int n = 1;
  long long sum = 0;
  while(n * d < 600) {
    sum += (n*d) * (n*d) * d;
    n++;
  }
  cout << sum << endl;
}

C++: #include <bits/stdc++.h>
using namespace std;
int main() {
  int a,i,s;
  while(cin>>a){
    for(s=0,i=1;a*i<600;i++)s+=i*i*a*a*a;
    cout<<s<<endl;
  }
}

C++: #include <iostream>
#include <cstdio>
#include <vector>
#include <list>
#include <algorithm>
#include <cmath>
#include <stack>
#include <set>
using namespace std;

#define REP(i,n) for(int (i)=0; (i)<(n); (i)++)
#define FOR(i,a,b) for(int (i)=(a); (i)<(b); (i)++)
#define PUSH(n,v) for(int i=0; i<(n); i++) {int j; cin >> j; v.push_back(j);}
#define ALL(v) v.begin(), v.end()

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

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

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

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

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

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

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

  return 0;
}

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

using namespace std;

int main()
{
    int w,num,count,sum,a[600];
    while(cin>>w){
       num=600/w;
       count=0;
       sum=0;
       for(int i=0;i<=600;i+=w){
          a[count++]=w*i*i;        
       }
       for(int i=0;i<num;i++){
          sum+=a[i];        
       }
       cout<<sum<<endl;
    }

    return 0;
}

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

int main(){
	int d;
	long sum;
	int n;

	while(cin >> d){
		sum = 0;
		n = 600 / d;

		for(int i=1;i<=n;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 sum=0;
    for(int i=1;i<600/d;i++)
      sum+=i*i*d*d*d;
    
    cout << sum << endl;
  }

  return 0;
}

C++: #include <iostream>

using namespace std;

int f(int);

int main() {
	int d, i, s;

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


}

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

C++: #include <iostream>
#include <math.h>

using namespace std;

int main() {
    int n,i = 1,sqrt;

    while (cin >> n){
        sqrt = 0;
        i =0;
        while (i * n < 600){
            sqrt += n * pow(i*n,2);
            i++;
        }
        cout << sqrt << endl;
    }
    return 0;
}

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

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

int main(){
	int d;
	int area=0;
	while(cin >> d){
		int w = 600/d;
		for(int i=0;i<w;i++){
			area += d*f(i*d);
		}
		cout << area << endl;
		area = 0;
	}

}

C++: #include<cmath>
#include<iostream>
#define f(x) x*x
using namespace std;
int main(){
  int d,sum; // 面積
  while(cin >> d){
    sum = 0;
    for(int i=d;i<600;i+=d){
      sum += (f(i) * d);
    }
    cout << sum << endl;
  }
}

C++: #include <iostream>

using namespace std;

void integral();

int main() {

	while(1) {
		integral();
	}


	return 0;

}


void integral() {

	int i;
	double d, j, s=0;
	i=0;
	j=1;
	cin >> d;

	while(i!=600-d) {
		s+=d*(j*d*j*d);
		i+=d;
		j++;
	}

	cout << s << endl;

}

C++: #include<iostream>

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

int main(){
	int d;
	
	while(std::cin >> d){
		double n = 600/d;
		int S = 0;
		
		for(int i=1; i<n ; ++i){
			S += function(i*d) * d;
		}
		
		std::cout << S << std::endl;
	}
	return 0;
}

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

int d;
int sum = 0;
int j = 0;
int a[10000];

int main() {
int x;
while (~scanf("%1d",&x)) {
a[j++] = x;
}
  for (int l = 0; l <= j; l++){
  for(int i = 1; i <= (600-a[j]) / a[j]; i++){
  sum += a[j]*((i*a[j])*(i*a[j]));
    }
  }
    cout << sum << endl;
  }

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

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

using namespace std;
using ll = long long;
using pii = pair<int, int>;

int main() {
  cin.tie(0);
  ios_base::sync_with_stdio(false);
  cout << fixed << setprecision(10);
  
  int d;
  while (cin >> d) {
    int ans = 0;
    for (int i = d; i <= 600 - d; i += d) {
      ans += d * i * i;
    }
    cout << ans << endl;
  }

  return 0;
}

C++: f :: Int -> Int
f x = x * x

solve :: Int -> Int
solve d = (d*) $ sum $ map f [0 , d .. 600 - d]

main :: IO ()
main  = getContents
    >>= return . map read . lines
    >>= return . map solve
    >>= mapM_ print

C++: #include <iostream>

using namespace std;

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

C++: #include<iostream>
using namespace std;
int n;
int a[1000000];
int sum[1000000];
int main(int argc, char const *argv[])
{

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

C++: #include<iostream>
#include<vector>
using namespace std;
int main(){
  int d,s;
  int S = 0;
  int n = 20;
  int y,x;
  while(n > 0){
    cin >> d;
    int y = x * d;
    for(y < 600-d;y++;){
      int x[1000]; 
    int s = y * d;
    int n = n - 1;
    int S = S + s;
  }
    cout << S << endl;
  }
  return 0;
}

C++: #include <stdio.h>
#define NN 600
int f(int x){ return x*x; }
int main(){
	int d,h,s=0;
	while(scanf("%d",&d)!=EOF){
		for(h=d;h<NN;h+=d){
			s += d*f(h);
		}
		printf("%d\n",s);
	}
	return 0;
}

C++: #include<cstdlib>
#include<cstring>
#include<cctype>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<bitset>
#include<utility>
#include<string>

using namespace std;

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