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

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

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

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

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

C++: #include <bits/stdc++.h>
using namespace std;
/* {{{ */
/*-------------------------------*/
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (b) - 1; i >= (a); i--)
#define REP(i, n) for(int i = 0; i < (n); i++)
#define rep(i, n) for(int i = 0; i < (n); i++)
#define RREP(i, n) for(int i = (n) - 1; i >= 0; i--)
#define rrep(i, n) for(int i = (n) - 1; i >= 0; i--)

#define all(i) (i).begin(),(i).end()
#define rall(i) (i).begin(),(i).end(),greater<int>()
#define print(x) cout << (x) << endl
#define PB push_back
#define pb push_back
#define mp make_pair
#define FI first
#define SE second

inline int in(){int x;std::cin>>x;return x;}
struct FAST {FAST(){cin.tie(0);ios::sync_with_stdio(false);}} Fast;
typedef long long ll;
typedef pair<int, int> pint;
typedef vector<int> vi;
typedef vector<vector<int> > vii;
typedef vector<long long> llv;
typedef vector<pint> vpint;
/*-------------------------------*/
/* }}} */ 

signed main(void)
{
  int d;

  while (cin >> d){
    int res = 0;
    FOR(i, 1, 600 / d) res += d * i * d * i * d;

    cout << res << endl;
  }

  return 0;
}

C++: #include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <climits>
#include <algorithm>
#include <map>
#include <set>
#include <stack>
#include <vector>
#include <queue>
#include <string>
#include <complex>
using namespace std;

#define rep(i,n) for(int i=0; i<n; i++)
#define repa(i,s,e) for(int i=s; i<=e; i++)
#define repd(i,s,e) for(int i=s; i>=e; i--)

typedef vector<int> vi;

int main() {
	int n;
	while(scanf("%d", &n)!=EOF) {
		int s = 0;
		int w = 600 / n;
		rep(i,w) {
			int h = n * i;
			s += h * h * n;
		}
		printf("%d\n", s);
	}
}

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

C++: #include <stdio.h>
#include <string>
#include <iostream>
#include <math.h>
#include <stack>

using namespace std;

int main(){

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

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

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);

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

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

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


int main(){
  int d;
  while(cin >>d){
    int sum = 0;
    int x=0;
    while(x < 600){
      sum+=f(x)*d;
      x+= d;
    }
    cout << sum <<endl;
  }
}

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

double dF(double x)
{
    return pow(x, 2);
}

double dIntegral(double d)
{
    double ans = 0;
    for(int i = 1; i <= 600 / d; i++)
    {
        ans += dF(i * d) * d;
    }

    return ans;
}

int main()
{
    double d;
    while(cin >> d)
    {
        cout << dIntegral(d) << endl;
    }

    return EXIT_SUCCESS;
}

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

int main(){
	int d, t = 0;
	int ans[100] = {0};
	while(cin >> d){
		for(int i = d; i < 600; i = i+d){
			ans[t] = ans[t]+i*i*d;
		}
		t++;
	}
	for(int i = 0; i < t; i++){
		cout << ans[i] << endl;
	}
}

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

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

int main()
{
    for (int d; cin >> d;) {
        int n = 600 / d - 1;
        cout << n * (2 * n + 1) * (n + 1) / 6 * d * d * d << endl;
    }

    return 0;
}

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

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

C++: #include <iostream>

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

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

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

C++: #include <iostream>

using namespace std;

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

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

int main()
{
	int d, S;

	while (cin >> d)
	{
		S = 0;
		if (cin.eof()) return 0;
		for (int i = 1; i < 600 / d; i++)
		{
			S += i * d * i * d * d;
		}
		cout << S << endl;
	}
	return 0;
}

C++: #include<iostream>

using namespace std;

int main(){

	int d;

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

	return 0;

}

C++: //
#include <iostream>
#include <cstdio>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <map>

using namespace std;

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


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

C++: #include<iostream>
int main(){for(int n,s,i;!(std::cin>>n).eof();printf("%d\n",s))for(s=i=0;i<600/n;)s+=n*i*n*i++*n;}

C++: #include <stdio.h>
#include <string.h>

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

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

int func(int n){
	int res=0;
	for(int i=1; i*n != 600; i++){
		res += i*n*i*n*n;
	}
	return res;
}

int main(void){
	int in;
	while(std::cin >> in){
		std::cout << func(in) << std::endl;
	}
	return 0;
}

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

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

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

int main(){

  int d;

  while(cin >> d){

    double ans = 0;

    for(int i=0;i<600/d;i++){
      ans += d * pow((double)i*(double)d,2.0);
    }

    cout << (int)ans << endl;
  }
}

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