Posts
 
Reputation
Joined
Last Seen
Strength to Increase Rep
+0
Strength to Decrease Rep
-0
0% Quality Score
Upvotes Received
0
Posts with Upvotes
0
Upvoting Members
0
Downvotes Received
1
Posts with Downvotes
1
Downvoting Members
1
1 Commented Post
0 Endorsements
~653 People Reached
Favorite Forums
Favorite Tags

4 Posted Topics

Member Avatar for aryansmit3754

could somebody tell wats wrong with this #define FOR(x,n)for(typeof(x);x<n;x++)

Member Avatar for mrnutty
0
240
Member Avatar for aryansmit3754

sorry if i posted in wrong forum.pls forgive me pls tell how to find bfs successor of a node in a tree(BST and binary tree)

Member Avatar for Nick Evan
0
87
Member Avatar for DonkeyKong92
Member Avatar for mrnutty

use a dp solution #include<iostream.h> #include<string.h> #include<vector.h> #include<iterator.h> int main() { vector<long long int>v1(101); vector<long long int>v2(101); int i=0; for(;i<101;i++) { if(i==0||i==1) v1[i]==1; else v1[i]=i; } v2[0]=v2[1]=1; i=2; for(;i<101;i++) { v2[i]=v2[i-1]*v1[i]; } cout<<"nter no for which u want factorial"; istream_iterator<long long int>is(cin); ostream_iterator<long long int>os(cout,"\n"); int a; a=*is; *os=v2[a]; cout<<"the …

Member Avatar for aryansmit3754
0
148

The End.