criyle/codenet-compile-errors huggingface dataset:
Language: C++

#include <iostream>
#include <map>
#include <algorithm>
using namespace std;
 
int checkSimilarity(int a, int b, int c)
{
	if((a-b==0)|(b-c==0)|(a-c==0))
       {
         return 1;
       }
    return 0;
}
       
int findTriagnles(vector<int,int> v, int size)
{ 
  int count;
  for(int i=0; i<size; i++)
  {
    for(int j= i+1; j<size; j++)
    {
      for(int k=j+1; k<size; k++)
      {
        if(checkSimilarity(v.at(i), v.at(j), v.at(k)) 
           { continue;
           }
         if(v.at(i)+v.at(j) > v.at(k))
           {
             count++;
           }
      }
    }
  }
  return count;
}
           
int main()
{
	int size, element;
  	int count = 0;
  	vector<int,int> v;
  	cin >> size;
  	for(int i = 0; i<size; i++)
    {
      cin >> element;
      v.push_back(element);
    }
  	sort(v.begin(),v.end());
  	findTriangles(v, v.size());
}

Compiler output:
a.cc:15:19: error: 'vector' was not declared in this scope
   15 | int findTriagnles(vector<int,int> v, int size)
      |                   ^~~~~~
a.cc:4:1: note: 'std::vector' is defined in header '<vector>'; this is probably fixable by adding '#include <vector>'
    3 | #include <algorithm>
  +++ |+#include <vector>
    4 | using namespace std;
a.cc:15:26: error: expected primary-expression before 'int'
   15 | int findTriagnles(vector<int,int> v, int size)
      |                          ^~~
a.cc:15:30: error: expected primary-expression before 'int'
   15 | int findTriagnles(vector<int,int> v, int size)
      |                              ^~~
a.cc:15:38: error: expected primary-expression before 'int'
   15 | int findTriagnles(vector<int,int> v, int size)
      |                                      ^~~
a.cc:15:46: error: expression list treated as compound expression in initializer [-fpermissive]
   15 | int findTriagnles(vector<int,int> v, int size)
      |                                              ^
a.cc: In function 'int main()':
a.cc:41:9: error: 'vector' was not declared in this scope
   41 |         vector<int,int> v;
      |         ^~~~~~
a.cc:41:9: note: 'std::vector' is defined in header '<vector>'; this is probably fixable by adding '#include <vector>'
a.cc:41:16: error: expected primary-expression before 'int'
   41 |         vector<int,int> v;
      |                ^~~
a.cc:46:7: error: 'v' was not declared in this scope
   46 |       v.push_back(element);
      |       ^
a.cc:48:14: error: 'v' was not declared in this scope
   48 |         sort(v.begin(),v.end());
      |              ^
a.cc:49:9: error: 'findTriangles' was not declared in this scope; did you mean 'findTriagnles'?
   49 |         findTriangles(v, v.size());
      |         ^~~~~~~~~~~~~
      |         findTriagnles
Language: C++

#include <bits/stdc++.h>
using namespace std;
int n, ans, a[1010], t[3];
int main(){
	cin >> n;
	for (int i = 1; i <= n; ++i) cin >> a[i];
	for (int i = 1; i <= n; ++i) {	
		for(int j = i + 1; j <= n; ++j){
			for(int k = j + 1; k <= n; ++k){
				t[1]=a[i];
				t[2]=a[j];
				t[3]=a[k];
				sort(tmp+1,tmp+3+1);
				if(a[i]!=a[j]&&a[i]!=a[k]&&a[j]!=a[k]&&t[1]+t[2]>t[3])
					ans++;
			}
		}
	}
	cout<<ans;
	return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:13:38: error: 'tmp' was not declared in this scope; did you mean 'tm'?
   13 |                                 sort(tmp+1,tmp+3+1);
      |                                      ^~~
      |                                      tm
Language: C++

#include <iostream>
#include <string.h>
using namespace std;

int main(int argc, char *argv[]){
    int n;
    cin >> n;
    int c=0;
    int l[n];
    for(int i=0;i<n;i++) cin >> l[i];
    sort(l, l+n);
    for(int i=0;i<n;i++){
        for(int j=i+1;j<n;j++){
            for(int k=j+1;k<n;k++){
                if(l[i]+l[j]>l[k] && l[i]!=l[j] && l[j]!=l[k]) c++;
            }
        }
    }
    cout << c << endl;
    return 0;
}

Compiler output:
a.cc: In function 'int main(int, char**)':
a.cc:11:5: error: 'sort' was not declared in this scope; did you mean 'short'?
   11 |     sort(l, l+n);
      |     ^~~~
      |     short
Language: C++

#include <bits/stdc++.h>
#define INF 2e9
#define MOD 1000000007
#define MOD9 998244353
#define intMAX 51000;
#define PI 3.14159265359
using namespace std;
typedef long long llong;
typedef long double ldouble;

using Graph = vector<vector<int>>;

typedef pair(llong, int);

int main(){
	int N;
  cin >> N;
  vector<llong> L(N);
  for(int i=0; i<N; ++i) cin >> L[i];
  sort(L.begin(), L.end());
  int ans = 0;
  for(int i=0; i<N-2; ++i){
    for(int j=i+1; j<N-1; ++j){
      if(L[i]==L[j]) continue;;
      for(int k=j+1; k<N; ++k){
        if(L[j]==L[k]) continue;
        if(L[k]<L[i]+L[j]) ++ans;
      }
    }
  }
  cout << ans << endl;
}

Compiler output:
a.cc:13:19: error: expected ')' before ',' token
   13 | typedef pair(llong, int);
      |             ~     ^
      |                   )
a.cc:13:21: error: expected unqualified-id before 'int'
   13 | typedef pair(llong, int);
      |                     ^~~
Language: C++

#include<iostream>
#include<vector>
#include<string>

using namespace std;


bool is_ok(long long a, long long b, long long c){
    return (a!=b&&b!=c&&a!=c) && a+b+c > 2*max(max(a,b),c);
}

long long main(long long argc, const char** argv) {
    vector<long long> L;
    int N;
    cin>>N;
    for(int i=0;i<N;i++){
       long long a;
       cin>>a;
       L.push_back(a);
    }
    long long cnt = 0;
    for(int i=0;i<N-2;i++){
        for(int j=i+1;j<N-1;j++){
            for(int k=j+1;k<N;k++){
                if(is_ok(L[i],L[j],L[k])){
                    //cout<<i<<j<<k<<"\n";
                    cnt++;
                }
            }
        }
    }

    cout<<cnt;

    return 0;
}

Compiler output:
cc1plus: error: '::main' must return 'int'
a.cc:12:11: warning: first argument of 'int main(long long int, const char**)' should be 'int' [-Wmain]
   12 | long long main(long long argc, const char** argv) {
      |           ^~~~
Language: C++

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;

int main() {
    int N;
    cin >> N;
    vector<ull> L(N);
    for (int i=0; i<N; i++) {
        cin >> L[i];
    }
    ull cnt = 0;
    for (int i=0; i<N-2; i++) {
        for (int j=i+1; j<N-1; j++) {
            if (L[i] == L[j]) {
                break;
            }
            else {
                for (int k=j+1; k<N; k++) {
                    if (L[i] == L[k] || L[j] == L[k]) {
                        break;
                    }
                    else {
                        ull L_s = L[i] + L[j] + L[k];
                        ull L_l = max(L[i], L[j], L[k]);
                        if (L_s - L_l > L_l) {
                            cnt ++;
                        }
                    }
                }
            }
        }
    }
    cout << cnt << endl;
}

Compiler output:
In file included from /usr/include/c++/14/algorithm:60,
                 from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:51,
                 from a.cc:1:
/usr/include/c++/14/bits/stl_algobase.h: In instantiation of 'constexpr const _Tp& std::max(const _Tp&, const _Tp&, _Compare) [with _Tp = long long unsigned int; _Compare = long long unsigned int]':
a.cc:26:38:   required from here
   26 |                         ull L_l = max(L[i], L[j], L[k]);
      |                                   ~~~^~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_algobase.h:306:17: error: '__comp' cannot be used as a function
  306 |       if (__comp(__a, __b))
      |           ~~~~~~^~~~~~~~~~
Language: C++

#include<bits/stdc++.h>
#define REP(i, n) for(int i=0; i<n; i++)
using namespace std;
using ll = long long;
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

int main() {  
    int N;
    cin >> N;
    ll  l[N];
    for (int i = 0; i < N; i++)
    {
        cin >> l[i];
    }
    ll ans = 0;
    for (int i = 0; i < N; i++)
    {
        for (int j = i+1; j < N; j++)
        {
            for (int k = j+1; k < N; k++)
            {
                if((l[i]+l[j])>l[k] && (l[j]+l[k])>l[i] && (l[k]+l[i])>l[j]){
                  if(l[i]!=l[j]&&l[i]!=l[k]&&l[j]!=l[k])ans++;
                }
            }
            
        }
        
    }
    
    
    cout << ans << endl;

Compiler output:
a.cc: In function 'int main()':
a.cc:45:25: error: expected '}' at end of input
   45 |     cout << ans << endl;
      |                         ^
a.cc:20:12: note: to match this '{'
   20 | int main() {
      |            ^
Language: C++

#include<bits/stdc++.h>
using namespace std;
int l[101];
bool TRA(int i,int j,int k){
	if(l[i]>l[j]&&l[i]>l[k])if(l[i]<l[k]+l[j])return 1;
	if(l[i]<l[j]&&l[j]>l[k])if(l[j]<l[k]+l[i])return 1;
	if(l[k]>l[j]&&l[i]<l[k])if(l[k]<l[i]+l[j])return 1;
	return 0;
}
int main(){
	int i,j,k,n,ans=0;
	cin>>n;
	for(i=1;i<=n;i++)cin>>l[i];
	for(i=1;i<=n;i++)
		for(j=i+1;j<=n;j++)
			for(k=j+1;k<=n;k++)
				if(TRA(i,l,k)==1)ans++;
	cout<<ans;
	return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:17:42: error: invalid conversion from 'int*' to 'int' [-fpermissive]
   17 |                                 if(TRA(i,l,k)==1)ans++;
      |                                          ^
      |                                          |
      |                                          int*
a.cc:4:20: note:   initializing argument 2 of 'bool TRA(int, int, int)'
    4 | bool TRA(int i,int j,int k){
      |                ~~~~^
Language: C++

// C++ program to count number of triangles that can be 
// formed from given array 
#include <bits/stdc++.h> 
using namespace std; 
  
/* Following function is needed for library function  
qsort(). Refer  
http:// www.cplusplus.com/reference/clibrary/cstdlib/qsort/ */
int comp(const void* a, const void* b) 
{ 
    return *(int*)a > *(int*)b; 
} 
  
// Function to count all possible triangles with arr[] 
// elements 
int findNumberOfTriangles(int arr[], int n) 
{ 
    // Sort the array elements in non-decreasing order 
    qsort(arr, n, sizeof(arr[0]), comp); 
  
    // Initialize count of triangles 
    int count = 0; 
  
    // Fix the first element. We need to run till n-3 
    // as the other two elements are selected from 
    // arr[i+1...n-1] 
    for (int i = 0; i < n - 2; ++i) { 
        // Initialize index of the rightmost third 
        // element 
        int k = i + 2; 
  
        // Fix the second element 
        for (int j = i + 1; j < n; ++j) { 
            // Find the rightmost element which is 
            // smaller than the sum of two fixed elements 
            // The important thing to note here is, we 
            // use the previous value of k. If value of 
            // arr[i] + arr[j-1] was greater than arr[k], 
            // then arr[i] + arr[j] must be greater than k, 
            // because the array is sorted. 
            while (k < n && arr[i] + arr[j] > arr[k]) 
                ++k; 
  
            // Total number of possible triangles that can 
            // be formed with the two fixed elements is 
            // k - j - 1. The two fixed elements are arr[i] 
            // and arr[j]. All elements between arr[j+1]/ to 
            // arr[k-1] can form a triangle with arr[i] and arr[j]. 
            // One is subtracted from k because k is incremented 
            // one extra in above while loop. 
            // k will always be greater than j. If j becomes equal 
            // to k, then above loop will increment k, because arr[k] 
            // + arr[i] is always greater than arr[k] 
            if (k > j) 
                count += k - j - 1; 
        } 
    } 
  
    return count; 
} 
  
// Driver code 
int main() 
{ 
    long long int size;
    cin>>size;
    long long int arr[size];
    for(long long int i=0;i,size;i++)
    {
        cin>>arr[i];
    }
    
  
    cout << "Total number of triangles possible is " << findNumberOfTriangles(arr, size); 
  
    return 0; 
} 

Compiler output:
a.cc: In function 'int main()':
a.cc:74:79: error: cannot convert 'long long int*' to 'int*'
   74 |     cout << "Total number of triangles possible is " << findNumberOfTriangles(arr, size);
      |                                                                               ^~~
      |                                                                               |
      |                                                                               long long int*
a.cc:16:31: note:   initializing argument 1 of 'int findNumberOfTriangles(int*, int)'
   16 | int findNumberOfTriangles(int arr[], int n)
      |                           ~~~~^~~~~
Language: C++

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;

int main() {
    ull N;
    cin >> N;
    vector<ull> L(N);
    for (ull i=0; i<N; i++) {
        cin >> L[i];
    }
    ull cnt = 0;
    for (ull i=0; i<N-2; i++) {
        for (ull j=i+1; j<N-1; j++) {
            if (L[i] == L[j]) {
                break;
            }
            else {
                for (ull k=j+1; k<N; k++) {
                    if (L[i] == L[k] || L[j] == L[k]) {
                        break;
                    }
                    else {
                        ull L_s = L[i] + L[j] + L[k];
                        ull L_l = max(L[i], L[j], L[k]);
                        if (L_s - L_l > L_l) {
                            cnt ++;
                        }
                    }
                }
            }
        }
    }
    cout << cnt << endl;
}

Compiler output:
In file included from /usr/include/c++/14/algorithm:60,
                 from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:51,
                 from a.cc:1:
/usr/include/c++/14/bits/stl_algobase.h: In instantiation of 'constexpr const _Tp& std::max(const _Tp&, const _Tp&, _Compare) [with _Tp = long long unsigned int; _Compare = long long unsigned int]':
a.cc:26:38:   required from here
   26 |                         ull L_l = max(L[i], L[j], L[k]);
      |                                   ~~~^~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_algobase.h:306:17: error: '__comp' cannot be used as a function
  306 |       if (__comp(__a, __b))
      |           ~~~~~~^~~~~~~~~~
Language: C

#include<stdio.h>
int main(){
 	int i;	
  	int ans = 0;
  	int n;
  	int a[100] = {0};
  	int b[100] = {0};
  	int p,q,r;
  
  scanf("%d",&n);
  
  for(i=0;i<n;i++){
    scanf("%d",&a[i]);
}
  
  
  for(p=0;p<n;p++){
    for(q=p+1;q<n;q++){
    	for(r=q+1;r<n;r++){
    	if(p>q&&p>r){
          if(p<q+r){
            ans++;
          }
        }
         if(q>p&&q>r){
          if(q<p+r){
            ans++;
          }
        }
         if(r>p&&r>q){
          if(r<q+p){
            ans++;
          }
        }
          
       }
    }
  }
  prinf("%d",ans);
  return 0;
}


Compiler output:
main.c: In function 'main':
main.c:39:3: error: implicit declaration of function 'prinf'; did you mean 'printf'? [-Wimplicit-function-declaration]
   39 |   prinf("%d",ans);
      |   ^~~~~
      |   printf
Language: C

#include<stdio.h>

using namespace std;
int main()
{
	int n;
	int p[100];
	int a=0;
	scanf("%d",&n);
	for(int i=0;i<n;i++)
	{
		scanf("%d",&p[i]);
	}
	for(int i=0;i<n;i++)
	{
		for(int j=i+1;j<n;j++)
		{
			for(int k=j+1;k<n;k++)
			{
				if((p[i]!=p[j])&&(p[j]!=p[k])&&(p[i]!=p[k])&&(p[i]+p[j]>p[k])&&(p[i]+p[k]>p[j])&&(p[j]+p[k]>p[i]))
				{
					++a;
				}
			}
		}
	}
	printf("%d",a);
	return 0;
}

Compiler output:
main.c:3:1: error: unknown type name 'using'
    3 | using namespace std;
      | ^~~~~
main.c:3:17: error: expected '=', ',', ';', 'asm' or '__attribute__' before 'std'
    3 | using namespace std;
      |                 ^~~
Language: C++

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;

int main() {
    ull N;
    cin >> N;
    vector<ull> L(N);
    for (int i=0; i<N; i++) {
        cin >> L[i];
    }
    ull cnt = 0;
    for (int i=0; i<N-2; i++) {
        for (int j=i+1; j<N-1; j++) {
            if (L[i] == L[j]) {
                break;
            }
            else {
                for (int k=j+1; k<N; k++) {
                    if (L[i] == L[k] || L[j] == L[k]) {
                        break;
                    }
                    else {
                        ull L_s = L[i] + L[j] + L[k];
                        ull L_l = max(L[i], L[j], L[k]);
                        if (L_s - L_l > L_l) {
                            cnt ++;
                        }
                    }
                }
            }
        }
    }
    cout << cnt << endl;
}

Compiler output:
In file included from /usr/include/c++/14/algorithm:60,
                 from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:51,
                 from a.cc:1:
/usr/include/c++/14/bits/stl_algobase.h: In instantiation of 'constexpr const _Tp& std::max(const _Tp&, const _Tp&, _Compare) [with _Tp = long long unsigned int; _Compare = long long unsigned int]':
a.cc:26:38:   required from here
   26 |                         ull L_l = max(L[i], L[j], L[k]);
      |                                   ~~~^~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_algobase.h:306:17: error: '__comp' cannot be used as a function
  306 |       if (__comp(__a, __b))
      |           ~~~~~~^~~~~~~~~~
Language: C++

#include<vector>
#include<iostream>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector <int> vi;
typedef vector <ll> vll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
typedef vector < pii > vpii;
typedef vector < pll > vpll;
typedef vector <string> vs;
typedef vector < vi > vvi;
typedef vector < vll > vvll;
typedef vector< vpii > vvpii;
 
typedef vector< vpll > vvpll;
#define all(v)     (v).begin(), (v).end()
#define srt(v)    sort (all (v))
#define pb push_back
#define mp make_pair
#define sz(x) ((int) (x).size())
#define FAST_IO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
const int mod=1e9+7;
 
 // bool comp(int i, int j){
 //    return i>j;
 // }
 
int main() {
    FAST_IO;
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    int t;
    cin>>t;
    unordered_map<int,int>M;
    vector<int>A;
    while(t--){
          int a;
          cin>>a;
          M[a]++;
          if(M[a]==1)A.pb(a);
   }
   sort(all(A));
   int ans=0;
   int l=A.size();
   if(A.size()<3)ans=0;
   else{int i=0;
        
        int j,k;
        while(i<l-2){
                j=i+1;
                while(j<l-1){
                    k=j+1;
                    while(k<l){
                        if(A[i]+A[j]>A[k])ans+=(M[A[i]]*M[A[j]]*M[A[k]]);
                        k++;
                    }
                    j++;
                }
                i++;
        }
 
 
   }
   cout<<ans<<endl;
 
    return 0;
}
 
 
 
 

Compiler output:
a.cc: In function 'int main()':
a.cc:35:5: error: 'unordered_map' was not declared in this scope
   35 |     unordered_map<int,int>M;
      |     ^~~~~~~~~~~~~
a.cc:3:1: note: 'std::unordered_map' is defined in header '<unordered_map>'; this is probably fixable by adding '#include <unordered_map>'
    2 | #include<iostream>
  +++ |+#include <unordered_map>
    3 | using namespace std;
a.cc:35:19: error: expected primary-expression before 'int'
   35 |     unordered_map<int,int>M;
      |                   ^~~
a.cc:40:11: error: 'M' was not declared in this scope
   40 |           M[a]++;
      |           ^
a.cc:43:4: error: 'sort' was not declared in this scope; did you mean 'short'?
   43 |    sort(all(A));
      |    ^~~~
      |    short
a.cc:55:49: error: 'M' was not declared in this scope
   55 |                         if(A[i]+A[j]>A[k])ans+=(M[A[i]]*M[A[j]]*M[A[k]]);
      |                                                 ^
Language: Java

import java.util.*; 
import java.lang.*; 


public class Main{
	public static void main(String[] args){
		Scanner scan = new Scanner(System.in);
                
                int N = scan.nextInt();
                
                long[] L = new long[N];
                
                for(int i=0; i<N; i++){
                    L[i] = scan.nextLong();
                }
                
                int ans = 0;
                
                if(N<=2){
                    System.out.println(0);
                }else{
                    for(int i=0; i<N-2; i++){
                        for(int j=i; j<N-1; j++){
                            for(int k=j; k<N; k++){
                                if(L[i]!=L[j] && L[k]!=L[j] && L[k]!=L[i]){
                                    long a = L[i]+L[j];
                                    long b = L[j]+L[k];
                                    long c = L[k]+L[i];
                                    if(a>L[k] && b>L[i] && c>L[j]){
                                        ans++;
                                    }
                                }
                            }
                        }
                    }
                    
                    System.out.println(ans);
                }

Compiler output:
Main.java:38: error: reached end of file while parsing
                }
                 ^
1 error
Language: C++

#include"bits\stdc++.h"
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector <int> vi;
typedef vector <ll> vll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
typedef vector < pii > vpii;
typedef vector < pll > vpll;
typedef vector <string> vs;
typedef vector < vi > vvi;
typedef vector < vll > vvll;
typedef vector< vpii > vvpii;

typedef vector< vpll > vvpll;
#define all(v)     (v).begin(), (v).end()
#define srt(v)    sort (all (v))
#define pb push_back
#define mp make_pair
#define sz(x) ((int) (x).size())
#define FAST_IO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
const int mod=1e9+7;

 // bool comp(int i, int j){
 //    return i>j;
 // }

int main() {
    FAST_IO;
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    int t;
    cin>>t;
    unordered_map<int,int>M;
    vector<int>A;
    while(t--){
          int a;
          cin>>a;
          M[a]++;
          if(M[a]==1)A.pb(a);
   }
   sort(all(A));
   int ans=0;
   int l=A.size();
   if(A.size()<3)ans=0;
   else{int i=0;
        
        int j,k;
        while(i<l-2){
                j=i+1;
                while(j<l-1){
                    k=j+1;
                    while(k<l){
                        if(A[i]+A[j]>A[k])ans+=(M[A[i]]*M[A[j]]*M[A[k]]);
                        k++;
                    }
                    j++;
                }
                i++;
        }


   }
   cout<<ans<<endl;

    return 0;
}






Compiler output:
a.cc:1:9: fatal error: bits\stdc++.h: No such file or directory
    1 | #include"bits\stdc++.h"
      |         ^~~~~~~~~~~~~~~
compilation terminated.
Language: C++

#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
  cin>>n;
  vector<int>vec(n);
  for(int i=0;i<n;i++){
    cin>>vec.at(i);}


Compiler output:
a.cc: In function 'int main()':
a.cc:8:21: error: expected '}' at end of input
    8 |     cin>>vec.at(i);}
      |                     ^
a.cc:3:11: note: to match this '{'
    3 | int main(){
      |           ^
Language: C++

#include <iostream>

using namespace std;



int main()
{
  int n;
  
  cin >> n;
  
  int l[n];
  for(int i=0;i<n;i++) cin >> l[i];
  
  sort(l,l+sizeof(l)/sizeof(l[0]));
  
  int ans = 0;
  
  for(int i=0;i<n;i++)
    for(int j=i+1;j<n;j++)
      for(int k=j+1;k<n;k++)
      {
        if (i*i+j*j==k*k) ans++;
      }
  
  cout << ans << endl;
  
  return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:16:3: error: 'sort' was not declared in this scope; did you mean 'short'?
   16 |   sort(l,l+sizeof(l)/sizeof(l[0]));
      |   ^~~~
      |   short
Language: C++

#include <iostream>

using namespace std;
int i,n,j,k,nr;
int a[105];
int main()
{
    cin>>n;
    for(i=1;i<=n;i++)
        cin>>a[i];
    
    sort(a+1, a+n+1);
    
    for(i=1;i<=n;i++)
    {
        for(j=i+1;j<=n;j++)
        {
            if(a[j]==a[i])
                continue;
            
            for(k=j+1;k<=n;k++)
            {
                if(a[k]==a[j])
                    continue;
                
                if(a[i]+a[j]>=a[k])
                    nr++;
            }
        }
    }
        
    cout<<nr;
    return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:12:5: error: 'sort' was not declared in this scope; did you mean 'short'?
   12 |     sort(a+1, a+n+1);
      |     ^~~~
      |     short
Language: C++

2
1 1#include<bits/stdc++.h>

using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    int n;
    cin>>n;
    int l[n];
    for(int i=0; i<n; i++) cin>>l[i];
    int cnt= 0;
    for(int i=0; i<n-2; i++){
        for(int j=i+1; j<n-1; j++){
            for(int k=j+1; k<n; k++){
                if(l[k]<l[i]+l[j] && l[i]<l[k]+l[j] && l[j]<l[i]+l[k]){
                    if(l[i]==l[k] || l[k]==l[j] || l[j]==l[i]) continue;
                    cnt++;
                }

            }
        }
    }
    cout<<cnt;
    return 0;
}


Compiler output:
a.cc:2:4: error: stray '#' in program
    2 | 1 1#include<bits/stdc++.h>
      |    ^
a.cc:1:1: error: expected unqualified-id before numeric constant
    1 | 2
      | ^
a.cc: In function 'int main()':
a.cc:7:5: error: 'ios' has not been declared
    7 |     ios::sync_with_stdio(false);
      |     ^~~
a.cc:8:5: error: 'cin' was not declared in this scope
    8 |     cin.tie(NULL);
      |     ^~~
a.cc:8:13: error: 'NULL' was not declared in this scope
    8 |     cin.tie(NULL);
      |             ^~~~
a.cc:1:1: note: 'NULL' is defined in header '<cstddef>'; this is probably fixable by adding '#include <cstddef>'
  +++ |+#include <cstddef>
    1 | 2
a.cc:25:5: error: 'cout' was not declared in this scope
   25 |     cout<<cnt;
      |     ^~~~
Language: C++


#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update
#include <ext/pb_ds/detail/standard_policies.hpp>


/* 
*    coder :: ATUL_PANDEY_2608
*        >>> INDIA <<<
*/
using namespace std;
using namespace __gnu_pbds;

// #define  part ..
#define pb(a) push_back(a)
#define all(a) a.begin(),a.end() 
#define mod 1000000007
//#define maxx 200006
#define ll long long 
#define quick    ios_base::sync_with_stdio(NULL),cin.tie(0);
#define listll vector< long long > 
#define listi vector< int> 
#define pii   pair<int , int> 
#define pll pair<long long , long long > 
#define minheap priority_queue<long long , vector< long long >, greater<long long > >
#define rep(i,a,b) for(int i=a;i<b;i++)
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}


template < class T > using oset = tree< T , null_type, less  < T  > , rb_tree_tag , tree_order_statistics_node_update > ;


// end of #define 

// define globals ...
const int maxx = 2e5+26;

//write function from here ...







int Main(){

int n;
cin>>n;



listll arr;
for(int i=0;i<n;i++)
{
	ll a;
	cin>>a;
	arr.pb(a);
}

ll ans = 0;

for(int i=0;i<n;i++)
{
	for(int j=i+1;j<n;j++)
	{
		for(int k=j+1;k<n;k++){
			
			if( (arr[i]+arr[j]>arr[k] )&& (arr[i]+arr[k]>arr[j] )&&  (arr[k]+arr[j]>arr[i])&& arr[i]^arr[j] &&arr[i]^arr[k]&&arr[j]^arr[k] )6
4 5 4 3 3 5

			ans+=1;
			
			
			
		}
	}
}

cout<<ans<<endl;


return 0;

}

















int main(){
 quick;
int t =1; 
//cin>>t;
while(t-- )
 Main();

 return 0;


}


Compiler output:
a.cc: In function 'int Main()':
a.cc:70:154: error: expected ';' before numeric constant
   70 |                         if( (arr[i]+arr[j]>arr[k] )&& (arr[i]+arr[k]>arr[j] )&&  (arr[k]+arr[j]>arr[i])&& arr[i]^arr[j] &&arr[i]^arr[k]&&arr[j]^arr[k] )6
      |                                                                                                                                                          ^
      |                                                                                                                                                          ;
   71 | 4 5 4 3 3 5
      | ~
Language: C++

#include<bits/stdc++.h>
using namespace std;
signed main() {
	int n,cnt=0;
	cin>>n;
	int a[n+1];
	for(int i=1;i<=n;i++){
		cin>>a[i];
	}
	for(int i=1;i<=n;i++){
		for(int j=i+1;j<=n;j++){
			for(int k=j+1;k<=n;k++){
				if(max(a[i],max(a[j],a[k]))<a[i]+a[j]+a[k]-max(a[i],max(a[j],a[k])){
					cnt++;
				}
			}
		}
	}
	cout<<cnt;
	return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:13:100: error: expected ')' before '{' token
   13 |                                 if(max(a[i],max(a[j],a[k]))<a[i]+a[j]+a[k]-max(a[i],max(a[j],a[k])){
      |                                   ~                                                                ^
      |                                                                                                    )
a.cc:16:25: error: expected primary-expression before '}' token
   16 |                         }
      |                         ^
Language: C

#include <bits/stdc++.h>
#define endl '\n'
#define LL long long
#define LD long double
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define debug(x) cerr << #x << " is " << x << endl;
using namespace std;
int const MAXN = 2e6 + 9;
int a[MAXN];
int main(){
    ios_base::sync_with_stdio (0),cin.tie(0);
    int n;
    cin >> n;
    for(int i = 0; i < n; i++)
        cin >> a[i];
    int ans = 0;
    for(int i = 0; i < n; i++){
        for(int j = i + 1; j < n; j++)
            for(int k = j + 1; k < n; k++){
                vector<int> v;
                v.push_back(a[i]);
                v.push_back(a[j]);
                v.push_back(a[k]);
                sort(all(v));
                if(v[0] == v[1] or v[1] == v[2]) continue;
                ans += (v[0] + v[1] > v[2]);
                
            }
    }
    cout << ans << endl;
}

Compiler output:
main.c:1:10: fatal error: bits/stdc++.h: No such file or directory
    1 | #include <bits/stdc++.h>
      |          ^~~~~~~~~~~~~~~
compilation terminated.
Language: C

#include <iostream>
#include <random>
#include <chrono>
#include <algorithm>
#define rep(i, x) for(ll i = 0; i < x; i++)
using namespace std;
typedef long long ll;
const ll MOD = (ll)1e9+7;
const ll N = 5e5+5, inf = 1e9+5000;
ll add(ll x, ll y) { x += y; if (x >= MOD) return x - MOD; return x; }
ll sub(ll x, ll y) { x -= y; if (x < 0) return x + MOD; return x; }
ll mult(ll x, ll y) { return (x * y) % MOD; }
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  
  int n; cin >> n;
  vector<int> L(n);
  rep (i, n) cin >> L[i];

  ll ans = 0;
  for (int i = 0; i < n; i++) {
    for (int j = i+1; j < n; j++) {
      for (int k = j+1; k < n; k++) {
        if (L[i]!=L[j] && L[i]!=L[k] && L[j]!=L[k]) {
          vector<int> sides = {L[i], L[j], L[k]};
          sort(begin(sides), end(sides));
          if (sides[0] + sides[1] > sides[2]) {
            ans++;
          }
        }
      }
    }
  }

  cout << ans << endl;

  return 0;
}

Compiler output:
main.c:1:10: fatal error: iostream: No such file or directory
    1 | #include <iostream>
      |          ^~~~~~~~~~
compilation terminated.
Language: C++

#include<bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
	int n,cnt=0;
	cin>>n;
	int a[n+1];
	for(int i=1;i<=n;i++){
		cin>>a[i];
	}
	for(int i=1;i<=n;i++){
		for(int j=i+1;j<=n;j++){
			for(int k=j+1;k<=n;k++){
				if(max(a[i],a[j],a[k])<a[i]+a[j]+a[k]-max(a[i],a[j],a[k])){
					cnt++;
				}
			}
		}
	}
	cout<<cnt;
	return 0;
}


Compiler output:
In file included from /usr/include/c++/14/algorithm:60,
                 from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:51,
                 from a.cc:1:
/usr/include/c++/14/bits/stl_algobase.h: In instantiation of 'constexpr const _Tp& std::max(const _Tp&, const _Tp&, _Compare) [with _Tp = long long int; _Compare = long long int]':
a.cc:14:11:   required from here
   14 |                                 if(max(a[i],a[j],a[k])<a[i]+a[j]+a[k]-max(a[i],a[j],a[k])){
      |                                    ~~~^~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_algobase.h:306:17: error: '__comp' cannot be used as a function
  306 |       if (__comp(__a, __b))
      |           ~~~~~~^~~~~~~~~~
Language: C++

#include <bits/stdc++.h>
#define int long long int
#define ii pair<int,int>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
using namespace std;
#define output(x) for (auto a:x) cout<<a<<" ";cout<<endl;
#define output2(x) for (auto a:x) cout<<a.fi<<" "<<a.se<<endl;
#define PI 3.14159265
#define rall(x) x.rbegin(),x.rend()
#define all(x) x.begin(),x.end()
#define sz(x) (int) x.size()
// DEBUG TEMPLATE
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
  enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (auto it = d.b; it != d.e; ++it)
  *this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
  
// DEBUG TEMPLATE ENDS

#define MOD 1000000007
int power(int x,int y,int mod = MOD) 
{ 
  int ret = 1;
  x = x % mod;
  while (y){
    if(y&1) ret = (ret*x)%mod;
    y = y>>1;
    x = (x*x)%mod;
    } 
    return ret%mod; 
}

void solve()
{ 
  int n;
  cin>>n;
  vector<int> inp(n);
  for (auto &x:inp) cin>>x;
  int ans = 0;
  for (int i = 0 ; i < n ; i++){
    for (int j = i +  1 ; j < n ; j++){
      for (int k = j + 1 ; k < n ; k++){
        vector<int> temp;
        temp.pb(inp[i]);
        temp.pb(inp[j]);
        temp.pb(inp[k]);
        sort(all(temp));
        if (a[0] + a[1] > a[2]) ans++;
       }
    }
  }
  cout<<ans<<endl;
}


/*
  
*/
signed main(){
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int t = 1;
  // cin>>t;
  while (t--)
  solve();
}
// Check MOD values plox :(


Compiler output:
a.cc: In function 'void solve()':
a.cc:75:13: error: 'a' was not declared in this scope
   75 |         if (a[0] + a[1] > a[2]) ans++;
      |             ^
Language: C++

#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define ff first
#define ss second
typedef long long ll;
ll power(ll a, ll b){//a^b
    ll res=1;
    a=a%MOD;
    while(b>0){
        if(b&1){res=(res*a)%MOD;b--;}
        a=(a*a)%MOD;
        b>>=1;
    }
    return res;
}
bool isPalin(string s){
    if (s==string(s.rbegin(),s.rend()))
        return true;
    return false;
}
ll fermat_inv(ll y){return power(y,MOD-2);}
ll gcd(ll a, ll b){return (b==0)?a:gcd(b,a%b);}
int main(){
    ll t=1;
    //cin>>t;
    while(t--){
        int n;
        cin>>n;
        int a[n];
        for(int i=0;i<n;i++)
            cin>>a[i];
        sort(a,a+n);
        for(int i=0;i<n;i++){
            for(int j=i+1;j<n;j++){
                for(int k=j+1;k<n;k++){
                    if(a[i]+a[j]>a[k])
                        ans++;
                }
            }
        }
        cout<<ans<<"\n";
    }
    return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:38:25: error: 'ans' was not declared in this scope; did you mean 'abs'?
   38 |                         ans++;
      |                         ^~~
      |                         abs
a.cc:42:15: error: 'ans' was not declared in this scope; did you mean 'abs'?
   42 |         cout<<ans<<"\n";
      |               ^~~
      |               abs
Language: C++

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rep1(i, n) FOR(i, 1, n+1)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define whole(x) (x).begin(),(x).end()
#define rwhole(x) (x).rbegin(), (x).rend()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define P pair<int, int>
#define debug(var) cerr << "[" << #var << "] " << var << endl
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define vi vector<int>
#define vl vector<ll>
#define pb push_back
#define eb emplace_back
#define pr(s) cout << (s) << '\n'
const ll mod = 1000000007;
const int dx[] = {-1,0,1,0};
const int dy[] = {0,-1,0,1};


int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    int n;
    cin >> n;
    vl l(n);
    rep(i, n) cin >> l[i];
    int ans = 0;
    rep(i, n-2) for (int j=i+1; j<n-1; j++) for(int k=j+1; k<n; k++) {
        vector<int> v(3);
        v[0] = l[i];
        v[1] = l[j];
        v[2] = l[k];
        sort(whole(v));
        if (v[0]==v[1] || v[1]==v[2]) continue;
        if (v[2]>__amd64=v[0]+v[1]) continue;
        ans++;
    }
    
    
    pr(ans);
    return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:41:17: error: lvalue required as left operand of assignment
   41 |         if (v[2]>__amd64=v[0]+v[1]) continue;
Language: C

#include<bits/stdc++.h>

int main(){
    using namespace std;
    unsigned long N;
    cin >> N;
    vector<unsigned long> L(N);
    for(auto&& i : L)cin >> i;
    unsigned long ans{0};
    for(const auto& i : L)for(const auto& j : L)for(const auto& k : L)if(i != j && j != k && i != k && 2 * max({i, j, k}) < i + j + k)++ans;
    cout << ans / 6 << endl;
    return 0;
}

Compiler output:
main.c:1:9: fatal error: bits/stdc++.h: No such file or directory
    1 | #include<bits/stdc++.h>
      |         ^~~~~~~~~~~~~~~
compilation terminated.
Language: C++

#include <bits/stdc++.h>
using namespace std;
using ll=long long;

int main(){
    ll x, k, d;
    cin >> x >> k >> d;
    ll a;
    
    if((x>0 && x-k*d>=0) || (x<0 && x-k*d=<0)){
        cout << abs(x-k*d) << endl;
    }else{
        a=x/d-x%d;
        x%=d;
        x=(x+d)%d;
        if(abs(x)<abs(x-d)){
            cout << abs(x) << endl;
        }else{
            cout << abs(x-d) << endl;
        }
    }

    return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:10:43: error: expected primary-expression before '<' token
   10 |     if((x>0 && x-k*d>=0) || (x<0 && x-k*d=<0)){
      |                                           ^
Language: C++

#include <bits/stdc++.h>
using namespace std;
int main() {
  long long X,K,D;
  cin>>X>>K>>D;
  long long ans,a;
  if(X<0)X=-X;
  if(X>=K*D)ans=X-K*D;
  if(X==0)ans=K%2*D;
  for(int i=0;i<K;i++){
    a=i*D
    if(X-a<=D){
      ans=min(X-a+(K-i)%2*D,a+D-X+(K-i-1)%2*D);
      break;
    }
  
  }
  cout<<ans<<endl;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:11:10: error: expected ';' before 'if'
   11 |     a=i*D
      |          ^
      |          ;
   12 |     if(X-a<=D){
      |     ~~
Language: C

#include <bits/stdc++.h>
using namespace std;
#define ll long long 
int main() 
{
    ll x,k,d;
    cin>>x>>k>>d;
    x=abs(x);
    ll p=min(k,x/d);
    k-=p;
    x-=p*d;
    if(k%2==0) cout<<x<<endl;
    else cout<<d-x<<endl;
    return 0;
}

Compiler output:
main.c:1:10: fatal error: bits/stdc++.h: No such file or directory
    1 | #include <bits/stdc++.h>
      |          ^~~~~~~~~~~~~~~
compilation terminated.
Language: Java

import java.util.Scanner;

public class HelloWorld{

     public static void main(String []args){
        long X,K,D;
        Scanner sc = new Scanner(System.in);
        
        X = sc.nextLong();
        K = sc.nextLong();
        D = sc.nextLong();
        
        
        long Xa = Math.abs(X);
        long ans = 0;
        
        long n = Xa / D;
        
        if(n > K) {
            ans = Xa - K*D;
            
        }
        
        else {
            if((Xa - n*D) > -(Xa-(n+1)*D)) {
                if((K-(n+1))%2==0)
                    ans = -(Xa-(n+1)*D);
                else
                    ans = (Xa - n*D);
            }
            else {
                if((K-(n))%2==0)
                    ans = (Xa - n*D); 
                else
                    ans = -(Xa-(n+1)*D);
                
            }
        }    
        //ans *=  (X<0?-1:1);
        System.out.println(ans);
         
     }
}

Compiler output:
Main.java:3: error: class HelloWorld is public, should be declared in a file named HelloWorld.java
public class HelloWorld{
       ^
1 error
Language: Java

import java.util.*;
import java.math.*;
class Main  
{
	public static void main (String[] args) throws java.lang.Exception
	{
	   System.out.println(process2());
	}
	
	public static int process2(){
	  
	    Scanner scan = new Scanner(System.in);
	    int start = scan.nextInt();
	    int least = scan.nextInt();
	    int end  = scan.nextInt();
	    int answer = 0;
	    for(int i = 0;i<=abs(start-end);i++)
	    {
	        if(process(start,least,end,start,i)==true)
	           {
	                answer  = i;
	                break;   
	           }
	    }
	    return answer;
	}
	
	
	
	
	
	public static boolean process(int start,int least,int end,int cur,int leap){
	    if(least == 0 && cur == end)
	        return true;
	    else if(least<0)
	        return false;
	    else
	        return process(start,least-1,end,cur+leap,leap)||process(start,least-1,end,cur-leap,leap);
	}
}

Compiler output:
Main.java:17: error: cannot find symbol
	    for(int i = 0;i<=abs(start-end);i++)
	                     ^
  symbol:   method abs(int)
  location: class Main
1 error
Language: Java

import java.util.*;
import java.Math.*;
class Main  
{
	public static void main (String[] args) throws java.lang.Exception
	{
	   System.out.println(process2());
	}
	
	public static int process2(){
	  
	    Scanner scan = new Scanner(System.in);
	    int start = scan.nextInt();
	    int least = scan.nextInt();
	    int end  = scan.nextInt();
	    int answer = 0;
	    for(int i = 0;i<=abs(start-end);i++)
	    {
	        if(process(start,least,end,start,i)==true)
	           {
	                answer  = i;
	                break;   
	           }
	    }
	    return answer;
	}
	
	
	
	
	
	public static boolean process(int start,int least,int end,int cur,int leap){
	    if(least == 0 && cur == end)
	        return true;
	    else if(least<0)
	        return false;
	    else
	        return process(start,least-1,end,cur+leap,leap)||process(start,least-1,end,cur-leap,leap);
	}
}

Compiler output:
Main.java:2: error: package java.Math does not exist
import java.Math.*;
^
Main.java:17: error: cannot find symbol
	    for(int i = 0;i<=abs(start-end);i++)
	                     ^
  symbol:   method abs(int)
  location: class Main
2 errors
Language: Java

import java.util.*;
class Main  
{
	public static void main (String[] args) throws java.lang.Exception
	{
	   System.out.println(process2(10,1,2));
	}
	
	public static int process2(){
	  
	    Scanner scan = new Scanner(System.in);
	    int start = scan.nextInt();
	    int least = scan.nextInt();
	    int end  = scan.nextInt();
	    int answer = 0;
	    for(int i = 0;i<=start-end;i++)
	    {
	        if(process(start,least,end,start,i)==true)
	           {
	                answer  = i;
	                break;   
	           }
	    }
	    return answer;
	}
	
	
	
	
	
	public static boolean process(int start,int least,int end,int cur,int leap){
	    if(least == 0 && cur == end)
	        return true;
	    else if(least<0)
	        return false;
	    else
	        return process(start,least-1,end,cur+leap,leap)||process(start,least-1,end,cur-leap,leap);
	}
}

Compiler output:
Main.java:6: error: method process2 in class Main cannot be applied to given types;
	   System.out.println(process2(10,1,2));
	                      ^
  required: no arguments
  found:    int,int,int
  reason: actual and formal argument lists differ in length
1 error
Language: Java

public static void main (String[] args) throws java.lang.Exception
	{
	   return progress(args[0],args[1],args[2]);
	}
	
	public static int progress(int X, int K ,int D){
	    int start = X;
	    int least = K;
	    int end  = D;
	    int answer = 0;
	    for(int i = 0;i<=start-end;i++)
	    {
	        if(process(start,least,end,start,i)==true)
	           {
	                answer  = i;
	                break;   
	           }
	    }
	    return answer;
	}
	
	
	
	
	
	public static Boolean process(int start,int least,int end,int cur,int leap){
	    if(least == 0 && cur == end)
	        return true;
	    else if(least<0)
	        return false;
	    else
	        return process(start,least-1,end,cur+leap,leap)||process(start,least-1,end,cur-leap,leap);
	}

Compiler output:
Main.java:1: error: unnamed classes are a preview feature and are disabled by default.
public static void main (String[] args) throws java.lang.Exception
              ^
  (use --enable-preview to enable unnamed classes)
1 error
Language: Java

	public static int progress(int X, int K ,int D){
	  
	    int start = X;
	    int least = K;
	    int end  = D;
	    int ans = 0；
	    for(i = 0;i<start-end;i++)
	    {
	        if(process(start,least,end,start,i)==true)
	           {
	                ans = i;
	                break;   
	           }
	    }
	    return ans ;
	}
	
	
	
	
	
	public static process(int start,int least,int end,int cur,int leap){
	    if(least == 0 && cur == end)
	        return true;
	    else if(least<0)
	        return false;
	    else
	        return process(start,least-1,end,cur+1,leap)||process(start,least-1,end,cur-1,leap);
	   
	}

Compiler output:
Main.java:6: error: illegal character: '\uff1b'
	    int ans = 0?
	               ^
Main.java:1: error: unnamed classes are a preview feature and are disabled by default.
	public static int progress(int X, int K ,int D){
	              ^
  (use --enable-preview to enable unnamed classes)
Main.java:22: error: class, interface, enum, or record expected
	public static process(int start,int least,int end,int cur,int leap){
	              ^
Main.java:25: error: class, interface, enum, or record expected
	    else if(least<0)
	    ^
Main.java:27: error: class, interface, enum, or record expected
	    else
	    ^
Main.java:30: error: class, interface, enum, or record expected
	}
	^
6 errors