Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- class A
- {
- private:
- static vector<size_t>v;
- static unordered_map<size_t,size_t>ht;
- static vector<unordered_map<size_t,size_t>> all;
- public:
- static void pus()
- {
- for(int i=0;i<10;i++)
- {
- v.push_back(i);
- ht[i]=i;
- all.push_back(unordered_map<size_t, size_t>());
- // cout<<"size = "<<all.size()<<endl;
- all.back()[i]++;;
- // cout<<all.back()[i]<<" here it is "<<endl;
- }
- }
- // static void call()
- // {
- // cout<<"entering call funcion\n";
- // for(int i=0;i<all.size();i++)
- // {
- // cout<<"\n";
- // for(auto it=all[i].begin();it!=all[i].end();it++)
- // {
- // cout<<"i = "<<i<<" "<<it->first<<" "<<it->second<<endl;
- // }
- // }
- // cout<<"en of call function"<<endl;
- // }
- static void pr()
- {
- // call();
- std::cout<<"SIZE OF V IS "<<v.size()<<endl;
- for(int i=0;i<v.size();i++)
- {
- cout<<v[i]<<" v[i] "<<endl;
- cout<<ht[i]<<"map"<<endl;
- cout<<all[i][i]<<"for "<<endl;
- }
- }
- };
- vector<size_t> A::v={};
- unordered_map<size_t,size_t> A::ht={};
- vector<unordered_map<size_t,size_t>> A::all={};
- int main()
- {
- for(int i=0;i<1;i++)
- {
- A::pus();
- A::pr();
- }
- std::cout<<"AFJSDFOSD "<<"\n";
- // The old values are still there,
- A::pus();
- A::pr();
- }
Add Comment
Please, Sign In to add comment