this day i wanna teach everyone segment tree↵
we can solve a problem [problem:A44↵
A] lets go↵
you can build this segment tree for sum↵
#include<bits//stdc++.h>↵
using namespace std;↵
string solve(string a,int n){ ↵
if(a=="dzmeruk"){↵
//this code for problem watermelon↵
if(n==88){return "i dont have any solve for this";}↵
if(n==2 or n%2)return "NO\n";↵
else return "YES\n";↵
}↵
}↵
struct segment{↵
int n;↵
void f(){↵
cin>>n;↵
cout<<solve("dzmeruk",n);↵
}↵
};↵
int main(){↵
↵
segment x;↵
x.f();↵
}↵
after 10 likes i can teach everyone how to solve this [problem:71a]
we can solve a problem [problem:
A] lets go↵
you can build this segment tree for sum↵
#include<bits//stdc++.h>↵
using namespace std;↵
string solve(string a,int n){ ↵
if(a=="dzmeruk"){↵
//this code for problem watermelon↵
if(n==88){return "i dont have any solve for this";}↵
if(n==2 or n%2)return "NO\n";↵
else return "YES\n";↵
}↵
}↵
struct segment{↵
int n;↵
void f(){↵
cin>>n;↵
cout<<solve("dzmeruk",n);↵
}↵
};↵
int main(){↵
↵
segment x;↵
x.f();↵
}↵
after 10 likes i can teach everyone how to solve this [problem:71a]
