//#pragma GCC optimize("O3,unroll-loops") //#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt") #include<bits/stdc++.h> #define ll long long #define F first #define S second #define pb push_back #define pf push_front #define ppb pop_back #define forik(x) ll i = 1; i <= x; i++ const int mod = 1e9 + 7; using namespace std; ll n, k, p[100001], q, a, l, r, m, s[100001], b, pr[100001]; ll gcd (ll a, ll b){ while (a > 0 && b > 0){ if (a >= b){ a %= b; } else{ b %= a; } } return a + b; } ll binpow(ll a, ll b){ a %= mod; if(b == 0){ return 1; } if(b % 2 == 1){ return binpow (a, b - 1) % mod * a; } if(b % 2 == 0){ ll t = binpow(a, b / 2) % mod; return t * t % mod; } } signed main (){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> k; for (int i = 1; i <= n; i++){ cin >> p[i]; pr[i] = pr[i - 1] + p[i]; } cin >> q; while (q--){ cin >> a; if (a == 1){ for (int y = 1; y <= k; y++){ cin >> s[y]; } b = s[1]; for (int y = 1; y < k; y++){ p[s[y]] = p[s[y + 1]]; } p[s[k]] = p[s[b]]; for (int i = 1; i <= n; i++){ pr[i] = pr[i - 1] + p[i]; } } else{ cin >> l >> r >> m; b = 0; for (int i = l; i <= r - m + 1; i++){ b += pr[i + m - 1] - pr[i - 1]; } cout << b << '\n'; } } }

Main.cpp: In function 'long long int binpow(long long int, long long int)':
Main.cpp:42:1: warning: control reaches end of non-void function [-Wreturn-type]
   42 | }
      | ^