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

#include <iostream>
#include <cstdlib>
#include <functional>
#include <queue>
#include <stack>
#include <map>
#include <vector>
#include <string>

using namespace std;
const long long MOD = 1e9+7;

long long fp(long long base, long long n){
    long long ret = 1;
    for(long long i = 0; i < n; i++){
        ret = ret * base % MOD;
    }
    return ret;
}

int main()
{
    long long n;
    cin >> n;
    long long ans = (fp(10, n) - fp(9, n) - fp(9, n) + fp(8, n) % MOD;
    ans = ans + MOD;
    ans %= MOD;
    cout << ans << endl;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:25:70: error: expected ')' before ';' token
   25 |     long long ans = (fp(10, n) - fp(9, n) - fp(9, n) + fp(8, n) % MOD;
      |                     ~                                                ^
      |                                                                      )
Language: C++

#include<iostream>
using namespace std;
int main()
{
  int n,k
    cin>>n>>k;
  cout<<(n%k!=0);
}


Compiler output:
a.cc: In function 'int main()':
a.cc:6:5: error: expected initializer before 'cin'
    6 |     cin>>n>>k;
      |     ^~~
a.cc:7:12: error: 'k' was not declared in this scope
    7 |   cout<<(n%k!=0);
      |            ^
Language: C++

//"BISMILLAHIR RAHMANIR RAHIM"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
const long long M = 1000000007 ;
ll fact(ll x, ll y){
    ll f=1,i=1;
    while(i<=y){
        f=( (f%M) * (x%M) )%M;
        i++;
    }
    return f;
}
int main()
{
   ll n,ans=0;
   cin>>n;
   ans = fact(10,n)%M; ans %= M;
   ans -= fact(9,n)%M; ans %= M;
   ans -= fact(9,n)%M; ans %= M;
   ans += fact(8,n)%M. ans %= M;
   ans= (ans+M)%M;

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

Compiler output:
a.cc: In function 'int main()':
a.cc:22:24: error: request for member 'ans' in 'M', which is of non-class type 'const long long int'
   22 |    ans += fact(8,n)%M. ans %= M;
      |                        ^~~
Language: C++

//"BISMILLAHIR RAHMANIR RAHIM"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
const long long M = 1e9+7 ;
ll fact(ll x, ll y){
    ll f=1,i=1;
    while(i<=y){
        f=( (f%M) * (x%M) )%M;
        i++;
    }
    return f;
}
int main()
{
   ll n,ans=0;
   cin>>n;
   ans = fact(10,n)%M; ans %= M;
   ans -= fact(9,n)%M; ans %= M;
   ans -= fact(9,n)%M; ans %= M;
   ans += fact(8,n)%M. ans %= M;
   ans= (ans+M)%M;

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

Compiler output:
a.cc: In function 'int main()':
a.cc:22:24: error: request for member 'ans' in 'M', which is of non-class type 'const long long int'
   22 |    ans += fact(8,n)%M. ans %= M;
      |                        ^~~
Language: C++

#include <iostream>
#include <vector>
using namespace std;
long long pow(long long x,long long a){
  long long ans = 1;
  for(int i = 0;i<a;i++){
    ans *= x;
    ans %= 1000000007;
  }
  return ans;
}

int main() {
  long long N;
  cin >>N;
  long long sum;
  long long non9, non0, non0_9;
  non9 = pow(9, N);
  non0 = pow(9, N);
  non0_9 = pow(8, N);
  sum = pow(10,N)-non9-non0+non0_9;
  (sum+1000000007) %= 1000000007;
  cout << sum << endl;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:22:7: error: lvalue required as left operand of assignment
   22 |   (sum+1000000007) %= 1000000007;
      |   ~~~~^~~~~~~~~~~~
Language: C++

#include<bits/stdc++.h>
#include<atcoder/modint>

using namespace std;
using ll = long long;
using mint = atcoder::modint1000000007;

ostream &operator<<(std::ostream &os,const mint &p){return os << p.val();}
istream &operator>>(std::istream &is, mint &a){ll x;is >> x;a = mint(x);return (is);}
 
struct MComb {
   vector<mint> fact;
   vector<mint> inversed;
   MComb(int n) { // O(n+log(mod))
       fact = std::vector<mint>(n+1,1);
       for (int i = 1; i <= n; i++) fact[i] = fact[i-1]*mint(i);
       inversed = std::vector<mint>(n+1);
       inversed[n] = fact[n].pow(fact[n].mod()-2);
       for (int i = n - 1; i >= 0; i--) inversed[i]=inversed[i+1]*mint(i+1);
   }
   mint ncr(int n, int r) {
        if (n < r) return 0;
        if (n < 0 || r < 0) return 0;
       return (fact[n] * inversed[r] * inversed[n-r]);
   }
   mint npr(int n, int r) {
        if (n < r) return 0;
        if (n < 0 || r < 0) return 0;
       return (fact[n] * inversed[n-r]);
   }
   mint nhr(int n, int r) {
       assert(n+r-1 < (int)fact.size());
       return ncr(n+r-1, r);
   }
   mint fac(int n) {
       if(n < 0)return 0;
       return fact[n];
   }
};
MComb comb(200000);
 
mint ncr(int n, int r) {
   mint res = 1;
   for (int i = n - r + 1; i <= n; i++) res *= i;
   for (int i = 1; i <= r; i++) res /= i;
   return res;
}


int main()
{
    int n; cin >> n;
    cout << mint(10).pow(n) - mint(9).pow(n) * 2 + mint(8).pow(n) << endl;
}

Compiler output:
a.cc:2:9: fatal error: atcoder/modint: No such file or directory
    2 | #include<atcoder/modint>
      |         ^~~~~~~~~~~~~~~~
compilation terminated.
Language: C++

#include <bits/stdc++.h>
#define ll long long
using namespace std;
int64_t exp(int64_t x,int64_t y)
{
	int64_t f=1;
	for(int64_t i=1;i<=y;i++)
	f=f*x;
	
	return f;
}
int main()
{
	int64_t n;cin>>n;
	int64_t nc2=n*(n-1);
	int64_t ans=(nc2*exp(10,n-2))%(1e9+7);
	cout<<ans<<"\n";
	
}

Compiler output:
a.cc: In function 'int main()':
a.cc:16:38: error: invalid operands of types 'int64_t' {aka 'long int'} and 'double' to binary 'operator%'
   16 |         int64_t ans=(nc2*exp(10,n-2))%(1e9+7);
      |                     ~~~~~~~~~~~~~~~~~^~~~~~~~
      |                         |                 |
      |                         |                 double
      |                         int64_t {aka long int}
Language: C

#include <stdio.h>
#define mod 1000000007

int pm(int x, long long y);

int main(void){
  long long n;
  scanf("%lld", &n);

  long long a = pm(10,n); 
  long long b = pm(9,n);
  long long c = pm(8,n); 


  long long ans = a - b - b + c;

  ans %= mod;

  ans = (ans + mod) % mod;

  printf("%lld\n", ans);

  return 0;
}

int pm(intx, long long y){
  long long a = 1;
  for(int i = 0; i < y; i++){
    a *= x;
    a %= mod;
  }
  return a;
}

Compiler output:
main.c:26:13: error: expected ')' before 'long'
   26 | int pm(intx, long long y){
      |             ^~~~~
      |             )
Language: C++

#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long
#define llu unsigned long long
#define loop(i,a,b) for (long long int i=a; i<b; i++)
#define loopr(i,a,b) for(long long int j=a-1;j>b;j--)
#define st string
#define sz size()
#define maxe *max_element
#define mine *min_element
#define gt greater<ll>()
#define F first
#define S second
#define R return
#define B break
#define C continue
#define pb push_back
#define tc ll t; cin>>t; while(t--)
#define PI 3.1415926535897932384626433832795
#define MOD 1000000007
#define ROG ios::sync_with_stdio(0); cin.tie(0);
#define sortA(v)   sort(v.begin(), v.end())
#define sortD(v)   sort(v.begin(), v.end(), greater<auto>())
#define next cout<< "\n"
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<long long int> vll;
typedef vector<char> vc;
typedef long double ld;
#define mem(a,b)     memset(a, b, sizeof a)
 
const int q = 1e6 + 1;
const int mod = 1e9+7;
 
 
ll n, a[q][2][2];
ll solve(ll i, bool flag, bool temp)
{
	if(i == n)
    {
		return ((flag)&&(temp));
	}
	if(a[i][flag][temp]!=-1)
    {
      return a[i][flag][temp];
    }
	ll c1 = func(i+1, 1, temp)%mod;
	ll c2 = func(i+1, flag, 1)%mod;
	ll c3 = (8 * func(i+1, flag, temp))%mod;
 
	return a[i][flag][temp] = (c1 + c2 + c3)%mod;
}
 
 
 
int main()
{
    ROG
    mem(a, -1);
	cin >> n;
	cout << solve(0, 0, 0);
        
        
    }
}
 
 

Compiler output:
a.cc: In function 'long long int solve(long long int, bool, bool)':
a.cc:50:17: error: 'func' was not declared in this scope
   50 |         ll c1 = func(i+1, 1, temp)%mod;
      |                 ^~~~
a.cc: At global scope:
a.cc:68:1: error: expected declaration before '}' token
   68 | }
      | ^
Language: C++

#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long
#define llu unsigned long long
#define loop(i,a,b) for (long long int i=a; i<b; i++)
#define loopr(i,a,b) for(long long int j=a-1;j>b;j--)
#define st string
#define sz size()
#define maxe *max_element
#define mine *min_element
#define gt greater<ll>()
#define F first
#define S second
#define R return
#define B break
#define C continue
#define pb push_back
#define tc ll t; cin>>t; while(t--)
#define PI 3.1415926535897932384626433832795
#define MOD 1000000007
#define ROG ios::sync_with_stdio(0); cin.tie(0);
#define sortA(v)   sort(v.begin(), v.end())
#define sortD(v)   sort(v.begin(), v.end(), greater<auto>())
//#define next cout<< "\n"
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<long long int> vll;
typedef vector<char> vc;
typedef long double ld;
#define mem(a,b)     memset(a, b, sizeof a)
 
const int next = 1e6 + 1;
const int mod = 1e9+7;
 
 
ll n, a[next][2][2];
ll solve(ll i, bool flag, bool temp)
{
	if(i == n)
    {
		return ((flag)&&(temp));
	}
	if(a[i][flag][temp]!=-1)
    {
      return a[i][flag][temp];
    }
	ll c1 = solve(i+1, 1, temp)%mod;
	ll c2 = solve(i+1, flag, 1)%mod;
	ll c3 = (8 * solve(i+1, flag, temp))%mod;
 
	return a[i][flag][temp] = (c1 + c2 + c3)%mod;
}
 
 
 
int main()
{
    ROG
    mem(a, -1);
	cin >> n;
	cout << solve(0, 0, 0);
        
        
    }
}
 
 

Compiler output:
a.cc:39:9: error: reference to 'next' is ambiguous
   39 | ll n, a[next][2][2];
      |         ^~~~
In file included from /usr/include/c++/14/bits/stl_algobase.h:66,
                 from /usr/include/c++/14/algorithm:60,
                 from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:51,
                 from a.cc:1:
/usr/include/c++/14/bits/stl_iterator_base_funcs.h:232:5: note: candidates are: 'template<class _InputIterator> constexpr _InputIterator std::next(_InputIterator, typename iterator_traits<_Iter>::difference_type)'
  232 |     next(_InputIterator __x, typename
      |     ^~~~
a.cc:35:11: note:                 'const int next'
   35 | const int next = 1e6 + 1;
      |           ^~~~
a.cc: In function 'long long int solve(long long int, bool, bool)':
a.cc:46:12: error: 'a' was not declared in this scope
   46 |         if(a[i][flag][temp]!=-1)
      |            ^
a.cc:54:16: error: 'a' was not declared in this scope
   54 |         return a[i][flag][temp] = (c1 + c2 + c3)%mod;
      |                ^
a.cc: In function 'int main()':
a.cc:62:9: error: 'a' was not declared in this scope
   62 |     mem(a, -1);
      |         ^
a.cc:33:29: note: in definition of macro 'mem'
   33 | #define mem(a,b)     memset(a, b, sizeof a)
      |                             ^
a.cc: At global scope:
a.cc:68:1: error: expected declaration before '}' token
   68 | }
      | ^
Language: C++

#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long
#define llu unsigned long long
#define loop(i,a,b) for (long long int i=a; i<b; i++)
#define loopr(i,a,b) for(long long int j=a-1;j>b;j--)
#define st string
#define sz size()
#define maxe *max_element
#define mine *min_element
#define gt greater<ll>()
#define F first
#define S second
#define R return
#define B break
#define C continue
#define pb push_back
#define tc ll t; cin>>t; while(t--)
#define PI 3.1415926535897932384626433832795
#define MOD 1000000007
#define ROG ios::sync_with_stdio(0); cin.tie(0);
#define sortA(v)   sort(v.begin(), v.end())
#define sortD(v)   sort(v.begin(), v.end(), greater<auto>())
#define next cout<< "\n"
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<long long int> vll;
typedef vector<char> vc;
typedef long double ld;
#define mem(a,b)     memset(a, b, sizeof a)

const int next = 1e6 + 1;
const int mod = 1e9+7;


ll n, a[next][2][2];
ll solve(ll i, bool flag, bool temp)
{
	if(i == n)
    {
		return ((flag)&&(temp));
	}
	if(a[i][flag][temp]!=-1)
    {
      return a[i][flag][temp];
    }
	ll c1 = func(i+1, 1, temp)%mod;
	ll c2 = func(i+1, flag, 1)%mod;
	ll c3 = (8 * func(i+1, flag, temp))%mod;

	return a[i][flag][temp] = (c1 + c2 + c3)%mod;
}



int main()
{
    ROG
    mem(a, -1);
	cin >> n;
	cout << solve(0, 0, 0);
        
        
    }
}











Compiler output:
a.cc:26:18: error: expected initializer before '<<' token
   26 | #define next cout<< "\n"
      |                  ^~
a.cc:35:11: note: in expansion of macro 'next'
   35 | const int next = 1e6 + 1;
      |           ^~~~
a.cc:26:18: error: could not convert 'std::operator<< <char_traits<char> >(std::cout, ((const char*)"\012"))' from 'std::basic_ostream<char>' to 'long unsigned int'
   26 | #define next cout<< "\n"
      |              ~~~~^~~~~~~
      |                  |
      |                  std::basic_ostream<char>
a.cc:39:9: note: in expansion of macro 'next'
   39 | ll n, a[next][2][2];
      |         ^~~~
a.cc:26:18: error: size of array 'a' has non-integral type 'std::basic_ostream<char>'
   26 | #define next cout<< "\n"
      |              ~~~~^~~~~~~
a.cc:39:9: note: in expansion of macro 'next'
   39 | ll n, a[next][2][2];
      |         ^~~~
a.cc: In function 'long long int solve(long long int, bool, bool)':
a.cc:50:17: error: 'func' was not declared in this scope
   50 |         ll c1 = func(i+1, 1, temp)%mod;
      |                 ^~~~
a.cc: At global scope:
a.cc:68:1: error: expected declaration before '}' token
   68 | }
      | ^
Language: C++

#define ll long long
using namespace std;

const int m = 1e9 + 7;

ll int p(int n, int r) {
    ll int p = 1;
    for(int i = 1; i <= r; i++) {
        p = (p * n) % m;
    }
    return p;
}

int main() {
    int n;
    cin >> n;
    ll int s = p(10, n) - 2 * p(9, n) + p(8, n);
    cout << s << '\n';
}

Compiler output:
a.cc: In function 'int main()':
a.cc:16:5: error: 'cin' was not declared in this scope
   16 |     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 | #define ll long long
a.cc:18:5: error: 'cout' was not declared in this scope
   18 |     cout << s << '\n';
      |     ^~~~
a.cc:18:5: note: 'std::cout' is defined in header '<iostream>'; this is probably fixable by adding '#include <iostream>'
Language: Java

import java.util.*;
public class Main {
  	public static int pow1(int a, int b) {
      	long res = a;
      	for( int i = 0; i < b - 1; i++ ) {
          	res = res * a % 1000000007;
        }
      	return (int)res;
    }
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        // 整数の入力
        int a = sc.nextInt();
        //if(a > 10) System.exit(1);
      	int i = pow1(10, a);
      	int j = pow1(9, a) * 2 % 1000000007;
      	int k = pow1(8, a);
      	
      	long l = i - j + k;
      	l %= 1000000007;
      	if(l < 0) {
        	l += 1000000007;
        }
        System.out.println(l);
    }
}
import java.util.*;
public class Main {
  	public static int pow1(int a, int b) {
      	long res = a;
      	for( int i = 0; i < b - 1; i++ ) {
          	res = res * a % 1000000007;
        }
      	return (int)res;
    }
}

Compiler output:
Main.java:27: error: class, interface, enum, or record expected
import java.util.*;
^
1 error
Language: C++

#include<iostream>
int main()
{
  int N = 0;
  scanf("%d",&N);
  long long abc = 1;
  for(int a = 0; a < N; a++)
  {
    abc = abc * 10;
    abc = abc % 1000000007;
  }
  long long def = 1;
  for(int a = 0; a < N; a++)
  {
    def = def * 8;
    def = def % 1000000007;
  }
  long long ghi = 1;
  for(int a = 0; a < N; a++)
  {
    ghi = ghi * 9;
    ghi = ghi % 1000000007;
  }
  long long A = 0;
  if(ghi >= def)
    A = ghi - def;
  else
    A = 1000000007 + ghi = def;
  A = (A * 2) % 1000000007;
  if(abc >= A)
  {
    long long ans = abc - A;
    printf("%lld",ans);
  }
  else
  {
    long long ans = (abc + 1000000007) - A;
    printf("%lld",ans);
  }
}


Compiler output:
a.cc: In function 'int main()':
a.cc:28:20: error: lvalue required as left operand of assignment
   28 |     A = 1000000007 + ghi = def;
      |         ~~~~~~~~~~~^~~~~
Language: C

#include<studio.h>
 int main(void)
 {
   int a;
   printf("%d",a%10*10*10*10*10*10*10*10*10*7);

   return 0;
 }

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

//Mahir Ratanpara (DA-IICT)
#include<bits/stdc++.h>
using namespace std;
#define Ff(i,a,n) for(i=a;i<n;i++)
#define Fr(i,a,n) for(i=a;i>n;i--)
#define ll long long
#define FAST ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
#define pb push_back
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
#define clr(x) memset(x, 0, sizeof(x))
#define sortall(x) sort(all(x))
#define tr(it, a) for(auto it = a.begin(); it != a.end(); it++)
typedef pair<ll, ll>	pa;
typedef vector<ll>		vc;
typedef vector<pa>		vp;
typedef vector<vc>		vvc;
int mpow(int base, int exp); 
void ipgraph(ll n,ll m);
void dfs(int u, int par);
const int mod = 1000000007;
const int N = 3e5, M = N;
//=======================

vc g[N];

ll power(ll x, unsigned ll y, ll p)  
{  
    ll res = 1;     // Initialize result  
  
    x = x % p; // Update x if it is more than or  
                // equal to p 
   
    if (x == 0) return 0; // In case x is divisible by p; 
  
    while (y > 0)  
    {  
        // If y is odd, multiply x with result  
        if (y & 1)  
            res = (res*x) % p;  
  
        // y must be even now  
        y = y>>1; // y = y/2  
        x = (x*x) % p;  
    }  
    return res;  
}  

int main() {
    FAST;
    ll t, i, j, k, p, q,l,r, x, y, u, v, n, m;
    cin>>n;

    ll a=1,b=1,c=1;
    while(n--)
    {
      a = a * 10 % mod;
      b = b * 9 % mod;
      c = c * 8 % mod;
    }
	  cout << (a - 2*b + c + 2*mod) % mod << endl;
    cout<<ans;
    return 0;
}

int mpow(int base, int exp) {
  base %= mod;
  int result = 1;
  while (exp > 0) {
    if (exp & 1) result = ((ll)result * base) % mod;
    base = ((ll)base * base) % mod;
    exp >>= 1;
  }
  return result;
}

void ipgraph(ll n, ll m){
	int i, u, v;
	while(m--){
		cin>>u>>v;
		g[u-1].pb(v-1);
		g[v-1].pb(u-1);
	}
}

void dfs(int u, int par){
	for(int v:g[u]){
		if (v == par) continue;
		dfs(v, u);
	}
}

Compiler output:
a.cc: In function 'int main()':
a.cc:63:11: error: 'ans' was not declared in this scope; did you mean 'abs'?
   63 |     cout<<ans;
      |           ^~~
      |           abs
Language: C++

#include <iostream>
#include <algorithm>
#include <bitset>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <cctype>
#include <assert.h>
#include <stdlib.h>
#include <stdio.h>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <limits>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#include <math.h>
#define int long long
using namespace std;
int mod=pow(10,9)+7;
signed main() {
    int N;
    cin>>N;

    cout<<(pow(10,N)-pow(9,N)-pow(9,N)+pow(8,N))%mod<<endl;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:44:49: error: invalid operands of types '__gnu_cxx::__promote<double>::__type' {aka 'double'} and 'long long int' to binary 'operator%'
   44 |     cout<<(pow(10,N)-pow(9,N)-pow(9,N)+pow(8,N))%mod<<endl;
      |           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~
      |                                       |          |
      |                                       |          long long int
      |                                       __gnu_cxx::__promote<double>::__type {aka double}
Language: C++

#include<iostream>
#include<cmath>
define MOD 1000000007
using namespace std;

int main(){
  int a;
  cin>>a;
  long b,c,d;
  
  b=std::pow(10,a);
  c=std::pow(8,a);
  d=std::pow(9,a);
  long long int ans;
  ans=b%MOD;
    ans+=c%MOD;
  ans-=2*(d%MOD);
  
  cout<<ans;
  return 0;
}


Compiler output:
a.cc:3:1: error: 'define' does not name a type
    3 | define MOD 1000000007
      | ^~~~~~
a.cc: In function 'int main()':
a.cc:8:3: error: 'cin' was not declared in this scope; did you mean 'std::cin'?
    8 |   cin>>a;
      |   ^~~
      |   std::cin
In file included from a.cc:1:
/usr/include/c++/14/iostream:62:18: note: 'std::cin' declared here
   62 |   extern istream cin;           ///< Linked to standard input
      |                  ^~~
a.cc:15:9: error: 'MOD' was not declared in this scope
   15 |   ans=b%MOD;
      |         ^~~
a.cc:19:3: error: 'cout' was not declared in this scope; did you mean 'std::cout'?
   19 |   cout<<ans;
      |   ^~~~
      |   std::cout
/usr/include/c++/14/iostream:63:18: note: 'std::cout' declared here
   63 |   extern ostream cout;          ///< Linked to standard output
      |                  ^~~~
Language: C++

#include<iostream>
#include<cmath>
define MOD 1000000007;
using namespace std;

int main(){
  int a;
  cin>>a;
  long b,c,d;
  
  b=std::pow(10,a);
  c=std::pow(8,a);
  d=std::pow(9,a);
  long long int ans;
  ans=b%MOD;
    ans+=c%MOD;
  ans-=2*(d%MOD);
  
  cout<<ans;
  return 0;
}


Compiler output:
a.cc:3:1: error: 'define' does not name a type
    3 | define MOD 1000000007;
      | ^~~~~~
a.cc: In function 'int main()':
a.cc:15:9: error: 'MOD' was not declared in this scope
   15 |   ans=b%MOD;
      |         ^~~
Language: C++

#include<iostream>
#include<cmath>
using namespace std;
const int MOD=1000000007;
int main(){
  int a;
  cin>>a;
  long b,c,d,e;
  int f;
  b=(std::pow(10,a))%MOD;
  c=(std::pow(8,a))%MOD;
  d=(std::pow(9,a))%MOD;
  f=b+c-2*d;
  cout<<f;
  return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:10:21: error: invalid operands of types '__gnu_cxx::__promote<double>::__type' {aka 'double'} and 'const int' to binary 'operator%'
   10 |   b=(std::pow(10,a))%MOD;
      |     ~~~~~~~~~~~~~~~~^~~~
      |              |       |
      |              |       const int
      |              __gnu_cxx::__promote<double>::__type {aka double}
a.cc:11:20: error: invalid operands of types '__gnu_cxx::__promote<double>::__type' {aka 'double'} and 'const int' to binary 'operator%'
   11 |   c=(std::pow(8,a))%MOD;
      |     ~~~~~~~~~~~~~~~^~~~
      |              |      |
      |              |      const int
      |              __gnu_cxx::__promote<double>::__type {aka double}
a.cc:12:20: error: invalid operands of types '__gnu_cxx::__promote<double>::__type' {aka 'double'} and 'const int' to binary 'operator%'
   12 |   d=(std::pow(9,a))%MOD;
      |     ~~~~~~~~~~~~~~~^~~~
      |              |      |
      |              |      const int
      |              __gnu_cxx::__promote<double>::__type {aka double}
Language: C++

#include<iostream>
#include<cmath>
using namespace std;
const int MOD=1000000007;
int main(){
  int a;
  cin>>a;
  long b,c,d,e;
  int f;
  b=std::pow(10,a)%MOD;
  c=std::pow(8,a)%MOD;
  d=std::pow(9,a)%MOD;
  f=b+c-2*d;
  cout<<f;
  return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:10:19: error: invalid operands of types '__gnu_cxx::__promote<double>::__type' {aka 'double'} and 'const int' to binary 'operator%'
   10 |   b=std::pow(10,a)%MOD;
      |     ~~~~~~~~~~~~~~^~~~
      |             |      |
      |             |      const int
      |             __gnu_cxx::__promote<double>::__type {aka double}
a.cc:11:18: error: invalid operands of types '__gnu_cxx::__promote<double>::__type' {aka 'double'} and 'const int' to binary 'operator%'
   11 |   c=std::pow(8,a)%MOD;
      |     ~~~~~~~~~~~~~^~~~
      |             |     |
      |             |     const int
      |             __gnu_cxx::__promote<double>::__type {aka double}
a.cc:12:18: error: invalid operands of types '__gnu_cxx::__promote<double>::__type' {aka 'double'} and 'const int' to binary 'operator%'
   12 |   d=std::pow(9,a)%MOD;
      |     ~~~~~~~~~~~~~^~~~
      |             |     |
      |             |     const int
      |             __gnu_cxx::__promote<double>::__type {aka double}
Language: C++

#include<iostream>
#include<cmath>
using namespace std;
const int MOD=1000000007
int main(){
  int a;
  cin>>a;
  long b,c,d,e;
  int f;
  b=std::pow(10,a)%MOD;
  c=std::pow(8,a)%MOD;
  d=std::pow(9,a)%MOD;
  f=b+c-2*d;
  cout<<f;
  return 0;
}


Compiler output:
a.cc:5:1: error: expected ',' or ';' before 'int'
    5 | int main(){
      | ^~~
Language: C++

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

int Mod = 10 ** 9
 
int main() {
  cout << pow(2,5) << endl;
}

Compiler output:
a.cc:4:15: error: invalid type argument of unary '*' (have 'int')
    4 | int Mod = 10 ** 9
      |               ^~~
Language: C++

#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n - 1); i >= 0; i--)
#define ALL(v) v.begin(), v.end()
using namespace std;
using P = pair<int, int>;
typedef long long ll;
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; }
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int MOD = 1e9 + 7;
const int MAX = 2000000;

long long modpow(long long a, long long n, long long mod) {
    long long res = 1;
    while (n > 0) {
        if (n & 1) res = res * a % mod;
        a = a * a % mod;
        n >>= 1;
    }
    return res;
}


int main() {
  int n;
  cin >> n;
  COMinit();
  ll ans = modpow(10, n, MOD);
  ans -= modpow(9, n, MOD) * 2;
  ans %= MOD;
  ans += modpow(8, n, MOD);
  ans %= MOD;
  cout << ans << endl;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:29:3: error: 'COMinit' was not declared in this scope
   29 |   COMinit();
      |   ^~~~~~~
Language: C++

// #pragma GCC optimize ("O3")
// #pragma GCC target ("sse4")

#include <bits/stdc++.h>
using namespace std;
const int INF = 1 << 29;
const int NINF = -1*INF;
const long long LLINF = 1ll << 60;
const long long LLNINF = -1*LLINF;

template <class Ch, class Tr, class Container>
basic_ostream <Ch, Tr> & operator << (basic_ostream <Ch, Tr> & os, Container const& x) {
    os << "{ ";
    for(auto& y : x) os << y << " ";
    return os << "}";
}

template <class X, class Y>
ostream & operator << (ostream & os, pair <X, Y> const& p) {
	return os << "[ " << p.first << ", " << p.second << "]" ;
}

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
 
typedef pair<int, int> pi;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<double> vd;
typedef vector<ld> vld;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
typedef vector<vector<int>> vvi;
typedef vector<vll> vvll;
typedef vector<vd> vvd;
typedef vector<vld> vvld;
 
#define mp make_pair
#define pb push_back
#define pf push_front
#define all(x) x.begin(), x.end()
#define revAll(x) x.rbegin(), x.rend()
#define gcd(a, b) __gcd(a, b)
#define popcount(x) __builtin_popcount(x)
#define isize(x) (int)(x.size())
#define rep(i,n) for(int i = 0; i < n; i++)
#define umap unordered_map
#define uset unordered_set
#define pq priority_queue

const ll MOD = 1e9 + 7;

long long pow_mod(long long a, long long b) {
    long long res = 1;
    while (b > 0) {
        if (b & 1)
            res = res * a;
        a = a * a;
        b >>= 1;
    }
    return res;
}
void madd(ll& a, ll b){
	a += b;
	if (a >= MOD) a -= MOD;
}

void msub(ll& a, ll b){
	a -= b;
	if (a < 0) a += MOD;
}

int main(){
	ios_base::sync_with_stdio(false);cin.tie(0);
	int n; cin >> n;
	ll x = pow_mod(10, n, MOD);
	msub(x, 2*pow_mod(9, n, MOD));
	madd(x, pow_mod(8, n, MOD));
	cout << x % MOD;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:80:23: error: too many arguments to function 'long long int pow_mod(long long int, long long int)'
   80 |         ll x = pow_mod(10, n, MOD);
      |                ~~~~~~~^~~~~~~~~~~~
a.cc:57:11: note: declared here
   57 | long long pow_mod(long long a, long long b) {
      |           ^~~~~~~
a.cc:81:26: error: too many arguments to function 'long long int pow_mod(long long int, long long int)'
   81 |         msub(x, 2*pow_mod(9, n, MOD));
      |                   ~~~~~~~^~~~~~~~~~~
a.cc:57:11: note: declared here
   57 | long long pow_mod(long long a, long long b) {
      |           ^~~~~~~
a.cc:82:24: error: too many arguments to function 'long long int pow_mod(long long int, long long int)'
   82 |         madd(x, pow_mod(8, n, MOD));
      |                 ~~~~~~~^~~~~~~~~~~
a.cc:57:11: note: declared here
   57 | long long pow_mod(long long a, long long b) {
      |           ^~~~~~~
Language: C++

// #pragma GCC optimize ("O3")
// #pragma GCC target ("sse4")

#include <bits/stdc++.h>
using namespace std;
const int INF = 1 << 29;
const int NINF = -1*INF;
const long long LLINF = 1ll << 60;
const long long LLNINF = -1*LLINF;

template <class Ch, class Tr, class Container>
basic_ostream <Ch, Tr> & operator << (basic_ostream <Ch, Tr> & os, Container const& x) {
    os << "{ ";
    for(auto& y : x) os << y << " ";
    return os << "}";
}

template <class X, class Y>
ostream & operator << (ostream & os, pair <X, Y> const& p) {
	return os << "[ " << p.first << ", " << p.second << "]" ;
}

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
 
typedef pair<int, int> pi;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<double> vd;
typedef vector<ld> vld;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
typedef vector<vector<int>> vvi;
typedef vector<vll> vvll;
typedef vector<vd> vvd;
typedef vector<vld> vvld;
 
#define mp make_pair
#define pb push_back
#define pf push_front
#define all(x) x.begin(), x.end()
#define revAll(x) x.rbegin(), x.rend()
#define gcd(a, b) __gcd(a, b)
#define popcount(x) __builtin_popcount(x)
#define isize(x) (int)(x.size())
#define rep(i,n) for(int i = 0; i < n; i++)
#define umap unordered_map
#define uset unordered_set
#define pq priority_queue

const ll MOD = 1e9 + 7;

long long binpow(long long a, long long b) {
    long long res = 1;
    while (b > 0) {
        if (b & 1)
            res = res * a;
        a = a * a;
        b >>= 1;
    }
    return res;
}
void madd(ll& a, ll b){
	a += b;
	if (a >= MOD) a -= MOD;
}

void msub(ll& a, ll b){
	a -= b;
	if (a < 0) a += MOD;
}

int main(){
	ios_base::sync_with_stdio(false);cin.tie(0);
	int n; cin >> n;
	ll x = pow_mod(10, n, MOD);
	msub(x, 2*pow_mod(9, n, MOD));
	madd(x, pow_mod(8, n, MOD));
	cout << x % MOD;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:80:16: error: 'pow_mod' was not declared in this scope
   80 |         ll x = pow_mod(10, n, MOD);
      |                ^~~~~~~
Language: C++

#include<bits/stdc++.h>
#define mod 1e9+7
using namespace std;
int main()
{
  int n;
  cin>>n;
  int ans=0;
  if(n==1)
    ans=0;
  else
  {
    ans=(n-2+pow(10,n-2)%n)%mod;
  }
  cout<<ans;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:13:25: error: invalid operands of types '__gnu_cxx::__promote<double>::__type' {aka 'double'} and 'int' to binary 'operator%'
   13 |     ans=(n-2+pow(10,n-2)%n)%mod;
      |              ~~~~~~~~~~~^~
      |                 |        |
      |                 |        int
      |                 __gnu_cxx::__promote<double>::__type {aka double}
Language: C

#include<stdio.h>
#include<math.h>


int main(void){
	int N;
  	scanf("%d",&N);
  double a=(double)pow(10,N)%1000000007;
  double b=(double)pow(9,N)%1000000007;
  double c=(double)pow(8,N)%1000000007;
  printf("%.0f\n",a-2*b+c);
  return 0;
}


Compiler output:
main.c: In function 'main':
main.c:8:29: error: invalid operands to binary % (have 'double' and 'int')
    8 |   double a=(double)pow(10,N)%1000000007;
      |            ~~~~~~~~~~~~~~~~~^
      |            |
      |            double
main.c:9:28: error: invalid operands to binary % (have 'double' and 'int')
    9 |   double b=(double)pow(9,N)%1000000007;
      |            ~~~~~~~~~~~~~~~~^
      |            |
      |            double
main.c:10:28: error: invalid operands to binary % (have 'double' and 'int')
   10 |   double c=(double)pow(8,N)%1000000007;
      |            ~~~~~~~~~~~~~~~~^
      |            |
      |            double
Language: C

#include<stdio.h>
#include<math.h>


int main(void){
	int N;
  	scanf("%d",&N);
  double a=pow(10,N)%1000000007;
  double b=pow(9,N)%1000000007;
  double c=pow(8,N)%1000000007;
  printf("%.0f\n",a-2*b+c);
  return 0;
}


Compiler output:
main.c: In function 'main':
main.c:8:21: error: invalid operands to binary % (have 'double' and 'int')
    8 |   double a=pow(10,N)%1000000007;
      |            ~~~~~~~~~^
      |            |
      |            double
main.c:9:20: error: invalid operands to binary % (have 'double' and 'int')
    9 |   double b=pow(9,N)%1000000007;
      |            ~~~~~~~~^
      |            |
      |            double
main.c:10:20: error: invalid operands to binary % (have 'double' and 'int')
   10 |   double c=pow(8,N)%1000000007;
      |            ~~~~~~~~^
      |            |
      |            double
Language: C

#include<stdio.h>
#include<math.h>


int main(void){
	int N;
  	scanf("%d",&N);
  int a=pow(10,N)%1000000007;
  int b=pow(9,N)%1000000007;
  int c=pow(8,N)%1000000007;
  printf("%d\n",a-2*b+c);
  return 0;
}


Compiler output:
main.c: In function 'main':
main.c:8:18: error: invalid operands to binary % (have 'double' and 'int')
    8 |   int a=pow(10,N)%1000000007;
      |         ~~~~~~~~~^
      |         |
      |         double
main.c:9:17: error: invalid operands to binary % (have 'double' and 'int')
    9 |   int b=pow(9,N)%1000000007;
      |         ~~~~~~~~^
      |         |
      |         double
main.c:10:17: error: invalid operands to binary % (have 'double' and 'int')
   10 |   int c=pow(8,N)%1000000007;
      |         ~~~~~~~~^
      |         |
      |         double
Language: C++

#include<iostream>
#include<cmath>
using namespace std;
int main(){
  int a;
  cin>>a;
  long b,c,d,e;
  b=std::pow(10,a);
  c=std::pow(8,a);
  d=std::pow(9,a);
  e=b-c+2d;
  cout<<e%1000000007;
  return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:11:9: error: unable to find numeric literal operator 'operator""d'
   11 |   e=b-c+2d;
      |         ^~
Language: C++

#include<iostream>
using namespace std;
int main(){
  int a;
  cin>>a;
  long b,c,d,e;
  b=std::pow(10,a);
  c=std::pow(8,a);
  d=std::pow(9,a);
  e=b-c+2d;
  cout<<e;
  return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:7:10: error: 'pow' is not a member of 'std'
    7 |   b=std::pow(10,a);
      |          ^~~
a.cc:8:10: error: 'pow' is not a member of 'std'
    8 |   c=std::pow(8,a);
      |          ^~~
a.cc:9:10: error: 'pow' is not a member of 'std'
    9 |   d=std::pow(9,a);
      |          ^~~
a.cc:10:9: error: unable to find numeric literal operator 'operator""d'
   10 |   e=b-c+2d;
      |         ^~
Language: C++

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

const int mod = 1e9 + 7;
int qp(int a, int b) {
	int ans = 1;
	while(b) {
		if(b & 1) ans = 1ll * ans * a % mod;
		a = 1ll * a * a % mod;
		b >>= 1; 
	}
	return ans;
}

int main()
{
	int n; scanf("%d", &n); 
	if(n == 1) puts("0");
	else if(n == 2) puts("2");
	else printf("%d\n", (((ll)qp(10, n) - 2 * qp(9, n) + qp(8, n)) % mod + mod) % mod);
	return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:20:32: error: 'll' was not declared in this scope
   20 |         else printf("%d\n", (((ll)qp(10, n) - 2 * qp(9, n) + qp(8, n)) % mod + mod) % mod);
      |                                ^~
a.cc:20:35: error: expected ')' before 'qp'
   20 |         else printf("%d\n", (((ll)qp(10, n) - 2 * qp(9, n) + qp(8, n)) % mod + mod) % mod);
      |                              ~    ^~
      |                                   )
a.cc:20:91: error: expected ')' before ';' token
   20 |         else printf("%d\n", (((ll)qp(10, n) - 2 * qp(9, n) + qp(8, n)) % mod + mod) % mod);
      |                             ~                                                             ^
      |                                                                                           )
Language: C++

#include <iostream>
#include <iomanip>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <sstream>
#include <fstream>
#include <functional>
#include <array>
#include <climits>
#include "debug.h"
using namespace std;
 
#define A first
#define B second
 
typedef long long ll;
constexpr int MOD = 1e9 + 7;

inline int mulmd(ll a, ll b){
  ll ret = (a * b) % MOD;
  return (int) ret;
}

inline int power(ll x, ll y, int m){
  ll res = 1;
  x = x % m;
  while(y > 0){
    if(y & 1){
      res = mulmd(res, x);
    }
    y = y >> 1;
    x = mulmd(x, x);
  }
  return (int) res;
}
inline int submd(ll a, ll b){
  ll ret = (a - b);
  if(ret < 0) ret += MOD;
  return (int) ret;
}

inline int addmd(ll a, ll b){
  ll ret = (a + b) % MOD;
  return (int) ret;
}

inline int invPow(ll a){
  return power(a, MOD - 2, MOD);
}

inline int divmd(ll a, ll b){
  ll ret = mulmd(a, invPow(b));
  return (int) ret;
}

void solve() {
  int N;
  cin >> N;
  ll ans = submd(addmd(power(10, N, MOD), power(8, N, MOD)), addmd(power(9, N, MOD), power(9, N, MOD)));
  cout << ans;
}
 
int main(){
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  int T;
  T = 1;
  //cin >> T;
  while(T--){
    solve();
  }
}

Compiler output:
a.cc:19:10: fatal error: debug.h: No such file or directory
   19 | #include "debug.h"
      |          ^~~~~~~~~
compilation terminated.
Language: C++

/* Author : Harshit Jain a.k.a. iharshit009 */
#include <bits/stdc++.h>
#define vi               vector<int>
#define pb(x)            push_back(x)
#define all(x)           x.begin(), x.end()
#define sortall(x)       sort(all(x))
#define sortrev(x)       sort(all(x), greater<int>())
#define debug(x)         cout << '>' << #x << ':' << x << endl;
#define int              long long
#define ld               long double
#define endl 			 "\n";
#define mp 				 make_pair
#define pii 			 <int, int>
#define lb 				 lower_bound
#define ub				 upper_bound
#define len(a)           int((a).size())
#define prec(n)          fixed<<setprecision(n)
#define cnt(n)           __builtin_popcountll(n)
#define pi               pair<int, int>
const int mod = 1000000007;
using namespace std;
using namespace std::chrono;
// const int N = 1e5 + 5; 
// int n;
// int a[N];
int fact = 1;
// int facts(int n){

// for(int i = 1; i<=n; i++){
// 	fact = (fact*i)%mod;
// }
// return fact%mod;
// }


int powmod(int x,int y){
    int res=1;
    for(int i=0;i<y;i++){
        res=res*x%mod;
    }
    return res;
}


int32_t main(){
auto start = high_resolution_clock::now(); // starting clock
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int t;
t = 1;
// cin >>t;
while(t--){
int n;
cin >> n;


int pap = power(10,n.mod) - 2*power(9,n,mod) + power(8,n,mod);
pap %= mod;
pap = (pap+mod)%mod;
cout << pap;

}
auto stop = high_resolution_clock::now(); // stop clock
auto duration = duration_cast<microseconds>(stop - start);  // printing duration
cerr << "Time taken by function: " << duration.count() << " milliseconds" << endl; 
return 0;
}

Compiler output:
a.cc: In function 'int32_t main()':
a.cc:62:22: error: request for member 'mod' in 'n', which is of non-class type 'long long int'
   62 | int pap = power(10,n.mod) - 2*power(9,n,mod) + power(8,n,mod);
      |                      ^~~
a.cc:62:11: error: 'power' was not declared in this scope
   62 | int pap = power(10,n.mod) - 2*power(9,n,mod) + power(8,n,mod);
      |           ^~~~~
Language: C++

#include <iostream>
#include <vector>
#include <math.h>
#include <algorithm>
#define rep(i,N) for(int i=0;i<(N);i++)
#define PI 3.1415926535897932
using namespace std;
typedef long long ll;

const ll MOD 1000000007;

ll powmod(ll x, ll y){
	ll res=1;
	rep(i,y){
		res=res*x%MOD;
	}
	return res;
}

int main(){
	long long N;
	cin>>N;

	long long ans = powmod(10,N) - powmod(9,N)-powmod(9,N) + powmod(8,N);
	ans=(ans+MOD)%MOD;
	cout<<ans<<endl;
}

Compiler output:
a.cc:10:14: error: expected initializer before numeric constant
   10 | const ll MOD 1000000007;
      |              ^~~~~~~~~~
a.cc: In function 'll powmod(ll, ll)':
a.cc:15:27: error: 'MOD' was not declared in this scope
   15 |                 res=res*x%MOD;
      |                           ^~~
a.cc: In function 'int main()':
a.cc:25:18: error: 'MOD' was not declared in this scope
   25 |         ans=(ans+MOD)%MOD;
      |                  ^~~
Language: C++

#include <iostream>
#include <vector>
#include <math.h>
#include <algorithm>
#define rep(i,N) for(int i=0;i<(N);i++)
#define PI 3.1415926535897932
using namespace std;

const ll MOD 1000000007;
typedef long long ll;

ll powmod(ll x, ll y){
	ll res=1;
	rep(i,y){
		res=res*x%MOD;
	}
	return res;
}

int main(){
	long long N;
	cin>>N;

	long long ans = powmod(10,N) - powmod(9,N)-powmod(9,N) + powmod(8,N);
	ans=(ans+MOD)%MOD;
	cout<<ans<<endl;
}

Compiler output:
a.cc:9:7: error: 'll' does not name a type
    9 | const ll MOD 1000000007;
      |       ^~
a.cc: In function 'll powmod(ll, ll)':
a.cc:15:27: error: 'MOD' was not declared in this scope
   15 |                 res=res*x%MOD;
      |                           ^~~
a.cc: In function 'int main()':
a.cc:25:18: error: 'MOD' was not declared in this scope
   25 |         ans=(ans+MOD)%MOD;
      |                  ^~~
Language: C++

// ConsoleApplication1.cpp : This file contains the 'main' function. Program execution begins and ends there.
//

//#include "pch.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define vll vector<ll>
#define vvll vector<vll>
#define mll map<ll,ll>
#define f(i,m,n) for(i=m;i<n;i++)
#define ee endl
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define take(v,n) for(i=0;i<n;i++) cin>>v[i];
#define print(v,n) for(i=0;i<n;i++) cout<<v[i]<<" ";
#define NO() cout<<"NO"<<endl
#define YES() cout<<"YES"<<endl
#define fast ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define sot(v) sort(v.begin(),v.end());
#define PI 3.14159265   ;
ll mod =1000000007;
bool isPrime(int n)
{
	// Corner cases 
	if (n <= 1)  return false;
	if (n <= 3)  return true;

	// This is checked so that we can skip  
	// middle five numbers in below loop 
	if (n % 2 == 0 || n % 3 == 0) return false;

	for (int i = 5; i*i <= n; i = i + 6)
		if (n%i == 0 || n % (i + 2) == 0)
			return false;

	return true;
}

ll powe(ll x, ll y) {
	ll res = 1;
	while (y > 0) {
		if (y & 1) res =( res * x)mod;
		y = y >> 1;
		x = (x * x)%mod;
	}
	return res;
}
struct hash_pair {
	template <class T1, class T2>
	size_t operator()(const pair<T1, T2>& p) const
	{
		auto hash1 = hash<T1>{}(p.first);
		auto hash2 = hash<T2>{}(p.second);
		return hash1 ^ hash2;
	}
};

void solve()
{
	ll i, x, y, j, k, h, l, n, w, r, k1, k2, q;
	cin >> n;
	ll ans=powe(10,n);
	k=(pow(9,n)*2)%mod;
	ans=(ans-k+mod)%mod;
	cout<<ans<<ee;
}

int main() {
	fast;
	ll i, j, l, k, t, n;
	t=1;
	for (i = 1; i <= t; i++)
	{
		// cout<<"Case #"<<i<<": ";
		solve();
	}
}
// 

Compiler output:
a.cc: In function 'll powe(ll, ll)':
a.cc:45:43: error: expected ';' before 'mod'
   45 |                 if (y & 1) res =( res * x)mod;
      |                                           ^~~
      |                                           ;
a.cc: In function 'void solve()':
a.cc:66:23: error: invalid operands of types '__gnu_cxx::__promote<double>::__type' {aka 'double'} and 'll' {aka 'long long int'} to binary 'operator%'
   66 |         k=(pow(9,n)*2)%mod;
      |           ~~~~~~~~~~~~^~~~
      |                    |   |
      |                    |   ll {aka long long int}
      |                    __gnu_cxx::__promote<double>::__type {aka double}
Language: C++

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod =1e9+7;
ll qui(ll n,ll m){
//    ll ans =1;
//    while(m){
//        if(m&1){
//            ans *=n;
//            ans %=mod;
//        }
//        m >>=1;
//        n *=n;
//        n %=mod;
//    }
//    return ans;
    ll ans =1;
    for(ll i=1;i<=m;i++) ans =ans*n%mod;
    return ans;
}
int main(){
    ll n;
    cin>>n
    ll res =qui(10,n)-qui(9,n)*2+qui(8,n);
    res =(res%mod+mod)%mod;
    cout<<res<<"\n";
    
    return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:23:11: error: expected ';' before 'll'
   23 |     cin>>n
      |           ^
      |           ;
   24 |     ll res =qui(10,n)-qui(9,n)*2+qui(8,n);
      |     ~~     
a.cc:25:5: error: 'res' was not declared in this scope
   25 |     res =(res%mod+mod)%mod;
      |     ^~~
Language: C++

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

const ll mod = 1e9 + 7;
ll modpow(ll a, ll n, ll mod) {
    ll res = 1;
    while (n > 0) {
        if (n & 1) res = res * a % mod;
        a = a * a % mod;
        n >>= 1;
    }
    return res;
}

int main() {
    ll n;
    cin >> n;
    ll ans = modpow(10, n, mod) - modpow(9, n, mod) * 2 + modpow(8, n, mod);
    cout << ans%mod << endl;
    return 0;
}

Compiler output:
a.cc:3:12: error: 'll' does not name a type
    3 | using ll = ll;
      |            ^~
a.cc:5:7: error: 'll' does not name a type
    5 | const ll mod = 1e9 + 7;
      |       ^~
a.cc:6:1: error: 'll' does not name a type
    6 | ll modpow(ll a, ll n, ll mod) {
      | ^~
a.cc: In function 'int main()':
a.cc:17:5: error: 'll' was not declared in this scope
   17 |     ll n;
      |     ^~
a.cc:18:12: error: 'n' was not declared in this scope; did you mean 'yn'?
   18 |     cin >> n;
      |            ^
      |            yn
a.cc:19:7: error: expected ';' before 'ans'
   19 |     ll ans = modpow(10, n, mod) - modpow(9, n, mod) * 2 + modpow(8, n, mod);
      |       ^~~~
      |       ;
a.cc:20:13: error: 'ans' was not declared in this scope; did you mean 'abs'?
   20 |     cout << ans%mod << endl;
      |             ^~~
      |             abs
a.cc:20:17: error: 'mod' was not declared in this scope; did you mean 'modf'?
   20 |     cout << ans%mod << endl;
      |                 ^~~
      |                 modf
Language: C++

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

int main() {
  int long long n;
  cin >> n ;
  int long long x=1,y=1,z=1;
  int long long ans;
  int long long mod=1000000007
  for(int i=0;i<n;i++){
    x=(x*10)%mod;
    y=(y*9)%mod;
    z=(z*8)%mod;
  }
  ans=(x-2*y+z)%mod;
  cout<<ans<<endl;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:10:3: error: expected ',' or ';' before 'for'
   10 |   for(int i=0;i<n;i++){
      |   ^~~
a.cc:10:15: error: 'i' was not declared in this scope
   10 |   for(int i=0;i<n;i++){
      |               ^