Good1, C++ (gcc) - rextester

Language: Layout:

//Title of this code

#include <iostream>
#include <list>
#include <memory>
using namespace std;

struct Node {
        int x;
        
        Node(int x) {
            this->x = int(x);
        }

Node(const Node& n) {
            *this = Node(n);
        }

};

typedef shared_ptr<Node> node_ptr;

void print(list<node_ptr> l) {
    
    for (auto it = l.begin(); it != l.end(); ++it)
        cout << (*it)->x << " ";
    cout << endl;
    
}

template <class T1, class T2>
class Prb {
public:

list<node_ptr> nodes;
    
    Prb& operator=(const Prb& p){
        
        this->nodes = p.nodes;
        
        
    }
    
};

int main()
{
    list<node_ptr> a,b;
    
    
    a.push_back(node_ptr(new Node(1)));
    b.push_back(node_ptr(new Node(2)));
    
    a=b;
    
    a.push_back(node_ptr(new Node(3)));
    b.push_back(node_ptr(new Node(4)));
    
    print(a);
    print(b);
    
    
    
    Prb<int,int> A,B;
    
    A.nodes = a;
    B.nodes = b;
    
    A=B;
    
    
    A.nodes.push_back(node_ptr(new Node(5)));
    B.nodes.push_back(node_ptr(new Node(6)));
    
    print(A.nodes);
    print(B.nodes);
    
    
    
}

Show compiler warnings [ + ] Compiler args [ + ] Show input
Compilation time: 0.78 sec, absolute running time: 0.15 sec, cpu time: 0 sec, memory peak: 3 Mb, absolute service time: 0.94 sec (cached)