hehê

include<bits/stdc++.h>

using namespace std;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long n,a[1000001],f[1000001],k,i,cnt=0;
cin>>n>>k;
f[0]=0;
for(i=1;i<=n;i++){
cin>>a[i];
f[i]=f[i-1]+a[i];
}
for(i=1;i<=n;i++){
for(long long j=i;j<=n;j++){
if(f[j]-f[i]==k){
cnt++;
}
}
}
cout<<cnt;
return 0;
}

include <bits/stdc++.h>

using namespace std;
long long n;
int main()
{
cin >>n;
if (n%2==0)
{
cout <<n/2(-1);
}
if (n%2!=0)
{
cout <<(n-1)/2(-1)+n%10;
}
return 0;
}

hihihi

include<bits/stdc++.h>

define maxn 10005

define ll long long

define vec vector

define pb push_back

define str string

define fi first

define se second

using namespace std;

int n,a[maxn],sum;
bool f[101][100000];
vec<int> result;

void nhap(){
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i]; sum+=a[i];
}
for(int i=0;i<=n;i++) f[i][0]= true;
}

void xuly(){
for(int i=1;i<=n;i++){
for(int j=1;j<=sum;j++){
f[i][j]=f[i-1][j];
if(f[i][j]==false&&j>=a[i]){
f[i][j]=f[i-1][j-a[i]];
}
}
}
for(int j=1;j<=sum;j++){
if (f[n][j]) result.pb(j);
}
cout<<result.size()<<endl;
for(auto x:result) cout<<x<<" ";
}

int main(){
// freopen("tester.inp","r",stdin);
// freopen("tester.out","w",stdout);
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
nhap();
xuly();
}

I am pro
The day I created this account was the day I reached the top 4500 =v

include <iostream>

include <math.h>

include <algorithm>

include <climits>

include <queue>

include <vector>

include <stack>

include <string>

include <iomanip>

include <tuple>

include <set>

include <map>

using namespace std;

define int long long

const int MAXN = 300005;
int a[MAXN];
int s;
int n;

void solve(){
cin >> n >> s;
for(int i = 1 ; i <= n ;i++){
cin >> a[i];
}
int i = 1;
int j = n ;
while(i <= j){
if(a[i] + a[j] < s){
i++;
}else if(a[i] + a[j] > s){
j--;
}else if(a[i]+a[j] == s){
cout << i << " " << j << endl;
return;
}
}
cout << "No solution" << endl;
return;

}

signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int t=1;
// cin >> t;
while(t--){
solve();
}
return 0;
}