Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
ContainerVector
//g++ 7.4.0 //Container Vector //this code is created by Rezaul Hoque on September 22,2021;contact: jewelmrh@yahoo.com //note: codes shared by Rezaul Hoque on rextester are not for sale; they are created and shared to facilitate the algorithm learning process; many like Hoque use this platform to practice programming ;Rezaul hopes his contribution helps others to fine tune their learning; #include <iostream> #include <vector> using namespace std; int main() { vector<int> a,b; vector<char> c,d,e,f; c.assign(25,'<'); d.assign(25,'>'); e.push_back('\n'); e.push_back('V'); e.push_back('e'); e.push_back('c'); e.push_back('t'); e.push_back('o'); e.push_back('r'); e.emplace(e.begin()+7,'\n'); e.emplace(e.begin()+8,'S'); e.emplace(e.begin()+9,'e'); e.emplace(e.begin()+10,'p'); e.emplace(e.begin()+11,'t'); e.emplace(e.begin()+12,' '); a.push_back(2); a.push_back(2); f.assign(1,','); b.push_back(2); b.push_back(0); b.push_back(2); b.push_back(1); for(unsigned int l=0;l<c.size();l++){ cout<<c[l]; if(l%25==0) cout<<"\n";} for(unsigned int l=0;l<d.size();l++){ { cout<<d[l]; if(l%25==0) cout<<"\n";} } for(auto it=e.begin();it != e.end();it++) cout<<*it<<" "; for(unsigned int l=0;l<a.size();l++) cout<<a[l]; cout<<","; for(unsigned int l=0;l<b.size();l++) cout<<b[l]; cout<<"\n"; for(unsigned int l=0;l<c.size();l++){ cout<<c[l]; if(l%25==0) cout<<"\n";} for(unsigned int l=0;l<d.size();l++){ { cout<<d[l]; if(l%25==0) cout<<"\n";} } return 0; }
run
|
edit
|
history
|
help
0
stl_sizeof
156
Template arguments pack
Binary search2
remove dublicates from string using recursion
Pairs having sum equal to target
Hi
Operators
next permutation leetcode
typecasting