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

#include <iostream>
#include <math.h>
#include <fstream>
#include <algorithm>
#include <string>
#include <string.h>
#include <queue>
#include <vector>
#include <set>
#include <map>
using namespace std;
long long int dp[100010][13] = {}
vector<long long int> solution(string S, int i){
  vector<long long int> res = vect(n, 0); 
  if(len == 0)
    {
    	res[0] = 1;
    	return res;
    }
  int num = S[i - 1] - '0';
		for (int j = 0; j < 13; j++)
		{
          	vector<long long int> resold = solution(S,i-1);
			if (num != '?' - '0') {
				res[(j * 10 + num) % 13] += resold[j];
			}
			else
			{
				for (int k = 0; k < 10; k++)
				{
					res[(j * 10 + k)%13] += resold[j];
				}
			}
		}
		for (int j = 0; j < 13; j++)res[j] %= 1000000007;
  return res;
  
}
 
int main() {
	string S;
	cin >> S;
	,len=S.length();
	vector<long long int> res = solution(S,len);
	cout << res[5];
}

Compiler output:
a.cc:13:1: error: expected ',' or ';' before 'vector'
   13 | vector<long long int> solution(string S, int i){
      | ^~~~~~
a.cc: In function 'int main()':
a.cc:43:9: error: expected primary-expression before ',' token
   43 |         ,len=S.length();
      |         ^
a.cc:43:10: error: 'len' was not declared in this scope
   43 |         ,len=S.length();
      |          ^~~
a.cc:44:37: error: 'solution' was not declared in this scope
   44 |         vector<long long int> res = solution(S,len);
      |                                     ^~~~~~~~
Language: C++

#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
#define limit(x,l,r) max(l,min(x,r))
#define lims(x,l,r) (x = max(l,min(x,r)))
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)),x.end())
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define show(x) cout<<#x<<" = "<<x<<endl;
#define PQ(T) priority_queue<T,v(T),greater<T> >
#define bn(x) ((1<<x)-1)
#define dup(x,y) (((x)+(y)-1)/(y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef tuple<int,int,int> T;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
typedef vector<T> vt;
//inline int in() { int x; scanf("%d",&x); return x;}
inline ll in() { ll x; cin >> x; return x; }
template<typename T>inline istream& operator>>(istream&i,v(T)&v)
{rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const v(T)&v)
{stringstream s;rep(i,sz(v))s<<' '<<v[i];return s.str().substr(1);}
template<typename T>inline ostream& operator<<(ostream&o,const v(T)&v)
{if(sz(v))o<<join(v);return o;}
template<typename T1,typename T2>inline istream& operator>>(istream&i,pair<T1,T2>&v)
{return i>>v.fi>>v.se;}
template<typename T1,typename T2>inline ostream& operator<<(ostream&o,const pair<T1,T2>&v)
{return o<<v.fi<<","<<v.se;}
template<typename T>inline ll suma(const v(T)& a) { ll res(0); for (auto&& x : a) res += x; return res;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
const ll mod = 1000000007ll;
#define dame { puts("-1"); return 0;}
#define yn {puts("YES");}else{puts("NO");}
const int MX = 200005;

int main() {
  string s; cin >> s;
  ll n = s.length();
  vector<vector<int>> dp(n+1, vector<int>(13));
  dp[0][0] = 1;
  rep(i,n) {
    rep(j,13) {
      if (s[i] == '?') {
        rep(d, 9) {
          jd = (j * 10 + d) % 13;
          dp[i+1][jd] += dp[i][j];
          dp[i+1][jd] %= mod;
          //(dp[i+1][(j*10+d)%13] += dp[i][j]) %= mod;
        }
      } else {
        js = (j * 10 + s[i] - '0') % 13;
        dp[i+1][js] += dp[i][j];
        dp[i+1][js] %= mod;
        //(dp[i+1][(j*10+s[i]-'0') % 13] += dp[i][j]) %= mod;
      }
    }
  }
  cout << dp[n][5] << endl;
  return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:69:11: error: 'jd' was not declared in this scope; did you mean 'd'?
   69 |           jd = (j * 10 + d) % 13;
      |           ^~
      |           d
a.cc:75:9: error: 'js' was not declared in this scope; did you mean 'j'?
   75 |         js = (j * 10 + s[i] - '0') % 13;
      |         ^~
      |         j
Language: C++

S = input()
  
import sys
sys.setrecursionlimit(10000)

origin = S

dp = [[0] * 13]
dp[0][0] = 1

idx = 0
for dig, n in enumerate(reversed(origin)):
    dp.append([0] * 13)
    pre_idx = idx
    idx += 1
    
    if n == '?':
        for n in range(10):
            now_mod = int(n)*(10**(dig)) % 13
            for i, m in enumerate(dp[pre_idx]):
                dp[idx][(i+now_mod)%13] += m
    else:
        now_mod = int(n)*(10**(dig)) % 13
        for i, m in enumerate(dp[pre_idx]):
            dp[idx][(i+now_mod)%13] += m
            
print(dp[idx][5] % (10**9+7))
        

Compiler output:
a.cc:1:1: error: 'S' does not name a type
    1 | S = input()
      | ^
Language: C++

static const ull MOD = 1000000007LL;

int n;
char s[100005];
uint64_t dp[100005][13];

uint64_t solve(){
    int i,j,ki;
    int res=0;

    scanf("%s",s);
    n=strlen(s);

    dp[0][0] =1;
    for(i=0; i<n; i++){
        int c;
        if(s[i]=='?') c=-1;
        else c= s[i] - '0';

        for(j=0; j<10; j++){
            if(c!=-1 && c != j) continue;
            for(ki=0; ki<13; ki++){
                dp[i+1][(ki*10+j%13)] += dp[i][ki];
            }
        }
        for(j=0; j<13; j++) dp[i+1][j] %= MOD;
    }
    res = dp[n][5];

    printf("%llu\n",res);
    return 0;
}

int main(){
    solve();
    return 0;
}

Compiler output:
a.cc:1:14: error: 'ull' does not name a type
    1 | static const ull MOD = 1000000007LL;
      |              ^~~
a.cc:5:1: error: 'uint64_t' does not name a type
    5 | uint64_t dp[100005][13];
      | ^~~~~~~~
a.cc:1:1: note: 'uint64_t' is defined in header '<cstdint>'; this is probably fixable by adding '#include <cstdint>'
  +++ |+#include <cstdint>
    1 | static const ull MOD = 1000000007LL;
a.cc:7:1: error: 'uint64_t' does not name a type
    7 | uint64_t solve(){
      | ^~~~~~~~
a.cc:7:1: note: 'uint64_t' is defined in header '<cstdint>'; this is probably fixable by adding '#include <cstdint>'
a.cc: In function 'int main()':
a.cc:35:5: error: 'solve' was not declared in this scope
   35 |     solve();
      |     ^~~~~
Language: C++

#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#define rep(i, n) for(int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
ll mod = 1000000007;

int n;
char s[100005];
ll dp[100005][13];

void solve() {
    ll ans = 0;
    n = s.size();

    dp[0][0] = 1;
    rep(i, n) {
        int c;
        if(s[i] == '?') {
            c = -1;
        }
        else {
            c = s[i] - '0';
        }

        rep(j, 10) {
            if(c != -1 && c != j) {
                continue;
            }
            rep(ki, 13) {
                dp[i+1][(10*ki + j)%13] += dp[i][ki];
            }
        }
        rep(j, 13) {
            dp[i+1][j] %= mod;
        }
    }
    ans = dp[n][5];

    cout << ans;
}

int main() {
    cin >> s;
    
    solve();
    
    cout << endl;
    return 0;
}

Compiler output:
a.cc: In function 'void solve()':
a.cc:21:11: error: request for member 'size' in 's', which is of non-class type 'char [100005]'
   21 |     n = s.size();
      |           ^~~~
Language: C++

#include<iostream>
#include<string>
#include<cstdlib>
#include<cstdio>
#include<vector>
using namespace std;
string s;
long long dp[100001][13];
int surplus[100001];
int main(){
    cin >> s;
    reverse(s.begin(),s.end());
    for(int j=0;j<=s.size();j++){
        for(int i=0;i<13;i++){
            dp[j][i] = 0;
        }
    }
    surplus[0] = 1;
    if(s[0] == '?'){
        for(int i=0;i<10;i++){
            dp[0][i] = 1;
        }
    }
    else{
        string s2(1,'a');
        s2[0] = s[0];
        const char *line = s2.c_str();
        int tmp = atoi(line);
        //cout << "s[" << "0" << "]" << "=" << tmp << endl;
        dp[0][tmp] = 1;
    }
    for(int i=1;i<s.size();i++){
        surplus[i] = (surplus[i-1]*10)%13;
        //cout << "surplus" << "[" << i << "]=" << surplus[i] << endl;
        if(s[i] == '?'){
            for(int k=0;k<10;k++){
                for(int j=0;j<13;j++){
                    dp[i][(j+surplus[i]*k)%13] = (dp[i][(j+surplus[i]*k)%13]+dp[i-1][j])%(1000000007);
                }
            }
        }
        else{
            string s2(1,'a');
                s2[0] = s[i];
                const char *line = s2.c_str();
                int tmp = atoi(line);
                //cout << "s[" << i << "]" << "=" << tmp << endl;
            
            for(int j=0;j<13;j++){
                dp[i][(j+surplus[i]*tmp)%13] = (dp[i][(j+surplus[i]*tmp)%13]+dp[i-1][j])%(1000000007); 
            }
        }
    }
    int ans = dp[s.size()-1][5];
    cout << ans << endl;
  return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:12:5: error: 'reverse' was not declared in this scope
   12 |     reverse(s.begin(),s.end());
      |     ^~~~~~~
Language: C++

#include<iostream>
#include<string>
#include<cstdlib>
#include<cstdio>
using namespace std;
string s;
long long dp[100001][13];
int surplus[100001];
int main(){
    cin >> s;
    reverse(s.begin(),s.end());
    for(int j=0;j<=s.size();j++){
        for(int i=0;i<13;i++){
            dp[j][i] = 0;
        }
    }
    surplus[0] = 1;
    if(s[0] == '?'){
        for(int i=0;i<10;i++){
            dp[0][i] = 1;
        }
    }
    else{
        string s2(1,'a');
        s2[0] = s[0];
        const char *line = s2.c_str();
        int tmp = atoi(line);
        //cout << "s[" << "0" << "]" << "=" << tmp << endl;
        dp[0][tmp] = 1;
    }
    for(int i=1;i<s.size();i++){
        surplus[i] = (surplus[i-1]*10)%13;
        //cout << "surplus" << "[" << i << "]=" << surplus[i] << endl;
        if(s[i] == '?'){
            for(int k=0;k<10;k++){
                for(int j=0;j<13;j++){
                    dp[i][(j+surplus[i]*k)%13] = (dp[i][(j+surplus[i]*k)%13]+dp[i-1][j])%(1000000007);
                }
            }
        }
        else{
            string s2(1,'a');
                s2[0] = s[i];
                const char *line = s2.c_str();
                int tmp = atoi(line);
                //cout << "s[" << i << "]" << "=" << tmp << endl;
            
            for(int j=0;j<13;j++){
                dp[i][(j+surplus[i]*tmp)%13] = (dp[i][(j+surplus[i]*tmp)%13]+dp[i-1][j])%(1000000007); 
            }
        }
    }
    int ans = dp[s.size()-1][5];
    cout << ans << endl;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:11:5: error: 'reverse' was not declared in this scope
   11 |     reverse(s.begin(),s.end());
      |     ^~~~~~~
Language: C++

#include<bits/stdc++.h>
using namespace std;
int main () {
  string S;
  cin >> S;
  char key[] = {'0','1','2','3','4','5','6','7','8','9'};
  int N = S.size();
  int ans[100002][13];//ans[i][j] = i番目まで処理、余りがjの個数(mod 1e9 + 7)
  int k = 5;
  vector<int>th();
  int num[100003];
  int n[] = {1, 10, 9, 12, 3, 4};
  for (int i = 0; i < 100003; i ++) {
    num[i] = n[i % 6];
  }
  for (int i = N - 1; i >= 0; i --) {
    char a = S[i];
    if (a == '?') {
      th.push_back(num[i]);
    }
    else {
      for (int j = 0; j < 10; j ++) {
        if (a == key[j]) {
          k -= j * num[i];
          k += 169;
          k %= 13;
        }
      }
    }
  }
  for(int i = 0; i < 13; i ++) ans[0][i] = 0;
  ans[0][0] = 1;
  for (int i = 0; i < th.size(); i ++) {
    for (int j = 0; j < 13; j ++) {
      for (int l = 0; l < 13; l ++) {
        int m = th[i] * j + l;
        m %= 13;
        ans[i + 1][m] += ans[i][l];
        pre[i + 1][m] %= 13;
      }
    }
  }
  cout << ans[th.size()][k];
}
  


Compiler output:
a.cc: In function 'int main()':
a.cc:10:16: warning: empty parentheses were disambiguated as a function declaration [-Wvexing-parse]
   10 |   vector<int>th();
      |                ^~
a.cc:10:16: note: remove parentheses to default-initialize a variable
   10 |   vector<int>th();
      |                ^~
      |                --
a.cc:19:10: error: request for member 'push_back' in 'th', which is of non-class type 'std::vector<int>()'
   19 |       th.push_back(num[i]);
      |          ^~~~~~~~~
a.cc:33:26: error: request for member 'size' in 'th', which is of non-class type 'std::vector<int>()'
   33 |   for (int i = 0; i < th.size(); i ++) {
      |                          ^~~~
a.cc:36:21: warning: pointer to a function used in arithmetic [-Wpointer-arith]
   36 |         int m = th[i] * j + l;
      |                     ^
a.cc:36:23: error: invalid operands of types 'std::vector<int>()' and 'int' to binary 'operator*'
   36 |         int m = th[i] * j + l;
      |                 ~~~~~ ^ ~
      |                     |   |
      |                     |   int
      |                     std::vector<int>()
a.cc:39:9: error: 'pre' was not declared in this scope; did you mean 'pread'?
   39 |         pre[i + 1][m] %= 13;
      |         ^~~
      |         pread
a.cc:43:18: error: request for member 'size' in 'th', which is of non-class type 'std::vector<int>()'
   43 |   cout << ans[th.size()][k];
      |                  ^~~~
Language: C++

s = input()
mod = int(1e9 + 7)
if s[-1]=="?":
    dp = [1]*13
    dp[12] = 0
    dp[11] = 0
    dp[10] = 0
else:
    dp = [0]*13
    dp[int(s[-1])] = 1

if len(s)==1:
    print(dp[5]%mod)
    exit()
else:
    mul = 10
    for i in reversed(range(len(s)-1)):
        nextdp = [0] * 13
        if s[i]=="?":
            for j in range(13):
                for k in range(10):
                    l = (k*mul) % 13
                    for m in range(13):
                        if ((l+m)%13)==j:
                            nextdp[j] += dp[m]
                        else:
                            nextdp[j] += 0
        else:
            for j in range(13):
                l = (int(s[i])*mul) % 13
                for m in range(13):
                    if ((l+m)%13)==j:
                        nextdp[j] += dp[m]
                    else:
                        nextdp[j] += 0
        mul *= 10
        dp = nextdp
print(dp[5]%mod)

Compiler output:
a.cc:1:1: error: 's' does not name a type
    1 | s = input()
      | ^
Language: C++

S = input()
 
N = len(S)
dp = [[0 for _ in range(13)] for _ in range(10 ** 5 + 1)]
mod = 10 ** 9 + 7
dp[0][0] = 1
 
for i in range(N):
    s = S[i]
    for j in range(10):
        if s != "?" and s != str(j):
            continue
        for r in range(13):
            dp[i+1][(r * 10 + j) % 13] += dp[i][r]
    for j in range(13):
        dp[i+1][j] %= mod
 
print(dp[N][5])

Compiler output:
a.cc:1:1: error: 'S' does not name a type
    1 | S = input()
      | ^
Language: C++

#pragma GCC优化（“O3” ）
#pragma GCC目标（“sse4” ）
 
#include < bits / stdc ++。h > 
#include <ext / pb_ds / tree_policy.hpp> 
#include <ext / pb_ds / assoc_container.hpp> 
 
using namespace std ; 
使用命名空间__gnu_pbds ; 
 
typedef long long ll ;  
typedef long double ld ;  
typedef complex <ld> cd ;
 
typedef pair < int ，int > pi ; 
typedef pair < ll ，ll > pl ;
typedef pair < ld ，ld > pd ;
 
typedef vector <int> vi ;
typedef vector <ld> vd ;
typedef vector <ll> vl ;
typedef vector <pi> vpi ;
typedef vector <pl> vpl ;
typedef vector <cd> vcd ;
 
template < class T > using Tree = tree < T ，null_type ，less < T >，rb_tree_tag ，tree_order_statistics_node_update >;    
 
#define FOR （i ，a ，b ）for （int i = a ; i <（b ）; i ++）  
#define F0R （i ，a ）for （int i = 0 ; i <（a ）; i ++）  
#define FORd （i ，a ，b ）for （int i = （b ） - 1 ; i > = a ; i - ）    
#define F0Rd （i ，a ）for （int i = （a ） - 1 ; i > = 0 ; i - ）    
 
#define sz （x ）（int ）（x ）。大小（） 
#define mp make_pair
#define pb push_back
首先#define f
#define 秒
#define lb lower_bound
#define ub upper_bound
#define all （x ）x 。begin （），x 。结束（）
#define shandom_ruffle random_shuffle
 
const int MOD = 1000000007 ;  
const ll INF = 1e18 ; 
const int MX = 100001 ; //检查限制，虚拟   
 
int main （）{ 
    ios_base :: sync_with_stdio （0 ）; cin 。领带（0 ）;
 
    字符串S ; cin >> S ;
    int N = sz （S ）;
    ll dp [ N + 1 ] [ 13 ];
    F0R （i ，N + 1 ）{ 
        F0R （j ，13 ）{  
            dp [ i ] [ j ] = 0 ;  
        }
    }
    dp [ 0 ] [ 0 ] = 1 ;  
 
    F0R （i ，N ）{ 
        F0R （j ，10 ）{  
            int nxt = S [ i ] - '0' ;  
            if （S [ i ] == '？' ）{    
                nxt = j ;
            }
            F0R （k ，13 ）{  
                int rem = （10 * k + nxt ）％13 ;   
                dp [ i + 1 ] [ rem ] + = dp [ i ] [ k ]; 
                dp [ i + 1 ] [ rem ] ％= MOD ; 
            }
            if （S [ i ] ！= '？' ）中断;    
        }
    }
 
 
    F0R （i ，N + 1 ）{ 
        F0R （j ，13 ）{  
            // cout << i <<“”<< j <<“”<< dp [i] [j] << endl;
        }
    }
    cout << dp [ N ] [ 5 ] << endl ; 
 
    返回0 ; 
}

Compiler output:
a.cc:1:9: error: extended character “ is not valid in an identifier
    1 | #pragma GCC优化（“O3” ）
      |         ^
a.cc:1:9: error: extended character ” is not valid in an identifier
a.cc:2:9: error: extended character “ is not valid in an identifier
    2 | #pragma GCC目标（“sse4” ）
      |         ^
a.cc:2:9: error: extended character ” is not valid in an identifier
a.cc:4:10: fatal error:  bits / stdc ++。h : No such file or directory
    4 | #include < bits / stdc ++。h >
      |          ^~~~~~~~~~~~~~~~~~~~~
compilation terminated.
Language: C++

#include <stdio.h>
static const long long MOD = 1000000007LL;
int n;
char s[100005];
int dp[100005][13];
int main () {
int i, j, ki;
int res = 0;

 scanf("%s", s);
 n = strlen(s);

 dp[0][0] = 1;
 for (i = 0; i < n; i++) {
 int c;
 if (s[i] == '?') c = -1;
 else c = s[i] - '0';

 for (j = 0; j < 10; j++) {
 if (c != -1 && c != j) continue;
 for (ki = 0; ki < 13; ki++) {
 dp[i + 1][(ki * 10 + j) % 13] += dp[i][ki];
 }
 }
 for (j = 0; j < 13; j++) dp[i + 1][j] %= MOD;
 }
 res = dp[n][5];

 printf("%llu\n", res);
 return 0;
 }


Compiler output:
a.cc: In function 'int main()':
a.cc:11:6: error: 'strlen' was not declared in this scope
   11 |  n = strlen(s);
      |      ^~~~~~
a.cc:2:1: note: 'strlen' is defined in header '<cstring>'; this is probably fixable by adding '#include <cstring>'
    1 | #include <stdio.h>
  +++ |+#include <cstring>
    2 | static const long long MOD = 1000000007LL;
Language: C++

static const long long MOD = 1000000007LL;
int n;
char s[100005];
int dp[100005][13];
int main () {
int i, j, ki;
int res = 0;

 scanf("%s", s);
 n = strlen(s);

 dp[0][0] = 1;
 for (i = 0; i < n; i++) {
 int c;
 if (s[i] == '?') c = -1;
 else c = s[i] - '0';

 for (j = 0; j < 10; j++) {
 if (c != -1 && c != j) continue;
 for (ki = 0; ki < 13; ki++) {
 dp[i + 1][(ki * 10 + j) % 13] += dp[i][ki];
 }
 }
 for (j = 0; j < 13; j++) dp[i + 1][j] %= MOD;
 }
 res = dp[n][5];

 printf("%llu\n", res);
 return 0;
 }


Compiler output:
a.cc: In function 'int main()':
a.cc:9:2: error: 'scanf' was not declared in this scope
    9 |  scanf("%s", s);
      |  ^~~~~
a.cc:10:6: error: 'strlen' was not declared in this scope
   10 |  n = strlen(s);
      |      ^~~~~~
a.cc:1:1: note: 'strlen' is defined in header '<cstring>'; this is probably fixable by adding '#include <cstring>'
  +++ |+#include <cstring>
    1 | static const long long MOD = 1000000007LL;
a.cc:28:2: error: 'printf' was not declared in this scope
   28 |  printf("%llu\n", res);
      |  ^~~~~~
a.cc:1:1: note: 'printf' is defined in header '<cstdio>'; this is probably fixable by adding '#include <cstdio>'
  +++ |+#include <cstdio>
    1 | static const long long MOD = 1000000007LL;
Language: C++

static const long long MOD = 1000000007LL;
int n;
char s[100005];
uint64_t dp[100005][13];
uint64_t main () {
int i, j, ki;
uint64_t res = 0;

 scanf("%s", s);
 n = strlen(s);

 dp[0][0] = 1;
 for (i = 0; i < n; i++) {
 int c;
 if (s[i] == '?') c = -1;
 else c = s[i] - '0';

 for (j = 0; j < 10; j++) {
 if (c != -1 && c != j) continue;
 for (ki = 0; ki < 13; ki++) {
 dp[i + 1][(ki * 10 + j) % 13] += dp[i][ki];
 }
 }
 for (j = 0; j < 13; j++) dp[i + 1][j] %= MOD;
 }
 res = dp[n][5];

 printf("%llu\n", res);
 return 0;
 }


Compiler output:
a.cc:4:1: error: 'uint64_t' does not name a type
    4 | uint64_t dp[100005][13];
      | ^~~~~~~~
a.cc:1:1: note: 'uint64_t' is defined in header '<cstdint>'; this is probably fixable by adding '#include <cstdint>'
  +++ |+#include <cstdint>
    1 | static const long long MOD = 1000000007LL;
a.cc:5:1: error: 'uint64_t' does not name a type
    5 | uint64_t main () {
      | ^~~~~~~~
a.cc:5:1: note: 'uint64_t' is defined in header '<cstdint>'; this is probably fixable by adding '#include <cstdint>'
Language: C++

static const ull MOD = 1000000007LL;
int n;
char s[100005];
uint64_t dp[100005][13];
uint64_t main () {
int i, j, ki;
uint64_t res = 0;

 scanf("%s", s);
 n = strlen(s);

 dp[0][0] = 1;
 for (i = 0; i < n; i++) {
 int c;
 if (s[i] == '?') c = -1;
 else c = s[i] - '0';

 for (j = 0; j < 10; j++) {
 if (c != -1 && c != j) continue;
 for (ki = 0; ki < 13; ki++) {
 dp[i + 1][(ki * 10 + j) % 13] += dp[i][ki];
 }
 }
 for (j = 0; j < 13; j++) dp[i + 1][j] %= MOD;
 }
 res = dp[n][5];

 printf("%llu\n", res);
 return 0;
 }

Compiler output:
a.cc:1:14: error: 'ull' does not name a type
    1 | static const ull MOD = 1000000007LL;
      |              ^~~
a.cc:4:1: error: 'uint64_t' does not name a type
    4 | uint64_t dp[100005][13];
      | ^~~~~~~~
a.cc:1:1: note: 'uint64_t' is defined in header '<cstdint>'; this is probably fixable by adding '#include <cstdint>'
  +++ |+#include <cstdint>
    1 | static const ull MOD = 1000000007LL;
a.cc:5:1: error: 'uint64_t' does not name a type
    5 | uint64_t main () {
      | ^~~~~~~~
a.cc:5:1: note: 'uint64_t' is defined in header '<cstdint>'; this is probably fixable by adding '#include <cstdint>'
Language: C++

//------------------------------------------
// C++ templete
//------------------------------------------
#include <bits/stdc++.h>
#include <iomanip>
using namespace std;
using ll = long long;
 
#define endl "\n"
 
//typedef
//------------------------------------------
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef vector<PII> VP;
 
//REPEAT
//------------------------------------------
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
 
//container util
//------------------------------------------
#define pb push_back
#define paired make_pair
#define ALL(a) (a).begin(), (a).end()
#define PRINT(V)       \
    for (auto v : (V)) \
    cout << v << " "
#define SORT(V) sort((V).begin(), (V).end())
#define RSORT(V) sort((V).rbegin(), (V).rend())
 
//constant
//------------------------------------------
const int MOD = 1000000007;
const int INF = 1061109567;
const double EPS = 1e-10;
const double PI = acos(-1.0);
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
 
 
//debug
//------------------------------------------
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
                      << " " << __FILE__ << endl;
 
int calc(int k, int i)
{
    //k*10**(i+1)を13でわったあまり
    int n=i%6;
    VI V{10,9,12,3,4,1};
    int ans=V[n];
    ans = ans*k%13;
    return ans;
}
 
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
 
    string S;
    cin >> S;
    ll dp[10501][15];
 
    char c = S.back();
    //initislization
    REP(i, 13)
    {
        dp[0][i] = 0;
        if (c == '?')
        {
            if (i <= 9)
                dp[0][i] = 1;
        }
        else
        {
            if (i == c - 48)
            {
                dp[0][i] = 1;
            }
        }
    }
    //update
    REP(i, S.size() - 1)
    {
        c = S[S.size() - 2 - i];
        REP(j, 13)
        {
            if (c == '?')
            {
                REP(k, 10)
                {
                    int num = j - calc(k,i);
                    int index = num >= 0 ? num : 13 + num;
 
                }
            }
            else
            {
                int num = j - calc(c-48,i);
                int index = num >= 0 ? num : 13 + num;
 
            }
        }
    }
  	dp[S.size() - 1][5]=100;
    cout << dp[S.size() - 1][5] << endl;
    return 0;


Compiler output:
a.cc: In function 'int main()':
a.cc:113:14: error: expected '}' at end of input
  113 |     return 0;
      |              ^
a.cc:62:1: note: to match this '{'
   62 | {
      | ^
Language: C++


#include <iostream>
#include <algorithm>

using namespace std;
long long int dp[100000][13] = { 0 };
#define mod 1000000007;

int  main()
{
	char s[100000];

	scanf( "%s",s);
	int n = strlen(s);
	
	

	if(s[0]=='?')
	{	
		for (int i = 0; i < 10; i++)
			dp[0][i] = 1;
		}
	else
	{
		int t = s[0] - '0';
		dp[0][t] = 1;
	}

	for (int i = 0; i < n-1; i++)
	{
		if (s[i] == '?')
		{
			for (int k = 0; k < 10; k++)
			{
				for (int ki = 0; ki < 13; ki++)
					dp[i + 1][(10 * ki + k) % 13] += dp[i][ki];
			}
			for (int k = 0; k < 13; k++)
				dp[i + 1][k] =  dp[i+1][k]%mod;
		}
		else 
		{
			for (int k = 0; k < 10; k++)
			{
				
					dp[i + 1][(10 * (s[i]-'0') + k) % 13] += dp[i][s[i] - '0'];
			}
			for (int k = 0; k < 10; k++)
				dp[i + 1][k]  = dp[i+1][k]% mod;
		}

	}

	cout << dp[0][5];


	}



Compiler output:
a.cc: In function 'int main()':
a.cc:14:17: error: 'strlen' was not declared in this scope
   14 |         int n = strlen(s);
      |                 ^~~~~~
a.cc:4:1: note: 'strlen' is defined in header '<cstring>'; this is probably fixable by adding '#include <cstring>'
    3 | #include <algorithm>
  +++ |+#include <cstring>
    4 |
Language: C++

#include<iostream>
using namespace std;
const int mod=1e9+7;
const int max=1e5+5;
ll dp[maxn][13];
int main()
{
	string s;
	cin>>s;
	int len=s.length();
	dp[0][0]=1//重要初始化 
	for(int i=0;i<len;i++)
	{
		if(s[i]=='?')
		{
			for(int now=0;now<=9;now++)
			{
				for(int j=0;j<13;j++)
				{
					int k=j*10+now;
					dp[i][k%13]=(dp[i][k%13]+dp[i-1][j])%mod;
				}
			}
		}
		else
		{
			int now=s[i]-'0';
			for(int j=0;j<13;j++)
			{
				int k=j*10+now;
				dp[i][k%13]=(dp[i][k%13]+dp[i-1][j])%mod;
			}
		}
	}
	printf("%lld",dp[i-1][5]);
    return 0;
}

Compiler output:
a.cc:5:1: error: 'll' does not name a type
    5 | ll dp[maxn][13];
      | ^~
a.cc: In function 'int main()':
a.cc:11:9: error: 'dp' was not declared in this scope
   11 |         dp[0][0]=1//重要初始化
      |         ^~
a.cc:12:21: error: 'i' was not declared in this scope
   12 |         for(int i=0;i<len;i++)
      |                     ^
Language: C++

#include<bits/stdc++.h>
    using namespace std;
    const int N=1e5+5;
    #define ll long long
    const ll md=1e9+7;
    ll dp[N][15];
     string s;
      	int n;
    ll solve(int idx,int val)
    {	
    	ll &ret=dp[idx][val];
      	if(ret>=0)
          return ret;
      	ret=0;
    	if(idx==n)
        {
          ret=(val==5);	
          rturn ret;
        }
      	if(s[idx]=='?')
        {
         	int tmp;
          	for(int i=0;i<10;i++)
            {
              tmp=(val*10+i)%13;
              ret+=(solve(idx+1,tmp));
              ret%=md;
            }
        }
      	else{
          int v=s[idx]-'0';
         	val=(val*10+v)%13;
          	ret+=solve(idx+1,val);
          	ret%=md;
        }
      return ret%=md;
     
    }
     
    int main()
    {
    	cin>>s;
      	n=s.size();
      	memset(dp,-1ll,sizeof (dp));
      
      	cout<<solve(0,0)<<endl;
    }

Compiler output:
a.cc: In function 'long long int solve(int, int)':
a.cc:18:11: error: 'rturn' was not declared in this scope
   18 |           rturn ret;
      |           ^~~~~
Language: C++

    #include<bits/stdc++.h>
    using namespace std;
    const int N=1e5+5;
    #define ll long long
    const ll md=1e9+7;
    ll dp[N][15];
     string s;
      	
    ll solve(int idx,int val)
    {	
    	ll &ret=dp[idx][val];
      	if(ret>=0)
          return ret;
      	ret=0;
    	if(idx==n)
        {
          ret=(val==5);	
        }
      	if(s[idx]=='?')
        {
         	int tmp;
          	for(int i=0;i<10;i++)
            {
              tmp=(val*10+i)%13;
              ret+=(solve(idx+1,tmp));
              ret%=md;
            }
        }
      	else{
          int v=s[idx]-'0';
         	val=(val*10+v)%13;
          	ret+=solve(idx+1,val);
          	ret%=md;
        }
      return ret%=md;
     
    }
     
    int main()
    {
    	cin>>s;
      	n=s.size();
      	memset(dp,-1ll,sizeof (dp));
      
      	cout<<solve(0,0)<<endl;
    }

Compiler output:
a.cc: In function 'long long int solve(int, int)':
a.cc:15:17: error: 'n' was not declared in this scope
   15 |         if(idx==n)
      |                 ^
a.cc: In function 'int main()':
a.cc:42:9: error: 'n' was not declared in this scope
   42 |         n=s.size();
      |         ^
Language: C++

    #include<bits/stdc++.h>
    using namespace std;
    const int N=1e5+5;
    #define ll long long
    const ll md=1e9+7;
    ll dp[N][15];
     
    ll solve(int idx,int val)
    {	
    	ll &ret=dp[idx][val];
      	if(ret!=-1)
          return ret;
      	ret=0;
    	if(idx==n)
        {
          ret=(val==5);	
        }
      	if(s[idx]=='?')
        {
         	int tmp;
          	for(int i=0;i<10;i++)
            {
              tmp=(val*10+i)%13;
              ret+=(solve(idx+1,tmp));
              ret%=md;
            }
        }
      	else{
         	val=(val*10+s[idx])%13;
          	ret+=solve(idx+1,val);
          	ret%=md;
        }
      return ret%=md;
     
    }
     
    int main()
    {
    	string s;
      	cin>>s;
      	n=s.size();
      	memset(dp,-1ll,sizeof (dp));
      
      	cout<<solve(0,0)<<endl;
    }

Compiler output:
a.cc: In function 'long long int solve(int, int)':
a.cc:14:17: error: 'n' was not declared in this scope
   14 |         if(idx==n)
      |                 ^
a.cc:18:12: error: 's' was not declared in this scope
   18 |         if(s[idx]=='?')
      |            ^
a.cc: In function 'int main()':
a.cc:41:9: error: 'n' was not declared in this scope
   41 |         n=s.size();
      |         ^
Language: C++

#include<bits/stdc++.h>
using namespace std;
const int N=1e5+5;
#define ll long long
const ll md=1e9+7;
ll dp[N][15];

ll solve(int idx,int val)
{	
	ll &ret=dp[idx][val];
  	if(ret!=-1)
      return ret;
  	ret=0;
	if(idx==n)
    {
      ret=(val==5);	
    }
  	if(s[idx]=='?')
    {
     	int tmp;
      	for(int i=0;i<10;i++)
        {
          tmp=(val*10+i)%13;
          ret+=(solve(idx+1,tmp));
          ret%=md;
        }
    }
  	else{
     	val=(val*10+s[idx])%13;
      	ret+=solve(idx+1,val);
      	ret%=md;
    }
  return ret%=md;

}

int main()
{
	string s;
  	cin>>s;
  	n=s.size();
  	memset(dp,-1ll,sizeof (dp));
  
  	cout<<solve(0,0)<<endl;
}

Compiler output:
a.cc: In function 'long long int solve(int, int)':
a.cc:14:17: error: 'n' was not declared in this scope
   14 |         if(idx==n)
      |                 ^
a.cc:18:12: error: 's' was not declared in this scope
   18 |         if(s[idx]=='?')
      |            ^
a.cc: In function 'int main()':
a.cc:41:9: error: 'n' was not declared in this scope
   41 |         n=s.size();
      |         ^
Language: C++

#include <iostream>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <stack>
#include <set>
#include <queue>
#include <algorithm>
#include <deque>
#include <map>
using namespace std;

#define INF 1e18
#define int long long

static const int MOD = 1000000007;

int n;
char s[100005];
int dp[100005][13];

int solve() {
    int i, j, k, res = 0;

    scanf("%s", s);
    n = strlen(s);

    dp[0][0] = 1;
    for(i = 0; i < n; i++) {
        int c;
        if(s[i] == '?') c = -1;
        else c = s[i] - '0';

        for(j = 0; j < 10; j++) {
            if(c != -1 && c != j) continue;
            for(k = 0; k < 13; k++) {
                dp[i + 1][(k * 10 + j) % 13] += dp[i][k];
            }
        }
        for(j = 0; j < 13; j++) dp[i + 1][j] %= MOD;
    }
    res = dp[n][5];

    printf("%lli\n", res);
    return 0;
}

signed main() {
    solve();
}


Compiler output:
a.cc: In function 'long long int solve()':
a.cc:29:9: error: 'strlen' was not declared in this scope
   29 |     n = strlen(s);
      |         ^~~~~~
a.cc:14:1: note: 'strlen' is defined in header '<cstring>'; this is probably fixable by adding '#include <cstring>'
   13 | #include <map>
  +++ |+#include <cstring>
   14 | using namespace std;
Language: Java

import java.util.Arrays;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        String v = scan.next();
        int[] dp = new int[13];
        int[] nx = new int[13];
        
        v = reverseS(v);
        for (int i = 0; i < v.length(); i++) {
            Arrays.fill(nx,0);
            for (int j = 0; j < 13; j++) {
                for (int k = 0; k < 10; k++) {
                    if(k == v.charAt(i)-'0' || v.charAt(i) == '?') {
                             nx[(j * 10 + k) % 13] = (nx[(j * 10 + k) % 13] + dp[j])%mod;

                    }
                }
            }

            for (int j = 0; j < 13; j++) {
                dp[j] = nx[j];
            }
        }

    }

    private static String reverseS(String v) {
        String rs = "";
        for (int i = v.length()-1; i >=0; i--) {
            rs+=v.charAt(i);
        }
        return rs;
    }
}


Compiler output:
Main.java:17: error: cannot find symbol
                             nx[(j * 10 + k) % 13] = (nx[(j * 10 + k) % 13] + dp[j])%mod;
                                                                                     ^
  symbol:   variable mod
  location: class Main
1 error
Language: Java

package AtCodr.agc135;

import java.util.Arrays;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        String v = scan.next();
        int[] dp = new int[13];
        int[] nx = new int[13];
        
        v = reverseS(v);
        for (int i = 0; i < v.length(); i++) {
            Arrays.fill(nx,0);
            for (int j = 0; j < 13; j++) {
                for (int k = 0; k < 10; k++) {
                    if(k == v.charAt(i)-'0' || v.charAt(i) == '?') {
                             nx[(j * 10 + k) % 13] = (nx[(j * 10 + k) % 13] + dp[j])%mod;

                    }
                }
            }

            for (int j = 0; j < 13; j++) {
                dp[j] = nx[j];
            }
        }

    }

    private static String reverseS(String v) {
        String rs = "";
        for (int i = v.length()-1; i >=0; i--) {
            rs+=v.charAt(i);
        }
        return rs;
    }
}


Compiler output:
Main.java:19: error: cannot find symbol
                             nx[(j * 10 + k) % 13] = (nx[(j * 10 + k) % 13] + dp[j])%mod;
                                                                                     ^
  symbol:   variable mod
  location: class Main
1 error
Language: C++

#include <vector>
#include <queue>
#include <stack>
#include <algorithm>
#include <iostream>
#include <string>
#include <set>
#include <map>
#include <unordered_map>
#include <complex>
#include <iomanip>
#include <cmath>
#include <tuple>
using namespace std;

long long const MOD = 1000000007LL;

int main() {
    string str;
    cin >> str;

    int n = str.size();

    long long dp[n][13];
    memset(dp, 0, sizeof dp);

    // 初期値
    if (str[n - 1] != '?') {
        int num = str[n - 1] - '0';
        dp[0][num] = 1;
    } else {
        for (int i = 0; i < 10; i++) dp[0][i] = 1;
    }

    int power = 10;
    for (int i = n - 2; i >= 0; i--) {
        if (str[i] != '?') {
            // 一つ前余り数と今の余りの数を知りたい
            int num = ((str[i] - '0') * power) % 13; // X00000...0の余り
            // 一つ前っていうのは二時限目なので、0 - 12 まである。
            // 0 - 12 と X000....0 の余りを足す　→　i番目までの数字の余り
            for (int j = 0; j < 13; j++) dp[n - i - 1][(j + num) % 13] += dp[n - i - 2][j] % MOD;
        } else {
            for (int j = 0; j < 10; j++) {
                int num = (j * power) % 13;
                for (int k = 0; k < 13; k++) dp[n - i - 1][(k + num) % 13] += dp[n - i - 2][k] % MOD;
            }
        }
        power *= 10;
        power %= 13;
    }

    cout << dp[n - 1][5] << endl;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:25:5: error: 'memset' was not declared in this scope
   25 |     memset(dp, 0, sizeof dp);
      |     ^~~~~~
a.cc:13:1: note: 'memset' is defined in header '<cstring>'; this is probably fixable by adding '#include <cstring>'
   12 | #include <cmath>
  +++ |+#include <cstring>
   13 | #include <tuple>
Language: C++

#include <bits/stdc++.h>

using namespace std;

int dp[N][15];
int n;
string s;
int rec(int idx,int md){
    int &ret=dp[idx][md];
    if(ret!=-1)return ret;
    if(idx==n)return ret=md==5;
    ret=0;
    if(s[idx]=='?'){
        for(int i=0;i<10;i++){
            ret+=rec(idx+1,(10*md+i)%13);
            ret%=(1000000007);
        }
        return ret;
    }else{
        return ret=rec(idx+1,(10*md+(s[idx]-'0'))%13);
    }
}
int main() {
    cin>>s;
    n=s.size();
    memset(dp,-1,sizeof dp);
    cout<<rec(0,0);
    return 0;
}

Compiler output:
a.cc:5:8: error: 'N' was not declared in this scope
    5 | int dp[N][15];
      |        ^
a.cc: In function 'int rec(int, int)':
a.cc:9:14: error: 'dp' was not declared in this scope; did you mean 'dup'?
    9 |     int &ret=dp[idx][md];
      |              ^~
      |              dup
a.cc: In function 'int main()':
a.cc:26:12: error: 'dp' was not declared in this scope; did you mean 'dup'?
   26 |     memset(dp,-1,sizeof dp);
      |            ^~
      |            dup
Language: Java

import java.util.*;

public class Bonuses{
    public static void main(String args[]){

        Scanner sc = new Scanner(System.in);
        String str = sc.next();

        int mod = (int)1e9+7;
        char arr[] = str.toCharArray();
        int dp[][] = new int[str.length()][13];

        dp[0][0]=1;

        if (arr[0]=='?'){
            for (int i=1; i<10; i++) dp[0][i]=1;
        }else{
            int t = arr[0]-'0';
            dp[0][t]=1;
        }
//        for (int i=0; i<10; i++) dp[0][i]=1;

        for (int i=1; i<str.length(); i++){
            int x = -1;
            if (arr[i]!='?'){
                x = arr[i] - '0';
            }
            for (int j=0; j<10; j++){
                if (x==-1 || x==j){
                    for (int k=0; k<13; k++){
                        int m = (k*10+j)%13;
                        dp[i][m] += dp[i-1][k];
                        dp[i][m] %= mod;
                    }
                }
            }
        }

        if (arr[0]=='?') System.out.println(dp[str.length()-1][5]);
        else System.out.println(dp[str.length()-1][5]-1);
//        System.out.println(dp[str.length()-1][2]);
//        System.out.println(dp[0][6]);


    }

}

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

#include <iostream>
#include <string

using namespace std;

#define MOD 1000000007

int dp[100010][13] = {};

int main() {
	string s; cin >> s;

	dp[s.size()][0] = 1;
	long long dig = 1;
	for (int i = s.size() - 1; i >= 0; --i) {
		if (s[i] == '?') {
			for (int j = 0; j < 10; ++j) {
				for (int k = 0; k < 13; ++k) {
					dp[i][(j * dig + k) % 13] += dp[i + 1][k];
					dp[i][(j * dig + k) % 13] %= MOD;
				}
			}
		} else {
			int x = s[i] - '0';
			for (int k = 0; k < 13; ++k) {
				dp[i][(x * dig + k) % 13] += dp[i + 1][k];
				dp[i][(x * dig + k) % 13] %= MOD;
			}
		}
		dig *= 10; dig %= 13;
	}
	cout << dp[0][5] << endl;

	return 0;
}

Compiler output:
a.cc:2:17: error: missing terminating > character
    2 | #include <string
      |                 ^
Language: Java

import java.util.*;

public class Bonuses{
    public static void main(String args[]){

        Scanner sc = new Scanner(System.in);
        String str = sc.next();

        int mod = (int)1e9+7;
        char arr[] = str.toCharArray();
        int dp[][] = new int[str.length()+1][13];

        dp[0][0]=1;
//        for (int i=0; i<10; i++) dp[0][i]=1;

        for (int i=0; i<str.length(); i++){
            int x = -1;
            if (arr[i]!='?'){
                x = arr[i] - '0';
            }
            for (int j=0; j<10; j++){
                if (x==-1 || x==j){
                    for (int k=0; k<13; k++){
                        int m = (k*10+j)%13;
                        dp[i+1][m] += dp[i][k];
                        dp[i+1][m] %= mod;
                    }
                }
            }
        }

        System.out.println(dp[str.length()][5]);


    }

}

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

#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>

#define NMAX 100000
#define MOD 1000000007
#define INF 2000000000

#define MIN(a, b) (a < b ? a : b)
#define MAX(a, b) (a > b ? a : b)

using namespace std;

char str[NMAX + 1];
int dp[NMAX][13];

int main()
{
	cin.getline(str, NMAX);
	int len = strlen(str);
	
	dp[0][0] = 1;

	for(int i = 1; i < len + 1; i++)
		for (int j = 0; j < 13; j++)
		{
			if (str[i - 1] == '?')
			{
				for (int k = 0; k < 10; k++)
				{
					dp[i][(10 * j + k) % 13] += (dp[i - 1][j] % MOD);
					dp[i][(10 * j + k) % 13] %= MOD;
				}
			}
			else
			{
				dp[i][(10 * j + (str[i - 1] - '0')) % 13] += (dp[i - 1][j] % MOD);
				dp[i][(10 * j + (str[i - 1] - '0')) % 13] %= MOD;
			}
		}
	cout << dp[len][5] % MOD << '\n';
	return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:21:19: error: 'strlen' was not declared in this scope
   21 |         int len = strlen(str);
      |                   ^~~~~~
a.cc:5:1: note: 'strlen' is defined in header '<cstring>'; this is probably fixable by adding '#include <cstring>'
    4 | #include <algorithm>
  +++ |+#include <cstring>
    5 |
Language: C++

#include<functional>
#include<algorithm>
#include<iostream>
#include<iomanip>
#include<cstring>
#include<cstdlib>
#include<utility>
#include<string>
#include<cstdio>
#include<vector>
#include<bitset>
#include<cmath>
#include<ctime>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
using namespace std;
const int inf=2147483647,dx[]={-1,0,1,0},dy[]={0,-1,0,1};// 上 左 下 右
const int N=100005,M=1000005,K=200005,mod=1000000007;
const long long llinf=9223372036854775807ll;
//int & long long
int n,m;
string s;
int main(){
	cin>>s;
	for(int i=1;i<=n;i++)
		for(int j=1;j<=13;i++)
		{
			dp[i][j]=add(dp[i-1][j]);
		}
	cout<<dp[s.size()][5];
	return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:31:25: error: 'dp' was not declared in this scope; did you mean 'dy'?
   31 |                         dp[i][j]=add(dp[i-1][j]);
      |                         ^~
      |                         dy
a.cc:31:34: error: 'add' was not declared in this scope; did you mean 'fadd'?
   31 |                         dp[i][j]=add(dp[i-1][j]);
      |                                  ^~~
      |                                  fadd
a.cc:33:15: error: 'dp' was not declared in this scope; did you mean 'dy'?
   33 |         cout<<dp[s.size()][5];
      |               ^~
      |               dy
Language: C++

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod (1000000007)
#define limit (7368791)
#define rep(i,a,b) for (int64_t i = (a); i < (b); i++)
#define REP(i,n) rep(i,0,n)

void solve()
{
    string s;cin>>s;
    const int n=s.size();
    vector<vector<ll>>dp(n+1,vector<ll>(13,0));dp[0][0]=1;
    REP(i,n)
    {
        int x;
        if(s[i]=='?')x=-1;
        else x=s[i]-'0';
        REP(j,10)
            if(x==-1||x==j)
                REP(k,N)
                    dp[i+1][(k*10+j)%13]+=dp[i][k];
    	REP(j,13)dp[i+1][j]%=mod;
    }
    cout<<dp[n][5]<<endl;
}

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

Compiler output:
a.cc: In function 'void solve()':
a.cc:21:23: error: 'N' was not declared in this scope
   21 |                 REP(k,N)
      |                       ^
a.cc:6:47: note: in definition of macro 'rep'
    6 | #define rep(i,a,b) for (int64_t i = (a); i < (b); i++)
      |                                               ^
a.cc:21:17: note: in expansion of macro 'REP'
   21 |                 REP(k,N)
      |                 ^~~
Language: C++

static const llu MOD = 1000000007LL;
 
int n;
char s[100005];
int64_t dp[100005][13];
 
int64_t solve () {
	int i, j, ki;
	uint64_t res = 0;
 
	scanf("%s", s);
	n = strlen(s);
 
	dp[0][0] = 1;
	for (i = 0; i < n; i++) {
		int c;
		if (s[i] == '?') c = -1;
		else c = s[i] - '0';
 
		for (j = 0; j < 10; j++) {
			if (c != -1 && c != j) continue;
			for (ki = 0; ki < 13; ki++) {
				dp[i + 1][(ki * 10 + j) % 13] += dp[i][ki];
			}
		}
		for (j = 0; j < 13; j++) dp[i + 1][j] %= MOD;
	}
	res = dp[n][5];
 
	printf("%llu\n", res);
	return 0;
}

Compiler output:
a.cc:1:14: error: 'llu' does not name a type
    1 | static const llu MOD = 1000000007LL;
      |              ^~~
a.cc:5:1: error: 'int64_t' does not name a type
    5 | int64_t dp[100005][13];
      | ^~~~~~~
a.cc:1:1: note: 'int64_t' is defined in header '<cstdint>'; this is probably fixable by adding '#include <cstdint>'
  +++ |+#include <cstdint>
    1 | static const llu MOD = 1000000007LL;
a.cc:7:1: error: 'int64_t' does not name a type
    7 | int64_t solve () {
      | ^~~~~~~
a.cc:7:1: note: 'int64_t' is defined in header '<cstdint>'; this is probably fixable by adding '#include <cstdint>'
Language: C++

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

long long MOD = 1e9+7;
long long dp[100001][13]; // dp[i][j] := i文字目(1-indexed)まで筆算した余りがjになるような'?'の置き換えが何通りあるか。

int main(void) {
    string S;
    cin >> S;
    
    dp[0][0] = 1; // dpの初期化。0文字目までの筆算の余りが0になるような置き換えが1通りあると考える。
    
    //今、筆算をしているのがi文字目
    for (int i = 1; i <= S.length(); i++) {
        // i-1文字目まで筆算した余りを決め打ちしているループ変数remain
        for (int remain = 0; remain < 13; remain++) {
            // i文字目が'?'であるかどうか
            if (S[i-1] == '?') {
                // i文字目が'?'であったら、それをjに置き換えた場合について、それぞれ計算
                for (int j = 0; j <= 9; j++) {
                    int next_remain = (remain * 10 + j) % 13;　// (i-1)文字目までの余りがremainで、i文字目の'?'をjに置き換えた場合の、i文字目まで筆算した余り
                    
                    // dpの遷移
                    dp[i][next_remain] += dp[i-1][remain];
                    dp[i][next_remain] %= MOD;
                }
            } else {
                int i_num = S[i-1] - '0'; // i文字目の数字をi_numに代入
                int next_remain = (remain * 10 + i_num) % 13; // (i-1)文字目までの余りがremainである場合の、i文字目まで筆算した余り
                
                // dpの遷移
                dp[i][next_remain] += dp[i-1][remain];
                dp[i][next_remain] %= MOD;
            }
        }
    }
    
    cout << dp[S.length()][5] << endl; // 答えは、S.length()文字目(つまり最後の文字)まで筆算した余りが5になるような'?'の置き換えが何通りあるか。
    return 0;
}

Compiler output:
a.cc:22:62: error: extended character 　 is not valid in an identifier
   22 |                     int next_remain = (remain * 10 + j) % 13;　// (i-1)文字目までの余りがremainで、i文字目の'?'をjに置き換えた場合の、i文字目まで筆算した余り
      |                                                              ^
a.cc: In function 'int main()':
a.cc:22:62: error: '\U00003000' was not declared in this scope
   22 |                     int next_remain = (remain * 10 + j) % 13;　// (i-1)文字目までの余りがremainで、i文字目の'?'をjに置き換えた場合の、i文字目まで筆算した余り
      |                                                              ^~