You prolly dont care at all but does anyone know a tool to log back into an instagram account? I somehow lost the login password. I love any tips you can give me.
A) n,t=map(int,input().split()) a=[int(x) for x in input().split()] a=[0]+a d={} for i in range(1,n): d[i]=i+a[i] x=1 while(True): if(d[x]==t): print("YES") break else: if(d[x] not in d): print("NO") break x=d[x]
"G" problem with that VIRTUAL NODE optimisation is absolute BEAUTY! at least for me !! I didn't see that kinda trick before !!
This is the best channel where you can learn a concept and then quickly app,y on a problem. It reminded me of my programming teacher.
OMG u didn't eat anything fr six hours and were teaching and solving problems? Amazing dedication bro!!
Best Graph Tutorial I've seen till date :)
more graphs(shortest paths, msts) next week
Hey thanks for this stream. I am really enjoying these Topic streams.
@@shashanksingh4708 what?
@@erenyeager4452 nevermind
Ayy Eren, didnt think I'd ever see you after the rumbling.
Best stream every Golin, Loved it!
Please arrange other streams as you scheduled this stream.
Thanks a lot!
You prolly dont care at all but does anyone know a tool to log back into an instagram account?
I somehow lost the login password. I love any tips you can give me.
@Layton Rowan Instablaster ;)
@Maddux Troy it did the trick and I finally got access to my account again. I am so happy:D
Thanks so much, you saved my ass :D
@Layton Rowan glad I could help :)
"F" won my heart
3:13:27 is just mind blowing thanks
"G" problem virtual node trick was kinda intuitive for me
for the problem E i got TLE by submitting the same code as yours
How to join the organization you've put in the link below?
Very helpful 👍👍👍
Thank you so much for explanation 🙏
for problem B I am getting MLE using DFS approach. Let me know what to change.
submission link
Try passing the vectors through reference (if any) in the dfs calls or try to use .clear() rather than allocating new memory
A)
n,t=map(int,input().split())
a=[int(x) for x in input().split()]
a=[0]+a
d={}
for i in range(1,n):
d[i]=i+a[i]
x=1
while(True):
if(d[x]==t):
print("YES")
break
else:
if(d[x] not in d):
print("NO")
break
x=d[x]
hello sir. your streams are top notch . is it possible to do a greedy practise
Do you really use Discord in light mode?
can you please recommend some good lectures for this topic
Hello I have a question to u how can I approach?
Hello, can you add subtitles please ... =D
omg hi!
👀
why do you have 70 other lines of code when your solution is only 10 lines long?
its his default template
you should do a collab with errichto!
#include
using namespace std;
int main(){
int n{}; cin>>n; vector v;
for(int i{}; i>a;
v.push_back(a);
}
sort(v.begin(),v.end());
int sum1 = accumulate(v.begin(),v.end(),0);
int sum2{};
int ans{};
for(int i{n-1}; i>=0; i--){
sum2+=v[i]; sum1-=v[i];
ans++;
if(sum2>sum1){
break;
}
}
cout
#include
using namespace std;
int main(){
string a{},b{}; cin>>a>>b;
int n1 = a.size();
int n2 = b.size();
bool ans = true;
for(int i{0},j{n2-1}; i=0; i++,j--){
if(a[i]!=b[j]){
ans = false; break;
}
}
if(ans) cout
Can someone tell me what is c[v] in dp[v] = c[v] in problem H? I got the idea but am stuck on the implementation for a long time. Thanks in advance!
the audio quality is very poor and volume is low, not expected from a stream of such important topic
What in the world am I watching? Coding? ....what?
#include
using namespace std;
class DisjointSet{
public:
vector size,parent;
DisjointSet(int n){
size.resize(n+1,1);
parent.resize(n+1);
for(int i{}; i>m;
DisjointSet ds(n);
while(m--){
int k{}; cin>>k;
if(k==0 || k==1) continue;
vector vec;
while(k--){
int a{}; cin>>a; vec.push_back(a);
}
for(int i{1}; i