stablegradients/pie-gem5-pairs huggingface dataset:
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;

#define rep(i,n) for (int i = 0; i < (n); i++) 

#define all(v) begin(v),end(v)

using ll = long long;



int main() {

  int n;cin>>n;

  vector<int> vec(n+1);

  for(int i=1;i<=100;i++){

    for(int j=1;j<=100;j++){

      for(int k=1;k<=100;k++){

        int ans=i*i+j*j+k*k+i*j+j*k+k*i;

        if(ans<=n)vec[ans]++;

      }

    }

  }

  for(int i=1;i<=n;i++)cout<<vec[i]<<endl;

}


// Faster C++ solution for the same problem (measured speedup: 3.4252575830495275x):
#include <bits/stdc++.h>

using namespace std;

#define rep(i,n) for (int i = 0; i < (n); i++) 

#define all(v) begin(v),end(v)

using ll = long long;



int main() {

  int n;cin>>n;

  vector<int> ans(n+1);

  for(int x=1;x<=100;x++){

    for(int y=1;y<=100;y++){

      for(int z=1;z<=100;z++){

        int a=x*x+y*y+z*z+x*y+y*z+z*x;

        if(a>n)break;

        ans[a]++;

      }

    }

  }

  for(int i=1;i<=n;i++)cout<<ans[i]<<endl;

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

using namespace std;

#define rep(i,n) for (int i = 0; i < (n); i++) 

#define all(v) begin(v),end(v)

using ll = long long;



int main() {

  int n;cin>>n;

  vector<int> ans(n+1);

  for(int x=1;x<=100;x++){

    for(int y=1;y<=100;y++){

      for(int z=1;z<=100;z++){

        int cnt=x*x+y*y+z*z+x*y+y*z+z*x;

        if(cnt<=n)ans[cnt]++;

      }

    }

  }

  for(int i=1;i<=n;i++)cout<<ans[i]<<endl;

}

// Faster C++ solution for the same problem (measured speedup: 3.4252575830495275x):
#include <bits/stdc++.h>

using namespace std;

#define rep(i,n) for (int i = 0; i < (n); i++) 

#define all(v) begin(v),end(v)

using ll = long long;



int main() {

  int n;cin>>n;

  vector<int> ans(n+1);

  for(int x=1;x<=100;x++){

    for(int y=1;y<=100;y++){

      for(int z=1;z<=100;z++){

        int a=x*x+y*y+z*z+x*y+y*z+z*x;

        if(a>n)break;

        ans[a]++;

      }

    }

  }

  for(int i=1;i<=n;i++)cout<<ans[i]<<endl;

}
// Slower C++ solution:
#include <iostream>

#include <bits/stdc++.h>

#include<cmath>

using namespace std;



int operation(int x , int y , int z)

{

    int v = (x*x)+(y*y)+(z*z)+(x*y)+(y*z)+(x*z);

    return v;

}

int main()

{

    int n;

    cin >>n;

    int counter=0;

    for(int i =1; i<=n; i++)

    {

        for(int x=1; x<100; x++)

        {

            for(int y=1; y<100; y++)

            {

                for(int z=1; z<100; z++)

                {

                    if(i == operation(x,y,z))

                    {

                        counter++;

                    }

                    else if(i < operation(x,y,z))

                        break;



                }

            }

        }



        cout<<counter<<endl;

        counter=0;

    }



    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 3.492344136742847x):
#include <iostream>

#include <cmath>

using namespace std;



int main()

{

    int n, c, maxxyz, x, y, z, val;

    cin >> n;

    int a [n];

    for ( int i = 0; i < n; i ++) {

        a[i] = 0;

    }

    maxxyz = sqrt(n-5);

    for  ( x = 1; x <= maxxyz; x++){

            for ( y = 1; y <= maxxyz; y++) {

                for ( z = 1; z <= maxxyz; z++) {

                    val =x*x + y*y + z*z + x*y + y*z + z*x;

                    if ( val <= n) a[val-1]++;

            }

        }

    }

    for ( int i = 0; i < n; i ++) {

        cout << a[i] <<endl;

    }

}
// Slower C++ solution:
#include <iostream>

#include <bits/stdc++.h>

#include<cmath>

using namespace std;



int operation(int x , int y , int z)

{

    int v = (x*x)+(y*y)+(z*z)+(x*y)+(y*z)+(x*z);

    return v;

}

int main()

{

    int n;

    cin >>n;

    int counter=0;

    for(int i =1; i<=n; i++)

    {

        for(int x=1; x<100; x++)

        {

            for(int y=1; y<100; y++)

            {

                for(int z=1; z<100; z++)

                {

                    if(i == operation(x,y,z))

                    {

                        counter++;

                    }

                    else if(i < operation(x,y,z))

                        break;



                }

            }

        }



        cout<<counter<<endl;

        counter=0;

    }



    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 3.39470497734848x):
#include <iostream>



using namespace std;

int c[10001];



int main()

{

    int n;

    cin>>n;

    for (int x=1; x<=100; x++) {

        for (int y=1; y<=100; y++){

            for (int z=1; z<=100; z++) {

                int f=x*x+y*y+z*z+x*y+x*z+z*y;

                if (f > n)

                    break;

                c[f]++;

            }

        }

    }

    for (int i=1; i<=n; i++)

        cout<<c[i]<<'\n';

    return 0;

}
// Slower C++ solution:
#include <iostream>

#include <bits/stdc++.h>

#include<cmath>

using namespace std;



int operation(int x , int y , int z)

{

    int v = (x*x)+(y*y)+(z*z)+(x*y)+(y*z)+(x*z);

    return v;

}

int main()

{

    int n;

    cin >>n;

    int counter=0;

    for(int i =1; i<=n; i++)

    {

        for(int x=1; x<100; x++)

        {

            for(int y=1; y<100; y++)

            {

                for(int z=1; z<100; z++)

                {

                    if(i == operation(x,y,z))

                    {

                        counter++;

                    }

                    else if(i < operation(x,y,z))

                        break;



                }

            }

        }



        cout<<counter<<endl;

        counter=0;

    }



    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 3.3289387049333428x):
#include <iostream>

#include <bits/stdc++.h>

#include <math.h>

using namespace std;



int main()

{

    int N;

    cin>>N;

    int x,temp;

    int count[N]={0,};

    for(int n=1;n<=N;++n)

    {x=ceil(sqrt((float)n));

        for(int i=1;i<x;++i)

       {

        for(int j=1;j<x;++j)

        {

            for(int k=1;k<x;++k)

            {

                temp=(i*i+j*j+k*k+i*j+i*k+j*k);

                if(temp==n)

                    ++count[n-1];

                else if(temp>n)

                    break;

            }

        }

       }

       cout<<count[n-1]<<"\n";

    }



    return 0;

}
// Slower C++ solution:
#include <iostream>

#include <bits/stdc++.h>

#include<cmath>

using namespace std;



int operation(int x , int y , int z)

{

    int v = (x*x)+(y*y)+(z*z)+(x*y)+(y*z)+(x*z);

    return v;

}

int main()

{

    int n;

    cin >>n;

    int counter=0;

    for(int i =1; i<=n; i++)

    {

        for(int x=1; x<100; x++)

        {

            for(int y=1; y<100; y++)

            {

                for(int z=1; z<100; z++)

                {

                    if(i == operation(x,y,z))

                    {

                        counter++;

                    }

                    else if(i < operation(x,y,z))

                        break;



                }

            }

        }



        cout<<counter<<endl;

        counter=0;

    }



    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 3.3178267398052075x):
#include <iostream>

#include <assert.h>

#include <math.h>

#include <algorithm>

typedef long long ll;

typedef unsigned long long ull;

using namespace std;



bool solve(ll x, ll y, ll n){

    ll sq = -3*(x*x)-2*x*y+4*n-3*(y*y);

    if(sq < 0) return 0;

    ll temp = sq;

    sq = sqrt(sq);

    if(sq * sq != temp) return 0;

    ll sol1 = (-y-x+(ll)sq)/2;

    ll sol2 = (-y-x-(ll)sq)/2;

    if(sol1 > 0 || sol2 > 0){

        return true;

    }else{

        return false;

    }

}



int main(){ ll n;

    cin >> n;

    for (ll i=1; i<=n; i++){

        ll ans = 0;

        for (ll j=1; j<=sqrt(i); j++){

            for (ll k=1; k<=sqrt(i); k++){

                if (solve(j, k, i)) {

                    ++ans;

                }

            }

        }

        cout << ans << endl;

    }

    return 0;

}
// Slower C++ solution:
#include <iostream>

#include <math.h>

#include <vector>

#include <string>

using namespace std;

int main() {

	int N = 0;

	scanf("%d", &N);

	vector<long>v (N+1,0);



	/*

	for (int x = 1; x <= 100; x++) {

		for (int y = 1; y <= 100; y++) {

			for (int z = 1; z <= 100; z++) {

				if ((x * x + y * y + z * z + x * y + x * z + z * y) != 0 && ((x * x + y * y + z * z + x * y + x * z + z * y) < v.size())) {

					v[(x * x + y * y + z * z + x * y + x * z + z * y) - 1]++;

				}

				

			}

			

		}

		

	}*/



	for (int i = 1; i <= 100; i++) {

		for (int w = 1; w <= 100; w++) {

			for (int y = 1; y <= 100; y++) {

				if (((i * i) + (w * w) + (y * y) + (i * w) + (i * y) + (y * w)) <= v.size()) {

					v[((i * i) + (w * w) + (y * y) + (i * w) + (i * y) + (y * w))]++;



				}



			}



		}

	}

	

	for (int i = 1; i <= N; i++) {

		string str = to_string(v[i]);

		const char* l = str.c_str();

		printf(l);

		printf("\n");

	}

	

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 2.552670096782851x):
/*

*         ****FOX****

*/

#include <iostream>

#include <string>

#include <algorithm>

#include <stack>

#include <queue>

#include <vector>

#include <map>

#include <set>

#include <sstream>

#include <iomanip>

#include <cmath>

#include <limits>

//freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);

#include <utility>

#include <list>

#include <cstdio>

#include<forward_list>

#include<algorithm>

#include<string>

#define Omar_Hafez ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);

#define pi 3.1415926536

#define ll long long

#define ull unsigned long long

#define lli long long int

using namespace std;

int main()

{

    Omar_Hafez

   int n; cin >> n;

    vector<int> v(n,0); 

    for (int i = 1; i < 400; i++)

    {

        for (int j = 1; j < 400; j++)

        {

            for (int z = 1; z < 400; z++)

            {

                int res = (i * i) + (j * j) + (z * z) + (i * j) + (j * z) + (i * z);  

                if (res <= n)  v[--res]++;

                else break;

            }

        }

    }

    for (int i = 0; i< v.size(); i++) cout << v[i] << "\n";

    return 0;

}
// Slower C++ solution:
#include <iostream>

#include <math.h>

#include <vector>

#include <string>

using namespace std;

int main() {

	int N = 0;

	scanf("%d", &N);

	vector<long>v (N+1,0);



	/*

	for (int x = 1; x <= 100; x++) {

		for (int y = 1; y <= 100; y++) {

			for (int z = 1; z <= 100; z++) {

				if ((x * x + y * y + z * z + x * y + x * z + z * y) != 0 && ((x * x + y * y + z * z + x * y + x * z + z * y) < v.size())) {

					v[(x * x + y * y + z * z + x * y + x * z + z * y) - 1]++;

				}

				

			}

			

		}

		

	}*/



	for (int i = 1; i <= 100; i++) {

		for (int w = 1; w <= 100; w++) {

			for (int y = 1; y <= 100; y++) {

				if (((i * i) + (w * w) + (y * y) + (i * w) + (i * y) + (y * w)) <= v.size()) {

					v[((i * i) + (w * w) + (y * y) + (i * w) + (i * y) + (y * w))]++;



				}



			}



		}

	}

	

	for (int i = 1; i <= N; i++) {

		string str = to_string(v[i]);

		const char* l = str.c_str();

		printf(l);

		printf("\n");

	}

	

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 1.0996866073900533x):
#include <iostream>

#include <vector>

using namespace std;



int formula(int x,int y,int z) {

    int ans = x*x+y*y+z*z+x*y+x*z+y*z;

    return ans;

}



int main()

{

    int n;

    cin>>n;

    int x(1),y(1),z(1),formul(0),c(0);

    for (int i=1;i<=n;i++)  {

        for (int x=1;x<=99;x++) {

            for (int y=1;y<=99;y++) {

               for (int z=1;z<=99;z++) {

                    formul=formula(x,y,z);

                    if (formul==i) c++;

                    if (formul>i) break;

                }

            }

        }

        

        cout<<c<<endl;

        c=0;

    }

}
// Slower C++ solution:
#include <iostream>

#include <math.h>

#include <vector>

#include <string>

using namespace std;

int main() {

	int N = 0;

	scanf("%d", &N);

	vector<long>v (N+1,0);



	/*

	for (int x = 1; x <= 100; x++) {

		for (int y = 1; y <= 100; y++) {

			for (int z = 1; z <= 100; z++) {

				if ((x * x + y * y + z * z + x * y + x * z + z * y) != 0 && ((x * x + y * y + z * z + x * y + x * z + z * y) < v.size())) {

					v[(x * x + y * y + z * z + x * y + x * z + z * y) - 1]++;

				}

				

			}

			

		}

		

	}*/



	for (int i = 1; i <= 100; i++) {

		for (int w = 1; w <= 100; w++) {

			for (int y = 1; y <= 100; y++) {

				if (((i * i) + (w * w) + (y * y) + (i * w) + (i * y) + (y * w)) <= v.size()) {

					v[((i * i) + (w * w) + (y * y) + (i * w) + (i * y) + (y * w))]++;



				}



			}



		}

	}

	

	for (int i = 1; i <= N; i++) {

		string str = to_string(v[i]);

		const char* l = str.c_str();

		printf(l);

		printf("\n");

	}

	

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 3.830149011330709x):
#include <iostream>



using namespace std;



int main()

{



    int n;  cin >> n;



    int x = 1, y = 1, z = 1, fn = 0;



    int* arr = new int[n+1];

    for (int i = 0; i <= n; i++){

        arr[i] = 0;

    }



    while (true){



        while (true){



            while (true){



                fn = x*x + y*y + z*z + x*y + y*z + x*z;

                z++;



                if (fn <= n){

                    arr[fn]++;

                } else {

                    break;

                }

            }



            y++; z = 1;

            fn = x*x + y*y + z*z + x*y + y*z + x*z;



            if (fn <= n){

                continue;

            } else {

                break;

            }

        }



        x++; y = 1; z = 1;

        fn = x*x + y*y + z*z + x*y + y*z + x*z;



        if (fn <= n){

            continue;

        } else {

            break;

        }

    }



    for (int i = 1; i <= n; i++){

        cout << arr[i] << endl;

    }



    return 0;

}
// Slower C++ solution:
/*

*         ****FOX****

*/

#include <iostream>

#include <string>

#include <algorithm>

#include <stack>

#include <queue>

#include <vector>

#include <map>

#include <set>

#include <sstream>

#include <iomanip>

#include <cmath>

#include <limits>

//freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);

#include <utility>

#include <list>

#include <cstdio>

#include<forward_list>

#include<algorithm>

#include<string>

#define Omar_Hafez ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);

#define pi 3.1415926536

#define ll long long

#define ull unsigned long long

#define lli long long int

using namespace std;

int main()

{

    Omar_Hafez

   int n; cin >> n;

    vector<int> v(n,0); 

    for (int i = 1; i < 400; i++)

    {

        for (int j = 1; j < 400; j++)

        {

            for (int z = 1; z < 400; z++)

            {

                int res = (i * i) + (j * j) + (z * z) + (i * j) + (j * z) + (i * z);  

                if (res <= n)  v[--res]++;

                else break;

            }

        }

    }

    for (int i = 0; i< v.size(); i++) cout << v[i] << "\n";

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 1.5004481057532164x):
#include <iostream>



using namespace std;



int main()

{



    int n;  cin >> n;



    int x = 1, y = 1, z = 1, fn = 0;



    int* arr = new int[n+1];

    for (int i = 0; i <= n; i++){

        arr[i] = 0;

    }



    while (true){



        while (true){



            while (true){



                fn = x*x + y*y + z*z + x*y + y*z + x*z;

                z++;



                if (fn <= n){

                    arr[fn]++;

                } else {

                    break;

                }

            }



            y++; z = 1;

            fn = x*x + y*y + z*z + x*y + y*z + x*z;



            if (fn <= n){

                continue;

            } else {

                break;

            }

        }



        x++; y = 1; z = 1;

        fn = x*x + y*y + z*z + x*y + y*z + x*z;



        if (fn <= n){

            continue;

        } else {

            break;

        }

    }



    for (int i = 1; i <= n; i++){

        cout << arr[i] << endl;

    }



    return 0;

}
// Slower C++ solution:
#include <iostream>

#include <vector>

using namespace std;



int formula(int x,int y,int z) {

    int ans = x*x+y*y+z*z+x*y+x*z+y*z;

    return ans;

}



int main()

{

    int n;

    cin>>n;

    int x(1),y(1),z(1),formul(0),c(0);

    for (int i=1;i<=n;i++)  {

        for (int x=1;x<=99;x++) {

            for (int y=1;y<=99;y++) {

               for (int z=1;z<=99;z++) {

                    formul=formula(x,y,z);

                    if (formul==i) c++;

                    if (formul>i) break;

                }

            }

        }

        

        cout<<c<<endl;

        c=0;

    }

}

// Faster C++ solution for the same problem (measured speedup: 3.4945882137629405x):
#include <iostream>



using namespace std;



int main()

{



    int n;  cin >> n;



    int x = 1, y = 1, z = 1, fn = 0;



    int* arr = new int[n+1];

    for (int i = 0; i <= n; i++){

        arr[i] = 0;

    }



    while (true){



        while (true){



            while (true){



                fn = x*x + y*y + z*z + x*y + y*z + x*z;

                z++;



                if (fn <= n){

                    arr[fn]++;

                } else {

                    break;

                }

            }



            y++; z = 1;

            fn = x*x + y*y + z*z + x*y + y*z + x*z;



            if (fn <= n){

                continue;

            } else {

                break;

            }

        }



        x++; y = 1; z = 1;

        fn = x*x + y*y + z*z + x*y + y*z + x*z;



        if (fn <= n){

            continue;

        } else {

            break;

        }

    }



    for (int i = 1; i <= n; i++){

        cout << arr[i] << endl;

    }



    return 0;

}
// Slower C++ solution:
#include <iostream>

#include <math.h>

#include <vector>

#include <string>

using namespace std;

int main() {

	int N = 0;

	scanf("%d", &N);

	vector<long>v (N+1,0);



	/*

	for (int x = 1; x <= 100; x++) {

		for (int y = 1; y <= 100; y++) {

			for (int z = 1; z <= 100; z++) {

				if ((x * x + y * y + z * z + x * y + x * z + z * y) != 0 && ((x * x + y * y + z * z + x * y + x * z + z * y) < v.size())) {

					v[(x * x + y * y + z * z + x * y + x * z + z * y) - 1]++;

				}

				

			}

			

		}

		

	}*/



	for (int i = 1; i <= 100; i++) {

		for (int w = 1; w <= 100; w++) {

			for (int y = 1; y <= 100; y++) {

				if (((i * i) + (w * w) + (y * y) + (i * w) + (i * y) + (y * w)) <= v.size()) {

					v[((i * i) + (w * w) + (y * y) + (i * w) + (i * y) + (y * w))]++;



				}



			}



		}

	}

	

	for (int i = 1; i <= N; i++) {

		string str = to_string(v[i]);

		const char* l = str.c_str();

		printf(l);

		printf("\n");

	}

	

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 3.6657119676885532x):
#include <iostream>

#include <vector>



using namespace std;



int main()

{

    vector<int> num(10001, 0);

    int n, i, res;

    cin >> n;

    for (int x=1 ; x<=100 ; x++)

    {

        for (int y=1 ; y<=100 ; y++)

        {

            if (x*x + y*y + x*y > n)

                break;

            for (int z=1 ; z<=100 ; z++)

            {

                res = x*x + y*y + z*z + x*y + x*z + y*z;

                if (res > n)

                    break;

                num[res]++;

            }

        }

    }

    for (i=1 ; i<=n && i<num.size() ; i++)

    {

        cout << num[i] << endl;

    }

    return 0;

}
// Slower C++ solution:
/*

*         ****FOX****

*/

#include <iostream>

#include <string>

#include <algorithm>

#include <stack>

#include <queue>

#include <vector>

#include <map>

#include <set>

#include <sstream>

#include <iomanip>

#include <cmath>

#include <limits>

//freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);

#include <utility>

#include <list>

#include <cstdio>

#include<forward_list>

#include<algorithm>

#include<string>

#define Omar_Hafez ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);

#define pi 3.1415926536

#define ll long long

#define ull unsigned long long

#define lli long long int

using namespace std;

int main()

{

    Omar_Hafez

   int n; cin >> n;

    vector<int> v(n,0); 

    for (int i = 1; i < 400; i++)

    {

        for (int j = 1; j < 400; j++)

        {

            for (int z = 1; z < 400; z++)

            {

                int res = (i * i) + (j * j) + (z * z) + (i * j) + (j * z) + (i * z);  

                if (res <= n)  v[--res]++;

                else break;

            }

        }

    }

    for (int i = 0; i< v.size(); i++) cout << v[i] << "\n";

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 1.4360304421274324x):
#include <iostream>

#include <vector>



using namespace std;



int main()

{

    vector<int> num(10001, 0);

    int n, i, res;

    cin >> n;

    for (int x=1 ; x<=100 ; x++)

    {

        for (int y=1 ; y<=100 ; y++)

        {

            if (x*x + y*y + x*y > n)

                break;

            for (int z=1 ; z<=100 ; z++)

            {

                res = x*x + y*y + z*z + x*y + x*z + y*z;

                if (res > n)

                    break;

                num[res]++;

            }

        }

    }

    for (i=1 ; i<=n && i<num.size() ; i++)

    {

        cout << num[i] << endl;

    }

    return 0;

}
// Slower C++ solution:
#include <iostream>

#include <vector>

using namespace std;



int formula(int x,int y,int z) {

    int ans = x*x+y*y+z*z+x*y+x*z+y*z;

    return ans;

}



int main()

{

    int n;

    cin>>n;

    int x(1),y(1),z(1),formul(0),c(0);

    for (int i=1;i<=n;i++)  {

        for (int x=1;x<=99;x++) {

            for (int y=1;y<=99;y++) {

               for (int z=1;z<=99;z++) {

                    formul=formula(x,y,z);

                    if (formul==i) c++;

                    if (formul>i) break;

                }

            }

        }

        

        cout<<c<<endl;

        c=0;

    }

}

// Faster C++ solution for the same problem (measured speedup: 3.3414904328782895x):
#include <iostream>

#include <vector>



using namespace std;



int main()

{

    vector<int> num(10001, 0);

    int n, i, res;

    cin >> n;

    for (int x=1 ; x<=100 ; x++)

    {

        for (int y=1 ; y<=100 ; y++)

        {

            if (x*x + y*y + x*y > n)

                break;

            for (int z=1 ; z<=100 ; z++)

            {

                res = x*x + y*y + z*z + x*y + x*z + y*z;

                if (res > n)

                    break;

                num[res]++;

            }

        }

    }

    for (i=1 ; i<=n && i<num.size() ; i++)

    {

        cout << num[i] << endl;

    }

    return 0;

}