Limit_breaker #Sabertooth

main.cpp main.cpp TO quickly type we can use #define in pair like this : #define pii pair< int , int > #define ppi pair<pii , int > #define ppp pair<pii , pii> #define ss second #define ff first CODE: #include <bits/stdc++.h> using namespace std ; #define ll long long #define pii pair< int , int > #define ppi pair<pii , int > #define ppp pair<pii , pii> #define ss second #define ff first int main() { pii p1 ; ppi p2 ; cin>>p1.ff>>p1.ss ; p2=ppi(p1 , p1.ss*p1.ff) ; cout<< "Entry: " <<p2.ff.ff<< " , " <<p2.ff.ss<<endl ; cout<< "Product: " <<p2.ss<<endl ; return 0 ; }

main.cpp main.cpp #include <bits/stdc++.h> using namespace std ; #define ll long long int main() { pair< int , int >px , py ; //created 2 pairs,px and py pair < int , int >p1( 23 , 42 ) ; //p1 pair is created initializing its value 2 23,42 pair< int , int >p2=pair< int , int >( 234 , 534 ) ; //can also initialize in this way px=p1 ; //assigned p1 value in px py.first=p2.first*px.second ; py.second=p2.second*px.first ; //use of pair.first/pair.second cout<< "py :( " <<py.first<< " , " <<py.second<< " ) \n " ; pair< pair< int , int > , pair< int , int > >p3 ; p3=pair<pair< int , int > , pair< int , int >>(px , py) ; cout<< "p3: ((" ; cout<<p3.first.first<< " , " <<p3.first.second<...

Vector ke parameter hishabe function e pass korle setar ekta copy create hoy..jeta time abong memory consuming tai:            void my_function(vector<int>v) na dia         void my_function(vector<int> &v) dewa bhalo v.size()  dia vector empty kina ta ber korar theke  v.empty()   use kora bhalo..karon sob empty vector size empty day na alltime vector copy nia: code: #include<bits/stdc++.h>                                             using namespace std;                                                #define ll long long                                     ...