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

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

int main ()
{
	string  s ;
	cin >> s;
	map <int,int> c;
	int  ss=0,ans=0;
	c[0] = 1 ; 
	for (int i=0;i<s.size();i++){
	    ss = (ss+((s[i]-'0')*cur))%2019;
	    ans += c[ss] ; 
	    c[ss]++ ; 
	    cur = (cur*10)%2019;
	}
	cout << ans << endl ; 
	return 0;
}
		

Compiler output:
a.cc: In function 'int main()':
a.cc:12:34: error: 'cur' was not declared in this scope
   12 |             ss = (ss+((s[i]-'0')*cur))%2019;
      |                                  ^~~
Language: C++

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

const int m = 2019;

int main(){

    string s;
    cin>>s;
    int n = s.size();
    reverse(s.begin(),s.end());
    int x = 1,tot = 0;
    vector<int> cnt(m);
    l1 ans = 0;
    rep(i,n){
        cnt[tot]++;
        tot += {s[i]-'0'}*x;
        tot %= m;
        ans += cnt[tot];
        x = x*10%m;
    }
    cout << ans << endl;
    return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:19:25: error: invalid use of brace-enclosed initializer list
   19 |         tot += {s[i]-'0'}*x;
      |                         ^
Language: C++

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

int main() {
    vector<ll> T;
    string S;
    cin >> S;
    int N = S.size();
    for(int i = 0; i < N; ++i) {
        T.push_back(S[i] - '0');
    }
    int ans = 0;
    for(int i = 4; i < N; ++i) {
        ll num = T[i];
        for(int j = i + 1; j < N; ++j) {
            num *= 10;
            num += T[j];
            if(num % 2019 == 0) {
                ++ans;
            }
        }
    }
    cout << ans << endl;



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

# Jasmine_ss's code modified by centipede_human

function MultipleOf2019(str)
    S = str
    n = length(S)
    T = zeros(Int, n+1)
    N = zeros(Int, 2019)
    N[1] += 1
    m = 1
    for i in n:-1:1
        T[i] = mod(T[i+1] + parse(Int, S[i])*m, 2019)
        m*=10; m%=2019
        N[T[i]+1] += 1
    end
#     println(T)
    println(sum(div(m*(m-1), 2) for m in N))
end
MultipleOf2019(readline())


Compiler output:
a.cc:1:3: error: invalid preprocessing directive #Jasmine_ss
    1 | # Jasmine_ss's code modified by centipede_human
      |   ^~~~~~~~~~
a.cc:1:13: warning: missing terminating ' character
    1 | # Jasmine_ss's code modified by centipede_human
      |             ^
a.cc:15:7: error: invalid preprocessing directive #println
   15 | #     println(T)
      |       ^~~~~~~
a.cc:3:1: error: 'function' does not name a type; did you mean 'union'?
    3 | function MultipleOf2019(str)
      | ^~~~~~~~
      | union
a.cc:12:16: error: 'm' does not name a type
   12 |         m*=10; m%=2019
      |                ^
Language: C++

#include<bits/stdc++.h>
using namespace std;
#define int long long
const int maxm=2e5+5;
char s[maxm];
int a[maxm];
int n;
signed main(){
    scanf("%s",s+1);
    n=strlen(s+1);
    for(int i=1;i<=n;i++){
        a[i]=s[i]-'0';
    }
    map<int,int>mark;
    int sum=0;
    int base=1;
    int ans=0;
    for(int i=b;i>=1;i--){
        sum=(sum*10+s[i]*base%mod)%mod;
        ans+=mark[sum];
        mark[sum]++;
        base=base*10%mod;
    }
    cout<<ans<<endl;
    return 0;
}
/*
对于s[l,r],如果是2019的倍数,那么满足:
s[l]*10^(n-l)%2019+
*/


Compiler output:
a.cc: In function 'int main()':
a.cc:18:15: error: 'b' was not declared in this scope
   18 |     for(int i=b;i>=1;i--){
      |               ^
a.cc:19:31: error: 'mod' was not declared in this scope; did you mean 'modf'?
   19 |         sum=(sum*10+s[i]*base%mod)%mod;
      |                               ^~~
      |                               modf
Language: C++

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

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

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

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

    string s;
    cin>>s;
    int cnt=0;
    for(int i=0;i<(int)s.size();i++){
        unsigned long long int devisor=0;
        for(int j=i;j<(int)s.size();j++){
            devisor=devisor*10+(s.at(j)-'0');
            if(devisor%2019==0){
                cnt++;
                break;
            }
        }
    }
    cout<<cnt;
}

}


Compiler output:
a.cc: In function 'int main()':
a.cc:12:9: warning: empty parentheses were disambiguated as a function declaration [-Wvexing-parse]
   12 | int main(){
      |         ^~
a.cc:12:9: note: remove parentheses to default-initialize a variable
   12 | int main(){
      |         ^~
      |         --
a.cc:12:9: note: or replace parentheses with braces to value-initialize a variable
a.cc:12:11: error: a function-definition is not allowed here before '{' token
   12 | int main(){
      |           ^
Language: C++

#include <iostream>
#include <algorithm>
#include <string>
#include <math.h>
#include <cstdint>
#include <sstream>
#include <map>
#include <cstring>
#include <vector>
#include <queue>
#include <iomanip>
#include <stack>
#include <unordered_set>
#include <conio.h>

using namespace std;
typedef long long ll;

ll ans, mx, sum, mn = 1e14, flag,cnt;


int main(){
	string  s;
	cin>>s;
	for(ll i=0; i<s.size(); i++){
		string t="";
		t+=s[i];
		for(ll j=i+1; j<s.size(); j++){
			t+=s[j];
			stringstream geek(t);
			ll x=0;
			geek>>x;
			if(x%2019==0) ans++;
		}
	}
	cout<<ans<<endl;	
}

Compiler output:
a.cc:14:10: fatal error: conio.h: No such file or directory
   14 | #include <conio.h>
      |          ^~~~~~~~~
compilation terminated.
Language: Java

import java.io.*;
import java.util.*;
import static java.lang.System.out;

public class Main {
    static MyReader in = new MyReader();

    public static void main(String[] args){
        String S = in.s();
        int len = S.length();
        int[] a = new int[2019];
        a[0] = 1;
        int x = 0;
         d = int;
        for (int i = len - 1; i >= 0; i--) {
            int j = S.charAt(i) - '0';
            x = (j * d + x) % 2019;
            a[x]++;
            d = 10 * d % 2019;
        }
        long ans = 0;
        for (int i = 0; i < 2019; i++) {
            ans += (long)a[i] * (a[i] - 1) / 2;
        }
        out.println(ans);
    }
}

class MyReader extends BufferedReader {
    char[] cbuf = new char[1024];
    int head = 0;
    int tail = 0;

    MyReader() {
        super(new InputStreamReader(System.in));
    }

    char next() {
        if (head == tail) {
            try {
                tail = read(cbuf, 0, cbuf.length);
            } catch (IOException e) {}
            head = 0;
        }
        return cbuf[head++];
    }

    void back() {
        head--;
    }

    boolean minus() {
        boolean minus;
        while (true) {
            char c = next();
            if (c != ' ' && c != '\n' && c != '\r') {
                if (!(minus = c == '-')) back();
                return minus;
            }
        }
    }

    void skip() {
        while (true) {
            char c = next();
            if (c != ' ' && c != '\n' && c != '\r') {
                back();
                break;
            }
        }
    }

    char[] s(final int N) {
        skip();
        char[] s = new char[N];
        for (int i = 0; i < s.length; i++) {
            s[i] = next();
        }
        return s;
    }

    String s() {
        try {
            return readLine();
        } catch (IOException e) {
            return "";
        }
    }

    int i() {
        boolean minus = minus();
        int n = 0;
        while (true) {
            int k = next() - '0';
            if (k < 0 || 9 < k) break;
            n = 10 * n + k;
        }
        return minus ? -n : n;
    }

    int[] ii(final int N) {
        int[] a = new int[N];
        for (int j = 0; j < a.length; j++) a[j] = i();
        return a;
    }

    long l() {
        boolean minus = minus();
        long n = 0;
        while (true) {
            int k = next() - '0';
            if (k < 0 || 9 < k) break;
            n = 10 * n + k;
        }
        return minus ? -n : n;
    }
}


Compiler output:
Main.java:14: error: '.class' expected
         d = int;
                ^
1 error
Language: Java

//AtCoder Beginner Contest 164 Task D
import java.io.*;
import java.util.*;

public class ac164d {
	static class InputReader{
		BufferedReader reader;
		StringTokenizer tokenizer;
		
		public InputReader(InputStream stream) {
			reader = new BufferedReader (new InputStreamReader(stream), 32768);
			tokenizer = null;
		}
		
		String next() {
			while(tokenizer == null || !tokenizer.hasMoreTokens()) {
				try {
					tokenizer = new StringTokenizer(reader.readLine());
				}catch(IOException e) {
					throw new RuntimeException(e);
				}
			}
			
			return tokenizer.nextToken();
		}
		
		public int nextInt() {
			return Integer.parseInt(next());
		}
		
		public long nextLong() {
			return Long.parseLong(next());
		}
		
		public double nextDouble() {
			return Double.parseDouble(next());
		}
		
	}
	

	static InputReader r = new InputReader(System.in);
	static PrintWriter pw = new PrintWriter(System.out);
	
	public static void main (String[] args) {
		
		//CODE GOES HERE
		
		String s = r.next();
		int n = s.length();
		int[] pre = new int[n+1];
		pre[n] = 0;
		int ten = 1;
		for(int i=n-1; i>=0; i--) {
			pre[i] = (pre[i+1] + ten*(int)(s.charAt(i)-48))%2019;
			ten = (ten*10)%2019;
		}
		
		int[] dis = new int[2019];
		
		for(int i=0; i<=n; i++) {
			dis[pre[i]]++;
		}
		
		long out = 0;
		
		for(int i=0; i<2019; i++) {
			out = out + (dis[i]*(dis[i]-1))/2;
		}
		
		pw.println(out);
		
		for(int i=0; i<2019; i++) {
			
		}
		
		pw.close();
		
	}
	
}


Compiler output:
Main.java:5: error: class ac164d is public, should be declared in a file named ac164d.java
public class ac164d {
       ^
1 error
Language: C++

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

#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define xrep(i, a, b) for (int i = int(a); i < int(b); ++i)
using ll = long long;
#include <bits/stdc++.h>
using namespace std;
void print() {
    cout << endl;
}
template <class Head, class... Tail>
void print(Head &&head, Tail &&... tail) {
    cout << head;
    if (sizeof...(tail) != 0)
        cout << " ";
    print(forward<Tail>(tail)...);
}
template <class T>
void print(vector<T> &vec) {
    for (auto &a : vec) {
        cout << a;
        if (&a != &vec.back())
            cout << " ";
    }
    cout << endl;
}
template <class T>
void print(vector<vector<T>> &df) {
    for (auto &vec : df) {
        print(vec);
    }
}

vector<int> num;
int cnt = 0;
bool visited[20000][20000];
int memo[200000][200000];
int N = 0;

int dfs(int i, int j) {
    if (visited[i][j]) return memo[i][j];
    if(i==N+1) {
        return 0;
    }
    if(j==N+1) {
        return 0;
    }
    visited[i][j] = true;
    int n = 0;
    for(int k=0; k<j-i; k++) {
        n += num[i+k]*pow(10, k);
    }
    if(n%2019==0 && n!=0) {
        cnt++;
    }
    dfs(i, j+1);
    dfs(i+1, j);
    memo[i][j] = n;
    return n;
}

int main() {
    string S;
    cin >> S;
    for(auto s: S) {
        num.push_back(s-'0');
    }
    reverse(num.begin(), num.end());
    N = num.size();
    auto piyo = dfs(0, 0);
    cout << cnt << endl;

    return 0;
}

Compiler output:
/tmp/ccA73bE3.o: in function `dfs(int, int)':
a.cc:(.text+0x82): relocation truncated to fit: R_X86_64_PC32 against symbol `N' defined in .bss section in /tmp/ccA73bE3.o
a.cc:(.text+0x9a): relocation truncated to fit: R_X86_64_PC32 against symbol `N' defined in .bss section in /tmp/ccA73bE3.o
/tmp/ccA73bE3.o: in function `main':
a.cc:(.text+0x2c2): relocation truncated to fit: R_X86_64_PC32 against symbol `N' defined in .bss section in /tmp/ccA73bE3.o
collect2: error: ld returned 1 exit status
Language: C++

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

#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define xrep(i, a, b) for (int i = int(a); i < int(b); ++i)
using ll = long long;
#include <bits/stdc++.h>
using namespace std;
void print() {
    cout << endl;
}
template <class Head, class... Tail>
void print(Head &&head, Tail &&... tail) {
    cout << head;
    if (sizeof...(tail) != 0)
        cout << " ";
    print(forward<Tail>(tail)...);
}
template <class T>
void print(vector<T> &vec) {
    for (auto &a : vec) {
        cout << a;
        if (&a != &vec.back())
            cout << " ";
    }
    cout << endl;
}
template <class T>
void print(vector<vector<T>> &df) {
    for (auto &vec : df) {
        print(vec);
    }
}

vector<int> num;
int cnt = 0;
bool visited[20000][20000];
int memo[20000][20000];
int N = 0;

int dfs(int i, int j) {
    if (visited[i][j]==true) return memo[i][j];
    if(i==N+1) {
        return 0;
    }
    if(j==N+1) {
        return 0;
    }
    visited[i][j] = true;
    int n = 0;
    for(int k=0; k<j-i; k++) {
        n += num[i+k]*pow(10, k);
    }
    if(n%2019==0 && n!=0) {
        cnt++;
    }
    dfs(i, j+1);
    dfs(i+1, j);
    memo[i][j] = n
    return n;
}

int main() {
    string S;
    cin >> S;
    for(auto s: S) {
        num.push_back(s-'0');
    }
    reverse(num.begin(), num.end());
    N = num.size();
    auto piyo = dfs(0, 0);
    cout << cnt << endl;

    return 0;
}

Compiler output:
a.cc: In function 'int dfs(int, int)':
a.cc:59:19: error: expected ';' before 'return'
   59 |     memo[i][j] = n
      |                   ^
      |                   ;
   60 |     return n;
      |     ~~~~~~         
a.cc:59:16: warning: control reaches end of non-void function [-Wreturn-type]
   59 |     memo[i][j] = n
      |     ~~~~~~~~~~~^~~
Language: C++

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

#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define xrep(i, a, b) for (int i = int(a); i < int(b); ++i)
using ll = long long;

vector<int> num;
int cnt = 0;
bool visited[50000][50000];
int memo[30000][30000];
int N = 0;

int dfs(int i, int j) {
    if (visited[i][j]==true) memo[i][j];
    if(i==N+1) {
        return 0;
    }
    if(j==N+1) {
        return 0;
    }
    visited[j][i] = true;
    int n = 0;
    for(int k=0; k<j-i; k++) {
        n += num[i+k]*pow(10, k);
    }
    if(n%2019==0 && n!=0) {
        cnt++;
    }
    dfs(i, j+1);
    dfs(i+1, j);
    return memo[i][j] = n;;
}

int main() {
    string S;
    cin >> S;
    for(auto s: S) {
        num.push_back(s-'0');
    }
    reverse(num.begin(), num.end());
    N = num.size();
    auto piyo = dfs(0, 0);
    cout << cnt << endl;

    return 0;
}

Compiler output:
/tmp/ccXMtGS8.o: in function `dfs(int, int)':
a.cc:(.text+0x10): relocation truncated to fit: R_X86_64_PC32 against symbol `N' defined in .bss section in /tmp/ccXMtGS8.o
a.cc:(.text+0x28): relocation truncated to fit: R_X86_64_PC32 against symbol `N' defined in .bss section in /tmp/ccXMtGS8.o
a.cc:(.text+0x15a): relocation truncated to fit: R_X86_64_PC32 against symbol `memo' defined in .bss section in /tmp/ccXMtGS8.o
a.cc:(.text+0x184): relocation truncated to fit: R_X86_64_PC32 against symbol `memo' defined in .bss section in /tmp/ccXMtGS8.o
/tmp/ccXMtGS8.o: in function `main':
a.cc:(.text+0x274): relocation truncated to fit: R_X86_64_PC32 against symbol `N' defined in .bss section in /tmp/ccXMtGS8.o
collect2: error: ld returned 1 exit status
Language: C++

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

#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define xrep(i, a, b) for (int i = int(a); i < int(b); ++i)
using ll = long long;

vector<int> num;
int cnt = 0;
int memo[30000][30000];
int N = 0;

int dfs(int i, int j) {
    if(i==N+1) {
        return 0;
    }
    if(j==N+1) {
        return 0;
    }
    if(memo[i][j]!=0) return memo[i][j];

    int n = 0;
    for(int k=0; k<j-i; k++) {
        n += num[i+k]*pow(10, k);
    }
    if(n%2019==0 && n!=0) {
        cnt++;
    }
    dfs(i, j+1);
    dfs(i+1, j);
    return memo[i][j] = n;;
}

int main() {
    string S;
    cin >> S;
    for(auto s: S) {
        num.push_back(s-'0');
    }
    reverse(num.begin(), num.end());
    N = num.size();
    auto piyo = dfs(0, 0);
    cout << cnt << endl;

    return 0;
}

Compiler output:
/tmp/cc34vMvF.o: in function `dfs(int, int)':
a.cc:(.text+0x10): relocation truncated to fit: R_X86_64_PC32 against symbol `N' defined in .bss section in /tmp/cc34vMvF.o
a.cc:(.text+0x28): relocation truncated to fit: R_X86_64_PC32 against symbol `N' defined in .bss section in /tmp/cc34vMvF.o
/tmp/cc34vMvF.o: in function `main':
a.cc:(.text+0x2a9): relocation truncated to fit: R_X86_64_PC32 against symbol `N' defined in .bss section in /tmp/cc34vMvF.o
collect2: error: ld returned 1 exit status
Language: C++

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

#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define xrep(i, a, b) for (int i = int(a); i < int(b); ++i)
using ll = long long;

vector<int> num;
int cnt = 0;
bool visited[50000][50000];
int memo[50000][50000];
int N = 0;

int dfs(int i, int j) {
    if (visited[j][i]==true) return 0;
    if(i==N+1) {
        return 0;
    }
    if(j==N+1) {
        return 0;
    }
    if(memo[i][j]!=0) return memo[i][j];
    visited[j][i] = true;
    int n = 0;
    for(int k=0; k<j-i; k++) {
        n += num[i+k]*pow(10, k);
    }
    if(n%2019==0 && n!=0) {
        cnt++;
    }
    dfs(i, j+1);
    dfs(i+1, j);
    return memo[i][j] = n;;
}

int main() {
    string S;
    cin >> S;
    for(auto s: S) {
        num.push_back(s-'0');
    }
    reverse(num.begin(), num.end());
    N = num.size();
    auto piyo = dfs(0, 0);
    cout << cnt << endl;

    return 0;
}

Compiler output:
/tmp/ccj2OXka.o: in function `dfs(int, int)':
a.cc:(.text+0x44): relocation truncated to fit: R_X86_64_PC32 against symbol `N' defined in .bss section in /tmp/ccj2OXka.o
a.cc:(.text+0x5c): relocation truncated to fit: R_X86_64_PC32 against symbol `N' defined in .bss section in /tmp/ccj2OXka.o
a.cc:(.text+0x92): relocation truncated to fit: R_X86_64_PC32 against symbol `memo' defined in .bss section in /tmp/ccj2OXka.o
a.cc:(.text+0xbd): relocation truncated to fit: R_X86_64_PC32 against symbol `memo' defined in .bss section in /tmp/ccj2OXka.o
a.cc:(.text+0x1e5): relocation truncated to fit: R_X86_64_PC32 against symbol `memo' defined in .bss section in /tmp/ccj2OXka.o
a.cc:(.text+0x20f): relocation truncated to fit: R_X86_64_PC32 against symbol `memo' defined in .bss section in /tmp/ccj2OXka.o
/tmp/ccj2OXka.o: in function `main':
a.cc:(.text+0x2ff): relocation truncated to fit: R_X86_64_PC32 against symbol `N' defined in .bss section in /tmp/ccj2OXka.o
collect2: error: ld returned 1 exit status
Language: C++

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

#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define xrep(i, a, b) for (int i = int(a); i < int(b); ++i)
using ll = long long;

vector<int> num;
int cnt = 0;
bool visited[20000][20000];
int memo[90000][90000];
int N = 0;

int dfs(int i, int j) {
    if (visited[j][i]==true) return 0;
    if(i==N+1) {
        return 0;
    }
    if(j==N+1) {
        return 0;
    }
    if(memo[i][j]!=0) return memo[i][j];
    visited[j][i] = true;
    int n = 0;
    for(int k=0; k<j-i; k++) {
        n += num[i+k]*pow(10, k);
    }
    if(n%2019==0 && n!=0) {
        cnt++;
    }
    dfs(i, j+1);
    dfs(i+1, j);
    return memo[i][j] = n;;
}

int main() {
    string S;
    cin >> S;
    for(auto s: S) {
        num.push_back(s-'0');
    }
    reverse(num.begin(), num.end());
    N = num.size();
    auto piyo = dfs(0, 0);
    cout << cnt << endl;

    return 0;
}

Compiler output:
/tmp/ccXBLWza.o: in function `dfs(int, int)':
a.cc:(.text+0x44): relocation truncated to fit: R_X86_64_PC32 against symbol `N' defined in .bss section in /tmp/ccXBLWza.o
a.cc:(.text+0x5c): relocation truncated to fit: R_X86_64_PC32 against symbol `N' defined in .bss section in /tmp/ccXBLWza.o
/tmp/ccXBLWza.o: in function `main':
a.cc:(.text+0x2ff): relocation truncated to fit: R_X86_64_PC32 against symbol `N' defined in .bss section in /tmp/ccXBLWza.o
collect2: error: ld returned 1 exit status
Language: C++

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

#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define xrep(i, a, b) for (int i = int(a); i < int(b); ++i)
using ll = long long;

vector<int> num;
int cnt = 0;
bool visited[200000][200000];
int N = 0;

void dfs(int i, int j) {
    if (visited[j][i]==true) return;
    if(i==N+1) {
        return;
    }
    if(j==N+1) {
        return;
    }
    visited[j][i] = true;
    int n = 0;
    for(int k=0; k<j-i; k++) {
        n += num[i+k]*pow(10, k);
    }
    if(n%2019==0 && n!=0) {
        cnt++;
    }
    dfs(i, j+1);
    dfs(i+1, j);
}

int main() {
    string S;
    cin >> S;
    for(auto s: S) {
        num.push_back(s-'0');
    }
    reverse(num.begin(), num.end());
    N = num.size();
    dfs(0, 0);
    cout << cnt << endl;

    return 0;
}

Compiler output:
/tmp/ccXiTTaf.o: in function `dfs(int, int)':
a.cc:(.text+0x3e): relocation truncated to fit: R_X86_64_PC32 against symbol `N' defined in .bss section in /tmp/ccXiTTaf.o
a.cc:(.text+0x50): relocation truncated to fit: R_X86_64_PC32 against symbol `N' defined in .bss section in /tmp/ccXiTTaf.o
/tmp/ccXiTTaf.o: in function `main':
a.cc:(.text+0x24e): relocation truncated to fit: R_X86_64_PC32 against symbol `N' defined in .bss section in /tmp/ccXiTTaf.o
collect2: error: ld returned 1 exit status
Language: C++

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

#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define xrep(i, a, b) for (int i = int(a); i < int(b); ++i)
using ll = long long;

vector<int> num;
int cnt = 0;
bool visited[300000][300000];
int N = 0;

void dfs(int i, int j) {
    if (visited[j][i]==true) return;
    if(i==N+1) {
        return;
    }
    if(j==N+1) {
        return;
    }
    visited[j][i] = true;
    int n = 0;
    for(int k=0; k<j-i; k++) {
        n += num[i+k]*pow(10, k);
    }
    if(n%2019==0 && n!=0) {
        cnt++;
    }
    dfs(i, j+1);
    dfs(i+1, j);
}

int main() {
    string S;
    cin >> S;
    for(auto s: S) {
        num.push_back(s-'0');
    }
    reverse(num.begin(), num.end());
    N = num.size();
    dfs(0, 0);
    cout <<cnt << endl;

    return 0;
}

Compiler output:
/tmp/cc5VSfLk.o: in function `dfs(int, int)':
a.cc:(.text+0x3e): relocation truncated to fit: R_X86_64_PC32 against symbol `N' defined in .bss section in /tmp/cc5VSfLk.o
a.cc:(.text+0x50): relocation truncated to fit: R_X86_64_PC32 against symbol `N' defined in .bss section in /tmp/cc5VSfLk.o
/tmp/cc5VSfLk.o: in function `main':
a.cc:(.text+0x24e): relocation truncated to fit: R_X86_64_PC32 against symbol `N' defined in .bss section in /tmp/cc5VSfLk.o
collect2: error: ld returned 1 exit status
Language: C++

#include<vector>
#include<iostream>
using namespace std;

#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define xrep(i, a, b) for (int i = int(a); i < int(b); ++i)
using ll = long long;

vector<int> num;
int cnt = 0;
bool visited[300000][300000];
int N = 0;

void dfs(int i, int j) {
    if (visited[j][i]==true) return;
    if(i==N+1) {
        return;
    }
    if(j==N+1) {
        return;
    }
    visited[j][i] = true;
    int n = 0;
    for(int k=0; k<j-i; k++) {
        n += num[i+k]*pow(10, k);
    }
    if(n%2019==0 && n!=0) {
        cnt++;
    }
    dfs(i, j+1);
    dfs(i+1, j);
}

int main() {
    string S;
    cin >> S;
    for(auto s: S) {
        num.push_back(s-'0');
    }
    reverse(num.begin(), num.end());
    N = num.size();
    dfs(0, 0);
    cout <<cnt << endl;

    return 0;
}

Compiler output:
a.cc: In function 'void dfs(int, int)':
a.cc:25:23: error: 'pow' was not declared in this scope
   25 |         n += num[i+k]*pow(10, k);
      |                       ^~~
a.cc: In function 'int main()':
a.cc:40:5: error: 'reverse' was not declared in this scope
   40 |     reverse(num.begin(), num.end());
      |     ^~~~~~~
Language: C++

#include<vector>
#include<iostream>
using namespace std;

#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define xrep(i, a, b) for (int i = int(a); i < int(b); ++i)
using ll = long long;
const int INF = 1001001001;

vector<int> num;
int cnt = 0;
bool visited[300000][300000];
int N = 0;

void dfs(int i, int j) {
    if (visited[j][i]==true) return;
    if(i==N+1) {
        return;
    }
    if(j==N+1) {
        return;
    }
    visited[j][i] = true;
    int n = 0;
    for(int k=0; k<j-i; k++) {
        n += num[i+k]*pow(10, k);
    }
    if(n%2019==0 && n!=0) {
        cnt++;
    }
    dfs(i, j+1);
    dfs(i+1, j);
}

int main() {
    string S;
    cin >> S;
    for(auto s: S) {
        num.push_back(s-'0');
    }
    reverse(num.begin(), num.end());
    N = num.size();
    dfs(0, 0);
    cout <<cnt << endl;

    return 0;
}

Compiler output:
a.cc: In function 'void dfs(int, int)':
a.cc:26:23: error: 'pow' was not declared in this scope
   26 |         n += num[i+k]*pow(10, k);
      |                       ^~~
a.cc: In function 'int main()':
a.cc:41:5: error: 'reverse' was not declared in this scope
   41 |     reverse(num.begin(), num.end());
      |     ^~~~~~~
Language: C++

#include<vector>
#include<iostream>
using namespace std;

#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define xrep(i, a, b) for (int i = int(a); i < int(b); ++i)
using ll = long long;
const int INF = 1001001001;

vector<int> num;
int cnt = 0;
bool visited[300000][300000];
int N = 0;

void dfs(int i, int j) {
    if (visited[j][i]==true) return;
    if(i==N+1) {
        return;
    }
    if(j==N+1) {
        return;
    }
    visited[j][i] = true;
    int n = 0;
    for(int k=0; k<j-i; k++) {
        n += num[i+k]*pow(10, k);
    }
    if(n%2019==0 && n!=0) {
        cnt++;
    }
    dfs(i, j+1);
    dfs(i+1, j);
}

int main() {
    string S;
    cin >> S;
    for(auto s: S) {
        num.push_back(s-'0');
    }
    reverse(num.begin(), num.end());
    N = num.size();
    dfs(0, 0);
    print(cnt);

    return 0;
}

Compiler output:
a.cc: In function 'void dfs(int, int)':
a.cc:26:23: error: 'pow' was not declared in this scope
   26 |         n += num[i+k]*pow(10, k);
      |                       ^~~
a.cc: In function 'int main()':
a.cc:41:5: error: 'reverse' was not declared in this scope
   41 |     reverse(num.begin(), num.end());
      |     ^~~~~~~
a.cc:44:5: error: 'print' was not declared in this scope; did you mean 'printf'?
   44 |     print(cnt);
      |     ^~~~~
      |     printf
Language: C

#include <vector.h>
using namespace std;

#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define xrep(i, a, b) for (int i = int(a); i < int(b); ++i)
using ll = long long;
const int INF = 1001001001;

vector<int> num;
int cnt = 0;
bool visited[300000][300000];
int N = 0;

void dfs(int i, int j) {
    if (visited[j][i]==true) return;
    if(i==N+1) {
        return;
    }
    if(j==N+1) {
        return;
    }
    visited[j][i] = true;
    int n = 0;
    for(int k=0; k<j-i; k++) {
        n += num[i+k]*pow(10, k);
    }
    if(n%2019==0 && n!=0) {
        cnt++;
    }
    dfs(i, j+1);
    dfs(i+1, j);
}

int main() {
    string S;
    cin >> S;
    for(auto s: S) {
        num.push_back(s-'0');
    }
    reverse(num.begin(), num.end());
    N = num.size();
    dfs(0, 0);
    print(cnt);

    return 0;
}

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

#include <vector>
using namespace std;

#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define xrep(i, a, b) for (int i = int(a); i < int(b); ++i)
using ll = long long;
const int INF = 1001001001;

vector<int> num;
int cnt = 0;
bool visited[300000][300000];
int N = 0;

void dfs(int i, int j) {
    if (visited[j][i]==true) return;
    if(i==N+1) {
        return;
    }
    if(j==N+1) {
        return;
    }
    visited[j][i] = true;
    int n = 0;
    for(int k=0; k<j-i; k++) {
        n += num[i+k]*pow(10, k);
    }
    if(n%2019==0 && n!=0) {
        cnt++;
    }
    dfs(i, j+1);
    dfs(i+1, j);
}

int main() {
    string S;
    cin >> S;
    for(auto s: S) {
        num.push_back(s-'0');
    }
    reverse(num.begin(), num.end());
    N = num.size();
    dfs(0, 0);
    print(cnt);

    return 0;
}

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

#include <bits/stdc++.h>
using namespace std;
void print() {
    cout << endl;
}
template <class Head, class... Tail>
void print(Head &&head, Tail &&... tail) {
    cout << head;
    if (sizeof...(tail) != 0)
        cout << " ";
    print(forward<Tail>(tail)...);
}
template <class T>
void print(vector<T> &vec) {
    for (auto &a : vec) {
        cout << a;
        if (&a != &vec.back())
            cout << " ";
    }
    cout << endl;
}
template <class T>
void print(vector<vector<T>> &df) {
    for (auto &vec : df) {
        print(vec);
    }
}
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define xrep(i, a, b) for (int i = int(a); i < int(b); ++i)
using ll = long long;
const int INF = 1001001001;

vector<int> num;
int cnt = 0;
bool visited[300000][300000];
int N = 0;

void dfs(int i, int j) {
    if (visited[j][i]==true) return;
    if(i==N+1) {
        return;
    }
    if(j==N+1) {
        return;
    }
    visited[j][i] = true;
    int n = 0;
    for(int k=0; k<j-i; k++) {
        n += num[i+k]*pow(10, k);
    }
    if(n%2019==0 && n!=0) {
        cnt++;
    }
    dfs(i, j+1);
    dfs(i+1, j);
}

int main() {
    string S;
    cin >> S;
    for(auto s: S) {
        num.push_back(s-'0');
    }
    reverse(num.begin(), num.end());
    N = num.size();
    dfs(0, 0);
    print(cnt);

    return 0;
}

Compiler output:
/tmp/ccGISxkW.o: in function `dfs(int, int)':
a.cc:(.text+0x5e): relocation truncated to fit: R_X86_64_PC32 against symbol `N' defined in .bss section in /tmp/ccGISxkW.o
a.cc:(.text+0x70): relocation truncated to fit: R_X86_64_PC32 against symbol `N' defined in .bss section in /tmp/ccGISxkW.o
/tmp/ccGISxkW.o: in function `main':
a.cc:(.text+0x26e): relocation truncated to fit: R_X86_64_PC32 against symbol `N' defined in .bss section in /tmp/ccGISxkW.o
collect2: error: ld returned 1 exit status
Language: C++

#include <bits/stdc++.h>
using namespace std;
void print() {
    cout << endl;
}
template <class Head, class... Tail>
void print(Head &&head, Tail &&... tail) {
    cout << head;
    if (sizeof...(tail) != 0)
        cout << " ";
    print(forward<Tail>(tail)...);
}
template <class T>
void print(vector<T> &vec) {
    for (auto &a : vec) {
        cout << a;
        if (&a != &vec.back())
            cout << " ";
    }
    cout << endl;
}
template <class T>
void print(vector<vector<T>> &df) {
    for (auto &vec : df) {
        print(vec);
    }
}
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define xrep(i, a, b) for (ll i = ll(a); i < ll(b); ++i)
using ll = long long;
const ll INF = 1001001001;

vector<ll> num;
ll cnt = 0;
bool visited[300000][300000];
int N = 0;

void dfs(ll i, ll j) {
    if (visited[j][i]==true) return;
    if(i==N+1) {
        return;
    }
    if(j==N+1) {
        return;
    }
    visited[j][i] = true;
    ll n = 0;
    for(ll k=0; k<j-i; k++) {
        n += num[i+k]*pow(10, k);
    }
    if(n%2019==0 && n!=0) {
        cnt++;
    }
    dfs(i, j+1);
    dfs(i+1, j);
}

int main() {
    string S;
    cin >> S;
    for(auto s: S) {
        num.push_back(s-'0');
    }
    reverse(num.begin(), num.end());
    N = num.size();
    dfs(0, 0);
    print(cnt);

    return 0;
}

Compiler output:
/tmp/ccrBcuSH.o: in function `dfs(long long, long long)':
a.cc:(.text+0x5d): relocation truncated to fit: R_X86_64_PC32 against symbol `N' defined in .bss section in /tmp/ccrBcuSH.o
a.cc:(.text+0x72): relocation truncated to fit: R_X86_64_PC32 against symbol `N' defined in .bss section in /tmp/ccrBcuSH.o
/tmp/ccrBcuSH.o: in function `main':
a.cc:(.text+0x29c): relocation truncated to fit: R_X86_64_PC32 against symbol `N' defined in .bss section in /tmp/ccrBcuSH.o
collect2: error: ld returned 1 exit status
Language: C++

#include <bits/stdc++.h>
using namespace std;
void print() {
    cout << endl;
}
template <class Head, class... Tail>
void print(Head &&head, Tail &&... tail) {
    cout << head;
    if (sizeof...(tail) != 0)
        cout << " ";
    print(forward<Tail>(tail)...);
}
template <class T>
void print(vector<T> &vec) {
    for (auto &a : vec) {
        cout << a;
        if (&a != &vec.back())
            cout << " ";
    }
    cout << endl;
}
template <class T>
void print(vector<vector<T>> &df) {
    for (auto &vec : df) {
        print(vec);
    }
}
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define xrep(i, a, b) for (ll i = ll(a); i < ll(b); ++i)
using ll = long long;
const ll INF = 1001001001;

vector<ll> num;
ll cnt = 0;
bool visited[300000][300000];
int N = 0;

void dfs(ll i, ll j) {
    if (visited[j][i]==true) return;
    if(i==N+1) {
        return;
    }
    if(j==N+1) {
        return;
    }
    visited[j][i] = true;
    ll n = 0;
    for(ll k=0; k<j-i; k++) {
        n += num[i+k]*pow(10, k);
    }
    if(n%2019==0 && n!=0) {
        cnt++;
    }
    dfs(i, j+1);
    dfs(i+1, j);
}

int main() {
    string S;
    cin >> S;
    for(auto s: S) {
        num.push_back(s-'0');
    }
    reverse(num.begin(), num.end());
    N = num.size();
    dfs(0, 0);
    print(cnt);

    return 0;
}

Compiler output:
/tmp/ccWf2C9D.o: in function `dfs(long long, long long)':
a.cc:(.text+0x5d): relocation truncated to fit: R_X86_64_PC32 against symbol `N' defined in .bss section in /tmp/ccWf2C9D.o
a.cc:(.text+0x72): relocation truncated to fit: R_X86_64_PC32 against symbol `N' defined in .bss section in /tmp/ccWf2C9D.o
/tmp/ccWf2C9D.o: in function `main':
a.cc:(.text+0x29c): relocation truncated to fit: R_X86_64_PC32 against symbol `N' defined in .bss section in /tmp/ccWf2C9D.o
collect2: error: ld returned 1 exit status
Language: C++

#include <bits/stdc++.h>
using namespace std;
void print() {
    cout << endl;
}
template <class Head, class... Tail>
void print(Head &&head, Tail &&... tail) {
    cout << head;
    if (sizeof...(tail) != 0)
        cout << " ";
    print(forward<Tail>(tail)...);
}
template <class T>
void print(vector<T> &vec) {
    for (auto &a : vec) {
        cout << a;
        if (&a != &vec.back())
            cout << " ";
    }
    cout << endl;
}
template <class T>
void print(vector<vector<T>> &df) {
    for (auto &vec : df) {
        print(vec);
    }
}
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define xrep(i, a, b) for (ll i = ll(a); i < ll(b); ++i)
using ll = long long;
const ll INF = 1001001001;

vector<ll> num;
ll cnt = 0;
bool visited[300000][300000];
int N = 0;

void dfs(ll i, ll j) {
    if (visited[j][i]==true) return;
    if(i==N+1) {
        return;
    }
    if(j==N+1) {
        return;
    }
    visited[j][i] = true;
    ll n = 0;
    for(ll k=0; k<j-i; k++) {
        n += num[i+k]*pow(10, k);
    }
    if(n%2019==0 && n!=0) {
        cnt++;
    }
    dfs(i, j+1);
    dfs(i+1, j);
}

int main() {
    string S;
    cin >> S;
    for(auto s: S) {
        num.push_back(s-'0');
    }
    reverse(num.begin(), num.end());
    int N = num.size();
    dfs(0, 0);
    print(cnt);

    return 0;
}

Compiler output:
/tmp/ccRWE36s.o: in function `dfs(long long, long long)':
a.cc:(.text+0x5d): relocation truncated to fit: R_X86_64_PC32 against symbol `N' defined in .bss section in /tmp/ccRWE36s.o
a.cc:(.text+0x72): relocation truncated to fit: R_X86_64_PC32 against symbol `N' defined in .bss section in /tmp/ccRWE36s.o
collect2: error: ld returned 1 exit status
Language: C++

#include <bits/stdc++.h>
using namespace std;
void prll() {
    cout << endl;
}
template <class Head, class... Tail>
void prll(Head &&head, Tail &&... tail) {
    cout << head;
    if (sizeof...(tail) != 0)
        cout << " ";
    prll(forward<Tail>(tail)...);
}
template <class T>
void prll(vector<T> &vec) {
    for (auto &a : vec) {
        cout << a;
        if (&a != &vec.back())
            cout << " ";
    }
    cout << endl;
}
template <class T>
void prll(vector<vector<T>> &df) {
    for (auto &vec : df) {
        prll(vec);
    }
}
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define xrep(i, a, b) for (ll i = ll(a); i < ll(b); ++i)
using ll = long long;
const ll INF = 1001001001;

vector<ll> num;
ll cnt = 0;
bool visited[300000][300000];

void dfs(ll i, ll j) {
    if (visited[j][i]==true) return;
    if(i==N+1) {
        return;
    }
    if(j==N+1) {
        return;
    }
    visited[j][i] = true;
    ll n = 0;
    for(ll k=0; k<j-i; k++) {
        n += num[i+k]*pow(10, k);
    }
    if(n%2019==0 && n!=0) {
        cnt++;
    }
    dfs(i, j+1);
    dfs(i+1, j);
}

int main() {
    string S;
    cin >> S;
    for(auto s: S) {
        num.push_back(s-'0');
    }
    reverse(num.begin(), num.end());

    dfs(0, 0);
    print(cnt);

    return 0;
}

Compiler output:
a.cc: In function 'void dfs(ll, ll)':
a.cc:39:11: error: 'N' was not declared in this scope
   39 |     if(i==N+1) {
      |           ^
a.cc:42:11: error: 'N' was not declared in this scope
   42 |     if(j==N+1) {
      |           ^
a.cc: In function 'int main()':
a.cc:66:5: error: 'print' was not declared in this scope; did you mean 'rint'?
   66 |     print(cnt);
      |     ^~~~~
      |     rint
Language: C++

#include <bits/stdc++.h>
using namespace std;
void print() {
    cout << endl;
}
template <class Head, class... Tail>
void print(Head &&head, Tail &&... tail) {
    cout << head;
    if (sizeof...(tail) != 0)
        cout << " ";
    print(forward<Tail>(tail)...);
}
template <class T>
void print(vector<T> &vec) {
    for (auto &a : vec) {
        cout << a;
        if (&a != &vec.back())
            cout << " ";
    }
    cout << endl;
}
template <class T>
void print(vector<vector<T>> &df) {
    for (auto &vec : df) {
        print(vec);
    }
}
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define xrep(i, a, b) for (int i = int(a); i < int(b); ++i)
using ll = long long;
const int INF = 1001001001;

vector<int> num;
int cnt = 0;
bool visited[200000][200000];
void dfs(int i, int j) {
    if (visited[j][i]==true) return;
    if(i==num.size()+1) {
        return;
    }
    if(j==num.size()+1) {
        return;
    }
    visited[j][i] = true;
    int n = 0;
    for(int k=0; k<j-i; k++) {
        n += num[i+k]*pow(10, k);
    }
    if(n%2019==0 && n!=0) {
        cnt++;
    }
    dfs(i, j+1);
    dfs(i+1, j);
}

Compiler output:
/usr/bin/ld: /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/Scrt1.o: in function `_start':
(.text+0x17): undefined reference to `main'
collect2: error: ld returned 1 exit status
Language: C++

#include <bits/stdc++.h>
using namespace std;
void print() {
    cout << endl;
}
template <class Head, class... Tail>
void print(Head &&head, Tail &&... tail) {
    cout << head;
    if (sizeof...(tail) != 0)
        cout << " ";
    print(forward<Tail>(tail)...);
}
template <class T>
void print(vector<T> &vec) {
    for (auto &a : vec) {
        cout << a;
        if (&a != &vec.back())
            cout << " ";
    }
    cout << endl;
}
template <class T>
void print(vector<vector<T>> &df) {
    for (auto &vec : df) {
        print(vec);
    }
}
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define xrep(i, a, b) for (int i = int(a); i < int(b); ++i)
using ll = long long;
const int INF = 1001001001;

vector<int> num;
int cnt = 0;
bool visited[1000][1000];
void dfs(int i, int j) {
    if (visited[j][i]==true) return;
    if(i==num.size()+1) {
        return;
    }
    if(j==num.size()+1) {
        return;
    }
    visited[j][i] = true;
    int n = 0;
    for(int k=0; k<j-i; k++) {
        n += num[i+k]*pow(10, k);
    }
    if(n%2019==0 && n!=0) {
        cnt++;
    }
    dfs(i, j+1);
    dfs(i+1, j);
}

Compiler output:
/usr/bin/ld: /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/Scrt1.o: in function `_start':
(.text+0x17): undefined reference to `main'
collect2: error: ld returned 1 exit status
Language: C++

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

typedef long long i64;
typedef pair<int, int> ii;
typedef pair<i64, i64> ll;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<ll> vll;
typedef vector<vi> vvi;

#define fastIO() ios_base::sync_with_stdio(0), cin.tie(0)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define ms(a, x) memset(a, x, sizeof(a))
#define len(x) (x).size()
#define pb push_back
#define eb emplace_back
#define fi first
#define se second

const double eps = 1e-9;
const double pi = acos(-1.0);
const int inf = 1e9;
const int maxn = 2e3+5;
const int mod = 2019;

string s; cin >> s;
int cur, ans, x, base, n;
int f[maxn+1], pot[200005];

int main() {
    fastIO();
    cin >> s;
    n = s.size();
    pot[n-1] = 1;
    for (int i = n-2; i >= 0; --i) pot[i] = (pot[i+1] * 10) % mod;
    f[0] = 1;
    for (int i = 0; i < n; ++i) {
    	cur = (cur + (pot[i] * (s[i]-'0')) % mod) % mod;
    	ans += f[cur];
    	++f[cur];
    }
    cout << ans << '\n';
    return 0;
}


Compiler output:
a.cc:28:11: error: 'cin' does not name a type
   28 | string s; cin >> s;
      |           ^~~
Language: C++

#include</Users/urarare/workspace_c++/include/bits/stdc++.h>
using namespace std;

int pow_mod(int a, int b, int c){ // a < 10^5
    if(b == 0) return 1;
    else if(b % 2 == 1) return a * pow_mod(a, b - 1, c) % c;
    else{
        int d = pow_mod(a, b / 2, c);
        return d * d % c;
    }
}

int main(){
    string S;
    cin >> S;
    vector<int> intS;
    for(char c : S) intS.push_back(c - 48);
    reverse(intS.begin(), intS.end());
    int Ssize = intS.size();
    vector<int> dp(Ssize);
    vector<int> rem(2019, 0);
    rem.at(0)++;
    dp.at(0) = intS.at(0);
    rem.at(intS.at(0))++;
    for(int i=1; i<Ssize; i++){
        int work = intS.at(i) * pow_mod(10, i, 2019);
        work = (work + dp.at(i - 1)) % 2019;
        dp.at(i) = work;
        rem.at(work)++;
    }
    int64_t cnt = 0;
    for(int i=0; i<2019; i++){
        int r = rem.at(i);
        if(r != 0)cnt += r * (r - 1) / 2;
    }
    cout << cnt << endl;
}

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


#include<bits/stdc++.h>
using namespace std;
#define rep(i, N) for(int i = 0; i< N; i++)

int main() {
    string s; cin >> s;
    vector<string> multiple;
    int ans = 0;
    rep(i,100) {
        multiple.push_back(to_string(2019*(i+1)));
    }
    for(string x : multiple) {
        auto findVec = find_all(s, x);
        ans += findVec.size();
    }
    cout << ans << endl;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:14:24: error: 'find_all' was not declared in this scope
   14 |         auto findVec = find_all(s, x);
      |                        ^~~~~~~~
Language: C++

#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < (n); i++)
#define RREP(i, s, n) for (int i = s; i < (n); i++)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
using namespace std;
using ll = long long;
typedef pair<int, int> pint;
typedef pair<ll, ll> pll;
const ll MOD = 1000000007;
const ll INF = MOD * MOD;
const int inf = (1<<29);

int main() {

    string s;
    cin >> s;

    vector<ll> val(2019, 0);
    ll fac = 1;
    ll cur = 0;
    val[cur]++;

    for (int i = 0; i < s.size(); i++) {
        ll add = s[n-1-i] - '0';
        cur = (cur + fac * add) % 2019;
        fac = (fac * 10) % 2019;
        val[cur]++;
    }

    ll res = 0;
    for(int i = 0; i < val.size(); i++) {
        res += val[i] * (val[i] -1) / 2;
    }

    cout << res << endl;
    

    //cout << ans << endl;
    return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:27:20: error: 'n' was not declared in this scope
   27 |         ll add = s[n-1-i] - '0';
      |                    ^
Language: C++

#include <bits/stdc++.h>
#define REP(i,n) for (int i = 0; i < (n); i++)
#define RREP(i, s, n) for (int i = s; i < (n); i++)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
using namespace std;
using ll = long long;
typedef pair<int, int> pint;
typedef pair<ll, ll> pll;
const ll MOD = 1000000007;
const ll INF = MOD * MOD;
const int inf = (1<<29);

int main() {

    string s;
    cin >> s;

    vector<ll> val(2019, 0);
    ll fac = 1;
    ll cur = 0;
    val[cur]++;

    for (int i = 0; i < n; i++) {
        ll add = s[n-1-i] - '0';
        cur = (cur + fac * add) % 2019;
        fac = (fac * 10) % 2019;
        val[cur]++;
    }

    ll res = 0;
    for(int i = 0; i < val.size(); i++) {
        res += val[i] * (val[i] -1) / 2;
    }

    cout << res << endl;
    

    //cout << ans << endl;
    return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:26:25: error: 'n' was not declared in this scope
   26 |     for (int i = 0; i < n; i++) {
      |                         ^
Language: C++

#inclue<bits/stdc++.h>
using namespace std;
int main(){
  set<string>s;
  int n;
  cin >> n;
  while(n--){
    string l;
    	cin >>l;
    s.insert(l);
  }
  cout << s.size();
}

Compiler output:
a.cc:1:2: error: invalid preprocessing directive #inclue; did you mean #include?
    1 | #inclue<bits/stdc++.h>
      |  ^~~~~~
      |  include
a.cc: In function 'int main()':
a.cc:4:3: error: 'set' was not declared in this scope
    4 |   set<string>s;
      |   ^~~
a.cc:1:1: note: 'std::set' is defined in header '<set>'; this is probably fixable by adding '#include <set>'
  +++ |+#include <set>
    1 | #inclue<bits/stdc++.h>
a.cc:4:7: error: 'string' was not declared in this scope
    4 |   set<string>s;
      |       ^~~~~~
a.cc:1:1: note: 'std::string' is defined in header '<string>'; this is probably fixable by adding '#include <string>'
  +++ |+#include <string>
    1 | #inclue<bits/stdc++.h>
a.cc:4:14: error: 's' was not declared in this scope
    4 |   set<string>s;
      |              ^
a.cc:6:3: error: 'cin' was not declared in this scope
    6 |   cin >> n;
      |   ^~~
a.cc:1:1: note: 'std::cin' is defined in header '<iostream>'; this is probably fixable by adding '#include <iostream>'
  +++ |+#include <iostream>
    1 | #inclue<bits/stdc++.h>
a.cc:8:11: error: expected ';' before 'l'
    8 |     string l;
      |           ^~
      |           ;
a.cc:9:15: error: 'l' was not declared in this scope
    9 |         cin >>l;
      |               ^
a.cc:12:3: error: 'cout' was not declared in this scope
   12 |   cout << s.size();
      |   ^~~~
a.cc:12:3: note: 'std::cout' is defined in header '<iostream>'; this is probably fixable by adding '#include <iostream>'
Language: C++

#include<iostream>

using namespace std;
int main()
{
    string S;
    cin >> S;
    //Tn=0
    //T(n-1)=右端ビット
    //あまりが同じもののmC2(mはかぶりあまりの個数)を足し合わせる
    int n=S.size();

    //あまりの個数
    int* modulo_number = new int[2019];
    for(int i=1;i<2019;++i){
        modulo_number[i]=0;
    }
    modulo_number[0]=1;

    for(int i=0;i<n;++i){
        //該当するあまり個数を加算
        modulo_number[atoi(S.substr(i).c_str())%2019]++;
    }

    //数え上げ
    int count=0;
    for(int i=0;i<2019;++i){
        int m=modulo_number[i];
        count=count+m*(m-1)/2;
    }
    
    cout << count << endl;
    delete [] modulo_nubmer
    return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:33:15: error: 'modulo_nubmer' was not declared in this scope; did you mean 'modulo_number'?
   33 |     delete [] modulo_nubmer
      |               ^~~~~~~~~~~~~
      |               modulo_number