Facebook
From gh, 1 Month ago, written in Plain Text.
Embed
Download Paste or View Raw
Hits: 120
  1. /*#include <iostream>
  2. using namespace std;
  3. struct nod
  4. {
  5.   int info;
  6.   nod *urm;
  7. } *prim, *ultim;
  8.  
  9. void
  10. inserare (int x, nod * &prim;)
  11. {
  12.    nod *q;
  13.    q= new nod;
  14.    q->info=x;
  15.    q->urm=prim;
  16.    prim=q;
  17. }
  18. void sterge(nod * &prim;)
  19. {
  20.     prim=prim->urm;
  21. }
  22. void
  23. afisare (nod * prim)
  24. {
  25.   nod *q;
  26.   q = prim;
  27.   while (q != NULL)
  28.  {
  29.    cout << q->info << " ";
  30.    q = q->urm;
  31.  }
  32. }
  33.  
  34. void
  35. adaug (int x, nod * &prim;)
  36. {
  37.   nod *q;
  38.   q = new nod;
  39.   q->info = x;
  40.   q->urm = NULL;
  41.   if (!prim)
  42.  prim = ultim = q;
  43.   else
  44.  {
  45.    ultim->urm = q;
  46.    ultim = q;
  47.  }
  48. }
  49.  
  50. int
  51. main ()
  52. {
  53.   int n, i, x;
  54.   cin >> n;
  55.   for (i = 1; i <= n; i++)
  56.  {
  57.    cin >> x;
  58.    adaug (x, prim);
  59.  }
  60.   afisare (prim);
  61.   sterge (prim);
  62.   afisare (prim);
  63.   return 0;
  64. }
  65. */
  66. #include <iostream>
  67. using namespace std;
  68. struct nod
  69. {
  70.   int info;
  71.   nod *urm;
  72. } *prim, *ultim;
  73.  
  74. void
  75. inserare (int x, nod * &prim;)
  76. {
  77.   nod *q;
  78.   q = prim;
  79.   while (q->urm != NULL)
  80.  q = q->urm;
  81.   nod *k;
  82.   k = new nod;
  83.   k->info = x;
  84.   q->urm = k;
  85. }
  86.  
  87. void
  88. sterge (nod * prim)
  89. {
  90.   nod *q;
  91.   q = prim;
  92.   while (q->urm->urm != NULL)
  93.  q = q->urm;
  94.   q->urm=NULL;
  95. }
  96.  
  97.  void afisare (nod * prim)
  98.   {
  99.  nod *q;
  100.  q = prim;
  101.  while (q != NULL)
  102.    {
  103.   cout << q->info << " ";
  104.   q = q->urm;
  105.    }
  106.   }
  107.  
  108.   void adaug (int x, nod * &prim;)
  109.   {
  110.  nod *q;
  111.  q = new nod;
  112.  q->info = x;
  113.  q->urm = NULL;
  114.  if (!prim)
  115.    prim = ultim = q;
  116.  else
  117.    {
  118.   ultim->urm = q;
  119.   ultim = q;
  120.    }
  121.   }
  122.  
  123.   int main ()
  124.   {
  125.  int n, i, x;
  126.  cin >> n;
  127.  for (i = 1; i <= n; i++)
  128.    {
  129.   cin >> x;
  130.   adaug (x, prim);
  131.    }
  132.  afisare (prim);
  133.  cout << endl;
  134.  sterge(prim);
  135.  afisare (prim);
  136.  return 0;
  137.   }