Gioi thieu cc

include <bits/stdc++.h>

// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")
using namespace std;

define int long long

define ii pair<int,int>

define iii pair<int,ii>

define vi vector<int>

define vii vector<ii>

define mii map<int,int>

define fi first

define se second

define pb push_back

define mp make_pair

define lb lower_bound

define ub upper_bound

define ep emplace_back

define endl "\n"

define MASK(i) (1LL << (i))

define c_bit(i) __builtin_popcountll(i)

define BIT(x,i) ((x) & MASK(i))

define SET_ON(x,i) ((x) | MASK(i))

define SET_OFF(x,i) ((x) & ~MASK(i))

define oo 1e18

define __lcm(a,b) (1ll * ((a) / __gcd((a), (b))) * (b))

define sz(A) (int) A.size()

define FOR(i,l,r) for (int i=l;i<=r;i++)

define FOD(i,r,l) for (int i=r;i>=l;i--)

define FORR(i,l,r,k) for (int i=l;i<=r;i+=k)

define FODD(i,l,r,k) for (int i=l;i<=r;i-=k)

define fillchar(a,x) memset(a, x, sizeof (a))

define faster ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);

define NAME "a"

signed main()
{
faster;
//freopen(NAME".inp", "r", stdin);
//freopen(NAME".out", "w", stdout);
return 0;
}

// _ ___ _ _ ____ _ _ _ ___ _ _ __ __ _ _
// | | / _ \ | \ | | / || | | | / \ |_ || | | |\ \ / /| | | |
// | | | | | || | || | _ | || | / _ \ | | | | | | \ \ /\ / / | | | |
// | | | || || |\ || || || _ | / ___ \ | | | || | \ V V / | || |
// |_____| _/ || _| _||| ||// _|__| _/ _/_/ _/

//

include<bits/stdc++.h>

using namespace std;

define faster ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

define ll long long

define pll pair<long long,long long>

define all(v) v.begin(),v.end()

define pb push_back

define pii pair<int,int>

define piii int,pair<int,int>

define bit(n,i) ((n>>i)&1)

define fi first

define sc second

define pdb pair<double,double>

define db double

define endl '\n'

const long long maxn=1e6+5;
const long long minn=-1e6;
const long long MOD=1e9+7;
const long long inf=1e18;
ll n,q,a[maxn],bit[maxn];
void update(int vt,int val){
while(vt<=n){
bit[vt]+=val;
vt+=(vt&-vt);
}
}
ll getsum(int vt){
ll ans=0;
while(vt){
ans+=bit[vt];
vt-=(vt&-vt);
}
return ans;
}
ll getsumdoan(int u,int v){
return getsum(v)-getsum(u-1);
}
void nhap(){
cin>>n>>q;
for(int i=1;i<=n;i++){
cin>>a[i];
update(i,a[i]);
}
}
void solve(){
for(int i=1;i<=q;i++){
int op;cin>>op;
if(op==1){
int vt,val;cin>>vt>>val;
update(vt,val);
}else{
int u,v;cin>>u>>v;
cout<<getsumdoan(u,v)<<endl;
}
}

}
int main(){
faster
nhap();
solve();

return 0;

}

include <bits/stdc++.h>

define int long long

using namespace std;
main()
{
string s;
cin>>s;
for(int i=s.size();i>=0;i--)
cout<<s[i];
}

n = int(input())
for k in range(1,n+1):
print(k, end =" ")

for n in range(1,6):
print(n, end = " ")

n=int(input())
for k in range(n+1):
print(k,end=" ")

study