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

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

using namespace std;
using namespace atcoder;
using usize = ::std::size_t;
using u64 = ::std::int_least64_t;
//using u64 = long long;
static constexpr u64 Inf = ::std::numeric_limits<u64>::max() / 2;


int main(int argc, char *argv[])
{
    
    
    cin.tie(0) ;
    ios::sync_with_stdio(false) ;
    
    int N, Q;
    cin >> N >> Q;
    fenwick_tree<u64> fw(N);
    for (int i = 0; i < N; i++) {
        int a;
        cin >> a;
        fw.add(i, (u64) a);
    }
    
    while (Q--) {
        int type, l, r;
        cin >> type >> l >> r;
        if(type) cout << fw.sum(l, r) << endl;
        else fw.add(l, (u64) r);
    }
    
    return 0;
    
}


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

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


#ifdef LOCAL
#define debug(var) cerr << (#var) << " = " << (var) << endl;
#else
#define debug(var)
#endif

void init() {
  ios_base::sync_with_stdio(0);
  cin.tie(0); cout.tie(0);
}

void solve() {
  int n, q; scanf("%d%d", &n, &q);
  fenwick_tree<int> fw(n);
  for (int a, i = 0; i < n; ++i) {
    scanf("%d", &a);
    fw.add(i, a);
  }
  while (q--) {
    int t, u, v; scanf("%d%d%d", &t, &u, &v);
    if (t) {
      fw.add(u, v);
    } else {
      printf("%d\n", fw.sum(u, v));
    }
  }
}

int main() {
  init();
  int t = 1; //scanf("%d", &t);
  while (t--) {
    solve();
  }
  return 0;
}


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

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

#ifdef LOCAL
#define debug(var) cerr << (#var) << " = " << (var) << endl;
#else
#define debug(var)
#endif

void init() {
  ios_base::sync_with_stdio(0);
  cin.tie(0); cout.tie(0);
}

void solve() {
  int n, q; scanf("%d%d", &n, &q);
  fenwick_tree<int> fw(n);
  for (int a, i = 0; i < n; ++i) {
    scanf("%d", &a);
    fw.add(i, a);
  }
  while (q--) {
    int t, u, v; scanf("%d%d%d", &t, &u, &v);
    if (t) {
      fw.add(u, v);
    } else {
      printf("%d\n", fw.sum(u, v));
    }
  }
}

int main() {
  init();
  int t = 1; //scanf("%d", &t);
  while (t--) {
    solve();
  }
  return 0;
}


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

#include <bits/stdc++.h>
#include <atcoder/all>
typedef long long ll;
using namespace atcoder;

int main(){
    int n,q;
    cin >> n >> q;
    fenwick_tree<ll> fw(int n);
    REP(i,n){
        int input;
        cin >> input;
        fw.add(i,input);
    }
    REP(i,q){
        int f,p,x;
        cin >> f >> p >> x;
        if(f==0){
            fw.add(p,x);
        }
        else{
            cout << fw.sum(p,x) << endl;
        }
    }
}

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

//フェニック木　Binary Indexed Tree;
#include <iostream>
#include <atcoder/fenwicktree>
using namespace std;
using namespace atcoder;

int main(){
    int N, Q;
    cin >> N >> Q;
    fenwick_tree<long long> fw(N);
    for(int i = 0; i < N; i++){
        long long a;
        cin >> a;
        fw.add(i, a);
    }
    for(int i = 0; i < Q; i++){
        bool b; long long u; long long v;
        cin >> b >> u >> v;
        if(b){
            cout << fw.sum(u, v) << endl;
        }
        else{
            fw.add(u, v);
        }
    }
    return 0;
}

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

#include <bits/stdc++.h>
#include "atcoder/fenwicktree.hpp"
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)

using namespace std;
using namespace atcoder;
using ll = long long;

int main() {
	int n, q;
	cin >> n >>q;
	fenwick_tree<ll> ft(n);
	rep(i, n) cin >> ft[i];
	rep(i, q) {
		ll t, p, x;
		cin >> t;
		if (t) {
			cin >> p >> x;
			ft.add(p, x);
		}
		else {
			cin >> p >> x;
			p--;
			x--;
			cout << ft.sum(p, x) << endl;;
		}
	}
	return 0;
}


Compiler output:
a.cc:2:10: fatal error: atcoder/fenwicktree.hpp: No such file or directory
    2 | #include "atcoder/fenwicktree.hpp"
      |          ^~~~~~~~~~~~~~~~~~~~~~~~~
compilation terminated.
Language: C++

#include <bits/stdc++.h>
#include "atcoder/fenwicktree.hpp"
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)

using namespace std;
using namespace atcoder;
using ll = long long;

int main() {
	int n, q;
	cin >> n >>q;
	fenwick_tree<ll> ft(n);
	rep(i, n) cin >> ft[i];
	rep(i, q) {
		ll t, p, x, w;
		cin >> t;
		if (t) {
			cin >> p >> x;
			ft.add(p, x);
		}
		else {
			cin >> p >> x;
			p--;
			x--;
			cout << ft.sum(p, x) << endl;;
		}
	}
	return 0;
}


Compiler output:
a.cc:2:10: fatal error: atcoder/fenwicktree.hpp: No such file or directory
    2 | #include "atcoder/fenwicktree.hpp"
      |          ^~~~~~~~~~~~~~~~~~~~~~~~~
compilation terminated.
Language: C++

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

#define int long long
using ll = long long;
using ld = long double;
using intpair = pair<int, int>;
using intmap = map<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
const int MOD = 1e9 + 7;
inline int mod (ll a, int m = MOD) { return (a % m + m) % m; }
inline bool bit (ll b, ll i) { return b & (1 << i); }
inline ll ceiv (ll a, ll b) { return (a + b - 1) / b; }
//struct Fast {Fast(){cin.tie(0);ios::sync_with_stdio(0);}} fast;

#define debug(x) cerr << #x << ": " << x << '\n'
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()

template <class T>
class FenwickTree {
    vector<T> a;
    
public:
    FenwickTree(){};
    FenwickTree(int size) {
        a = vector<T>(size + 1, 0);
    }
    
    void add(int idx, T value) {
        idx++;
        while(0 <= idx && idx < a.size()){
            a[idx] += value;
            idx += idx & (-idx);
        }
    }
    
    int sum(int idx) {
        int ret = 0;
        idx++;
        while(idx > 0) {
            ret += a[idx];
            idx -= idx & (-idx);
        }
        return ret;
    }
    
    int sum(int l, int r){
        return sum(r-1) - sum(l-1);
    }
};

int main() {
    int n, Q;
    cin >> n >> Q;
    
    FenwickTree<int> fw(n);
    rep(i,n){
        int a; cin >> a;
        fw.add(i, a);
    }
    
    while(Q--){
        int type; cin >> type;
        if(type == 0){
            int p, x;
            cin >> p >> x;
            fw.add(p, x);
        }else{
            int l, r;
            cin >> l >> r;
            cout << fw.sum(l, r) << endl;
        }
    }
}

Compiler output:
cc1plus: error: '::main' must return 'int'
Language: C++

// ALPC-B.cpp

#include <iostream>
#include <atcoder/fenwicktree.hpp>
using namespace std;
using namespace atcoder;
#define rep(i,n) for(ll i=0;i<(n);++i)
using ll = long long;
int main()
{
    int n, q;
    cin >> n >> q;
    fenwick_tree<ll> fw(n);
    ll a;
    rep(i, n) {
        cin >> a;
        fw.add(i, a); // fwに値をセット
    }
    ll q0, q1, q2;
    rep(i, q) {
        cin >> q0 >> q1 >> q2;
        if (q0 == 0) {
            fw.add(q1, q2); // fwの値を更新
        }
        if (q0 == 1) {
            cout << fw.sum(q1, q2) << endl; // fwで区間和を求める
        }
    }
}


Compiler output:
a.cc:4:10: fatal error: atcoder/fenwicktree.hpp: No such file or directory
    4 | #include <atcoder/fenwicktree.hpp>
      |          ^~~~~~~~~~~~~~~~~~~~~~~~~
compilation terminated.
Language: C++

#include <atcoder/all>
#include<bits/stdc++.h>
#define REP(i, n) for(int i=0; i<n; i++)
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
using namespace std;
using ll = long long;
using Graph = vector<vector<ll>>;

template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

int main(){
    int N, Q;
    cin >> N >> Q;
    fenwick_tree<ll> fw(N);
    for (int i = 0; i < N; i++)
    {
        int a;
        cin >> a;
        fw.add(i, a);
    }
    for (int i = 0; i < Q; i++)
    {
        int a, b, c;
        cin >> a >> b >> c;
        if(a) cout << fw.sum(b, c) << endl;
        else fw.add(b, c);
    }
}

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

#include <atcoder/segtree>
#include <cstdio>
#include <vector>

using namespace std;
using namespace atcoder;

int op(int a, int b) { return max(a, b); }

int e() { return -1; }

int main() {
    int n, q;
    scanf("%d %d", &n, &q);
    vector<int> a(n);
    for (int i = 0; i < n; i++) {
        scanf("%d", &(a[i]));
    }

    segtree<int, op, e> seg(a);

    for (int i = 0; i < q; i++) {
        int t;
        scanf("%d", &t);
        if (t == 1) {
            int x, v;
            scanf("%d %d", &x, &v);
            x--;
            seg.set(x, v);
        } else if (t == 2) {
            int l, r;
            scanf("%d %d", &l, &r);
            l--;
            printf("%d\n", seg.prod(l, r));
        }
    }
}


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

#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <algorithm>
#include <cstdio>
#include <iomanip>
#include <queue>
#include <deque>
#include <stack>
#include <fstream>
#include <cmath>
#include <random>
#include <complex>
#include <functional>
#include <bitset>
#include <sstream>
#include <cassert>
#include <time.h>
#include <atcoder/all>

#define ll int64_t
#define Rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
typedef vector<ll> vec;
typedef vector<vec> mat;

const ll inf = 1LL << 60;

template<class T> inline void chmin(T& a, T b) {
    if (a > b) {
        a = b;
    }
}
template<class T> inline void chmax(T& a, T b) {
    if (a < b) {
        a = b;
    }
}
void printvec (vec &v) {
    Rep (i, (ll)v.size()) {
        cout << v[i] << " \n"[i+1 == (ll)v.size()];
    }
}

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

    ll N, Q;
    cin >> N >> Q;
    atcoder::fenwick_tree<ll> fw(N);
    Rep (i, N) {
        ll a;
        cin >> a;
        fw.add(i, a);
    }

    while (Q--) {
        ll t, x, y;
        cin >> t >> x >> y;
        if (t) {
            cout << fw.sum(x, y) << "\n";
        } else {
            fw.add(x, y);
        }
    }

}

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

#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <atcoder/all>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pii pair<int,int>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define endl '\n'
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,x) distance(c.begin(),lower_bound(all(c),x))
#define ub(c,x) distance(c.begin(),upper_bound(all(c),x))

using namespace std;

using namespace atcoder;

int main(){
    int n,q;
    cin >> n >> q;
    fenwick_tree<int> fen=fenwick_tree(n);
    rep(i,n){
        ll x;
        cin >> x;
        fen.add(i,x);
    }
    rep(i,q){
        ll tp;
        cin >> tp;
        if(tp==0){
            ll p,x;
            cin >> p >> x;
            fen.add(p,x);
        }
        else{
            ll l,r;
            cin >> l >> r;
            cout << fen.sum(l,r) << endl;
        }
    }
    return 0;
}

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

#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <atcoder/all>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pii pair<int,int>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define endl '\n'
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,x) distance(c.begin(),lower_bound(all(c),x))
#define ub(c,x) distance(c.begin(),upper_bound(all(c),x))

using namespace std;

using namespace atcoder;

int main(){
    int n,q;
    cin >> n >> q;
    fenwick_tree<ll> fen=fenwick_tree(n);
    rep(i,n){
        ll x;
        cin >> x;
        fen.add(i,x);
    }
    rep(i,q){
        ll tp;
        cin >> tp;
        if(tp==0){
            ll p,x;
            cin >> p >> x;
            fen.add(p,x);
        }
        else{
            ll l,r;
            cin >> l >> r;
            cout << fen.sum(l,r) << endl;
        }
    }
    return 0;
}

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

#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <atcoder/all>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pii pair<int,int>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define endl '\n'
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,x) distance(c.begin(),lower_bound(all(c),x))
#define ub(c,x) distance(c.begin(),upper_bound(all(c),x))

using namespace std;

using namespace atcoder;

int main(){
    ll n,q;
    cin >> n >> q;
    fenwick_tree<ll> fen=fenwick_tree(n);
    rep(i,n){
        ll x;
        cin >> x;
        fen.add(i,x);
    }
    rep(i,q){
        ll tp;
        cin >> tp;
        if(tp==0){
            ll p,x;
            cin >> p >> x;
            fen.add(p,x);
        }
        else{
            ll l,r;
            cin >> l >> r;
            cout << fen.sum(l,r) << endl;
        }
    }
    return 0;
}

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

#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <atcoder/all>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pii pair<int,int>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define endl '\n'
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,x) distance(c.begin(),lower_bound(all(c),x))
#define ub(c,x) distance(c.begin(),upper_bound(all(c),x))

using namespace std;

using namespace atcoder;

int main(){
    ll n,q;
    cin >> n >> q;
    fenwick_tree fen=fenwick_tree(n);
    rep(i,n){
        ll x;
        cin >> x;
        fen.add(i,x);
    }
    rep(i,q){
        ll tp;
        cin >> tp;
        if(tp==0){
            ll p,x;
            cin >> p >> x;
            fen.add(p,x);
        }
        else{
            ll l,r;
            cin >> l >> r;
            cout << fen.sum(l,r) << endl;
        }
    }
    return 0;
}

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

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

#define fi first
#define se second
#define m_p make_pair
#define p_b push_back
#define e_b emplace_back
#define all(x) (x).begin(),(x).end()
#define uniq(x) ((x).erase(unique(all(x)),(x).end()))
#define sz(x) ((int)(x).size())

#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#define rep(i,n) REP(i,0,n)

#ifdef LOCAL//compile with -DLOCAL
#define debug(x) cerr<<"LINE"<<__LINE__<<" : "<<#x<<" = "<<(x)<<endl
#define debug_vec(x) cerr<<"LINE"<<__LINE__<<" : "<<#x<<" = ";\
  rep(i,sz(x)){cerr<<x[i]<<" ";}cerr<<endl
#define debug_mat(x) cerr<<"LINE"<<__LINE__<<" : "<<#x<<" = "<<endl;\
  rep(i,sz(x)){rep(j,sz(x[i])){cerr<<x[i][j]<<" ";}cerr<<endl;}cerr<<endl
#else
#define debug(x) void(0)
#define debug_vec(x) void(0)
#define debug_mat(x) void(0)
#endif

template<class T> bool chmax(T &a,T b){if(a<b){a=b;return true;}return false;}
template<class T> bool chmin(T &a,T b){if(a>b){a=b;return true;}return false;}


int main(){
  ios_base::sync_with_stdio(false);cin.tie(0);
  int N,Q;
  cin >> N >> Q;
  fenwick_tree<ll> fw(N);
  rep(i,N){
    int a;
    cin >> a;
    fw.add(i,a);
  }
  rep(_,Q){
    int q;
    cin >> q;
    if(q==0){
      int p,x;
      cin >> p >> x;
      fw.add(p,x);
    }
    else if(q==1){
      int l,r;
      cin >> l >> r;
      cout << fw.sum(l,r) << endl;
    }
  }

  return 0;
}

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

#include <bits/stdc++.h>
#include <atcoder/fenwicktree>
using namespace std;
using namespace atcoder;
typedef long long ll;
const double pi=3.141592653589793;
typedef unsigned long long ull;
typedef long double ldouble;
const ll INF=1e18;
#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
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; }

//　ローカルでの実行方法は g++ main.cpp -std=c++14 -I .

int main(){
    int n, q;
    cin >> n >> q;

    fenwick_tree<ll> fw(n);
    rep(i, n) {
        int a;
        cin >> a;
        fw.add(i, a);
    }

    rep(i, q) {
        int t, a, b;
        cin >> t >> a >> b;
        if(t == 0) {
            fw.add(a, b);
        }
        else {
            cout << fw.sum(a, b) << endl;
        }
    }
}


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

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

int main(){
  int n, q;
  cin >> n >> q;
  fenwick_tree<ll> fw(n);
  rep(i,n) {
    ll a;
    cin >> a;
    fw.add(i,a);
  }
  rep(i,q) {
    int t, x, y;
    cin >> t >> x >> y;
    if(t == 0) fw.add(x,y);
    else cout << fw.sum(l,r) << endl;
  } 
  return 0; 
}

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

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

int main(){
  int n, q;
  cin >> n >> q;
  fenwick_tree<ll> fw(n);
  rep(i,n) {
    ll a;
    cin >> a;
    fw.add(i,a);
  }
  rep(i,q) {
    int t, x, y;
    cin >> t >> x >> y;
    if(t == 0) fw.add(x,y);
    else cout << fw.sum(l,r) << endl;
  } 
  return 0; 
}

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

#include <bits/stdc++.h>
#include <atcoder/fenwicktree>
using namespace std;
#ifdef __DEBUG__
    void debug_out() { cerr << endl; } 
    template <typename Head, typename... Tail>
    void debug_out(Head H, Tail... T) {cerr << " " << H; debug_out(T...);}
    #define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
    #define debug(...) 
#endif

using ll = long long int;
using ull = unsigned long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

int dx[]={1, 0, -1, 0, 1,-1, 1,-1};
int dy[]={0, 1, 0, -1, 1, 1,-1,-1};
const int INT_INF = (int)(2e9);
const ll  LL_INF = (ll)(2e18);

inline void fast_io() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); };
template<typename T, typename S> inline ostream& operator<<(ostream& os, const pair<T, S> p) { cout << "[" << p.first << ";" << p.second << "]"; return os; }
template<typename T, typename S> inline ostream& operator<<(ostream& os, const map<T, S> p) { for (auto el : p) cout << "[" << el.first << ";" << el.second << "]"; return os; }
template<typename T> inline ostream& operator<<(ostream& os, const vector<T>& v) { for (auto el : v) cout << el << " "; return os; }
template<typename T> inline ostream& operator<<(ostream& os, const deque<T>& v) { for (auto el : v) cout << el << " "; return os; }
template<typename T> inline ostream& operator<<(ostream& os, const set<T>& v) { for (auto el : v) cout << el << " "; return os; }
template<typename T> inline vector<T> fetch_vec(int sz) { vector<T> ret(sz); for (auto& elem : ret) cin >> elem; return ret; }

int N,Q;
vector<int> A;
inline void input(){
    fast_io();
    cin >> N >> Q;
    A = fetch_vec<int>(N);
}

inline int solve(){
    atcoder::fenwick_tree<int> ft(N);
    for (int i = 0; i < N; i++)
    {
        ft.add(i,A[i]);
    }
    
    for (int i = 0; i < Q; i++)
    {
        int t,a,b;
        cin >> t >> a >> b;
        if(t==0){
            ft.add(a,b);
        }
        else{
            cout << ft.sum(a,b) << "\n";
        }
    }
    
    return 0;
}   

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


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

#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
using pll = pair<long long,long long>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e17;
constexpr int MOD = 1000000007;
constexpr double PI = 3.14159265358979323846;

#include <atcoder/all>
using namespace atcoder;

int main(){
    int n,q;
    cin >> n >> q;
    fenwick_tree<ll> ft(n);
    rep(i,n){
        int a;
        cin >> a;
        ft.add(i,a);
    }

    while(q--){
        int t;
        cin >> t;
        if(t==0){
            int p,x;
            cin >> p >> x;
            ft.add(p,x);
        }else{
            int l,r;
            cin >> l >> r;
            cout << ft.sum(l,r) << endl;
        }
    }
}

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

#include<bits/stdc++.h>
#include"atcoder/all"
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
using namespace atcoder;
typedef long long ll;
int main(){
  ll N,Q,i,a,t,l,r;scanf("%lld%lld",&N,&Q);
  fenwick_tree<ll> B(N);
  for(i=0;i<N;i++){
    scanf("%lld",&a);
    B.add(i,a);
  }
  for(i=0;i<Q;i++){
    scanf("%lld%lld%lld",&t,&l,&r);
    if(t == 0) B.add(l,r);
    else printf("%lld\n",B.sum(l,r));
  }
}

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

#include <bits/stdc++.h>
#define endl "\n"
using namespace std;
#define ll long long
#define ld long double
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define repo(i,n) for(int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
#define uniq(v) v.erase(unique(v.begin(),v.end()),v.end())
#define lb(v,x) (lower_bound(v.begin(),v.end(),x)-v.begin())
#define ub(v,x) (upper_bound(v.begin(),v.end(),x)-v.begin())
using Pair = pair<ll,pair<int,int>>;
#define pq priority_queue<Pair, vector<Pair>, greater<Pair>> 
const ll mod=1000000007;
//const ll mod=998244353;
const ld pi=acos(-1.0);
const ll INF = 1LL<<61;
template<class T>bool chmax(T &a, const T &b) { 
  if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) {
  if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
//intの最大値2147483647 ≒ 2×10^9
//long longの最大値9223372036854775807 ≒ 9×10^18
//'大文字'+=32;    で小文字に
//  cout << fixed << setprecision (20);   小数点以下2０桁まで
//実行時間制約2秒では２×10^8回くらいまで計算できる

#include <atcoder/all> 
using namespace atcoder;

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

  int n,q;
  cin>>n>>q;

  fenwick_tree<ll> f(n);

  rep(i,n){
    ll x;
    cin>>x;
    f.add(i,x);
  }

  rep(i,q){
    int a,b,c;
    cin>>a>>b>>c;
    if(a==0) f.add(b,c);
    else cout << f.sum(b,c) << endl;
  }

}


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

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

using namespace std;
using namespace atcoder;

typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef pair<ll,ll> P;
typedef string str;
typedef vector<P> vp;
typedef vector<string> vs;
typedef vector<bool> vb;

const ll mod=1e9+7;
const ll inf=1e18;

#define rep(i,m,n) for(ll i=m;i<n;i++)
#define repr(i,m,n) for(ll i=m-1;i>=n;i--)
#define fi first
#define se second
#define chmax(x,y) x=max(x,y)
#define chmin(x,y) x=min(x,y)
#define eb(x) emplace_back(x)
#define pb(x) pop_back(x)
#define all(x) x.begin(),x.end()
#define allr(x) x.rbegin(),x.rend()
#define pc(x) __builtin_popcount(x)
#define gll greater<ll>()

void solve(){
  ll n,q;
  cin >> n >> q;

  fenwick_tree<ll> fw(n);
  
  rep(i,0,n){
   ll a;
    cin >> a;
    fw.add(i,a);
  }
  
  while(q--){
   ll c,x,y;
    cin >> c >> x >> y;
    if(c){
      cout << fw.sum(x,y) << endl;
    }else{
     fw.add(x,y);
    }
  }
  
 
 
}
int main(){
   cin.tie(nullptr);
  ios::sync_with_stdio(false);
  solve();
}

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

#include <iostream>
#include <cstdio>
#include <atcoder/fenwicktree>
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rep2(i,s,t) for(int i = s; i <= t; ++i)
#define rev(i,n) for(int i = n-1; i >= 0; --i)
#define rev1(i,n) for(int i = n; i > 0; --i)
#define rev2(i,s,t) for(int i = s; i >= t; --i)
#define F first
#define S second
using namespace std;
using namespace atcoder;
int main()
{
  int n,q; scanf("%d %d", &n, &q);

  fenwick_tree<ll> fw(n);
  rep(i,n) {
    ll a; scanf("%lld", &a);
    fw.add(i, a);
  }

  rep(i,q) {
    int t; scanf("%d", &t);
    if(t == 0) {
      ll p, x; scanf("%lld %lld", &p, &x);
      fw.add(p, x);
    }
    else {
      int l, r; cin >> l >> r;
      printf("%lld\n", fw.sum(l, r));
    }
  }
  return 0;
}


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

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

using namespace std;
using ll = long long;

ll op(ll a, ll b) {return a + b;}
ll e(){return 0LL;}

int main()
{
	int N, Q; cin >> N >> Q;
	vector<ll> A(N);
	for(int i = 0; i < N; i++) cin >> A[i];
	atcoder::segtree<ll, op, e> tree(A);

	while(Q--) {
		int t, l, r; cin >> t >> l >> r;
		if(t == 0) {
			tree.set(l, r);
		} else {
			cout << tree.prod(l, r) << endl;
		}
	}
}

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

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

using namespace std;
using ll = long long;

ll op(ll a, ll b) {return a + b;}
ll e(){return 0LL;}

int main()
{
	int N, Q; cin >> N >> Q;
	vector<ll> A(N);
	for(int i = 0; i < N; i++) cin >> A[i];
	atcoder::segtree<ll, op, e> tree(A);

	while(Q--) {
		int t, l, r; cin >> t >> l >> r;
		if(t == 0) {
			tree.set(l, r);
		} else {
			cout << tree.prod(l, r) << endl;
		}
	}
}

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

#include <atcoder/fenwicktree>
#include <iostream>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;

int main()
{
    int n, q;
    cin >> n >> q;
    fenwick_tree<ll> bit(n);
    for(int i = 0; i < n; i++){
        ll a;
        cin >> a;
        bit.add(i, a);
    }
    while(q--){
        int t;
        cin >> t;
        if(t){
            int l, r;
            cin >> l >> r;
            cout << bit.sum(l, r) << endl;;
        }
        else{
            int p;
            ll x;
            cin >> p >> x;
            bit.add(p, x);
        }
    }
}


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

#include <atcoder/fenwicktree>
#include <cstdio>

using namespace std;
using namespace atcoder;

int main() {
    int n, q;
    scanf("%d %d", &n, &q);

    fenwick_tree<long long> fw(n);
    for (int i = 0; i < n; i++) {
        int a;
        scanf("%d", &a);
        fw.add(i, a);
    }

    for (int i = 0; i < q; i++) {
        int t;
        scanf("%d", &t);
        if (t == 0) {
            int p, x;
            scanf("%d %d", &p, &x);
            fw.add(p, x);
        } else {
            int l, r;
            scanf("%d %d", &l, &r);
            printf("%lld\n", fw.sum(l, r));
        }
    }
}

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

#include <atcoder/segtree>
#include <iostream>
#include <vector>
#include <cstdint>
#include <functional>

using i64 = std::int64_t;

int main() {
	int n, q;
	std::cin >> n >> q;
	
	std::vector<i64> a(n);
	for (int i = 0; i < n; i++) {
		std::cin >> a[i];
	}
	
	std::function<i64(i64, i64)> op = [] (i64 a, i64 b) { return a + b; };
	std::function<i64()> e = [] () { return 0; };
	atcoder::segtree<i64, +op, +e> seg(a);
	
	for (int _ = 0; _ < q; _++) {
		int type;
		std::cin >> type;
		if (type == 0) {
			int p;
			i64 x;
			std::cin >> p >> x;
			seg.set(p, seg.get(p) + x);
		} else {
			int l, r;
			std::cin >> l >> r;
			std::cout << seg.prod(l, r) << '\n';
		}
	}
	
	return 0;
}

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

#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
typedef long long ll;
#define rep(i,N) for(int i=0;i<int(N);++i)
#define rep1(i,N) for(int i=1;i<int(N);++i)
#define all(a) (a).begin(),(a).end()
#define bit(k) (1LL<<(k))
#define SUM(v) accumulate(all(v), 0LL)

typedef pair<int, int> i_i;
typedef pair<ll, ll> l_l;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;
struct fast_ios{ fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; }fast_ios_;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }

#define TOSTRING(x) string(#x)
template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (T &x : vec) is >> x; return is; }
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) { os  << "["; for(auto _: v) os << _ << ", "; os << "]"; return os; };
template <typename T> ostream &operator<<(ostream &os, set<T> &st) { os << "("; for(auto _: st) { os << _ << ", "; } os << ")";return os;}
template <typename T, typename U> ostream &operator<<(ostream &os, const pair< T, U >& p){os << "{" <<p.first << ", " << p.second << "}";return os; }
template <typename T, typename U> ostream &operator<<(ostream &os, const map<T, U> &mp){ os << "["; for(auto _: mp){ os << _ << ", "; } os << "]" << endl; return os; }

#define DUMPOUT cerr
void dump_func(){ DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head &&head, Tail &&... tail) { DUMPOUT << head; if (sizeof...(Tail) > 0) { DUMPOUT << ", "; } dump_func(std::move(tail)...); }

#ifdef DEBUG
#define dbg(...) dump_func(__VA_ARGS__)
#define dump(...) DUMPOUT << string(#__VA_ARGS__) << ": "; dump_func(__VA_ARGS__)
#else
#define dbg(...)
#define dump(...)
#endif

const int INF = (ll)1e9;
const ll INFLL = (ll)1e18+1;
const ll MOD = 1000000007;
// const ll MOD = 998244353;
const long double PI = acos(-1.0);

/*
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const string dir = "DRUL";
*/


int main() {
    int N, Q;
    cin >> N >> Q;
    atcoder::fenwick_tree<ll> Tree(N);
    rep(i,N){
        ll a;
        cin >> a;
        Tree.add(i, a);
    }
    while(Q--){
        int type;
        cin >> type;
        if(type == 0){
            int idx;
            ll x;
            cin >> idx >> x;
            Tree.add(idx, x);
        }
        else{
            int l, r;
            cin >> l >> r;
            cout << Tree.sum(l, r) << endl;
        }
    }
}


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

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

int main()
{
  int n,q;
  cin>>n>>q ;
  fenwick_tree f(n);
  for(int i=0 ; i<n ; ++i)
  {
    int el;
    cin>>el;
    f.add(i,el);
  }


  for(int i=0 ; i<q ; ++i)
  {
    int t,u,x ;
    cin>>t>>u>>x ;
    if(t==0)
      f.add(u,x);
    else
      cout<<f.sum(u,x)<<"\n";
  }
  
  return 0;
}


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

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

int main()
{
  int n,q;
  cin>>n>>q ;
  vector<int> ar(n);
  for(int i=0 ; i<n ; ++i)
  {
    int el;
    cin>>el;
    ar.push_back(el);
  }

  fenwick_tree f(n,ar);
  for(int i=0 ; i<q ; ++i)
  {
    int t,u,x ;
    cin>>t>>u>>x ;
    if(t==0)
      f.add(u,x);
    else
      cout<<f.sum(u,x-1)<<"\n";
  }
  
  return 0;
}


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

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

int main()
{
  int n,q;
  cin>>n>>q ;
  int ar[n];
  for(int i=0 ; i<n ; ++i)
    cin>>ar[i];

  fenwick_tree f(n,ar);
  for(int i=0 ; i<q ; ++i)
  {
    int t,u,x ;
    cin>>t>>u>>x ;
    if(t==0)
      f.add(u,x);
    else
      cout<<f.sum(u,x-1)<<"\n";
  }
  
  return 0;
}


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

#import<iostream>
#import<atcoder/all>
long N,Q,i,a;main(){std::cin>>N>>Q;atcoder::fenwick_tree<long>b(N);for(;i++<N;b.add(i-1,a))std::cin>>a;for(;std::cin>>i>>a>>N;Q--)i&&std::cout<<b.sum(a,N)<<'\n'||b.add(a,N);}}

Compiler output:
a.cc:1:2: warning: #import is a deprecated GCC extension [-Wdeprecated]
    1 | #import<iostream>
      |  ^~~~~~
a.cc:2:2: warning: #import is a deprecated GCC extension [-Wdeprecated]
    2 | #import<atcoder/all>
      |  ^~~~~~
a.cc:2:8: fatal error: atcoder/all: No such file or directory
    2 | #import<atcoder/all>
      |        ^~~~~~~~~~~~~
compilation terminated.
Language: C++

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
 
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vvvi = vector<vector<vector<int>>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vvvl = vector<vector<vector<ll>>>;
using vs = vector<string>;
using vb = vector<bool>;
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define FORR(i, m, n) for (int i = (m); i >= (n); i--)
#define REP(i, n) FOR(i, 0, (n))
#define REPR(i, n) FORR(i, (n) - 1, 0)
#define REP1(i, n) FOR(i, 1, (n) + 1)
#define REPS(c, s) for (char c : s)
#define ALL(c) (c).begin(), (c).end()
#define SORT(c) sort(ALL(c))
#define REV(c) reverse(ALL(c))
#define sz(v) (int)v.size()
#define endl '\n'
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
template<class T> inline void prn(vector<T>& v) {int n = sz(v); REP(i, n) cout << v[i] << ' ';}
template<class T> inline void printv(vector<T>& v) {int n = sz(v); REP(i, n) cout << v[i] << (i == n - 1 ? endl : ' ');}
template<class T> inline void printvv(vector<vector<T>>& v) {for (auto u : v) printv(u);}
template<class T> inline void printlnv(vector<T>& v) {int n = sz(v); REP(i, n) cout << v[i] << endl;}
const int MOD = 1000000007;
const int INF = 1000000001;
const ll LINF = 1000000001000000001LL;
 
void solve();
 
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(numeric_limits<double>::max_digits10);
    solve();
    return 0;
}

void solve() {
    int n, q;
    cin >> n >> q;
    fenwick_tree<ll> bit(n);
    REP(i, n) {
        ll a;
        cin >> a;
        bit.add(i, a);
    }
    REP(i, q) {
        int t;
        ll u, v;
        cin >> t >> u >> v;
        if (t == 0) bit.add(u, v);
        else cout << bit.sum(u, v) << endl;
    }
}


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

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <queue>
#include <bitset>
#include <stack>
#include <functional>

// AtCoder
#include <atcoder/all>
using namespace atcoder;

#ifdef LOCAL
    #define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
    #define eprintf(...)
#endif

#define rep_(i, a_, b_, a, b, ...) for (int i = (a), i##_len = (b); i < i##_len; ++i)
#define rep(i, ...) rep_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define reprev_(i, a_, b_, a, b, ...) for (int i = (b-1), i##_min = (a); i >= i##_min; --i)
#define reprev(i, ...) reprev_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define all(x) (x).begin(), (x).end()
template <class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }
template <class T> bool chmin(T &a, const T &b) { if (b < a) { a = b; return 1; } return 0; }
#define fls(x) (64 - __builtin_clzll(x))
#define pcnt(x) __builtin_popcountll(x)
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair <int,int> P;
typedef long double ld;

int main (void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll n, q; cin >> n >> q;
    fenwick_tree<ll> f(n);
    rep (i, n) {
        ll a; cin >> a; f.add(i, a);
    }
    rep (_, q) {
        int c, a, b; cin >> c >> a >> b;
        if (c == 0) f.add(a, b);
        else cout << f.sum(a, b) << "\n";
    }
    return 0;
}

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

#import<iostream>
#import<atcoder/all>
using namespace std;long N,Q,i,a;main(){cin>>N>>Q;atcoder::fenwick_tree<long>b(N);for(;i++<N;b.add(i-1,a))cin>>a;for(;cin>>i>>a>>N;Q--)i>0?cout<<b.sum(a,N)<<endl:b.add(a,N);}

Compiler output:
a.cc:1:2: warning: #import is a deprecated GCC extension [-Wdeprecated]
    1 | #import<iostream>
      |  ^~~~~~
a.cc:2:2: warning: #import is a deprecated GCC extension [-Wdeprecated]
    2 | #import<atcoder/all>
      |  ^~~~~~
a.cc:2:8: fatal error: atcoder/all: No such file or directory
    2 | #import<atcoder/all>
      |        ^~~~~~~~~~~~~
compilation terminated.
Language: C++

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define ll long long
#define ld long double
#define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define rrep(i,n) RREP(i,(n)-1,0)
#define all(v) v.begin(), v.end()
#define endk '\n'
const int inf = 1e9+7;
const ll longinf = 1LL<<60;
const ll mod = 1e9+7;
const ld eps = 1e-10;
template<typename T1, typename T2> inline void chmin(T1 &a, T2 b){if(a>b) a=b;}
template<typename T1, typename T2> inline void chmax(T1 &a, T2 b){if(a<b) a=b;}

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  int n, q; cin >> n >> q;
  vector<ll> A(n);
  fenwick_tree<ll> bit(n);
  rep(i, n) {
    cin >> A[i];
    bit.add(i, A[i]);
  }
  rep(_, q) {
    int t; cin >> t;
    if(t == 0) {
      int p; ll x; cin >> p >> x;
      bit.add(p, x);
    } else {
      int l, r; cin >> l >> r;
      cout << bit.sum(l, r) << endk;
    }
  }
  return 0;
}


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

#import<iostream>
#import<atcoder/all>
using namespace std;long N,Q,i,a;int main(){cin>>N>>Q;atcoder::fenwick_tree<long>b(N);for(;i<N;i++)cin>>a,b.add(i,a);while(Q--)cin>>i>>a>>N,i>0&&cout<<b.sum(a,N)<<endl,if(i<1)b.add(a,N);}

Compiler output:
a.cc:1:2: warning: #import is a deprecated GCC extension [-Wdeprecated]
    1 | #import<iostream>
      |  ^~~~~~
a.cc:2:2: warning: #import is a deprecated GCC extension [-Wdeprecated]
    2 | #import<atcoder/all>
      |  ^~~~~~
a.cc:2:8: fatal error: atcoder/all: No such file or directory
    2 | #import<atcoder/all>
      |        ^~~~~~~~~~~~~
compilation terminated.
Language: C++

#import<iostream>
#import<atcoder/all>
using namespace std;long N,Q,i,a;int main(){cin>>N>>Q;atcoder::fenwick_tree<long>b(N);for(;i<N;i++)cin>>a,b.add(i,a);while(Q--)cin>>i>>a>>N,i>0&&cout<<b.sum(a,N)<<endl,i<1&&b.add(a,N);}

Compiler output:
a.cc:1:2: warning: #import is a deprecated GCC extension [-Wdeprecated]
    1 | #import<iostream>
      |  ^~~~~~
a.cc:2:2: warning: #import is a deprecated GCC extension [-Wdeprecated]
    2 | #import<atcoder/all>
      |  ^~~~~~
a.cc:2:8: fatal error: atcoder/all: No such file or directory
    2 | #import<atcoder/all>
      |        ^~~~~~~~~~~~~
compilation terminated.
Language: C++

#import <iostream>
#import <atcoder/all>
using namespace std;long N,Q,i,a;int main(){cin>>N>>Q;atcoder::fenwick_tree<long> b(N);for(;i<N;i++)cin>>a,b.add(i,a);}while(Q--){cin>>i>>a>>N;if(i)cout<<b.sum(a,N)<<endl;else b.add(a,N);}}

Compiler output:
a.cc:1:2: warning: #import is a deprecated GCC extension [-Wdeprecated]
    1 | #import <iostream>
      |  ^~~~~~
a.cc:2:2: warning: #import is a deprecated GCC extension [-Wdeprecated]
    2 | #import <atcoder/all>
      |  ^~~~~~
a.cc:2:9: fatal error: atcoder/all: No such file or directory
    2 | #import <atcoder/all>
      |         ^~~~~~~~~~~~~
compilation terminated.
Language: C++


/**
 * Dont raise your voice, improve your argument.
 * --Desmond Tutu
 */

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

const bool ready = [](){
    ios_base::sync_with_stdio(false); cin.tie(0);
    cout << fixed << setprecision(12);
    return true;
}();

const double PI = acos(-1);
using ll= long long;
//#define int ll
#define all(v) (v).begin(), (v).end()
#define fori(n) for(int i=0; i<int(n); i++)

#define cini(i) int i; cin>>i;
#define cins(s) string s; cin>>s;
#define cind(d) double d; cin>>d;
#define cinai(a,n) vi a(n); fori(n) { cin>>a[i]; }
#define cinas(s,n) vs s(n); fori(n) { cin>>s[i]; }
#define cinad(a,n) vd a(n); fori(n) { cin>>a[i]; }

using pii= pair<int, int>;
using pdd= pair<double, double>;
using vd= vector<double>;
using vb= vector<bool>;
using vi= vector<int>;
using vvi= vector<vi>;
using vs= vector<string>;

#define endl "\n"


/** stolen from tourist, Problem D, https://codeforces.com/contest/1208/standings/page/1 */
template <typename T>
struct fenwick {
    vector<T> fenw;
    int n;

    fenwick(int _n) : n(_n) {
        fenw.resize(n);
    }

    /* update add */
    void update(int x, T v) {
        while (x < n) {
            fenw[x] += v;
            x |= (x + 1);
        }
    }

    /* get sum of range (0,x), including x */
    T query(int x) {
        T v{};
        while (x >= 0) {
            v += fenw[x];
            x = (x & (x + 1)) - 1;
        }
        return v;
    }
};

void solve() {
    cini(n);
    cini(q);
    
    fenwick<ll> fen(n);
    for(int i=0; i<n; i++) {
        cini(a);
        fen.update(i,a);
    }

    for(int i=0; i<q; i++) {
        cini(t);
        if(t==0) {
            ll p,x;
            cin>>p>>x;
            fen.update(p,x);
        } else {
            ll l,r;
            cin>>l>>r;
            cout<<fen.query(l,r)<<endl;
        }
    }
}

signed main() {
    solve();
}

// FIRST THINK, THEN CODE
// DO NOT JUMP BETWEEN PROBLEMS


Compiler output:
a.cc: In function 'void solve()':
a.cc:88:28: error: no matching function for call to 'fenwick<long long int>::query(ll&, ll&)'
   88 |             cout<<fen.query(l,r)<<endl;
      |                   ~~~~~~~~~^~~~~
a.cc:59:7: note: candidate: 'T fenwick<T>::query(int) [with T = long long int]'
   59 |     T query(int x) {
      |       ^~~~~
a.cc:59:7: note:   candidate expects 1 argument, 2 provided