criyle/codenet-compile-errors huggingface dataset:
Language: Java

import java.util.*;
import javafx.util.Pair;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int H = Integer.parseInt(sc.next());
        int W = Integer.parseInt(sc.next());
        int N = Integer.parseInt(sc.next());
        // HashMap<ArrayList<Integer>, Integer> map = new HashMap<ArrayList<Integer>, Integer>();
        HashMap<Pair<Integer, Integer>, Integer> map = new HashMap<Pair<Integer, Integer>, Integer>();
        for (int i=0;i<N;i++) {
            int a = Integer.parseInt(sc.next());
            int b = Integer.parseInt(sc.next());
            for (int j=-1;j<=1;j++) {
                for (int k=-1;k<=1;k++) {
                    if (a+j<2 || a+j>H-1) continue;
                    if (b+k<2 || b+k>W-1) continue;
                    // ArrayList<Integer> add = new ArrayList<Integer>();
                    // add.add(a+j);
                    // add.add(b+k);
                    Pair<Integer, Integer> add = new Pair<Integer, Integer>(a+j, b+k);
                    if (map.containsKey(add)) {
                        map.put(add, map.get(add)+1);
                    } else {
                        map.put(add, 1);
                    }
                }
            }
        }
        ArrayList<Integer> val = new ArrayList<Integer>(map.values());
        long[] ans = new long[10];
        long sum = 0L;
        for (int i=0;i<val.size();i++) {
            sum++;
            ans[val.get(i)]++;
        }
        ans[0]=(long)(H-2)*(W-2)-sum;
        for (int i=0;i<10;i++) {
            System.out.println(ans[i]);
        }
        // System.out.println(map);
    }
}

Compiler output:
Main.java:2: error: package javafx.util does not exist
import javafx.util.Pair;
                  ^
Main.java:11: error: cannot find symbol
        HashMap<Pair<Integer, Integer>, Integer> map = new HashMap<Pair<Integer, Integer>, Integer>();
                ^
  symbol:   class Pair
  location: class Main
Main.java:11: error: cannot find symbol
        HashMap<Pair<Integer, Integer>, Integer> map = new HashMap<Pair<Integer, Integer>, Integer>();
                                                                   ^
  symbol:   class Pair
  location: class Main
Main.java:22: error: cannot find symbol
                    Pair<Integer, Integer> add = new Pair<Integer, Integer>(a+j, b+k);
                    ^
  symbol:   class Pair
  location: class Main
Main.java:22: error: cannot find symbol
                    Pair<Integer, Integer> add = new Pair<Integer, Integer>(a+j, b+k);
                                                     ^
  symbol:   class Pair
  location: class Main
5 errors
Language: Java

import java.util.*;
import javafx.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int H = Integer.parseInt(sc.next());
        int W = Integer.parseInt(sc.next());
        int N = Integer.parseInt(sc.next());
        // HashMap<ArrayList<Integer>, Integer> map = new HashMap<ArrayList<Integer>, Integer>();
        HashMap<Pair<Integer, Integer>, Integer> map = new HashMap<Pair<Integer, Integer>, Integer>();
        for (int i=0;i<N;i++) {
            int a = Integer.parseInt(sc.next());
            int b = Integer.parseInt(sc.next());
            for (int j=-1;j<=1;j++) {
                for (int k=-1;k<=1;k++) {
                    if (a+j<2 || a+j>H-1) continue;
                    if (b+k<2 || b+k>W-1) continue;
                    // ArrayList<Integer> add = new ArrayList<Integer>();
                    // add.add(a+j);
                    // add.add(b+k);
                    Pair<Integer, Integer> add = new Pair<Integer, Integer>(a+j, b+k);
                    if (map.containsKey(add)) {
                        map.put(add, map.get(add)+1);
                    } else {
                        map.put(add, 1);
                    }
                }
            }
        }
        ArrayList<Integer> val = new ArrayList<Integer>(map.values());
        long[] ans = new long[10];
        long sum = 0L;
        for (int i=0;i<val.size();i++) {
            sum++;
            ans[val.get(i)]++;
        }
        ans[0]=(long)(H-2)*(W-2)-sum;
        for (int i=0;i<10;i++) {
            System.out.println(ans[i]);
        }
        // System.out.println(map);
    }
}

Compiler output:
Main.java:2: error: package javafx.util does not exist
import javafx.util.*;
^
Main.java:11: error: cannot find symbol
        HashMap<Pair<Integer, Integer>, Integer> map = new HashMap<Pair<Integer, Integer>, Integer>();
                ^
  symbol:   class Pair
  location: class Main
Main.java:11: error: cannot find symbol
        HashMap<Pair<Integer, Integer>, Integer> map = new HashMap<Pair<Integer, Integer>, Integer>();
                                                                   ^
  symbol:   class Pair
  location: class Main
Main.java:22: error: cannot find symbol
                    Pair<Integer, Integer> add = new Pair<Integer, Integer>(a+j, b+k);
                    ^
  symbol:   class Pair
  location: class Main
Main.java:22: error: cannot find symbol
                    Pair<Integer, Integer> add = new Pair<Integer, Integer>(a+j, b+k);
                                                     ^
  symbol:   class Pair
  location: class Main
5 errors
Language: C++

#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define f first
#define s second
#define all(container) container.begin(),container.end()
#define fast ios::sync_with_stdio(0); cin.tie(0)
#ifndef ONLINE_JUDGE
#include "debug.cpp"
#endif
#define int long long
const int mod = 1e9+7;  
int power(int a,int b) { if(b==0) return 1; int res = power(a,b/2); if(b&1) return res * res * a; else return res * res; }

int h,w,n;
set<pair<int,int>> se;

int check(int x,int y){
  int cnt = 0;
  for(int i=0;i<=2;i++){
    for(int j=0;j<=2;j++){
      if(x+i>=1&&x+i<=h&&y+j>=1&&y+j<=w) cnt+=se.count({x+i,y+j});
      else return 0;
    }
  }
  return cnt;
}

int32_t main(){
    
  fast;
  cin >> h >> w >> n;


  for(int i=1;i<=n;i++){
    int x,y; cin >> x >> y;
    se.insert({x,y});
  }

  vector<pair<int,int>> vp(all(se));
  int ans[10]={0};
  set<pair<int,int>> used;

  for(int idx=0;idx<vp.size();idx++){
    int x = vp[idx].f , y = vp[idx].s;
    for(int i=-2;i<1;i++){
      for(int j=-2;j<1;j++){
        if(!used.count({x+i,y+j})){
          ans[check(x+i,y+j)]++;
          used.insert({x+i,y+j});
        }
      }
    }
  }

  int sum = 0;
  for(int k=1;k<10;k++) sum+=ans[k];
  ans[0] = (h-2)*(w-2) - sum;

  for(int k : ans) cout << k << '\n';



  return 0;
}

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

#include<iostream>
#include<string>
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
using namespace std;

typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef long double ld;
const int inf=1e9+7;
const ll INF=1LL<<60 ;
const ll mod=1e9+7 ;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<int, int> P;
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(),c.end()
#define pb push_back
#define debug(x)  cout << #x << " = " << (x) << endl;
using Graph = vector<vector<int> >;
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; }
//#define int long long

void solve() {
	int h, w, n; cin >> h >> w >> n;
    vector<P> x;
    map<P, int> mp;
    rep(i, n) {
        cin >> x[i].fr >> x[i].sc;
        rep(a, 3) {
            rep(b, 3) {
                if(x[i].fr - a >= - && x[i].sc - b >= 0) mp[P(x[i].fr - a, x[i].sc - b)] ++;
            }
        }
    }
    vector<int> cnt(10);
    for(auto p: mp) {
        int co = p.sc;
        if(p.sc >= 10) continue;
        cnt[p.sc] ++;
    }

    rep(j, 10) {
        cout << cnt[j] << endl;
    }
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//init();
	solve();
	//cout << "finish" << endl;
    return 0;
}

Compiler output:
a.cc: In function 'void solve()':
a.cc:61:37: error: wrong type argument to unary minus
   61 |                 if(x[i].fr - a >= - && x[i].sc - b >= 0) mp[P(x[i].fr - a, x[i].sc - b)] ++;
      |                                     ^~~~
a.cc:61:41: error: expected ')' before '[' token
   61 |                 if(x[i].fr - a >= - && x[i].sc - b >= 0) mp[P(x[i].fr - a, x[i].sc - b)] ++;
      |                   ~                     ^
      |                                         )
a.cc:61:40: error: label 'x' used but not defined
   61 |                 if(x[i].fr - a >= - && x[i].sc - b >= 0) mp[P(x[i].fr - a, x[i].sc - b)] ++;
      |                                        ^
Language: C++

#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; 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 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 sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)),x.end())
#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 set<int> S;
typedef queue<int> Q;
typedef queue<P> QP;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
inline int in() { int x; scanf("%d",&x); return x;}
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
const int MOD = 1000000007;
#define dame { puts("-1"); return 0;}
#define yn {puts("YES");}else{puts("NO");}
  
int main() {
  ll H,W,N;
  cin >> H >> W >> N;
  vector<ll> ans(10,(ll)0);
  ans[0] = (ll)(H-2) * (ll)(W-2);
  map<P,int> mp;
  rep(i,N) {
    int a,b;
    cin >> a >> b;
    a--;
    b--;
    srep(dx,-1,2) {
      srep(dy,-1,2) {
        int x = a + dx;
        int y = b + dy;
        if(x >= 1 && x < H-1&& y >= 1 && y < W-1) {
          ans[mp[P(x,y)]]--;
          mp[P(x,y)]++;
          ans[mp[P(x,y)]]++;
        }
      }
    }
  }
  rep(i,10) {
    cout << ans[i] << endl;
  }
  return 0;

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

#include <bits/stdc++.h>
using namespace std;
#define ll long long
map<pair<int,int>,int>mp;
int h,w,n,cnt[10];
int main(){
	cin>>h>>w>>n;
	while(n--){
		int x,y;cin>>x>>y;
		for(int i=max(1,x-2);i<=min(h-2,x);i++)for(int j=max(1,y-2);j<=min(w-2,y);j++)mp[pair<int,int>(i,j)]++;
	}
	map<pair<int,int>,int>::tera ter;ter=mp.begin();
	while(ter!=mp.end()){
		cnt[iter->second]++;
		ter++; 
		n++;
	}
	ll ans=1ll*(h-2)*(w-2);	printf("%lld\n",ans-n-1);
	for(int i=1;i<=9;i++) cout<<cnt[i]<<endl;
	return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:12:33: error: 'tera' is not a member of 'std::map<std::pair<int, int>, int>'
   12 |         map<pair<int,int>,int>::tera ter;ter=mp.begin();
      |                                 ^~~~
a.cc:12:42: error: 'ter' was not declared in this scope
   12 |         map<pair<int,int>,int>::tera ter;ter=mp.begin();
      |                                          ^~~
a.cc:14:21: error: 'iter' was not declared in this scope
   14 |                 cnt[iter->second]++;
      |                     ^~~~
Language: C++

#include<bits/stdc++.h>
using namespace std;
#define int long long 
int H,W,N,a,b;
set< pair<int,int> > brd;
int dem[15];
signed main(){

	cin>>H>>W>>N;
	dem[0]=(H-2)*(W-2);
	while(N--)
	{
		cin>>a>>b;
		a--;b--;
		brd.insert({a,b});
		for(int x=max((int)0,a-2);x<=min(H-3,a);x++)
		{
			for(int y=max((int)0,b-2);y<=min(W-3,b);y++)
			{
				int cnt=0;
				for(int i=x;i<=x+2;i++)
				{
					for(int j=y;j<=y+2;j++)
					{
						if(brd.count({i,j})) cnt++;
					}
				}
				dem[cnt]++;
				dem[cnt-1]--;
			}
		}
	}
	for(int i=0;i<=9;i++)
	{
		cout<<dem[i]<<endl;
	}
	
	
}
		a--;b--;
		brd.insert({a,b});
		for(int x=max((int)0,a-2);x<=min(H-3,a);x++)
		{
			for(int y=max((int)0,b-2);y<=min(W-3,b);y++)
			{
				int cnt=0;
				for(int i=x;i<=x+2;i++)
				{
					for(int j=y;j<=y+2;j++)
					{
						if(brd.count({i,j})) cnt++;
					}
				}
				dem[cnt]++;
				dem[cnt-1]--;
			}
		}
	}
	for(int i=0;i<=9;i++)
	{
		cout<<dem[i]<<endl;
	}
	
	
}

Compiler output:
a.cc:40:17: error: 'a' does not name a type
   40 |                 a--;b--;
      |                 ^
a.cc:40:21: error: 'b' does not name a type
   40 |                 a--;b--;
      |                     ^
a.cc:41:17: error: 'brd' does not name a type
   41 |                 brd.insert({a,b});
      |                 ^~~
a.cc:41:33: error: expected unqualified-id before ')' token
   41 |                 brd.insert({a,b});
      |                                 ^
a.cc:42:17: error: expected unqualified-id before 'for'
   42 |                 for(int x=max((int)0,a-2);x<=min(H-3,a);x++)
      |                 ^~~
a.cc:42:43: error: 'x' does not name a type
   42 |                 for(int x=max((int)0,a-2);x<=min(H-3,a);x++)
      |                                           ^
a.cc:42:57: error: 'x' does not name a type
   42 |                 for(int x=max((int)0,a-2);x<=min(H-3,a);x++)
      |                                                         ^
a.cc:58:9: error: expected declaration before '}' token
   58 |         }
      |         ^
a.cc:59:9: error: expected unqualified-id before 'for'
   59 |         for(int i=0;i<=9;i++)
      |         ^~~
a.cc:59:21: error: 'i' does not name a type
   59 |         for(int i=0;i<=9;i++)
      |                     ^
a.cc:59:26: error: 'i' does not name a type
   59 |         for(int i=0;i<=9;i++)
      |                          ^
a.cc:65:1: error: expected declaration before '}' token
   65 | }
      | ^
Language: C++

#include <bits/stdc++.h>
#include <iostream>
#include <iomanip>
#include <ios>
#include <vector>
#include <string>
#include <algorithm>
#include <functional>
#include <queue>
#include <stack>
#include <set>
#include <cmath>
#include <bitset>
#include <map>
using namespace std;
typedef long long ll;
#define mp make_pair;
#define pb push_back;
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)


int main(){
  ios::sync_with_stdio(false);
  cin.tie(0);
  int H,W,N;
  cin >> H >> W >> N;
  pair<ll, ll> cor[N];
  ll a[N], b[N];
  rep(i,N){
    cin >> a[i] >> b[i];
    cor[i] = make_pair(a[i], b[i]);
  }
  sort(cor, cor+N);
  //  int dx[5]={-2,-1,0,1,2};
  //  int dy[5]={-2,-1,0,1,2};
  int ans[9] ={};
  rep(i,N){
    int t[5][5]={};
    int j=i-1;
    int tmp;
    int x=cor[i].first;
    int y=cor[i].second;
    while(j>=0){
      if(cor[j].first < x-2 || cor[i].first + 2 < x) break;
      if(cor[j].second >= y-2 && cor[j].second <= y+2){
	t[cor[j].first - x +2][cor[j].second - y +2]++;
      }      
      j--;
    }
    j=i+1;
    while(j<N){
      if(cor[j].first < x-2 || x + 2 < cor[j].first) break;
      if(cor[j].second >= y-2 && cor[j].second <= y+2){
        t[cor[j].first - x +2][cor[j].second - y +2]++;
      }
      j++;
    }
    int tmp[5][5];
    rep(k,5)rep(l,5){
      
      if(t[k][l] != 0) ans[t[k][l]]++;
    }      
  }
  ll zero=(H-2)*(W-2);
  rep(i, 9 ){
    zero -= ans[i]/(i+1);
  }
  cout << zero << endl;
  rep(i, 9){
    cout << ans[i]/(i+1) << endl;
  }

  
  return 0;
    

}


Compiler output:
a.cc: In function 'int main()':
a.cc:59:9: error: conflicting declaration 'int tmp [5][5]'
   59 |     int tmp[5][5];
      |         ^~~
a.cc:41:9: note: previous declaration as 'int tmp'
   41 |     int tmp;
      |         ^~~
Language: C++

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

typedef pair<long, long> P;

int binary_search(vector<P> &tmp, long long x, long long y_up, long long y_down){
    int ok = (int)tmp.size();
    int ng = -1;
    while (abs(ok - ng) > 1){
        int mid = (ok + ng) / 2;
        if (tmp[mid].first >= x) ok = mid;
        else ng = mid;
    }
    int ok2 = (int)tmp.size();
    int ng2 = -1;
    while (abs(ok2 - ng2) > 1){
        int mid = (ok2 + ng2) / 2;
        if (tmp[mid].first >= x + 1) ok2 = mid;
        else ng2 = mid;
    }
    int ok3 = ok2;
    int ng3 = ng;
    while (abs(ok3 - ng3) > 1){
        int mid = (ok3 + ng3) / 2;
        if (tmp[mid].second >= y_up) ok3 = mid;
        else ng3 = mid;
    }
    int ok4 = ok2;
    int ng4 = ng;
    while (abs(ok4 - ng4) > 1){
        int mid = (ok4 + ng4) / 2;
        if (tmp[mid].second >= y_donw + 1) ok4 = mid;
        else ng4 = mid;
    }
    return ng4 - ng3;
}

int main(){
    long long h, w, n;
    cin >> h >> w >> n;

    vector<P> tmp(n);
    for (int i = 0; i < n; i++) cin >> tmp[i].first >> tmp[i].second;
    sort(tmp.begin(), tmp.end());

    vector<long long> ans(10, 0);
    for (int elm = 0; elm < n; elm++){
        long long x = tmp[elm].first;
        long long y = tmp[elm].second;
        for (int i = - 2; i < 1; i++){
            for (int j = -2; j < 1; j++){
                if (x + i <= 0 || h < x + i || y + j <= 0 || w < y + j) continue;
                if (x + i + 2 <= 0 || h < x + i + 2 || y + j + 2 <= 0 || w < y + j + 2) continue;
                int ss = 0;
                ss += binary_search(tmp, x + i, y + j, y + j + 2);
                ss += binary_search(tmp, x + i + 1, y + j, y + j + 2);
                ss += binary_search(tmp, x + i + 2, y + j, y + j + 2);
                ans[ss]++;
            }
        }
    }

    long long tt = 0;
    for (int i = 1; i < 10; i++){
        ans[i] /= i;
        tt += ans[i];
    }

    ans[0] = (h - 2) * (w - 2) - tt;
    for (int i = 0; i < 10; i++) cout << ans[i] << endl;
}

Compiler output:
a.cc: In function 'int binary_search(std::vector<std::pair<long int, long int> >&, long long int, long long int, long long int)':
a.cc:32:32: error: 'y_donw' was not declared in this scope; did you mean 'y_down'?
   32 |         if (tmp[mid].second >= y_donw + 1) ok4 = mid;
      |                                ^~~~~~
      |                                y_down
Language: C++

#include <iostream>
#include <vector>
#include <map>

using namespace std;

int main(void) {
	int num, a, b, i, k = 0, sum = 0;
	long long H, W, ss;
	cin >> H >> W >> num;
	ss = (H - 2) * (W - 2);
	vector<pair<int, int>> list(9 * num);
	vector<int> ans(10, 0);
	map<pair<int, int>, int> mp;
	pair<int, int> p;
	for (i = 0; i < num; i++) {
		scanf_s("%d%d", &a, &b);
		for (int j = -1; j < 2; j++) {
			for (int l = -1; l < 2; l++) {
				p = make_pair(a + j, b + l);
				if (mp[p] == 0)
					list[k++] = p;
				mp[p]++;
			}
		}
	}
	for (i = 0; i < 9 * num; i++) {
		if (list[i].first > 1 && list[i].first < H && list[i].second > 1 && list[i].second < W) {
			ans[mp[list[i]]]++;
			sum++;
		}
	}
	cout << ss - sum << "\n";
	for (i = 1; i < 10; i++)
		cout << ans[i] << "\n";
	return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:17:17: error: 'scanf_s' was not declared in this scope; did you mean 'scanf'?
   17 |                 scanf_s("%d%d", &a, &b);
      |                 ^~~~~~~
      |                 scanf
Language: C++

#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
#include <math.h>
#include <string.h>
using namespace std;
int main() {
	long long int H, W, N;
	cin >> H >> W >> N;
	map<pair<long long int, long long int>, long long int>MLL;
	for( int i = 0; i < N; i++ ) {
		long long int a, b;
		cin >> a >> b;
		a--; b--;
		for( int j = -1; j <= 1; j++ ) {
			for( int k = -1; k <= 1; k++ ) {
				MLL[make_pair( a + j, b + k )]++;
			}
		}
	}
	vector<long long int>ans( 10 );
	for( auto n : MLL ) {
		if( 1 <= n.first.first&&n.first.first < H - 1 && 1 <= n.first.second&&n.first.second < W - 1 ) {
			ans[n.second]++;
		}
	}
	ans[0] = (H - 2)*(W - 2);
	for( size_t i = 1; i < 10; i++ ) {
		ans[0] -= ans[i];
	}
	for( size_t i = 0; i < 10; i++ ) {
		cout << ans[i] << endl;
	}
}


Compiler output:
a.cc: In function 'int main()':
a.cc:11:9: error: 'map' was not declared in this scope
   11 |         map<pair<long long int, long long int>, long long int>MLL;
      |         ^~~
a.cc:7:1: note: 'std::map' is defined in header '<map>'; this is probably fixable by adding '#include <map>'
    6 | #include <string.h>
  +++ |+#include <map>
    7 | using namespace std;
a.cc:11:47: error: expected primary-expression before ',' token
   11 |         map<pair<long long int, long long int>, long long int>MLL;
      |                                               ^
a.cc:11:49: error: expected primary-expression before 'long'
   11 |         map<pair<long long int, long long int>, long long int>MLL;
      |                                                 ^~~~
a.cc:18:33: error: 'MLL' was not declared in this scope
   18 |                                 MLL[make_pair( a + j, b + k )]++;
      |                                 ^~~
a.cc:23:23: error: 'MLL' was not declared in this scope
   23 |         for( auto n : MLL ) {
      |                       ^~~
Language: C++

#include <iostream>
#include <map>
#include <utility>

using namespace std;

int main(){


	long H,W,N;
	scanf("%ld",&H);
	scanf("%ld",&W);
	scanf("%ld",&N);

	std::map<pair<int, int>, long> m;

	// Create grid mappings
	for(long h=1 ; h<=H-2 ; h++){
		for(long w=1 ; w<=W-2 ; w++){
			m[make_pair(h,w)] = 0;
		}
	}

	long x,y;
	for(long i=0 ; i<N ; i++){
		scanf("%ld %ld",&x,&y);
		for(int x_offset = -1 ; x_offset<=1 ; x_offset++){
			for(int y_offset = -1 ; y_offset<=1 ; y_offset++){
				if(x+x_offset>=2 && y+y_offset>=2 && x+x_offset<=H-1 && y+y_offset<=W-1){
					m[make_pair(x+x_offset, y+y_offset)]+=1;
				}
			}		
		}
	}

	long count[10] = {0};
	count[0]=(H-2)*(W-2);

	for(auto elem:m){
		count[m.second]++;
		count[0]--;
	}

	for(int i=0; i<10;i++){
		cout << count[i] << endl;
	}
}


Compiler output:
a.cc: In function 'int main()':
a.cc:40:25: error: 'class std::map<std::pair<int, int>, long int>' has no member named 'second'
   40 |                 count[m.second]++;
      |                         ^~~~~~
Language: C++

#include <bits/stdc++.h>

using namespace std;

namespace std {
template <>
class hash<pair<int64_t, int64_t>> {
 public:
  size_t operator()(const pair<int64_t, int64_t>& d) const {
    return hash<int64_t>()(d.first) + hash<int64_t>()(d.second);
  }
};
}  // namespace std

int64_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);

  int64_t h, w, n;
  cin >> h >> w >> n;
  unordered_map<pair<int64_t, int64_t>, int64_t> pieces;
  for (int64_t i = 0; i < n; ++i) {
    int64_t a, b;
    cin >> a >> b;
    for (int64_t x = 0; x < 3; ++x) {
      for (int64_t y = 0; y < 3; ++y) {
        auto p = make_pair(b - x, a - y);
        if (p.first < 1 || p.second < 1 || w - 2 < p.first || h - 2 < p.second) {
          continue;
        }
        pieces[p] += 1;
      }
    }
  }
  vector<int64_t> ans(10);
  int64_t whites = (w - 2) * (h - 2);
  for (auto& e : pieces) {
    ans[e.second]++;
  }
  for (auto& elm : ans) {
    whites -= elm;
  }
  ans[0] = whites;
  for (auto& elm : ans) {
    cout << elm << "\n";
  }
  cout << "\n";
}


Compiler output:
a.cc:15:1: error: '::main' must return 'int'
   15 | int64_t main() {
      | ^~~~~~~
Language: C++

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
using namespace std;
const int maxn=1000007,p1=100007,p2=10007;
int vis[1000010];
long long cou[12]; 
int n,bux[9]={-2,-2,-2,-1,-1,-1,0,0,0},buy[9]={-1,-2,0,-1,-2,0,-1,-2,0};
long long h,w;
char ch;
inline int get_num(){
	int num=0;ch=getchar();
	while(ch>'9'||ch<'0'){ch=getchar();	}
	while(ch<='9'&&ch>='0'){num=(num<<3)+(num<<1)+ch-'0';ch=getchar();	}
	return num;
}
int hash(int a,int b){
	long long ans=((a*p1)%maxn+(b*p2)%maxn)%maxn;
	return ans;
}
void work(int x,int y){
	int nowx,nowy;
	long long node;
	for(int i=0;i<9;i++){
		nowx=x+bux[i],nowy=y+buy[i];
		if(nowx>0&&nowx<=h-2&&nowy>0&&nowy<=w-2){
			node=hash(nowx,nowy);
			cou[vis[node]]--;cou[++vis[node]]++;
		}
	}
}
int main(){
	int a,b;
	memset(cou,0,sizeof(cou));
	memset(vis,0,sizeof(vis));
	scanf("%d%d%d",&h,&w,&n);
	cou[0]=(h-2)*(w-2);
	for(int i=1;i<=n;i++){
		a=get_num();b=get_num();
		work(a,b);
	}
	for(int i=0;i<=9;i++)printf("%d\n",cou[i]);
	
	return 0;
}

Compiler output:
a.cc: In function 'void work(int, int)':
a.cc:28:30: error: reference to 'hash' is ambiguous
   28 |                         node=hash(nowx,nowy);
      |                              ^~~~
In file included from /usr/include/c++/14/string_view:50,
                 from /usr/include/c++/14/bits/basic_string.h:47,
                 from /usr/include/c++/14/string:54,
                 from /usr/include/c++/14/bits/locale_classes.h:40,
                 from /usr/include/c++/14/bits/ios_base.h:41,
                 from /usr/include/c++/14/ios:44,
                 from /usr/include/c++/14/ostream:40,
                 from /usr/include/c++/14/iostream:41,
                 from a.cc:1:
/usr/include/c++/14/bits/functional_hash.h:59:12: note: candidates are: 'template<class _Tp> struct std::hash'
   59 |     struct hash;
      |            ^~~~
a.cc:18:5: note:                 'int hash(int, int)'
   18 | int hash(int a,int b){
      |     ^~~~
Language: C++

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
using namespace std;
const int maxn=1000007,p1=100007,p2=10007;
int vis[1000010];
long long cou[12]; 
int n,bux[9]={-2,-2,-2,-1,-1,-1,0,0,0},buy[9]={-1,-2,0,-1,-2,0,-1,-2,0};
long long h,w;
char ch;
inline int get_num(){
	int num=0;ch=getchar();
	while(ch>'9'||ch<'0'){ch=getchar();	}
	while(ch<='9'&&ch>='0'){num=(num<<3)+(num<<1)+ch-'0';ch=getchar();	}
	return num;
}
int hash(int a,int b){
	long long ans=((a*p1)%maxn+(b*p2)%maxn)%maxn;
	return ans;
}
void work(int x,int y){
	int nowx,nowy,node;
	for(int i=0;i<9;i++){
		nowx=x+bux[i],nowy=y+buy[i];
		if(nowx>0&&nowx<=h-2&&nowy>0&&nowy<=w-2){
			node=hash(nowx,nowy);
			cou[vis[node]]--;cou[++vis[node]]++;
		}
	}
}
int main(){
	int a,b;
	memset(cou,0,sizeof(cou));
	memset(vis,0,sizeof(vis));
	scanf("%d%d%d",&h,&w,&n);
	cou[0]=(h-2)*(w-2);
	for(int i=1;i<=n;i++){
		a=get_num();b=get_num();
		work(a,b);
	}
	for(int i=0;i<=9;i++)printf("%d\n",cou[i]);
	
	return 0;
}

Compiler output:
a.cc: In function 'void work(int, int)':
a.cc:27:30: error: reference to 'hash' is ambiguous
   27 |                         node=hash(nowx,nowy);
      |                              ^~~~
In file included from /usr/include/c++/14/string_view:50,
                 from /usr/include/c++/14/bits/basic_string.h:47,
                 from /usr/include/c++/14/string:54,
                 from /usr/include/c++/14/bits/locale_classes.h:40,
                 from /usr/include/c++/14/bits/ios_base.h:41,
                 from /usr/include/c++/14/ios:44,
                 from /usr/include/c++/14/ostream:40,
                 from /usr/include/c++/14/iostream:41,
                 from a.cc:1:
/usr/include/c++/14/bits/functional_hash.h:59:12: note: candidates are: 'template<class _Tp> struct std::hash'
   59 |     struct hash;
      |            ^~~~
a.cc:18:5: note:                 'int hash(int, int)'
   18 | int hash(int a,int b){
      |     ^~~~
Language: C++

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<queue>
#include<stack>
using namespace std;
const int maxn=1000007,p1=100007,p2=10007;
int vis[1000010];
long long cou[12]; 
int n,bux[9]={-2,-2,-2,-1,-1,-1,0,0,0},buy[9]={-1,-2,0,-1,-2,0,-1,-2,0};
long long h,w;
char ch;
inline int get_num(){
	int num=0;ch=getchar();
	while(ch>'9'||ch<'0'){ch=getchar();	}
	while(ch<='9'&&ch>='0'){num=(num<<3)+(num<<1)+ch-'0';ch=getchar();	}
	return num;
}
int hash(int a,int b){
	long long ans=((a*p1)%maxn+(b*p2)%maxn)%maxn;
	return ans;
}
void work(int x,int y){
	int nowx,nowy,node;
	for(int i=0;i<9;i++){
		nowx=x+bux[i],nowy=y+buy[i];
		if(nowx>0&&nowx<=h-2&&nowy>0&&nowy<=w-2){
			node=hash(nowx,nowy);
			cou[vis[node]]--;cou[++vis[node]]++;
		}
	}
}
int main(){
	int a,b;
	memset(cou,0,sizeof(cou));
	memset(vis,0,sizeof(vis));
	scanf("%d%d%d",&h,&w,&n);
	cou[0]=(h-2)*(w-2);
	for(int i=1;i<=n;i++){
		a=get_num();b=get_num();
		work(a,b);
	}
	for(int i=0;i<=9;i++)printf("%d\n",cou[i]);
	
	return 0;
}

Compiler output:
a.cc: In function 'void work(int, int)':
a.cc:30:30: error: reference to 'hash' is ambiguous
   30 |                         node=hash(nowx,nowy);
      |                              ^~~~
In file included from /usr/include/c++/14/string_view:50,
                 from /usr/include/c++/14/bits/basic_string.h:47,
                 from /usr/include/c++/14/string:54,
                 from /usr/include/c++/14/bits/locale_classes.h:40,
                 from /usr/include/c++/14/bits/ios_base.h:41,
                 from /usr/include/c++/14/ios:44,
                 from /usr/include/c++/14/ostream:40,
                 from /usr/include/c++/14/iostream:41,
                 from a.cc:1:
/usr/include/c++/14/bits/functional_hash.h:59:12: note: candidates are: 'template<class _Tp> struct std::hash'
   59 |     struct hash;
      |            ^~~~
a.cc:21:5: note:                 'int hash(int, int)'
   21 | int hash(int a,int b){
      |     ^~~~
Language: C++

#include<iostream>
#include<cstdio>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
const long long hash=456123;
long long hashx[10000007];
long long ans[10000007];
int dx[9]={-2,-2,-2,-1,-1,-1,0,0,0};
int dy[9]={-2,-1,0,-2,-1,0,-2,-1,0};
int tot;
int main()
{
	long long H,W,N;
	cin>>H>>W>>N;
	long long ans0=(H-2)*(W-2);
	for(int i=0;i<N;i++)
	{
		int x,y;
		cin>>x>>y;
		for(int j=0;j<9;j++)
		{
			int xx=x+dx[j];
			int yy=y+dy[j];
			if(xx>=1&&xx<=H-2&&yy>=1&&yy<=W-2)
			{
				hashx[tot++] =xx*hash+yy;
			}
		}
	}
	sort(hashx,hashx+tot);
	int cnt=1;
	for(int i=0;i<tot;i++)
	{
		if(hashx[i]==hashx[i+1])
			cnt++;
		else
		{
			ans[cnt]++;
			cnt=1;
			ans0--;
		}
	}
	cout<<ans0<<endl;
	for(int i=1;i<10;i++)
	cout<<ans[i]<<endl;
	return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:29:50: error: reference to 'hash' is ambiguous
   29 |                                 hashx[tot++] =xx*hash+yy;
      |                                                  ^~~~
In file included from /usr/include/c++/14/string_view:50,
                 from /usr/include/c++/14/bits/basic_string.h:47,
                 from /usr/include/c++/14/string:54,
                 from /usr/include/c++/14/bits/locale_classes.h:40,
                 from /usr/include/c++/14/bits/ios_base.h:41,
                 from /usr/include/c++/14/ios:44,
                 from /usr/include/c++/14/ostream:40,
                 from /usr/include/c++/14/iostream:41,
                 from a.cc:1:
/usr/include/c++/14/bits/functional_hash.h:59:12: note: candidates are: 'template<class _Tp> struct std::hash'
   59 |     struct hash;
      |            ^~~~
a.cc:8:17: note:                 'const long long int hash'
    8 | const long long hash=456123;
      |                 ^~~~
Language: C++

#include<bits/stdc++.h>
using namespace std;
const long long hash=456123;
long long hashx[10000007];
long long ans[10000007];
int dx[9]={-2,-2,-2,-1,-1,-1,0,0,0};
int dy[9]={-2,-1,0,-2,-1,0,-2,-1,0};
int tot;
int main()
{
	long long H,W,N;
	cin>>H>>W>>N;
	long long ans0=(H-2)*(W-2);
	for(int i=0;i<N;i++)
	{
		int x,y;
		cin>>x>>y;
		for(int j=0;j<9;j++)
		{
			int xx=x+dx[j];
			int yy=y+dy[j];
			if(xx>=1&&xx<=H-2&&yy>=1&&yy<=W-2)
			{
				hashx[tot++] =xx*hash+yy;
			}
		}
	}
	sort(hashx,hashx+tot);
	int cnt=1;
	for(int i=0;i<tot;i++)
	{
		if(hashx[i]==hashx[i+1])
			cnt++;
		else
		{
			ans[cnt]++;
			cnt=1;
			ans0--;
		}
	}
	cout<<ans0<<endl;
	for(int i=1;i<10;i++)
	cout<<ans[i]<<endl;
	return 0;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:24:50: error: reference to 'hash' is ambiguous
   24 |                                 hashx[tot++] =xx*hash+yy;
      |                                                  ^~~~
In file included from /usr/include/c++/14/string_view:50,
                 from /usr/include/c++/14/bits/basic_string.h:47,
                 from /usr/include/c++/14/string:54,
                 from /usr/include/c++/14/bitset:52,
                 from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:52,
                 from a.cc:1:
/usr/include/c++/14/bits/functional_hash.h:59:12: note: candidates are: 'template<class _Tp> struct std::hash'
   59 |     struct hash;
      |            ^~~~
a.cc:3:17: note:                 'const long long int hash'
    3 | const long long hash=456123;
      |                 ^~~~
Language: C++

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

 a,b,H,W;
int64_t cnt[10];
map<pair<int64_t, int64_t>, int64_t> mp;
int N,i,j,k;
int64_t sm;
int main(){
  std::ios::sync_with_stdio(false);
  std::cin.tie(0);

  // ifstream in("input.txt");
  // cin.rdbuf(in.rdbuf());

  cin>>H>>W>>N;
  for(i=0;i<N;i++){
    cin>>a>>b;
    a--;b--;
    for(j=-2;j<=0;j++){
      for(k=-2;k<=0;k++){
        if(a+j<0 || a+j+2>H-1 || b+k<0 || b+k+2>W-1)continue;
        mp[make_pair(a+j, b+k)]++;
      }
    }
  }
  sm = (H - 2) * (W - 2);
  for(auto itr=mp.begin(); itr!=mp.end();++itr){
    for(i=1;i<=9;i++){
      if((itr->second)==i)cnt[i]++;
    }
  }
  for(i=1;i<=9;i++){
    sm-=cnt[i];
  }
  cnt[0]=sm;
  for(i=0;i<=9;i++)cout<<cnt[i]<<endl;
  return 0;
}

Compiler output:
a.cc:4:2: error: 'a' does not name a type
    4 |  a,b,H,W;
      |  ^
a.cc: In function 'int main()':
a.cc:16:8: error: 'H' was not declared in this scope
   16 |   cin>>H>>W>>N;
      |        ^
a.cc:16:11: error: 'W' was not declared in this scope
   16 |   cin>>H>>W>>N;
      |           ^
a.cc:18:10: error: 'a' was not declared in this scope
   18 |     cin>>a>>b;
      |          ^
a.cc:18:13: error: 'b' was not declared in this scope
   18 |     cin>>a>>b;
      |             ^
Language: C++

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

ll a,b,H,W;
ll cnt[10];
map<pair<ll, ll>, ll> mp;
int N,i,j,k;
ll sm;
int main(){
  std::ios::sync_with_stdio(false);
  std::cin.tie(0);

  // ifstream in("input.txt");
  // cin.rdbuf(in.rdbuf());

  cin>>H>>W>>N;
  for(i=0;i<N;i++){
    cin>>a>>b;
    a--;b--;
    for(j=-2;j<=0;j++){
      for(k=-2;k<=0;k++){
        if(a+j<0 || a+j+2>H-1 || b+k<0 || b+k+2>W-1)continue;
        mp[make_pair(a+j, b+k)]++;
      }
    }
  }
  sm = (H - 2) * (W - 2);
  for(auto itr=mp.begin(); itr!=mp.end();++itr){
    for(i=1;i<=9;i++){
      if((itr->second)==i)cnt[i]++;
    }
  }
  for(i=1;i<=9;i++){
    sm-=cnt[i];
  }
  cnt[0]=sm;
  for(i=0;i<=9;i++)cout<<cnt[i]<<endl;
  return 0;
}

Compiler output:
a.cc:4:1: error: 'll' does not name a type
    4 | ll a,b,H,W;
      | ^~
a.cc:5:1: error: 'll' does not name a type
    5 | ll cnt[10];
      | ^~
a.cc:6:10: error: 'll' was not declared in this scope
    6 | map<pair<ll, ll>, ll> mp;
      |          ^~
a.cc:6:14: error: 'll' was not declared in this scope
    6 | map<pair<ll, ll>, ll> mp;
      |              ^~
a.cc:6:16: error: template argument 1 is invalid
    6 | map<pair<ll, ll>, ll> mp;
      |                ^
a.cc:6:16: error: template argument 2 is invalid
a.cc:6:19: error: 'll' was not declared in this scope
    6 | map<pair<ll, ll>, ll> mp;
      |                   ^~
a.cc:6:21: error: template argument 1 is invalid
    6 | map<pair<ll, ll>, ll> mp;
      |                     ^
a.cc:6:21: error: template argument 2 is invalid
a.cc:6:21: error: template argument 3 is invalid
a.cc:6:21: error: template argument 4 is invalid
a.cc:8:1: error: 'll' does not name a type
    8 | ll sm;
      | ^~
a.cc: In function 'int main()':
a.cc:16:8: error: 'H' was not declared in this scope
   16 |   cin>>H>>W>>N;
      |        ^
a.cc:16:11: error: 'W' was not declared in this scope
   16 |   cin>>H>>W>>N;
      |           ^
a.cc:18:10: error: 'a' was not declared in this scope
   18 |     cin>>a>>b;
      |          ^
a.cc:18:13: error: 'b' was not declared in this scope
   18 |     cin>>a>>b;
      |             ^
a.cc:27:3: error: 'sm' was not declared in this scope; did you mean 'tm'?
   27 |   sm = (H - 2) * (W - 2);
      |   ^~
      |   tm
a.cc:28:19: error: request for member 'begin' in 'mp', which is of non-class type 'int'
   28 |   for(auto itr=mp.begin(); itr!=mp.end();++itr){
      |                   ^~~~~
a.cc:28:36: error: request for member 'end' in 'mp', which is of non-class type 'int'
   28 |   for(auto itr=mp.begin(); itr!=mp.end();++itr){
      |                                    ^~~
a.cc:30:27: error: 'cnt' was not declared in this scope; did you mean 'int'?
   30 |       if((itr->second)==i)cnt[i]++;
      |                           ^~~
      |                           int
a.cc:34:9: error: 'cnt' was not declared in this scope; did you mean 'int'?
   34 |     sm-=cnt[i];
      |         ^~~
      |         int
a.cc:36:3: error: 'cnt' was not declared in this scope; did you mean 'int'?
   36 |   cnt[0]=sm;
      |   ^~~
      |   int
Language: C++

//
// Created by Tzyark on 2018/9/18.
//
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int H, W, N, a, b;
ll ans[10];
vector<pair<int, int>> vec;
int main() {
    cin >> H >> W >> N;
    for (int n = 0; n < N; n++) {
        cin >> a >> b;
        for (int i = 0; i < 3; i++) {
            for (int j = 0; j < 3; j++) {
                if (1 <= a-i && a-i <= H-2 && 1 <= b-j && b-j <= W-2) {
                    vec.push_back(make_pair(a-i, b-j));
                }
            }
        }
    }
    sort(vec.begin(), vec.end());
    int cnt = 1;
    for (int i = 0; i < vec.size(); i++) {
        if (vec[i] == vec[i + 1]) cnt++;
        else ans[cnt]++, cnt = 1;
    }
    ans[0] = 1ll * (H-2) * (W-2);
    for (int i = 1; i <= 9; i++) {
        ans[0] -= ans[i];
    }
    for (int i = 0; i <= 9; i++) {
        cout << ans[i] << endl;
    }
    return 0;
}

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

#include<bits/stdc++.h> //Ithea Myse Valgulious
namespace chtholly{//这里快读快写有30多行,我就省略了.
using namespace std;
const int yuzu=1e5;
typedef pair<int,int> pii;
map<pii,int> mp;
int h=read(),w=read(),n=read(),cnt[10];

int main(){
int i,j;
for (;n--;){
  int x=read(),y=read();
  for (i=max(1,x-2);i<=min(h-2,x);++i){
    for (j=max(1,y-2);j<=min(w-2,y);++j){
      mp[pii(i,j)]++; 
      }
    }
  }
for (auto p:mp) cnt[p.second]++,n++;
ll ans=1ll*(h-2)*(w-2);
write(ans-n-1),pl;
for (i=1;i<=9;++i) write(cnt[i]),pl;
}

Compiler output:
a.cc:7:11: error: too few arguments to function 'ssize_t read(int, void*, size_t)'
    7 | int h=read(),w=read(),n=read(),cnt[10];
      |       ~~~~^~
In file included from /usr/include/x86_64-linux-gnu/bits/sigstksz.h:24,
                 from /usr/include/signal.h:328,
                 from /usr/include/c++/14/csignal:42,
                 from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:116,
                 from a.cc:1:
/usr/include/unistd.h:371:16: note: declared here
  371 | extern ssize_t read (int __fd, void *__buf, size_t __nbytes) __wur
      |                ^~~~
a.cc: In function 'int chtholly::main()':
a.cc:11:7: error: 'n' was not declared in this scope
   11 | for (;n--;){
      |       ^
a.cc:12:13: error: too few arguments to function 'ssize_t read(int, void*, size_t)'
   12 |   int x=read(),y=read();
      |         ~~~~^~
/usr/include/unistd.h:371:16: note: declared here
  371 | extern ssize_t read (int __fd, void *__buf, size_t __nbytes) __wur
      |                ^~~~
a.cc:14:18: error: 'y' was not declared in this scope
   14 |     for (j=max(1,y-2);j<=min(w-2,y);++j){
      |                  ^
a.cc:14:30: error: 'w' was not declared in this scope
   14 |     for (j=max(1,y-2);j<=min(w-2,y);++j){
      |                              ^
a.cc:19:17: error: 'cnt' was not declared in this scope; did you mean 'int'?
   19 | for (auto p:mp) cnt[p.second]++,n++;
      |                 ^~~
      |                 int
a.cc:19:33: error: 'n' was not declared in this scope
   19 | for (auto p:mp) cnt[p.second]++,n++;
      |                                 ^
a.cc:20:1: error: 'll' was not declared in this scope
   20 | ll ans=1ll*(h-2)*(w-2);
      | ^~
a.cc:21:7: error: 'ans' was not declared in this scope; did you mean 'abs'?
   21 | write(ans-n-1),pl;
      |       ^~~
      |       abs
a.cc:21:11: error: 'n' was not declared in this scope
   21 | write(ans-n-1),pl;
      |           ^
a.cc:21:16: error: 'pl' was not declared in this scope
   21 | write(ans-n-1),pl;
      |                ^~
a.cc:22:26: error: 'cnt' was not declared in this scope; did you mean 'int'?
   22 | for (i=1;i<=9;++i) write(cnt[i]),pl;
      |                          ^~~
      |                          int
a.cc:23:1: warning: no return statement in function returning non-void [-Wreturn-type]
   23 | }
      | ^
a.cc: At global scope:
a.cc:23:2: error: expected '}' at end of input
   23 | }
      |  ^
a.cc:2:19: note: to match this '{'
    2 | namespace chtholly{//这里快读快写有30多行,我就省略了.
      |                   ^
Language: C++

/* goes here */
#include<bits/stdc++.h> //1
using namespace std; //2
typedef signed long long ll; //3
#define INF 0x3f3f3f3f //4
vector<pair<long long, long long>> rekkyo; //1
#define int ll //2
bool isvalid (ll i, ll j, ll h, ll w) { //3
    if(i<0 || h<=i || j<0 || w<=j){    //4
        return false; //1
    } return true; //2
} signed main(void){ //3
    int H,W,N;    //4
    cin >> H >> W >> N; //1
    int a[114514],b[114514]; //2
    for (ll i = 0; i < N; i++) { //3
        cin>>a[i]>>b[i];    //4
        for(int j = 0; j < 3; ++j){ //1
            for(int k=0;k<3;++k){ //2
                if (!j && !k) {a[i]--; b[i]--;} //3
                ;    //4
            } //1
        } //2
        for (ll j = -1; j <= +1; j++) { //3
            int c;    //4
            for(ll k = -1; k <= +1; ++k)if(isvalid(a[i] + j - 1, b[i] + k - 1, H, W) && isvalid(a[i] + j + 1, b[i] + k + 1, H, W))rekkyo.emplace_back(a[i] + j, b[i] + k); //1 †悪魔的行為†
        } //2
        if ("POKAIKO" == "RYONAIKO") std::sort( //3
        rekkyo.begin(),rekkyo.end());    //4
    } //1
    int Ans[10]={}; //2
    while (!rekkyo.empty()) { //3
    break;}    //4
    //pair<long long, long long> i, previous; //1
    for(int j=0;j<rekkyo.size();j++){ //2
        ll k; for (k = j; k < rekkyo.size() && rekkyo[k] == rekkyo[j]; k++); //3
    }    //4
    for(auto i : rekkyo){ //1
    } //2
    ll samebegin = 0, sameend; while (samebegin < rekkyo.size()) { //3
        ll samepunch;    //4
    break;}map<pair<long long, long long>, long long> taplis; //1
    for(auto i : rekkyo){ //2
    if (taplis.find(i) == taplis.end()) taplis.insert( //3
        make_pair(i,0));    //4
        ++taplis[i]; //1
    } //2
    Ans[0] = H * W - taplis.size(); //3
    for(pair<pair<long long,long long>,long long> PP:taplis){    //4
        ++Ans[PP.second]; //1
        ; //2
    } Ans[0] = (H - 2) * (W - 2); for (ll viine = 1; viine <= 9; viine++) { //3
        Ans[0]-=Ans[viine];    //4
    } for(auto i : Ans)cout << i << endl; //1
    int Gabriel,Satanichia,Raphiel; //2
    char* ukuku09 = "Ukunichia"; Satanichia = (int)ukuku09; //3
    return 0

Compiler output:
a.cc: In function 'int main()':
a.cc:56:21: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
   56 |     char* ukuku09 = "Ukunichia"; Satanichia = (int)ukuku09; //3
      |                     ^~~~~~~~~~~
a.cc:57:13: error: expected ';' at end of input
   57 |     return 0
      |             ^
      |             ;
a.cc:57:13: error: expected '}' at end of input
a.cc:12:20: note: to match this '{'
   12 | } signed main(void){ //3
      |                    ^
Language: C++

/* goes here */
#include<bits/stdc++.h> //1
using namespace std; //2
typedef signed long long ll; //3
#define INF 0x3f3f3f3f //4
vector<pair<long long, long long>> rekkyo; //1
#define int ll //2
bool isvalid (ll i, ll j, ll h, ll w) { //3
    if(i<0 || h<=i || j<0 || w<=j){    //4
        return false; //1
    } return true; //2
} signed main(void){ //3
    int H,W,N;    //4
    cin >> H >> W >> N; //1
    int a[114514],b[114514]; //2
    for (ll i = 0; i < N; i++) { //3
        cin>>a[i]>>b[i];    //4
        for(int j = 0; j < 3; ++j){ //1
            for(int k=0;k<3;++k){ //2
                if (!j && !k) {a[i]--; b[i]--;} //3
                ;    //4
            } //1
        } //2
        for (ll j = -1; j <= +1; j++) { //3
            int c;    //4
            for(ll k = -1; k <= +1; ++k)if(isvalid(a[i] + j - 1, b[i] + k - 1, H, W) && isvalid(a[i] + j + 1, b[i] + k + 1, H, W))rekkyo.emplace_back(a[i] + j, b[i] + k); //1 †悪魔的行為†
        } //2
        if ("POKAIKO" == "RYONAIKO") std::sort( //3
        rekkyo.begin(),rekkyo.end());    //4
    } //1
    int Ans[10]={}; //2
    while (!rekkyo.empty()) { //3
    break;}    //4
    //pair<long long, long long> i, previous; //1
    for(int j=0;j<rekkyo.size();j++){ //2
        ll k; for (k = j; k < rekkyo.size() && rekkyo[k] == rekkyo[j]; k++); //3
    }    //4
    for(auto i : rekkyo){ //1
    } //2
    ll samebegin = 0, sameend; while (samebegin < rekkyo.size()) { //3
        ll samepunch;    //4
    break;}map<pair<long long, long long>, long long> taplis; //1
    for(auto i : rekkyo){ //2
    if (taplis.find(i) == taplis.end()) taplis.insert( //3
        make_pair(i,0));    //4
        ++taplis[i]; //1
    } //2
    Ans[0] = H * W - taplis.size(); //3
    for(pair<pair<long long,long long>,long long> PP:taplis){    //4
        ++Ans[PP.second]; //1
        ; //2
    } Ans[0] = (H - 2) * (W - 2); for (ll viine = 1; viine <= 9; viine++) { //3
        Ans[0]-=Ans[i];    //4
    } for(auto i : Ans)cout << i << endl; //1
    int Gabriel,Satanichia,Raphiel; //2
    char* ukuku09 = "Ukunichia"; Satanichia = (int)ukuku09; //3
    return 0;    //4
} // 1 end

Compiler output:
a.cc: In function 'int main()':
a.cc:53:21: error: 'i' was not declared in this scope
   53 |         Ans[0]-=Ans[i];    //4
      |                     ^
a.cc:56:21: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
   56 |     char* ukuku09 = "Ukunichia"; Satanichia = (int)ukuku09; //3
      |                     ^~~~~~~~~~~