Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <fstream>
- using namespace std;
- ifstream f("nr.in");
- ofstream g("nr.out");
- struct nod { int info; nod *urm; };
- void INSERARE_FATA(nod *&prim, int nr)
- {
- nod *p = new nod;
- p -> info = nr;
- p -> urm = prim;
- prim = p;
- }
- void afisare_lista(nod *prim)
- {
- nod *p;
- for(p = prim; p != NULL; p = p->urm)
- g << p -> info << " ";
- g << endl;
- }
- int main()
- {
- int n, i, nr;
- nod *prim, *ultim;
- nod *p;
- f >> n;
- prim = ultim = NULL;
- for(i = 1; i <= n; i++)
- {
- f >> nr;
- INSERARE_FATA(prim, nr);
- }
- g << "Lista creata este: ";
- afisare_lista(prim);
- g << endl;
- int k = 0;
- for(p = prim; p != NULL; p = p -> urm)
- {
- if(p -> info % 2 != 0)
- k++;
- }
- g << "Nr. elementelor impare: " << k << endl;
- int min = 32767;
- for(p = prim; p != NULL; p = p -> urm)
- {
- if(p -> info < min)
- min = p -> info;
- }
- g << "Elementul minim este: " << min;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement