├── Grupa 1 ├── Dinu_George_Grupa1 │ └── Teme ├── Ruse_Alex_Grupa1 │ ├── Tema │ │ └── ex │ └── Laborator4.cpp ├── Bucura_Bogdan_Gr1 │ ├── biblio │ │ ├── poezie.txt │ │ ├── Carti oarecare.txt │ │ └── a.exe │ ├── Impartirea melodiilor pe 2 CD uri │ │ ├── output │ │ │ └── main.exe │ │ └── Enunt problema.jpg │ └── laborator4.cpp ├── Ciociu_Alexia_grupa1 │ ├── laborator │ │ ├── lab5.cpp │ │ └── laborator4.cpp │ └── Teme │ │ └── pb1.cpp ├── Stanculescu_Mihai_grupa1 │ └── Laborator4.cpp ├── Tamasag_Irina_grupa1 │ ├── laborator │ │ ├── lab5.cpp │ │ ├── lab9ex2 │ │ ├── lab9codfibo │ │ ├── lab9 │ │ ├── lab9ex3 │ │ ├── lab9ex4 │ │ └── lab4.cpp │ └── Teme │ │ ├── exlab12 │ │ └── ex.test │ │ ├── p1 │ │ ├── p2 │ │ └── e9 ├── Lacatus_Cristian_GR1 │ ├── Laboratoare │ │ └── lab4.cpp │ └── Teme │ │ └── TemaMatrici.cpp ├── Badea_George_Catalin_Grupa_1 │ ├── lab │ │ └── Laborator5.cpp │ ├── Tema 10 │ │ └── Tema 10.layout │ └── Laborator4.cpp ├── Mandea_Alexandra_Nicoleta_Grupa1 │ └── Laborator │ │ ├── Laborator5.cpp │ │ └── Laborator4.cpp ├── Micu_Alexandru_Gr 1 │ └── Laborator4.cpp ├── Arsenie_Vlad_GR1 │ └── LucruLaborator │ │ ├── SirFibonacci_recursiv.cpp │ │ └── Laborator4.cpp ├── Tutu_Cristian_G1 │ ├── Laboratoare │ │ ├── Lab 9 │ │ │ ├── ex 2.cpp │ │ │ ├── ex 3.cpp │ │ │ ├── ex 1.cpp │ │ │ └── ex 4.cpp │ │ └── Laborator4.cpp │ └── Teme │ │ └── Exemple test │ │ ├── problema 1.cpp │ │ └── problema 9.cpp ├── Ciobanu_Constantin_GR1 │ ├── Laborator │ │ ├── Lab 2 │ │ │ ├── length.cpp │ │ │ ├── fibonacci.c │ │ │ └── equation.cpp │ │ ├── Lab 9 │ │ │ ├── prog2.cpp │ │ │ └── prog3.cpp │ │ └── Lab 8 │ │ │ └── prog3.c │ ├── Teme │ │ └── Tema 2 │ │ │ ├── ex2.c │ │ │ └── ex2v2.cpp │ └── adaugator │ │ └── distanta dintre doua caractere difereite.cpp ├── Ene_Ionut_Grupa1 │ └── Laborator │ │ ├── Lab9P2.cpp │ │ ├── Lab9P3.cpp │ │ ├── Lab9P4.cpp │ │ ├── Lab9P1.cpp │ │ └── Laborator4.cpp ├── Marinescu_Teodora_G1 │ └── Laborator_4.cpp ├── Sauciuc_Darius_G1 │ └── Laborator │ │ ├── Laborator9-pb2.cpp │ │ └── Laborator9-towerofhanoi.cpp ├── Dragomir_Gabriel_Valentin_gr1 │ └── laborator │ │ └── lab4.cpp ├── Catanea_Bianca_grupa1 │ └── Laborator │ │ ├── Laborator 2 - Problema 2 - Numar cifre.cpp │ │ ├── Laborator 11 - Problema 3 - Ctg.cpp │ │ ├── Laborator 1 - Problema 1 - Afisare initiale nume.cpp │ │ ├── Laborator 1 - Problema 3 - Convertire Celsius.cpp │ │ ├── Laborator 2 - Problema 4 - Sir Fibonacci.cpp │ │ └── Laborator 9 - Problema 3 - Turnurile Hanoi.cpp ├── Onu_Ada_gr1 │ ├── Teme │ │ └── tema 2 │ └── Laboratoare │ │ └── lab4 ├── Iliescu_Eduard_George_Grupa_1 │ └── Laborator │ │ └── lab4.cpp ├── Sauca_Victor_Gr1 │ └── Lab │ │ └── laborator4.cpp ├── Sirbu_Diana_grupa1 │ └── laborator4.cpp ├── Pacuraru_Robert_AIA_GR1 │ └── Laborator │ │ └── lab 4 ├── Dobra_Mario_Grupa1 │ └── Laboratoare │ │ └── lab4.cpp └── Radu_Cristian_Grupa1 │ └── laborator4.cpp ├── Grupa 2 ├── Borta_Antonio_GR2 │ ├── Teme │ ├── Laboratoare │ │ ├── lab-matrice.cpp │ │ ├── Lab9-2.cpp │ │ ├── Lab9-3.cpp │ │ ├── Lab9-1.cpp │ │ ├── Lab9-4.cpp │ │ └── Lab7.c │ ├── Lab2.cpp │ └── Teme_Programare │ │ ├── Tema12-ex1.cpp │ │ ├── Tema12-ex9.cpp │ │ ├── Tema12-ex6.cpp │ │ └── Tema12-ex8.cpp ├── Ghetau_Cristian_G2 │ ├── Teme │ │ └── temax.cpp │ └── Laboratoare │ │ ├── lab5.cpp │ │ ├── lab9fib.cpp │ │ ├── lab9pb2.cpp │ │ └── lab9pb4.cpp ├── Udrea_Marius_Grupa2 │ ├── teme │ │ └── nimic │ └── lab │ │ └── lab4.cpp ├── Mircea_Diana_Grupa2 │ ├── teme │ │ └── tema_8 │ │ │ └── ex3.cpp │ ├── exemple │ │ ├── exemplu_5.cpp │ │ └── exemplu_8.cpp │ └── laboratoare │ │ ├── lab_5 │ │ └── a1.cpp │ │ ├── lab_6 │ │ └── a1.cpp │ │ ├── lab_7 │ │ └── a1.cpp │ │ ├── lab_9 │ │ ├── sirfibo.cpp │ │ ├── p2.cpp │ │ └── towerofhanoi.cpp │ │ └── lab_4 │ │ └── vectori.cpp ├── Rusu_Sebastian_Constantin_gr2 │ ├── Lab4.cpp │ └── Laboratoare │ │ ├── lab4.cpp │ │ ├── sir_fibonacii.cpp │ │ └── lab10 │ │ ├── p3.cpp │ │ └── p2.cpp ├── Vlad_Marius_Grupa2 │ ├── Laboratoare │ │ ├── lab.cpp │ │ └── lab5.cpp │ └── lab4.cpp ├── Blinzeanu_Mihai_G2 │ ├── Laboratoare │ │ ├── lab4.2.cpp │ │ └── lab5 │ │ │ └── lab5.cpp │ ├── lab4.cpp │ └── teme │ │ └── exemple │ │ └── pb1.cpp ├── Stefan_Razvan_Grupa 2 │ ├── Laboratoare │ │ ├── lab5.cpp │ │ ├── Laborator 9 - Ex2.cpp │ │ ├── lab6_2.cpp │ │ ├── Laborator 9 - Ex4.cpp │ │ ├── Laborator 9 - Ex1.cpp │ │ ├── Laborator 9 - Ex3.cpp │ │ └── CMMD.cpp │ └── Extra │ │ ├── #11 - Vocale.cpp │ │ ├── #1866 - prosir.cpp │ │ ├── #1456 - Cuvant.cpp │ │ ├── #12 - Initiale.cpp │ │ ├── #972 - Pozitii.cpp │ │ ├── test1_ex2.cpp │ │ └── #877 - cuburi2.cpp ├── Suciu_Andrei_Grupa2 │ ├── laborator │ │ └── laboratoare5.cpp │ ├── lab4.cpp │ └── teme │ │ └── suma nr pare vector.cpp ├── DorceaHeia_EduardDamian_2 │ ├── Laboratoare │ │ ├── 1 │ │ │ ├── main.cpp │ │ │ ├── 1.depend │ │ │ ├── bin │ │ │ │ └── Debug │ │ │ │ │ └── 1.exe │ │ │ ├── obj │ │ │ │ └── Debug │ │ │ │ │ └── main.o │ │ │ └── 1.layout │ │ ├── recuperare 3 │ │ │ ├── DATA.txt │ │ │ ├── obj │ │ │ │ └── Debug │ │ │ │ │ └── main.o │ │ │ ├── recuperare 3.depend │ │ │ ├── bin │ │ │ │ └── Debug │ │ │ │ │ └── recuperare 3.exe │ │ │ ├── recuperare 3.layout │ │ │ └── main.cpp │ │ ├── problema fisier c │ │ │ ├── DATA.txt │ │ │ ├── obj │ │ │ │ └── Debug │ │ │ │ │ └── main.o │ │ │ ├── problema fisier c.depend │ │ │ ├── bin │ │ │ │ └── Debug │ │ │ │ │ └── problema fisier c.exe │ │ │ └── problema fisier c.layout │ │ ├── test cu matrice │ │ │ ├── MATRICE.txt │ │ │ ├── intrare.txt │ │ │ ├── obj │ │ │ │ └── Debug │ │ │ │ │ └── main.o │ │ │ └── test cu matrice.depend │ │ ├── probelme fisere 4 │ │ │ ├── vocale.txt │ │ │ └── probelme fisere 4.layout │ │ ├── probelma fisiere 2 │ │ │ ├── DATA.txt │ │ │ ├── obj │ │ │ │ └── Debug │ │ │ │ │ └── main.o │ │ │ ├── probelma fisiere 2.depend │ │ │ ├── bin │ │ │ │ └── Debug │ │ │ │ │ └── probelma fisiere 2.exe │ │ │ └── probelma fisiere 2.layout │ │ ├── problema fisier 3 c++ │ │ │ ├── note.txt │ │ │ ├── media.txt │ │ │ ├── obj │ │ │ │ └── Debug │ │ │ │ │ └── main.o │ │ │ ├── problema fisier 3 c++.depend │ │ │ ├── bin │ │ │ │ └── Debug │ │ │ │ │ └── problema fisier 3 c++.exe │ │ │ └── problema fisier 3 c++.layout │ │ ├── salut │ │ │ └── main.cpp │ │ ├── test cu matrice incercare 2 │ │ │ ├── intrare.txt │ │ │ ├── obj │ │ │ │ └── Debug │ │ │ │ │ └── main.o │ │ │ ├── MATRICE.txt │ │ │ ├── bin │ │ │ │ └── Debug │ │ │ │ │ └── test cu matrice incercare 2.exe │ │ │ ├── test cu matrice incercare 2.depend │ │ │ └── test cu matrice incercare 2.layout │ │ ├── Test matrice.depend │ │ ├── bin │ │ │ └── Debug │ │ │ │ └── Test.exe │ │ ├── grade │ │ │ ├── grade.depend │ │ │ ├── obj │ │ │ │ └── Debug │ │ │ │ │ └── main.o │ │ │ ├── bin │ │ │ │ └── Debug │ │ │ │ │ └── grade.exe │ │ │ ├── main.cpp │ │ │ └── grade.layout │ │ ├── Matrice 1 │ │ │ ├── obj │ │ │ │ └── Debug │ │ │ │ │ └── main.o │ │ │ └── bin │ │ │ │ └── Debug │ │ │ │ └── Matrice 1.exe │ │ ├── operatii │ │ │ ├── obj │ │ │ │ └── Debug │ │ │ │ │ └── main.o │ │ │ ├── bin │ │ │ │ └── Debug │ │ │ │ │ └── operatii.exe │ │ │ ├── operatii.depend │ │ │ └── operatii.layout │ │ ├── yeeeeeey │ │ │ ├── obj │ │ │ │ └── Debug │ │ │ │ │ └── main.o │ │ │ ├── bin │ │ │ │ └── Debug │ │ │ │ │ └── yeeeeeey.exe │ │ │ ├── yeeeeeey.depend │ │ │ └── main.c │ │ ├── AB │ │ │ ├── 1611lab1 │ │ │ │ ├── obj │ │ │ │ │ └── Debug │ │ │ │ │ │ └── main.o │ │ │ │ ├── bin │ │ │ │ │ └── Debug │ │ │ │ │ │ └── 1611lab1.exe │ │ │ │ └── 1611lab1.layout │ │ │ ├── 1611lab2 │ │ │ │ ├── obj │ │ │ │ │ └── Debug │ │ │ │ │ │ └── main.o │ │ │ │ ├── 1611lab2.layout │ │ │ │ └── main.cpp │ │ │ ├── sir fibanacci ex │ │ │ │ ├── obj │ │ │ │ │ └── Debug │ │ │ │ │ │ └── main.o │ │ │ │ ├── sir fibanacci ex.depend │ │ │ │ ├── bin │ │ │ │ │ └── Debug │ │ │ │ │ │ └── sir fibanacci ex.exe │ │ │ │ ├── sir fibanacci ex.layout │ │ │ │ └── main.cpp │ │ │ ├── problema recursiva 2 │ │ │ │ ├── obj │ │ │ │ │ └── Debug │ │ │ │ │ │ └── main.o │ │ │ │ ├── bin │ │ │ │ │ └── Debug │ │ │ │ │ │ └── problema recursiva 2.exe │ │ │ │ ├── main.cpp │ │ │ │ └── problema recursiva 2.layout │ │ │ ├── problema recursivitate 3 │ │ │ │ ├── obj │ │ │ │ │ └── Debug │ │ │ │ │ │ └── main.o │ │ │ │ ├── bin │ │ │ │ │ └── Debug │ │ │ │ │ │ └── problema recursivitate 3.exe │ │ │ │ ├── problema recursivitate 3.layout │ │ │ │ └── main.cpp │ │ │ ├── problema interactivitate │ │ │ │ ├── main.cpp │ │ │ │ └── problema interactivitate.layout │ │ │ ├── problema interactivitatetrue │ │ │ │ ├── obj │ │ │ │ │ └── Debug │ │ │ │ │ │ └── main.o │ │ │ │ ├── bin │ │ │ │ │ └── Debug │ │ │ │ │ │ └── problema interactivitatetrue.exe │ │ │ │ ├── problema interactivitatetrue.layout │ │ │ │ └── main.cpp │ │ │ └── problema turnuri hanoe │ │ │ │ ├── problema turnuri hanoe.layout │ │ │ │ └── main.cpp │ │ ├── PROBLEMA fisier 3 │ │ │ ├── main.c │ │ │ └── PROBLEMA fisier 3.layout │ │ ├── biblioteca │ │ │ ├── obj │ │ │ │ └── Debug │ │ │ │ │ └── main.o │ │ │ ├── biblioteca.depend │ │ │ ├── bin │ │ │ │ └── Debug │ │ │ │ │ └── biblioteca.exe │ │ │ └── biblioteca.layout │ │ ├── fct grad 2 │ │ │ ├── obj │ │ │ │ └── Debug │ │ │ │ │ └── main.o │ │ │ ├── bin │ │ │ │ └── Debug │ │ │ │ │ └── fct grad 2.exe │ │ │ └── fct grad 2.layout │ │ ├── nr de cifre │ │ │ ├── obj │ │ │ │ └── Debug │ │ │ │ │ └── main.o │ │ │ ├── nr de cifre.depend │ │ │ ├── bin │ │ │ │ └── Debug │ │ │ │ │ └── nr de cifre.exe │ │ │ ├── nr de cifre.layout │ │ │ └── main.cpp │ │ ├── sir fibonaci │ │ │ ├── obj │ │ │ │ └── Debug │ │ │ │ │ └── main.o │ │ │ ├── bin │ │ │ │ └── Debug │ │ │ │ │ └── sir fibonaci.exe │ │ │ ├── sir fibonaci.depend │ │ │ ├── sir fibonaci.layout │ │ │ └── main.cpp │ │ ├── aria+perimetru │ │ │ ├── obj │ │ │ │ └── Debug │ │ │ │ │ └── main.o │ │ │ ├── bin │ │ │ │ └── Debug │ │ │ │ │ └── aria+perimetru.exe │ │ │ ├── main.cpp │ │ │ └── aria+perimetru.layout │ │ ├── c arie+perimetru │ │ │ ├── obj │ │ │ │ └── Debug │ │ │ │ │ └── main.o │ │ │ ├── c arie+perimetru.depend │ │ │ ├── bin │ │ │ │ └── Debug │ │ │ │ │ └── c arie+perimetru.exe │ │ │ ├── c arie+perimetru.layout │ │ │ └── main.c │ │ ├── obj │ │ │ └── Debug │ │ │ │ └── Documents │ │ │ │ └── AB │ │ │ │ └── Test │ │ │ │ └── main.o │ │ ├── yey │ │ │ ├── main.cpp │ │ │ └── yey.layout │ │ ├── laborator 4 vectori │ │ │ ├── obj │ │ │ │ └── Debug │ │ │ │ │ └── main.o │ │ │ ├── laborator 4 vectori.depend │ │ │ ├── bin │ │ │ │ └── Debug │ │ │ │ │ └── laborator 4 vectori.exe │ │ │ ├── laborator 4 vectori.layout │ │ │ └── main.cpp │ │ ├── problema malloc3nou │ │ │ ├── obj │ │ │ │ └── Debug │ │ │ │ │ └── main.o │ │ │ ├── problema malloc3nou.depend │ │ │ ├── bin │ │ │ │ └── Debug │ │ │ │ │ └── problema malloc3nou.exe │ │ │ ├── problema malloc3nou.layout │ │ │ └── main.c │ │ ├── test sir caractere │ │ │ ├── obj │ │ │ │ └── Debug │ │ │ │ │ └── main.o │ │ │ ├── bin │ │ │ │ └── Debug │ │ │ │ │ └── test sir caractere.exe │ │ │ ├── test sir caractere.depend │ │ │ ├── test sir caractere.layout │ │ │ └── main.cpp │ │ ├── problema vectori malloc │ │ │ ├── obj │ │ │ │ └── Debug │ │ │ │ │ └── main.o │ │ │ ├── bin │ │ │ │ └── Debug │ │ │ │ │ └── problema vectori malloc.exe │ │ │ ├── problema vectori malloc.depend │ │ │ └── problema vectori malloc.layout │ │ ├── cel mai mic div comun recursiv │ │ │ ├── obj │ │ │ │ └── Debug │ │ │ │ │ └── main.o │ │ │ ├── bin │ │ │ │ └── Debug │ │ │ │ │ └── cel mai mic div comun recursiv.exe │ │ │ ├── cel mai mic div comun recursiv.layout │ │ │ └── main.cpp │ │ ├── test sir caractere.cpp │ │ ├── 2.cpp │ │ ├── recuperare │ │ │ ├── main.cpp │ │ │ └── recuperare.layout │ │ ├── Test matrice.layout │ │ ├── probelma fisiere │ │ │ └── probelma fisiere.layout │ │ ├── problema malloc3 │ │ │ ├── problema malloc3.layout │ │ │ └── main.cpp │ │ ├── problema struct elevi │ │ │ └── problema struct elevi.layout │ │ ├── problema struct malloc │ │ │ └── problema struct malloc.layout │ │ └── problema struct malloc2 │ │ │ └── problema struct malloc2.layout │ └── lab4.cpp ├── Glont_Tudor_G2 │ ├── LABORATOARE │ │ ├── 8.11-1.cpp │ │ ├── lab9 5.cpp │ │ ├── lab9 2.cpp │ │ ├── 15.11.c │ │ ├── Lab4.cpp │ │ ├── lab9 3.cpp │ │ ├── lab9 4.cpp │ │ └── 8.11-2.c │ └── TEME │ │ └── tema 1.ex1.c ├── Margarit_Iustin_Gr2 │ ├── Teme │ │ └── s14 │ │ │ └── permutari.cpp │ └── Laboratoare │ │ ├── Fibonacci_recursiv.cpp │ │ ├── lab9 │ │ ├── lab9_ex2.cpp │ │ ├── lab9_ex3.cpp │ │ └── lab9_ex1.cpp │ │ ├── lab4.cpp │ │ ├── lab10_4.cpp │ │ └── lab8.c ├── Chitu_Gabriela_GR2 │ ├── Laboratoare │ │ ├── lab1_problema3.cpp │ │ ├── lab1_problema1.cpp │ │ ├── lab9_2.cpp │ │ ├── Lab1.cpp │ │ ├── lab2_2.cpp │ │ ├── lab11_ex3.cpp │ │ ├── lab1_problema2.cpp │ │ ├── lab9_3.cpp │ │ ├── lab2_4_sir_fractii_fibonacci.cpp │ │ ├── lab8_3.cpp │ │ ├── lab9_4.cpp │ │ ├── lab9_1.cpp │ │ ├── lab5_3.cpp │ │ └── lab2_3.cpp │ ├── Teme │ │ └── problema1.cpp │ └── lab4.cpp ├── Popescu_Tudor_Stefan │ ├── Lab 4 .cpp │ └── LAboratoare │ │ └── Ex2 ├── Virnav_Stefan_GR2 │ └── Laborator │ │ ├── lab_9_5.cpp │ │ ├── lab_9_2.cpp │ │ ├── lab4.cpp │ │ ├── lab2_prob2_nrcifre.cpp │ │ ├── lab1_prob1_afis_initiale.cpp │ │ ├── lab_9_3.cpp │ │ ├── lab1_prob3_convCelsiu.cpp │ │ ├── lab2_prob4_sir_fibonacci.cpp │ │ ├── lab_9_4.cpp │ │ └── lab_9_1.cpp ├── Gheorghe_Alin_g2 │ ├── lab │ │ ├── lab9fibonaccirecursiv.cpp │ │ ├── lab9ex2.cpp │ │ ├── lab9ex3.cpp │ │ ├── lab9turunurilehanoi.cpp │ │ └── lab9.cpp │ └── tema │ │ └── AlocareDinamica Matrice cu .cpp ├── Bektas_Denis_G2 │ └── Laboratoare │ │ ├── sir fibonnaci recursiv.cpp │ │ ├── Laborator4.cpp │ │ ├── Lab 9.1.cpp │ │ ├── lab.cpp │ │ ├── Lab 9.2.cpp │ │ ├── Laborator5.cpp │ │ ├── Lab 9.cpp │ │ ├── Laborator8Pb2C │ │ ├── Lab 6.c │ │ ├── Lab 10 C++2.cpp │ │ └── Laborator 8 C ├── Sfetcu_Delia_g2 │ ├── Teme │ │ ├── temalab12-exempletest │ │ │ └── problema1.cpp │ │ └── temalab2 │ │ │ ├── pr4.c │ │ │ └── pr3.cpp │ └── Laboratoare │ │ ├── Lab7 │ │ └── prob3.c │ │ ├── Lab9 │ │ ├── pr2.cpp │ │ ├── pb3.cpp │ │ └── pb4.cpp │ │ ├── Lab13 │ │ └── problemastelute1.cpp │ │ └── Lab8 │ │ └── prob3.c ├── Balan_Bianca_GR2 │ ├── lab4.cpp │ └── laboratoare │ │ ├── lab4_2.cpp │ │ ├── lab9_pr2.cpp │ │ ├── lab7.cpp │ │ └── lab9.cpp ├── Pufulete_Andreea_grupa2 │ └── Laboratoare │ │ ├── prob2 recursivitate.cpp │ │ ├── lab4.cpp │ │ └── towerOfHanoi.cpp ├── Chicea_Alexandru_Daniel_G2 │ └── Laboratoare │ │ ├── lab_12.cpp │ │ ├── lab4.cpp │ │ └── lab8_c_2.c ├── Rusu_Denice_Grupa2 │ ├── Laboratoare │ │ ├── Lab9 │ │ │ ├── problema5.cpp │ │ │ ├── problema2.cpp │ │ │ ├── problema3.cpp │ │ │ ├── problema4.cpp │ │ │ └── problema1.cpp │ │ ├── lab4.cpp │ │ └── Lab8 │ │ │ └── problema3 │ └── Teme │ │ └── test2 │ │ └── problema1.cpp ├── Toloanca_Ioana_Gr2 │ └── Laboratoare │ │ ├── lab13 │ │ └── lab4.cpp ├── Vasile_Rares_Stefan_Gr2 │ └── Lab4.cpp ├── Ionita_Radu_Alexandru_G2 │ └── Laboratoare │ │ ├── lab9_d.cpp │ │ ├── lab9_b.cpp │ │ ├── lab9_c.cpp │ │ ├── lab4.cpp │ │ ├── lab8b.c │ │ ├── lab8c.c │ │ └── lab7b.c ├── Constantin_Mihai_G2 │ └── lab4.cpp └── Nica_Andrei_Gr2 │ └── lab4.cpp ├── Problema - Biblioteca └── biblioteca1.txt ├── UML (2).docx ├── exemple.docx ├── Exemple SUBIECTE EXAMEN.pdf ├── Laboratoare ├── Lab 11 │ ├── l11.docx │ └── e3.cpp ├── Lab 7 │ ├── main (1).exe │ ├── main (1).o │ ├── tip_enum.exe │ ├── tip_enum.o │ ├── laborator 7.docx │ ├── ~$borator 7.docx │ └── tip_enum.c ├── Lab 1 │ ├── Laborator 1.docx │ ├── problema3.cpp │ ├── problema1.cpp │ ├── main.cpp │ └── problema2.cpp ├── Lab 2 │ ├── Laborator 2.docx │ ├── sir_fractii_fibonacci.c │ └── main.cpp ├── Lab 3 │ └── Laborator 3.docx ├── Laborato 10 │ ├── tema.docx │ └── laborator10.pdf ├── Lab 5 │ ├── Laborator 5 -v2.docx │ ├── problema_+.cpp │ └── problema1.cpp ├── laborator 9 │ ├── LABORATOR S9.pdf │ ├── p2.c │ └── turnuri.cpp └── Lab 8 │ └── tema lab 8 │ └── LABORATOR S8.pdf ├── LinkSharepoint └── .vscode └── c_cpp_properties.json /Grupa 1/Dinu_George_Grupa1/Teme: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /Grupa 1/Ruse_Alex_Grupa1/Tema/ex: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /Grupa 2/Borta_Antonio_GR2/Teme: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /Grupa 1/Bucura_Bogdan_Gr1/biblio/poezie.txt: -------------------------------------------------------------------------------- 1 | -------------------------------------------------------------------------------- /Grupa 2/Ghetau_Cristian_G2/Teme/temax.cpp: -------------------------------------------------------------------------------- 1 | -------------------------------------------------------------------------------- /Grupa 2/Udrea_Marius_Grupa2/teme/nimic: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /Problema - Biblioteca/biblioteca1.txt: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /Grupa 1/Ruse_Alex_Grupa1/Laborator4.cpp: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /Grupa 2/Ghetau_Cristian_G2/Laboratoare/lab5.cpp: -------------------------------------------------------------------------------- 1 | -------------------------------------------------------------------------------- /Grupa 1/Bucura_Bogdan_Gr1/biblio/Carti oarecare.txt: -------------------------------------------------------------------------------- 1 | -------------------------------------------------------------------------------- /Grupa 1/Ciociu_Alexia_grupa1/laborator/lab5.cpp: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /Grupa 1/Stanculescu_Mihai_grupa1/Laborator4.cpp: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /Grupa 1/Tamasag_Irina_grupa1/laborator/lab5.cpp: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /Grupa 2/Mircea_Diana_Grupa2/teme/tema_8/ex3.cpp: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /Grupa 2/Rusu_Sebastian_Constantin_gr2/Lab4.cpp: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /Grupa 2/Vlad_Marius_Grupa2/Laboratoare/lab.cpp: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /Grupa 2/Vlad_Marius_Grupa2/Laboratoare/lab5.cpp: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /Grupa 1/Lacatus_Cristian_GR1/Laboratoare/lab4.cpp: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /Grupa 1/Lacatus_Cristian_GR1/Teme/TemaMatrici.cpp: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /Grupa 2/Blinzeanu_Mihai_G2/Laboratoare/lab4.2.cpp: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /Grupa 2/Blinzeanu_Mihai_G2/Laboratoare/lab5/lab5.cpp: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /Grupa 2/Borta_Antonio_GR2/Laboratoare/lab-matrice.cpp: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /Grupa 2/Mircea_Diana_Grupa2/exemple/exemplu_5.cpp: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /Grupa 2/Mircea_Diana_Grupa2/laboratoare/lab_5/a1.cpp: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /Grupa 2/Mircea_Diana_Grupa2/laboratoare/lab_6/a1.cpp: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /Grupa 2/Mircea_Diana_Grupa2/laboratoare/lab_7/a1.cpp: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /Grupa 2/Stefan_Razvan_Grupa 2/Laboratoare/lab5.cpp: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /Grupa 1/Badea_George_Catalin_Grupa_1/lab/Laborator5.cpp: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /Grupa 2/Mircea_Diana_Grupa2/laboratoare/lab_9/sirfibo.cpp: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /Grupa 2/Rusu_Sebastian_Constantin_gr2/Laboratoare/lab4.cpp: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /Grupa 2/Suciu_Andrei_Grupa2/laborator/laboratoare5.cpp: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/recuperare 3/DATA.txt: -------------------------------------------------------------------------------- 1 | -------------------------------------------------------------------------------- /Grupa 1/Mandea_Alexandra_Nicoleta_Grupa1/Laborator/Laborator5.cpp: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/problema fisier c/DATA.txt: -------------------------------------------------------------------------------- 1 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/test cu matrice/MATRICE.txt: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/probelme fisere 4/vocale.txt: -------------------------------------------------------------------------------- 1 | Ana are mere -------------------------------------------------------------------------------- /UML (2).docx: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/UML (2).docx -------------------------------------------------------------------------------- /exemple.docx: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/exemple.docx -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/probelma fisiere 2/DATA.txt: -------------------------------------------------------------------------------- 1 | ACESTA ESTE UN EXEMPLU -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/problema fisier 3 c++/note.txt: -------------------------------------------------------------------------------- 1 | 4 2 | 6 3 | 8 4 | 10 -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/test cu matrice/intrare.txt: -------------------------------------------------------------------------------- 1 | 2 2 | 2 3 | 5 6 7 9 4 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/problema fisier 3 c++/media.txt: -------------------------------------------------------------------------------- 1 | Media finala este5.25 2 | -------------------------------------------------------------------------------- /Exemple SUBIECTE EXAMEN.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Exemple SUBIECTE EXAMEN.pdf -------------------------------------------------------------------------------- /Laboratoare/Lab 11/l11.docx: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Laboratoare/Lab 11/l11.docx -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/salut/main.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | -------------------------------------------------------------------------------- /Laboratoare/Lab 7/main (1).exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Laboratoare/Lab 7/main (1).exe -------------------------------------------------------------------------------- /Laboratoare/Lab 7/main (1).o: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Laboratoare/Lab 7/main (1).o -------------------------------------------------------------------------------- /Laboratoare/Lab 7/tip_enum.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Laboratoare/Lab 7/tip_enum.exe -------------------------------------------------------------------------------- /Laboratoare/Lab 7/tip_enum.o: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Laboratoare/Lab 7/tip_enum.o -------------------------------------------------------------------------------- /Laboratoare/Lab 1/Laborator 1.docx: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Laboratoare/Lab 1/Laborator 1.docx -------------------------------------------------------------------------------- /Laboratoare/Lab 2/Laborator 2.docx: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Laboratoare/Lab 2/Laborator 2.docx -------------------------------------------------------------------------------- /Laboratoare/Lab 3/Laborator 3.docx: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Laboratoare/Lab 3/Laborator 3.docx -------------------------------------------------------------------------------- /Laboratoare/Lab 7/laborator 7.docx: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Laboratoare/Lab 7/laborator 7.docx -------------------------------------------------------------------------------- /Laboratoare/Lab 7/~$borator 7.docx: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Laboratoare/Lab 7/~$borator 7.docx -------------------------------------------------------------------------------- /Laboratoare/Laborato 10/tema.docx: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Laboratoare/Laborato 10/tema.docx -------------------------------------------------------------------------------- /LinkSharepoint: -------------------------------------------------------------------------------- 1 | https://utcb.sharepoint.com/sites/Site_CPM/SitePages/CollabHome.aspx 2 | https://www.youtube.com/watch?v=UFkKD5Huops 3 | -------------------------------------------------------------------------------- /Grupa 1/Bucura_Bogdan_Gr1/biblio/a.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Grupa 1/Bucura_Bogdan_Gr1/biblio/a.exe -------------------------------------------------------------------------------- /Laboratoare/Lab 5/Laborator 5 -v2.docx: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Laboratoare/Lab 5/Laborator 5 -v2.docx -------------------------------------------------------------------------------- /Laboratoare/Laborato 10/laborator10.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Laboratoare/Laborato 10/laborator10.pdf -------------------------------------------------------------------------------- /Laboratoare/laborator 9/LABORATOR S9.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Laboratoare/laborator 9/LABORATOR S9.pdf -------------------------------------------------------------------------------- /Grupa 2/Glont_Tudor_G2/LABORATOARE/8.11-1.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Grupa 2/Glont_Tudor_G2/LABORATOARE/8.11-1.cpp -------------------------------------------------------------------------------- /Laboratoare/Lab 8/tema lab 8/LABORATOR S8.pdf: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Laboratoare/Lab 8/tema lab 8/LABORATOR S8.pdf -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/1/main.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/1/main.cpp -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/test cu matrice incercare 2/intrare.txt: -------------------------------------------------------------------------------- 1 | 3 2 | 3 3 | 1 4 | 2 5 | 3 6 | 4 7 | 5 8 | 6 9 | 7 10 | 8 11 | 9 12 | 13 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/1/1.depend: -------------------------------------------------------------------------------- 1 | # depslib dependency file v1.0 2 | 1695800788 source:c:\users\student\desktop\dorcea eduard1\1\main.cpp 3 | 4 | 5 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/1/bin/Debug/1.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/1/bin/Debug/1.exe -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/1/obj/Debug/main.o: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/1/obj/Debug/main.o -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/Test matrice.depend: -------------------------------------------------------------------------------- 1 | # depslib dependency file v1.0 2 | 1698826796 source:c:\users\student\documents\ab\test\main.cpp 3 | 4 | 5 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/bin/Debug/Test.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/bin/Debug/Test.exe -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/grade/grade.depend: -------------------------------------------------------------------------------- 1 | # depslib dependency file v1.0 2 | 1695804761 source:c:\users\student\desktop\dorcea eduard1\grade\main.cpp 3 | 4 | 5 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/grade/obj/Debug/main.o: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/grade/obj/Debug/main.o -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/Matrice 1/obj/Debug/main.o: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/Matrice 1/obj/Debug/main.o -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/grade/bin/Debug/grade.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/grade/bin/Debug/grade.exe -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/operatii/obj/Debug/main.o: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/operatii/obj/Debug/main.o -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/yeeeeeey/obj/Debug/main.o: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/yeeeeeey/obj/Debug/main.o -------------------------------------------------------------------------------- /Grupa 1/Bucura_Bogdan_Gr1/Impartirea melodiilor pe 2 CD uri/output/main.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Grupa 1/Bucura_Bogdan_Gr1/Impartirea melodiilor pe 2 CD uri/output/main.exe -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/AB/1611lab1/obj/Debug/main.o: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/AB/1611lab1/obj/Debug/main.o -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/AB/1611lab2/obj/Debug/main.o: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/AB/1611lab2/obj/Debug/main.o -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/PROBLEMA fisier 3/main.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main() 5 | { 6 | printf("Hello world!\n"); 7 | return 0; 8 | } 9 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/biblioteca/obj/Debug/main.o: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/biblioteca/obj/Debug/main.o -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/fct grad 2/obj/Debug/main.o: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/fct grad 2/obj/Debug/main.o -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/nr de cifre/obj/Debug/main.o: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/nr de cifre/obj/Debug/main.o -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/recuperare 3/obj/Debug/main.o: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/recuperare 3/obj/Debug/main.o -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/sir fibonaci/obj/Debug/main.o: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/sir fibonaci/obj/Debug/main.o -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/aria+perimetru/obj/Debug/main.o: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/aria+perimetru/obj/Debug/main.o -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/biblioteca/biblioteca.depend: -------------------------------------------------------------------------------- 1 | # depslib dependency file v1.0 2 | 1701855242 source:c:\users\student\desktop\dorcea eduard1\biblioteca\main.cpp 3 | 4 | 5 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/operatii/bin/Debug/operatii.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/operatii/bin/Debug/operatii.exe -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/yeeeeeey/bin/Debug/yeeeeeey.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/yeeeeeey/bin/Debug/yeeeeeey.exe -------------------------------------------------------------------------------- /Grupa 1/Bucura_Bogdan_Gr1/Impartirea melodiilor pe 2 CD uri/Enunt problema.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Grupa 1/Bucura_Bogdan_Gr1/Impartirea melodiilor pe 2 CD uri/Enunt problema.jpg -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/AB/1611lab1/bin/Debug/1611lab1.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/AB/1611lab1/bin/Debug/1611lab1.exe -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/Matrice 1/bin/Debug/Matrice 1.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/Matrice 1/bin/Debug/Matrice 1.exe -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/c arie+perimetru/obj/Debug/main.o: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/c arie+perimetru/obj/Debug/main.o -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/nr de cifre/nr de cifre.depend: -------------------------------------------------------------------------------- 1 | # depslib dependency file v1.0 2 | 1696407724 source:c:\users\student\desktop\dorcea eduard1\nr de cifre\main.cpp 3 | 4 | 5 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/obj/Debug/Documents/AB/Test/main.o: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/obj/Debug/Documents/AB/Test/main.o -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/operatii/operatii.depend: -------------------------------------------------------------------------------- 1 | # depslib dependency file v1.0 2 | 1696406255 source:c:\users\student\desktop\dorcea eduard1\operatii\main.c 3 | 4 | 5 | 6 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/problema fisier c/obj/Debug/main.o: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/problema fisier c/obj/Debug/main.o -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/recuperare 3/recuperare 3.depend: -------------------------------------------------------------------------------- 1 | # depslib dependency file v1.0 2 | 1702460986 source:c:\users\student\desktop\dorcea eduard1\recuperare 3\main.cpp 3 | 4 | 5 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/test cu matrice/obj/Debug/main.o: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/test cu matrice/obj/Debug/main.o -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/yeeeeeey/yeeeeeey.depend: -------------------------------------------------------------------------------- 1 | # depslib dependency file v1.0 2 | 1702033965 source:c:\users\student\desktop\dorcea eduard1\yeeeeeey\main.c 3 | 4 | 5 | 6 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/yey/main.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | cout << "Hello world!" << endl; 8 | return 0; 9 | } 10 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/AB/sir fibanacci ex/obj/Debug/main.o: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/AB/sir fibanacci ex/obj/Debug/main.o -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/biblioteca/bin/Debug/biblioteca.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/biblioteca/bin/Debug/biblioteca.exe -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/fct grad 2/bin/Debug/fct grad 2.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/fct grad 2/bin/Debug/fct grad 2.exe -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/laborator 4 vectori/obj/Debug/main.o: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/laborator 4 vectori/obj/Debug/main.o -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/probelma fisiere 2/obj/Debug/main.o: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/probelma fisiere 2/obj/Debug/main.o -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/problema malloc3nou/obj/Debug/main.o: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/problema malloc3nou/obj/Debug/main.o -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/test sir caractere/obj/Debug/main.o: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/test sir caractere/obj/Debug/main.o -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/nr de cifre/bin/Debug/nr de cifre.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/nr de cifre/bin/Debug/nr de cifre.exe -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/problema fisier 3 c++/obj/Debug/main.o: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/problema fisier 3 c++/obj/Debug/main.o -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/recuperare 3/bin/Debug/recuperare 3.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/recuperare 3/bin/Debug/recuperare 3.exe -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/sir fibonaci/bin/Debug/sir fibonaci.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/sir fibonaci/bin/Debug/sir fibonaci.exe -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/AB/problema recursiva 2/obj/Debug/main.o: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/AB/problema recursiva 2/obj/Debug/main.o -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/probelma fisiere 2/probelma fisiere 2.depend: -------------------------------------------------------------------------------- 1 | # depslib dependency file v1.0 2 | 1701249759 source:c:\users\student\desktop\dorcea eduard1\probelma fisiere 2\main.c 3 | 4 | 5 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/problema fisier c/problema fisier c.depend: -------------------------------------------------------------------------------- 1 | # depslib dependency file v1.0 2 | 1701247917 source:c:\users\student\desktop\dorcea eduard1\problema fisier c\main.c 3 | 4 | 5 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/problema vectori malloc/obj/Debug/main.o: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/problema vectori malloc/obj/Debug/main.o -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/sir fibonaci/sir fibonaci.depend: -------------------------------------------------------------------------------- 1 | # depslib dependency file v1.0 2 | 1696409617 source:c:\users\student\desktop\dorcea eduard1\sir fibonaci\main.cpp 3 | 4 | 5 | 6 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/AB/problema recursivitate 3/obj/Debug/main.o: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/AB/problema recursivitate 3/obj/Debug/main.o -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/AB/sir fibanacci ex/sir fibanacci ex.depend: -------------------------------------------------------------------------------- 1 | # depslib dependency file v1.0 2 | 1700645731 source:c:\users\student\desktop\dorcea eduard1\ab\sir fibanacci ex\main.cpp 3 | 4 | 5 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/aria+perimetru/bin/Debug/aria+perimetru.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/aria+perimetru/bin/Debug/aria+perimetru.exe -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/test cu matrice incercare 2/obj/Debug/main.o: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/test cu matrice incercare 2/obj/Debug/main.o -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/AB/problema interactivitate/main.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | cout << "Hello world!" << endl; 8 | return 0; 9 | } 10 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/c arie+perimetru/c arie+perimetru.depend: -------------------------------------------------------------------------------- 1 | # depslib dependency file v1.0 2 | 1695803772 source:c:\users\student\desktop\dorcea eduard1\c arie+perimetru\main.c 3 | 4 | 5 | 6 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/AB/problema interactivitatetrue/obj/Debug/main.o: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/AB/problema interactivitatetrue/obj/Debug/main.o -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/c arie+perimetru/bin/Debug/c arie+perimetru.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/c arie+perimetru/bin/Debug/c arie+perimetru.exe -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/cel mai mic div comun recursiv/obj/Debug/main.o: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/cel mai mic div comun recursiv/obj/Debug/main.o -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/problema fisier c/bin/Debug/problema fisier c.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/problema fisier c/bin/Debug/problema fisier c.exe -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/AB/sir fibanacci ex/bin/Debug/sir fibanacci ex.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/AB/sir fibanacci ex/bin/Debug/sir fibanacci ex.exe -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/laborator 4 vectori/laborator 4 vectori.depend: -------------------------------------------------------------------------------- 1 | # depslib dependency file v1.0 2 | 1697615773 source:c:\users\student\desktop\dorcea eduard1\laborator 4 vectori\main.cpp 3 | 4 | 5 | 6 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/probelma fisiere 2/bin/Debug/probelma fisiere 2.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/probelma fisiere 2/bin/Debug/probelma fisiere 2.exe -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/problema malloc3nou/problema malloc3nou.depend: -------------------------------------------------------------------------------- 1 | # depslib dependency file v1.0 2 | 1700041932 source:c:\users\student\desktop\dorcea eduard1\problema malloc3nou\main.c 3 | 4 | 5 | 6 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/test sir caractere/bin/Debug/test sir caractere.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/test sir caractere/bin/Debug/test sir caractere.exe -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/test sir caractere/test sir caractere.depend: -------------------------------------------------------------------------------- 1 | # depslib dependency file v1.0 2 | 1698828753 source:c:\users\student\desktop\dorcea eduard1\test sir caractere\main.cpp 3 | 4 | 5 | 6 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/yey/yey.layout: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/laborator 4 vectori/bin/Debug/laborator 4 vectori.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/laborator 4 vectori/bin/Debug/laborator 4 vectori.exe -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/problema malloc3nou/bin/Debug/problema malloc3nou.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/problema malloc3nou/bin/Debug/problema malloc3nou.exe -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/problema fisier 3 c++/problema fisier 3 c++.depend: -------------------------------------------------------------------------------- 1 | # depslib dependency file v1.0 2 | 1701250896 source:c:\users\student\desktop\dorcea eduard1\problema fisier 3 c++\main.cpp 3 | 4 | 5 | 6 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/AB/problema recursiva 2/bin/Debug/problema recursiva 2.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/AB/problema recursiva 2/bin/Debug/problema recursiva 2.exe -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/problema fisier 3 c++/bin/Debug/problema fisier 3 c++.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/problema fisier 3 c++/bin/Debug/problema fisier 3 c++.exe -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/problema vectori malloc/bin/Debug/problema vectori malloc.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/problema vectori malloc/bin/Debug/problema vectori malloc.exe -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/test cu matrice incercare 2/MATRICE.txt: -------------------------------------------------------------------------------- 1 | n=3 2 | m=3 3 | V[0][0]=1 4 | V[0][1]=2 5 | V[0][2]=3 6 | V[1][0]=4 7 | V[1][1]=5 8 | V[1][2]=6 9 | V[2][0]=7 10 | V[2][1]=8 11 | V[2][2]=9 12 | V[1][0]=4V[2][0]=7V[2][1]=8 -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/test cu matrice/test cu matrice.depend: -------------------------------------------------------------------------------- 1 | # depslib dependency file v1.0 2 | 1703062589 source:c:\users\student\desktop\dorcea eduard1\test cu matrice\main.cpp 3 | 4 | 5 | 6 | 7 | 8 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/test sir caractere.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main() { 6 | char s[50],s1[20]="ANTERIOR",s2[20]="POSTERIOR"; 7 | cin.getline(s, 49); 8 | 9 | 10 | 11 | } 12 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/AB/problema recursivitate 3/bin/Debug/problema recursivitate 3.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/AB/problema recursivitate 3/bin/Debug/problema recursivitate 3.exe -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/PROBLEMA fisier 3/PROBLEMA fisier 3.layout: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/problema vectori malloc/problema vectori malloc.depend: -------------------------------------------------------------------------------- 1 | # depslib dependency file v1.0 2 | 1700037684 source:c:\users\student\desktop\dorcea eduard1\problema vectori malloc\main.c 3 | 4 | 5 | 6 | 7 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/test cu matrice incercare 2/bin/Debug/test cu matrice incercare 2.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/test cu matrice incercare 2/bin/Debug/test cu matrice incercare 2.exe -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/AB/problema interactivitatetrue/bin/Debug/problema interactivitatetrue.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/AB/problema interactivitatetrue/bin/Debug/problema interactivitatetrue.exe -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/cel mai mic div comun recursiv/bin/Debug/cel mai mic div comun recursiv.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/Agent-Orange9two5/LP1-AIA-1/HEAD/Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/cel mai mic div comun recursiv/bin/Debug/cel mai mic div comun recursiv.exe -------------------------------------------------------------------------------- /Laboratoare/Lab 1/problema3.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | void problema3() 6 | { 7 | float c, f; 8 | 9 | cout<<"Grade in Fahrenheit: "; 10 | cin>>f; 11 | 12 | c = (5.0 / 9.0) * (f - 32); 13 | 14 | cout<<"Grade in Celsius: "< 4 | 5 | 6 | 7 | 8 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/grade/main.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | float f,c; 8 | cout<<"Grade Farenheit: "; 9 | cin>>f; 10 | c=(5.0/9.0)*(f-32); 11 | cout<<"Grade Celsius: "< 2 | 3 | using namespace std; 4 | 5 | void problema1() 6 | { 7 | char nume, prenume; 8 | cout<<"Initiala nume: "; 9 | cin>>nume; 10 | cout<<"Initiala prenume: "; 11 | cin>>prenume; 12 | cout << "Salut, " << nume<< " "< 2 | using namespace std; 3 | int main(){ 4 | int n,v[10],i,s=0; 5 | cin>>n; 6 | for(i=0;i<0;i++) 7 | cin>>v[i]; 8 | while(n!=0){ 9 | 10 | 11 | if(n%2==0) 12 | s=s+n%10; 13 | n=n/10;} 14 | cout< 2 | using namespace std; 3 | 4 | int permutari(int n){ 5 | 6 | if(n==1||n==0) 7 | return 1; 8 | 9 | return n*=permutari(n-1);} 10 | 11 | int main(){ 12 | 13 | int x; 14 | cout<<"Permutari de: "; 15 | cin>>x; 16 | cout< 2 | 3 | using namespace std; 4 | 5 | void problema3() 6 | { 7 | float c, f; 8 | cout<<"Grade in Fahrenheit: "; 9 | cin>>f; 10 | 11 | c = (5.0 / 9.0) * (f - 32); 12 | cout<<"Grade in Celsius: "<> c; 14 | 15 | return 0; 16 | } 17 | -------------------------------------------------------------------------------- /Grupa 2/Stefan_Razvan_Grupa 2/Extra/#11 - Vocale.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main(){ 6 | char s[256], voc[]="aeiou"; 7 | int i; 8 | 9 | cin.get(s, 255); 10 | for(i=0; i 2 | 3 | using namespace std; 4 | 5 | void problema1() 6 | { 7 | char nume,prenume; 8 | cout<<"Initiala nume: "; 9 | cin>>nume; 10 | cout<<"Initiala prenume: "; 11 | cin>>prenume; 12 | cout<<"Salut, "< 2 | 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | int a[10]={1,2,3,4,5,6,7,8,9,10},s=0,i; 8 | for(i=0;i<10;i++) 9 | { 10 | if(a[i]%2==1) 11 | s=s=a[i]; 12 | if(a[i]%2==0) 13 | cout<=0;i--) 15 | cout< 2 | #include 3 | using namespace std; 4 | 5 | int main(){ 6 | char s[256]; 7 | int i; 8 | 9 | cin.getline(s, 255); 10 | for(i=0;i 2 | using namespace std; 3 | 4 | void fib(int n,int a,int b) 5 | { 6 | if(n==2) 7 | return; 8 | else 9 | { cout<>n; 17 | cout<<"1"<<" 1 "; 18 | fib(n,1,1); 19 | return 0; 20 | } 21 | -------------------------------------------------------------------------------- /Grupa 2/Gheorghe_Alin_g2/lab/lab9fibonaccirecursiv.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | void fib(int n,int a,int b) 5 | { 6 | if(n==2) return; 7 | else{ 8 | cout<>n; 17 | cout<<"1"<<" 1 "; 18 | fib(n,1,1); 19 | return 0; 20 | } 21 | -------------------------------------------------------------------------------- /Grupa 1/Tamasag_Irina_grupa1/laborator/lab9ex2: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | int fa(int); 5 | int fb(int); 6 | int fa(int n){ 7 | if(n<=1) 8 | return 1; 9 | else return n*fb(n-1); 10 | } 11 | int fb(int n){ 12 | if(n<=1) 13 | return 1; 14 | else return n*fa(n-1); 15 | } 16 | int main() 17 | { 18 | int num=5; 19 | cout< 2 | 3 | using namespace std; 4 | void fib (int n, int a, int b) 5 | { 6 | if(n==2) 7 | return; 8 | else 9 | { 10 | cout<> n; 19 | cout << "1" <<" 1 "; 20 | fib (n,1,1); 21 | return 0; 22 | } 23 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/2.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | int l,L,a=0,p=0; 8 | cout<<"Lungime: "; 9 | cin>>L; 10 | cout<<"Latime: "; 11 | cin>>l; 12 | p=2*(L+l); 13 | cout<<"Perimetrul este: "< 2 | using namespace std; 3 | 4 | void fib(int n,int a,int b) 5 | { 6 | if(n==2) 7 | return; 8 | else 9 | { cout<>n; 17 | cout<<"1"<<" 1 "; 18 | fib(n,1,1); 19 | return 0; 20 | } 21 | -------------------------------------------------------------------------------- /Grupa 2/Stefan_Razvan_Grupa 2/Extra/#1456 - Cuvant.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main(){ 6 | char s[256],voc[]="aeou"; 7 | int i, ok=0; 8 | 9 | cin>>s; 10 | for(i=0;i 2 | 3 | using namespace std; 4 | 5 | void fibo(int n) 6 | { 7 | int a=1,b=1; 8 | cout< 2 | #include 3 | //sa se aloce 4 variabile de tip int si sa se livreze memoria corespunzator 4 | using namespace std; 5 | 6 | 7 | int main() 8 | { 9 | int a,b,c,d,*p1,*p2,*p3,*p4; 10 | *p1=malloc(a*sizeof(int)); 11 | *p2=malloc(b*sizeof(int)); 12 | *p3=malloc(c*sizeof(int)); 13 | } 14 | -------------------------------------------------------------------------------- /Grupa 2/Stefan_Razvan_Grupa 2/Extra/#12 - Initiale.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main(){ 6 | char s[256]; 7 | int i; 8 | 9 | cin.getline(s, 255); 10 | s[0]-=32; 11 | s[strlen(s)-1]-=32; 12 | for(i=1; i 2 | #include 3 | using namespace std; 4 | int main(){ 5 | fstream fp("SumaPare.txt"); 6 | int a[50], i, n, s = 0; 7 | cin >> n; 8 | for(i = 0; i < n; i++) 9 | { cin >> a[i]; 10 | if(a[i] % 2 == 0) 11 | s += a[i]; 12 | } 13 | fp << s; 14 | 15 | return 0; 16 | } 17 | -------------------------------------------------------------------------------- /Grupa 2/Balan_Bianca_GR2/lab4.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | int v[10],s=0,i,np=0,inv; 8 | for(i=0;i<10;i++) 9 | { 10 | cin>>v[i]; 11 | if(v[i]%2==1) 12 | s=s+v[i]; 13 | else 14 | cout<=0;i--) 19 | cout< 2 | using namespace std; 3 | 4 | int fa(int); 5 | int fb(int); 6 | int fa(int n){ 7 | if (n<=1) 8 | return 1; 9 | else 10 | return n*fb(n-1); 11 | } 12 | int fb(int n){ 13 | if(n<=1) 14 | return 1; 15 | else 16 | return n*fa(n-1); 17 | } 18 | int main(){ 19 | int num=5; 20 | cout< 2 | using namespace std; 3 | int a=1,b=1,c; 4 | 5 | int fibo(int n){ 6 | 7 | while(n){ 8 | c=a+b; 9 | a=b; 10 | b=c; 11 | n--; 12 | cout<>n; 19 | cout<<1<<" "<<1<<" "; 20 | fibo(n-2); 21 | 22 | return 0; 23 | } 24 | -------------------------------------------------------------------------------- /Grupa 1/Arsenie_Vlad_GR1/LucruLaborator/SirFibonacci_recursiv.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | void fib(int n, int x, int y) 5 | { 6 | if(n) 7 | { 8 | cout<>n; 17 | x=y=1; 18 | cout< 2 | using namespace std; 3 | 4 | void fib(int n, int a, int b) 5 | { 6 | if(n==2) 7 | return; 8 | else 9 | { cout<>n; 18 | cout<<"1"<<" 1 "; 19 | fib(n,1,1); 20 | return 0; 21 | } 22 | -------------------------------------------------------------------------------- /Grupa 2/Pufulete_Andreea_grupa2/Laboratoare/prob2 recursivitate.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | int fa(int); 5 | int fb(int); 6 | int fa(int n){ 7 | if(n<=1)return 1; 8 | else 9 | return n*fb(n-1); 10 | } 11 | int fb(int n){ 12 | if(n<=1) return 1; 13 | else return n*fa(n-1); 14 | 15 | } 16 | int main() 17 | { 18 | int num=5; 19 | cout << fa(num); 20 | return 0; 21 | } 22 | -------------------------------------------------------------------------------- /Laboratoare/laborator 9/p2.c: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int fa(int); 4 | int fb(int); 5 | int fa(int n){ 6 | if(n<=1) 7 | return 1; 8 | else 9 | return n*fb(n-1); 10 | } 11 | int fb(int n){ 12 | if(n<=1) 13 | return 1; 14 | else 15 | return n*fa(n-1); 16 | } 17 | int main(){ 18 | int num=5; 19 | cout<>n; 10 | for(int i=0; i>a; 12 | f<>a; 18 | cout< 3 | 4 | using namespace std; 5 | 6 | int main() 7 | { 8 | int l,L,a=0,p=0; 9 | cout<<"Lungime: "; 10 | cin>>L; 11 | cout<<"Latime: "; 12 | cin>>l; 13 | p=2*(L+l); 14 | cout<<"Perimetrul este: "< 2 | 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | int v[10], s=0, i; 8 | for (i=0; i<=9; i++){ 9 | cin>>v[i]; 10 | 11 | if (v[i]%2==1) 12 | s= s+v[i]; 13 | 14 | if (v[i]%2==0) 15 | cout<<"nr par "<=0; i--) 19 | cout< 2 | using namespace std; 3 | int fa(int); 4 | int fb(int); 5 | int fa(int n) 6 | { 7 | if(n<=1) 8 | return 1; 9 | return n*fb(n-1); 10 | } 11 | int fb(int n) 12 | { 13 | if(n<=1) 14 | return 1; 15 | else 16 | return n*fa(n-1); 17 | } 18 | int main() 19 | { 20 | int num=5; 21 | cout< 2 | 3 | using namespace std; 4 | int fa(int); 5 | int fb(int); 6 | int fa(int n){ 7 | if (n<=1) 8 | return 1; 9 | else 10 | return n*fb(n-1); 11 | } 12 | int fb (int n){ 13 | if (n<=1) 14 | return 1; 15 | else 16 | return n*fa(n-1); 17 | } 18 | int main() 19 | { int num; 20 | cin >> num; 21 | cout << fa(num); 22 | return 0; 23 | } 24 | 25 | -------------------------------------------------------------------------------- /Laboratoare/Lab 7/tip_enum.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | void main(void) 4 | { 5 | enum zile_saptam {luni = 10, marti, miercuri, joi, vineri}; 6 | enum zile_saptam zi_lucru; 7 | for (zi_lucru = luni; zi_lucru <= vineri; zi_lucru++) 8 | { 9 | printf("%d ", zi_lucru); 10 | } 11 | zi_lucru = miercuri; 12 | printf ("\nValoarea variabilei de tip enum \"zi_lucru\" este %d" , zi_lucru); 13 | } 14 | -------------------------------------------------------------------------------- /Grupa 2/Chitu_Gabriela_GR2/Laboratoare/lab9_2.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int fa(int) ; 6 | int fb(int) ; 7 | int fa(int n) 8 | { 9 | if(n<=1) 10 | return 1; 11 | else 12 | return n*fb(n-1); 13 | 14 | } 15 | int fb(int n) { 16 | if(n<=1) 17 | return 1; 18 | else 19 | return n*fa(n-1); 20 | 21 | } 22 | int main() { 23 | int num=5; 24 | cout< 2 | using namespace std; 3 | 4 | void fib(int n, int a, int b) 5 | { 6 | if (n == 2) 7 | return; 8 | else 9 | { 10 | cout << a + b << " "; 11 | return fib(n - 1, b, a + b); 12 | } 13 | } 14 | int main() 15 | { 16 | int n; 17 | cin >> n; 18 | cout << "1" << " 1 "; 19 | fib(n, 1, 1); 20 | return 0; 21 | } 22 | -------------------------------------------------------------------------------- /Grupa 2/Balan_Bianca_GR2/laboratoare/lab4_2.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | //n=4.sa se afiseze elementele de pe diag principala de sub diagonala pricipala suma nr de 3 cifre 5 | int main() 6 | { 7 | int a[4][4],n,i,j; 8 | for(i=0;i<4;i++) 9 | for(j=0;j<4;j++) 10 | cin>>a[i][j]; 11 | for(i=0;i<4;i++) 12 | for(j=1;j<4;j++) 13 | { 14 | if(i==j) 15 | cout< 2 | using namespace std; 3 | int fa(int); 4 | int fb(int); 5 | int fa (int n) 6 | { 7 | if(n<=1) 8 | 9 | return 1; 10 | else return n*fb(n-1); 11 | } 12 | int fb(int n){ 13 | if(n<=1) 14 | return 1; 15 | else return n*fa(n-1); 16 | } 2 17 | int main() 18 | { 19 | int num=5; 20 | cout< 2 | 3 | void main(void) 4 | { 5 | enum zile_saptam {luni = 10, marti, miercuri, joi, vineri}; 6 | enum zile_saptam zi_lucru; 7 | for (zi_lucru = luni; zi_lucru <= vineri; zi_lucru++) 8 | { 9 | printf("%d ", zi_lucru); 10 | } 11 | zi_lucru = miercuri; 12 | printf ("\nValoarea variabilei de tip enum \"zi_lucru\" este %d" , zi_lucru); 13 | } 14 | -------------------------------------------------------------------------------- /Grupa 2/Toloanca_Ioana_Gr2/Laboratoare/lab13: -------------------------------------------------------------------------------- 1 | //Problema stelute 2 | #include 3 | #include 4 | using namespace std; 5 | int main() 6 | {int n; 7 | char a[100][100]; 8 | cin >> n; 9 | for(int i = 1; i <= n; i++) 10 | for(int j = 1; j <= i; j++) { a[i][j] = '*'; } 11 | for(int i = 1; i <= n; i++) { 12 | for(int j = 1; j <= i; j++) { cout << a[i][j] << " "; } 13 | cout << endl; } 14 | return 0; } 15 | -------------------------------------------------------------------------------- /Grupa 1/Badea_George_Catalin_Grupa_1/Tema 10/Tema 10.layout: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | -------------------------------------------------------------------------------- /Grupa 1/Ciociu_Alexia_grupa1/Teme/pb1.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | int v[100],n,i,s; 5 | int main() 6 | {ofstream f("Sumepare.txt"); 7 | cout<<"Introduceti numarul de elemente: "; 8 | cin>>n; 9 | cout<>v[i]; 11 | for(i=0;i 2 | 3 | using namespace std; 4 | int fa(int); 5 | int fb(int); 6 | int fa(int n){ 7 | if(n<=1) 8 | return 1; 9 | else 10 | return n*fb(n-1); 11 | } 12 | int fb(int n){ 13 | if(n<=1) 14 | return 1; 15 | else 16 | return n*fa(n-1); 17 | } 18 | int main() 19 | { 20 | int num=5; 21 | cout< 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | -------------------------------------------------------------------------------- /Grupa 1/Bucura_Bogdan_Gr1/laborator4.cpp: -------------------------------------------------------------------------------- 1 | 2 | #include 3 | using namespace std; 4 | int i,s,k; 5 | int main(){ 6 | int v[]={1,2,3,4,5,6,7,8,9,10}; 7 | for(i=0;i<=9;i++){ 8 | if (v[i]%2==1) 9 | s=s+v[i]; 10 | } 11 | for(i=9;i>=0;i--) 12 | cout< 2 | 3 | using namespace std; 4 | 5 | int main() { 6 | 7 | int num = 0; 8 | int count = 1; 9 | 10 | cout << "Introdu numarul : " << endl; 11 | cin >> num; 12 | 13 | while (num > 9) { 14 | 15 | num = num / 10; 16 | count++; 17 | 18 | } 19 | 20 | cout << "Numarul are lungimea : " << count << endl; 21 | 22 | return 0; 23 | } 24 | -------------------------------------------------------------------------------- /Grupa 1/Ene_Ionut_Grupa1/Laborator/Lab9P2.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int fa(int); 6 | int fb(int); 7 | int fa(int n){ 8 | if (n<=1) 9 | return 1; 10 | else 11 | return n*fb(n-1); 12 | } 13 | int fb(int n){ 14 | if(n<=1) 15 | return 1; 16 | else 17 | return n*fa(n-1); 18 | } 19 | int main() 20 | { 21 | int num=5; 22 | cout< 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | -------------------------------------------------------------------------------- /Grupa 2/Ghetau_Cristian_G2/Laboratoare/lab9pb2.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int fa(int); 4 | int fb(int); 5 | int fa(int n){ 6 | if(n<=1) 7 | return 1; 8 | else 9 | return n*fb(n-1); 10 | } 11 | int fb(int n){ 12 | if(n<=1) 13 | return 1; 14 | else 15 | return n*fa(n-1); 16 | } 17 | int main() { 18 | int num=5; 19 | cout< 2 | 3 | using namespace std; 4 | 5 | int fa(int); 6 | int fb(int); 7 | int fa(int n) { 8 | if (n<=1) return 1; 9 | else return n*fb(n-1); 10 | } 11 | int fb(int n){ 12 | if (n<=1) return 1; 13 | else return n*fa(n-1); 14 | 15 | } 16 | int main() 17 | { 18 | int num=5; 19 | cout<< fa(num); 20 | return 0; 21 | } 22 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/operatii/operatii.layout: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | -------------------------------------------------------------------------------- /Grupa 2/Gheorghe_Alin_g2/lab/lab9ex2.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | int fa(int); 5 | int fb(int); 6 | int fa(int n){ 7 | if(n<=1) 8 | return 1; 9 | else 10 | return n*fb(n-1); 11 | } 12 | int fb(int n) 13 | { 14 | if(n<=1) 15 | return 1; 16 | else 17 | return n*fa(n-1); 18 | } 19 | int main() 20 | { 21 | int num=5; 22 | cout< 2 | using namespace std; 3 | int fa(int); 4 | int fb(int); 5 | int fa(int n) 6 | { 7 | if(n<=1) 8 | return 1; 9 | else 10 | return n*fb(n-1); 11 | } 12 | int fb(int n) 13 | { 14 | if(n<=1) 15 | return 1; 16 | else 17 | return n*fa(n-1); 18 | } 19 | int main() 20 | { 21 | int num=5; 22 | cout< 2 | using namespace std; 3 | int fa(int); 4 | int fb(int); 5 | int fa (int n) 6 | { 7 | if(n<=1) 8 | 9 | return 1; 10 | else return n*fb(n-1); 11 | } 12 | int fb(int n){ 13 | if(n<=1) 14 | return 1; 15 | else return n*fa(n-1); 16 | } 2 17 | int main() 18 | { 19 | int num=5; 20 | cout< 2 | #include "problema3.cpp" 3 | #include "problema1.cpp" 4 | #include "problema2.cpp" 5 | 6 | using namespace std; 7 | 8 | int main() 9 | { 10 | int tip; 11 | cout<< "Alegeti tipul de problema:"; 12 | cin >> tip; 13 | 14 | if (tip == 1) 15 | problema1(); 16 | else if (tip == 2) 17 | problema2(); 18 | else if (tip == 3) 19 | problema3(); 20 | return 0; 21 | } 22 | -------------------------------------------------------------------------------- /Laboratoare/Lab 2/sir_fractii_fibonacci.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | void main() 4 | { 5 | long f0=1,f1=1; 6 | long fc; 7 | int i=1,n; 8 | printf("Introduceti numarul de termeni din sirul lui Fibonacci: "); 9 | scanf("%d",&n); 10 | 11 | printf("%ld\n", f0); 12 | printf("%ld\n", f1); 13 | while(i<=n) 14 | { 15 | fc=f0+f1; 16 | f0=f1; 17 | f1=fc; 18 | i++; 19 | 20 | printf("%ld\n", fc); 21 | } 22 | 23 | getch(); 24 | } 25 | -------------------------------------------------------------------------------- /Grupa 1/Ciobanu_Constantin_GR1/Laborator/Lab 9/prog2.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int fa(int); 6 | int fb(int); 7 | int fa(int n) { 8 | 9 | if (n <= 1) return 1; 10 | else return n*fb(n-1); 11 | } 12 | 13 | int fb (int n) { 14 | 15 | if (n <= 1) return 1; 16 | else return n*fa(n-1); 17 | } 18 | 19 | int main () { 20 | 21 | int num = 5; 22 | cout << fa(num) << endl; 23 | 24 | return 0; 25 | } 26 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/AB/1611lab1/1611lab1.layout: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/AB/1611lab2/1611lab2.layout: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/fct grad 2/fct grad 2.layout: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/recuperare/recuperare.layout: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/biblioteca/biblioteca.layout: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/nr de cifre/nr de cifre.layout: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/recuperare 3/recuperare 3.layout: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/sir fibonaci/sir fibonaci.layout: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | -------------------------------------------------------------------------------- /Grupa 2/Stefan_Razvan_Grupa 2/Extra/#972 - Pozitii.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main(){ 6 | char s[256]; 7 | int i,ok=0; 8 | 9 | cin.getline(s, 255); 10 | 11 | for(i=1; i 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/c arie+perimetru/c arie+perimetru.layout: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | -------------------------------------------------------------------------------- /Grupa 2/Margarit_Iustin_Gr2/Laboratoare/lab9/lab9_ex2.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | 5 | int fa(int); 6 | int fb(int); 7 | 8 | int fa(int n ){ 9 | if(n<=1) 10 | return 1; 11 | 12 | else 13 | return n*fb(n-1);} 14 | 15 | int fb(int n) 16 | { 17 | if(n<=1) 18 | return 1; 19 | else 20 | return n*fa(n-1);} 21 | 22 | 23 | int main() 24 | { 25 | int num=5; 26 | cout< 3 | 4 | using namespace std; 5 | 6 | int main() 7 | { 8 | int n,v[10],i,s=0; 9 | cin>>n; 10 | for(i=0;i>v[i]; 13 | if(v[i]%2==1) 14 | s=s+v[i]; 15 | else 16 | cout<=0;i--) 22 | cout< 2 | #include "problema3.cpp" 3 | #include "problema1.cpp" 4 | #include "problema2.cpp" 5 | 6 | using namespace std; 7 | 8 | int main () 9 | { 10 | int tip; 11 | cout<<"Alegeti tipul de problema: "; 12 | cin>> tip; 13 | 14 | if(tip==1) 15 | problema1; 16 | else if(tip==2) 17 | problema2; 18 | else if(tip==3) 19 | problema3; 20 | 21 | return 0; 22 | 23 | } 24 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/AB/sir fibanacci ex/sir fibanacci ex.layout: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/Test matrice.layout: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/probelma fisiere 2/probelma fisiere 2.layout: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/probelma fisiere/probelma fisiere.layout: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/probelme fisere 4/probelme fisere 4.layout: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/problema fisier c/problema fisier c.layout: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/problema malloc3/problema malloc3.layout: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/lab4.cpp: -------------------------------------------------------------------------------- 1 | using namespace std; 2 | 3 | int main() 4 | { 5 | int v[10]= { 1 , 2 ,3 ,4 ,5 ,6 ,7 ,8 ,9 ,10}; 6 | int suma =0; 7 | 8 | for(int i=0 ; i<9 ; i ++){ 9 | if (v[i] % 2!=0){ 10 | suma+= v[i]; 11 | } 12 | if (v[i]%2==0){ 13 | cout<0 ; i --){ 20 | cout << v[i]< 2 | 3 | int main() { 4 | double a, b, c, media = 0; 5 | printf("Notele studentului sunt: \n"); 6 | scanf("%lf %lf %lf", &a, &b, &c); 7 | printf("Media lui este: "); 8 | media = (a + b + c) / 3; 9 | printf("%lf\n", media); 10 | if (media > 6) 11 | printf("Studentul are nota de trecere"); 12 | else 13 | printf("Studentul nu are nota de trecere"); 14 | return 0; 15 | } 16 | -------------------------------------------------------------------------------- /Grupa 2/Vasile_Rares_Stefan_Gr2/Lab4.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int main() 4 | { 5 | int n,v[10],s=0; 6 | cin>>n; 7 | for(int i=0; i>v[i]; 10 | if(v[i]%2) 11 | s=s+v[i]; 12 | if(v[i]%2==0) 13 | cout<=0; i--) 18 | cout< 2 | #include 3 | using namespace std; 4 | // ifstream f("SumaPare.txt"); 5 | ofstream g("SumaPare.txt"); 6 | 7 | int main () 8 | { 9 | int v[100],i,s=0,n; 10 | cin>>n; 11 | for(i=0;i>v[i]; 14 | } 15 | for(i=0;i 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/problema malloc3nou/problema malloc3nou.layout: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/recuperare 3/main.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | FILE *txt; 8 | int i=0,n; 9 | char prop[50][50]; 10 | cout<<"n=";cin>>n; 11 | if ((txt = fopen("DATA.txt", "w")) == NULL); 12 | for (i=0; i>prop[50][i]; 14 | cout< 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | -------------------------------------------------------------------------------- /Grupa 1/Marinescu_Teodora_G1/Laborator_4.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | int n=10; 8 | int v[n], si=0; 9 | cout<<"nr pare :"; 10 | for(int i=0;i=0;i--) cout< 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/problema fisier 3 c++/problema fisier 3 c++.layout: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/problema struct elevi/problema struct elevi.layout: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/problema vectori malloc/problema vectori malloc.layout: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | -------------------------------------------------------------------------------- /Grupa 2/Rusu_Sebastian_Constantin_gr2/Laboratoare/sir_fibonacii.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | void s(int n,int a, int b){ 4 | if(n>=1){ 5 | cout<>n; 15 | if(n<=1){ 16 | cout< 2 | 3 | using namespace std; 4 | int fa(int); 5 | int fb(int); 6 | int fa(int n) 7 | { 8 | if(n <= 1) 9 | return 1; 10 | else 11 | return n * fb(n - 1); 12 | } 13 | int fb(int n) 14 | { 15 | if(n <= 1) 16 | return 1; 17 | else 18 | return n * fa(n - 1); 19 | } 20 | int main() 21 | { 22 | int num = 5; 23 | cout << fa(num); 24 | return 0; 25 | } 26 | -------------------------------------------------------------------------------- /Grupa 1/Sauciuc_Darius_G1/Laborator/Laborator9-pb2.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int fa(int); 6 | int fb(int); 7 | 8 | int fa(int n) 9 | { 10 | if(n <= 1) 11 | return 1; 12 | else 13 | return n * fb(n - 1); 14 | } 15 | int fb(int n) 16 | { 17 | if(n <= 1) 18 | return 1; 19 | else 20 | return n * fa(n - 1); 21 | } 22 | 23 | int main() 24 | { 25 | int num = 5; 26 | cout << fa(num); 27 | return 0; 28 | } 29 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/AB/problema interactivitate/problema interactivitate.layout: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/AB/problema turnuri hanoe/problema turnuri hanoe.layout: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/problema struct malloc/problema struct malloc.layout: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/problema struct malloc2/problema struct malloc2.layout: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | -------------------------------------------------------------------------------- /Grupa 2/Sfetcu_Delia_g2/Teme/temalab2/pr3.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int main(){ 4 | double a, b, c, media = 0; 5 | cout << "Notele studentului sunt: " << endl; 6 | cin >> a >> b >> c; 7 | cout << "Media lui este: "; 8 | media = (a + b + c)/3; 9 | cout << media << endl; 10 | if(media > 6) 11 | cout << "Studentul are nota de trecere"; 12 | else 13 | cout << "Studentul nu are nota de trecere"; 14 | return 0; 15 | } 16 | -------------------------------------------------------------------------------- /Grupa 2/Virnav_Stefan_GR2/Laborator/lab4.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | int v[10],s=0,i; 8 | for(i=0;i<10;i++) 9 | { 10 | cin>>v[i]; 11 | if(v[i]%2==1) 12 | s+=v[i]; 13 | else 14 | cout<=0;i--) 17 | cout< 2 | 3 | void problema2() 4 | { 5 | float lungime, latime; 6 | float a, p; 7 | 8 | printf("Lungimea dreptunghiului: "); 9 | scanf("%f", &lungime); 10 | printf("Latimea dreptunghiului: "); 11 | scanf("%f", &latime); 12 | 13 | a = lungime * latime; 14 | p = 2 * (lungime + latime); 15 | 16 | printf("Aria drepunghiului este: %0.2f\n", a); 17 | printf("Perimetrul drepunghiului este: %0.2f\n", p); 18 | } 19 | -------------------------------------------------------------------------------- /Grupa 1/Tamasag_Irina_grupa1/Teme/exlab12: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int CMMDC (int a, int b) 6 | { 7 | if(b!=0) 8 | return CMMDC(b,a%b); 9 | else 10 | return a; 11 | } 12 | int main() 13 | { 14 | int n1,n2; 15 | cout<<"Introduceti primul numar: "; 16 | cin>>n1; 17 | cout<<"Introduceti al doilea numar: "; 18 | cin>>n2; 19 | cout<<"Cel mai mic divivor comun al numerelor este: "< 2 | 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | int v[]={1,2,3,4,5,6,7,8,9,10},i,s=0; 8 | for(i=0;i<=9;i++) 9 | { 10 | if(v[i]%2==1) 11 | s=s+v[i]; 12 | } 13 | for(i=9;i>=0;i--) 14 | cout< 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/sir fibonaci/main.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | int f0=1,f1=1; 8 | long fc; 9 | int i=1,n; 10 | cout<<"Nr de termeni din sirul fiboncci:";cin>>n; 11 | cout< 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | -------------------------------------------------------------------------------- /Grupa 2/Rusu_Denice_Grupa2/Laboratoare/Lab9/problema2.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | int fa(int); 5 | int fb(int); 6 | int fa(int n) 7 | { 8 | if (n <= 1) 9 | { 10 | return 1; 11 | } 12 | else 13 | { 14 | return n * fb(n - 1); 15 | } 16 | } 17 | int fb(int n) 18 | { 19 | if (n <= 1) return 1; 20 | else return n * fa(n - 1); 21 | } 22 | int main() 23 | { 24 | int num = 5; 25 | cout << fa(num); 26 | return 0; 27 | } 28 | -------------------------------------------------------------------------------- /Grupa 1/Tamasag_Irina_grupa1/Teme/ex.test/p1: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | ofstream fout("SumaPare.txt"); 5 | int main() 6 | { 7 | int v[100],n,i, s=0; 8 | cout<<"Marimea vect este: "; 9 | cin>>n; 10 | cout<>v[i]; 14 | if(v[i]%2==0) 15 | s+=v[i]; 16 | } 17 | fout<<"Suma numerelor pare este:"<<" "< 2 | 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | unsigned nr = 0; 8 | long x, x_init; 9 | cout<<"Introduceti un numar natural: "; 10 | cin>> x; 11 | x_init = x; 12 | 13 | if(x) 14 | { 15 | while(x) 16 | { 17 | x/=10; nr ++; 18 | } 19 | cout<<"Numarul natural" << x_init << "are" << nr << "cifre."; 20 | } 21 | else 22 | cout<<"Numarul natural 0 are o cifra."; 23 | return 0; 24 | } 25 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/AB/problema interactivitatetrue/problema interactivitatetrue.layout: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/cel mai mic div comun recursiv/cel mai mic div comun recursiv.layout: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | -------------------------------------------------------------------------------- /Grupa 2/Mircea_Diana_Grupa2/laboratoare/lab_4/vectori.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int main() 4 | { 5 | int v[10],i,s=0,n; 6 | cin>>n; 7 | for(i=0; i>v[i]; 10 | if(v[i]%2==1) 11 | s=s+v[i]; 12 | else 13 | cout< 3 | #include 4 | using namespace std; 5 | 6 | int main() { 7 | 8 | char s[51],s1[20]="ANTERIOR",s2[20]="POSTERIOR"; 9 | cin.getline(s, 50); //mama 10 | strcat(s1, s); //ANTERIORmama 11 | cout< 2 | 3 | using namespace std; 4 | 5 | int main() 6 | { int v[10],i,s=0,n; 7 | cin>>n; 8 | for(i=1;i<=n;i++) 9 | cin>>v[i]; 10 | for(i=1;i<=n;i++) 11 | if(v[i]%2==1) s=s+v[i]; 12 | cout<<"suma numerelor impare este:"<=1;i--)cout< 2 | #include 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | char s1[20]="ANTERIOR",s2[20]="POSTERIOR", s3[51]; 8 | 9 | cout<<"Sirul 1 este: "<>s3; 13 | strcat(s1,s3); 14 | strcat(s1,s2+4); 15 | 16 | cout<<"Sirul complet: "< 2 | 3 | using namespace std; 4 | int v[10]={1,2,3,4,5,6,7,8,9,10},n,i,sumimp; 5 | int main() 6 | { 7 | n=10; 8 | for(i=0;i=0;i--) 21 | cout< 2 | 3 | using namespace std; 4 | void toH(int n, char sr, char aux, char dest){ 5 | if (n == 1){ 6 | cout<<"Move disk 1 from "< 2 | using namespace std; 3 | 4 | 5 | int main() 6 | { 7 | /* 2. Scrieti un program care cere utilizatorului un numar natural intreg si si va determina numarul de cifre al acestuia. */ 8 | 9 | int ok=0,b; 10 | cout << " Introduceti un numar intreg: "; 11 | cin >> b ; 12 | while(b>0) 13 | { 14 | b /=10; 15 | ++ok; 16 | } 17 | cout << "Numarul are " << ok << " cifre."; 18 | return 0; 19 | } 20 | 21 | -------------------------------------------------------------------------------- /Grupa 2/Blinzeanu_Mihai_G2/lab4.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | int i,s=0; 8 | int v[]={1,2,3,4,5,6,7,8,9,10}; 9 | for(i=0;i<=9;i++) 10 | { 11 | if(v[i]%2==1) 12 | s=s+v[i]; 13 | } 14 | cout<<"suma nr impare este "< 2 | using namespace std; 3 | int fa(int); 4 | int fb(int); 5 | int fa(int n){ 6 | if(n<=1) 7 | return 1; 8 | else 9 | return n*fb(n-1); 10 | } 11 | int fb(int n){ 12 | if (n<=1) 13 | return 1; 14 | else 15 | return n*fa(n-1); 16 | } 17 | int main() 18 | { 19 | int num; 20 | cout<<"Introdu numarul: "; cin>>num; 21 | cout<<"Factorial din "< 2 | using namespace std; 3 | 4 | int main() 5 | { 6 | int v[10] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; 7 | int s = 0; 8 | for (auto i: v) 9 | if (i % 2 != 0) 10 | s += i; 11 | cout << "Suma nr impare: " << s << "\n" << "Nr pare: "; 12 | for (auto i: v) 13 | if (i % 2 == 0) 14 | cout << i << " "; 15 | cout << "\nVectorul inversat: "; 16 | for (int i = 9; i >= 0; i--) 17 | cout << v[i] << " "; 18 | } 19 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/c arie+perimetru/main.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | float lungime,latime,a,p; 6 | printf("Lungimea dreptunghiuui: "); 7 | scanf("%f", &lungime); 8 | printf("Latimea dreptunghiului: "); 9 | scanf("%f", &latime); 10 | 11 | a=lungime * latime; 12 | p=2*(lungime + latime); 13 | 14 | printf("Aria dreptunghiului este: %0.4f/n", a); 15 | printf("Perimetrul dreptunghiului este: %0.3f/n", p); 16 | return 0; 17 | } 18 | -------------------------------------------------------------------------------- /Grupa 2/Bektas_Denis_G2/Laboratoare/lab.cpp: -------------------------------------------------------------------------------- 1 | /* matrice patratica 4/4 2 | sa se afiseze elem de pe diag principala, toate elem de sub diagonala secundara, suma tuturor elem de 3 cifre*/ 3 | 4 | #include 5 | 6 | using namespace std; 7 | 8 | int main() 9 | { 10 | int a[10][10],n,v[100],i,j,s=0; 11 | cout<<"Cate linii/coloane va avea matricea patratica: "; 12 | cin>>n; 13 | cout<<"Citim matricea patratica: "<>a[i][j]; 16 | cout< 2 | #include 3 | using namespace std; 4 | 5 | double cotan(double); 6 | 7 | int main() 8 | { 9 | int i; 10 | double x; 11 | double(*func_trig[])(double)={sin,cos,tan,cotan}; 12 | cout <<" Nr Sinus Cosinus Tan Cotan"; 13 | for(x=0.01;x<=M_PI;x+=0.1) 14 | {cout< 2 | 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | int nrcif,cif; 8 | cout<<"Cifra este: "; 9 | cin>>cif; 10 | cout<=9) { 15 | cif=cif/10; 16 | nrcif++; 17 | } 18 | } 19 | else cout<<"Nr are 0 cifre"; 20 | if (cif<9 & cif!=0) cout<<"Nr are "< 2 | 3 | using namespace std; 4 | 5 | int fa(int); 6 | int fb(int); 7 | int fa(int n) 8 | { 9 | if(n<=1) 10 | return 1; 11 | else return n*fb(n-1); 12 | } 13 | int fb(int n) 14 | { 15 | if(n<=1) 16 | return 1; 17 | else return n*fa(n-1); 18 | } 19 | int main() 20 | { 21 | int num=5; 22 | cout< 3 | 4 | using namespace std; 5 | 6 | int main() 7 | { 8 | int v[10]= {1 , 2 , 3 , 4, 5, 6 ,7 ,8 , 9 , 10 } ; 9 | int suma=0; 10 | for ( int i=0 ; i<10 ; i++){ 11 | if (v[i]%2 != 0 ){ 12 | suma += v[i] ; 13 | } 14 | 15 | if (v[i]%2 ==0){ 16 | cout<< v[i] << endl; 17 | } 18 | 19 | } 20 | cout<< suma <=0; i--){ 22 | cout < 2 | #include 3 | using namespace std; 4 | 5 | double cotan(double); 6 | 7 | int main() 8 | { 9 | int i; 10 | double x; 11 | double(*func_trig[])(double)={sin,cos,tan,cotan}; 12 | cout <<" Nr Sinus Cosinus Tan Cotan"; 13 | for(x=0.01;x<=M_PI;x+=0.1) 14 | {cout< 2 | 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | /* 2. Scrieti un program care cere utilizatorului un numar natural intreg si si va determina numarul de cifre al acestuia. */ 8 | 9 | int a,ok=0; 10 | cout << " Introduceti un numar intreg: "; 11 | cin >> a ; 12 | while(a > 0) 13 | { 14 | a /=10; 15 | ok++; 16 | } 17 | cout << "Numarul are " << ok << " cifre."; 18 | return 0; 19 | } 20 | -------------------------------------------------------------------------------- /Grupa 2/Suciu_Andrei_Grupa2/lab4.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int main() 6 | { int v[10]={ 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 , 10 }; 7 | int suma=0; 8 | for(int i=0 ; i<10 ; i++){ 9 | if (v[i]%2 !=0){ 10 | suma +=v[i]; 11 | } 12 | 13 | if(v[i]%2 ==0){ 14 | cout<=0 ; i--){ 21 | cout < 2 | #include 3 | using namespace std; 4 | 5 | int main() { 6 | double a,b,c; 7 | cout<<"Nota 1:"; 8 | cin>>a; 9 | cout<<"Nota 2:"; 10 | cin>>b; 11 | cout<<"Nota 3:"; 12 | cin>>c; 13 | 14 | double media = (a + b + c) / 3; 15 | 16 | if (media >= 6){ 17 | cout<<"Studentul are nota de trecere: "< 2 | 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | int v[10], i , s; 8 | 9 | for(int i=0; i<=10; i++) { 10 | cin>>v[i]; 11 | if(v[i]%2!=0) s=s+v[i]; 12 | } 13 | cout<<"Suma numerelor impare este:"< 2 | #include 3 | using namespace std; 4 | int main() { 5 | int v[]={1,2,3,4,5,6,7,8,9,10}, sumimp,i; 6 | cout<<"nr pare:"<<" "; 7 | for (i = 0; i < 10; i++) { 8 | if (v[i] % 2 == 1) { 9 | sumimp = v[i] + sumimp; 10 | } 11 | if (v[i] % 2 == 0) { 12 | cout << v[i] << " "; 13 | } 14 | } 15 | cout<<'\n'; 16 | cout << "suma nr impare:" << sumimp<<'\n'; 17 | cout << "vector inversat:"; 18 | for (i = 9;i >= 0; i--) { 19 | cout << v[i] << " "; 20 | } 21 | } 22 | -------------------------------------------------------------------------------- /Laboratoare/Lab 2/main.cpp: -------------------------------------------------------------------------------- 1 | //problema 2 2 | #include 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | unsigned nr =0; 8 | long x, x_init; 9 | cout << "Introduceti un numar natural:"; 10 | cin >> x; 11 | x_init=x; 12 | if (x) 13 | { 14 | while (x) 15 | { 16 | x/=10; nr++; 17 | } 18 | cout << "Numarul natural " << x_init << " are " << nr << " cifre."; 19 | } 20 | else 21 | cout << "Numarul natural 0 are o cifra."; 22 | return 0; 23 | } 24 | -------------------------------------------------------------------------------- /Grupa 1/Ciobanu_Constantin_GR1/Teme/Tema 2/ex2.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | 4 | int main() { 5 | 6 | double a, b, c, sum, med; 7 | 8 | printf("Notele studentului: \n"); 9 | scanf("%2lf", &a); 10 | scanf("%2lf", &b); 11 | scanf("%2lf", &c); 12 | 13 | sum = a + b + c; 14 | med = sum / 3; 15 | 16 | if (med >= 6) { 17 | printf("Studentul are nota de trecere: %f\n", med); 18 | } else { 19 | printf("Studentul nu are nota de trecere: %f\n", med); 20 | } 21 | 22 | return 0; 23 | } 24 | -------------------------------------------------------------------------------- /Grupa 2/Blinzeanu_Mihai_G2/teme/exemple/pb1.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | int main() 5 | { 6 | ofstream f("Sumapare.txt"); 7 | int n,v[100],s=0,i; 8 | cout<<"Introduceti dimensiunea vectorului: "; 9 | cin>>n; 10 | for(int i=0;i>v[i]; 12 | for(int i=0;i 2 | #include 3 | 4 | void problema2() 5 | { 6 | float lungime, latime; 7 | float a , p; 8 | 9 | printf("Lungimea dreptunghiului este: "); 10 | scanf("%f", &lungime); 11 | printf("Latimea dreptunghiului este: "); 12 | scanf("%f", &latime); 13 | 14 | a = lungime * latime; 15 | p = 2 * (lungime + latime); 16 | 17 | printf("Aria dreptunghiului este: %0.2f\n", a); 18 | printf("Perimetrul dreptunghiului este: %0.2f\n", p); 19 | } 20 | -------------------------------------------------------------------------------- /Grupa 2/Margarit_Iustin_Gr2/Laboratoare/lab9/lab9_ex3.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int i=0; 6 | void foo1(int); 7 | void foo2(int); 8 | 9 | void foo1(int n){ 10 | 11 | if(i<=n){ 12 | cout<>n; 34 | foo1(n); 35 | 36 | return 0; 37 | } 38 | -------------------------------------------------------------------------------- /Grupa 1/Catanea_Bianca_grupa1/Laborator/Laborator 11 - Problema 3 - Ctg.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | double cotan(double); 6 | 7 | int main() 8 | { 9 | int i; 10 | double x; 11 | double(*func_trig[])(double)={sin,cos,tan,cotan}; 12 | cout <<" Nr Sinus Cosinus Tan Cotan"; 13 | for(x=0.01;x<=M_PI;x+=0.1) 14 | {cout< 2 | 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | int v[10],i,s=0; 8 | for(i=0;i<10;i++) 9 | cin>>v[i]; 10 | for(i=0;i<10;i++) 11 | {if(v[i]%2==1) 12 | s+=v[i]; 13 | if(v[i]%2==0) 14 | cout<=0;i--) 19 | cout< 2 | 3 | using namespace std; 4 | int v[10], i, j, s; 5 | int main() 6 | { 7 | for(i=0;i<10;i++) 8 | { 9 | v[i]=i+1; 10 | if(v[i]%2!=0) 11 | s=s+v[i]; 12 | } 13 | cout<<"Suma numerelor impare:"<=0;i--) 22 | cout< 2 | using namespace std; 3 | 4 | int n,a[1001],nr=0,v[1001],i; 5 | 6 | int main() 7 | { 8 | cin>>n; 9 | cin>>v[0]; 10 | a[0]=0; 11 | for(i=1;i>v[i]; 14 | if(v[i]>v[a[nr]]) 15 | { 16 | while(v[a[nr]]=0) nr--; 17 | } 18 | nr++; 19 | a[nr]=i; 20 | } 21 | cout< 2 | using namespace std; 3 | int i = 0; 4 | void foo1(int); 5 | void foo2(int); 6 | void foo1(int n) 7 | { 8 | if(i <= n) 9 | { 10 | 11 | cout << i << " "; 12 | i++; 13 | foo2(n); 14 | } 15 | 16 | } 17 | void foo2(int n) 18 | { 19 | if(i <= n) 20 | { 21 | cout << i << " "; 22 | i++; 23 | foo1(n); 24 | } 25 | 26 | } 27 | 28 | int main() 29 | { 30 | int n; 31 | cin >> n; 32 | foo1(n); 33 | return 0; 34 | } 35 | -------------------------------------------------------------------------------- /Grupa 1/Badea_George_Catalin_Grupa_1/Laborator4.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int main() 4 | { 5 | int v[10],i,s=0,n; 6 | for(i=0;i<10;i++) 7 | cin>>v[i]; 8 | for(i=0;i<10;i++) 9 | { 10 | if(v[i]%2==1) 11 | { 12 | s=s+v[i]; 13 | } 14 | else 15 | { 16 | cout<=0;i--) 21 | cout< 2 | 3 | using namespace std; 4 | int fact_iterativ(int n){ 5 | int fact=1; 6 | for(int i=1;i<=n;i++) 7 | fact*=i; 8 | } 9 | int fact_recursiv(int n){ 10 | if(n==0)return 1; 11 | else return n*fact_recursiv(n-1); 12 | } 13 | int main() 14 | { 15 | int n; 16 | cout<<"Dati N:"; 17 | cin>>n; 18 | cout << "N! cu metoda iterativa este egal cu: " << fact_iterativ(n) << endl; 19 | cout << "N! cu metoda recursiva este egal cu: " << fact_recursiv(n) << endl; 20 | 21 | return 0; 22 | } 23 | -------------------------------------------------------------------------------- /Grupa 2/Gheorghe_Alin_g2/lab/lab9ex3.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | int i=0; 5 | void foo1(int); 6 | void foo2(int); 7 | void foo1(int n) 8 | { 9 | if(i<=n) 10 | { 11 | cout<>n; 31 | foo1(n); 32 | return 0; 33 | } 34 | -------------------------------------------------------------------------------- /Grupa 2/Bektas_Denis_G2/Laboratoare/Lab 9.2.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | int i = 0; 5 | void foo1(int); 6 | void foo2(int); 7 | void foo1 (int n) 8 | { 9 | if (i <= n) 10 | { 11 | cout << i <<" "; 12 | i++; 13 | foo2(n); 14 | } 15 | else 16 | return; 17 | } 18 | void foo2 (int n) 19 | { 20 | if (i <= n) 21 | { 22 | cout << i << " "; 23 | i++; 24 | foo1(n); 25 | } 26 | } 27 | int main(void) 28 | { 29 | int n; 30 | cin >> n; 31 | foo1(n); 32 | return 0; 33 | } 34 | -------------------------------------------------------------------------------- /Grupa 1/Sauca_Victor_Gr1/Lab/laborator4.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int main(){ 4 | int v[]={1,2,3,4,5,6,7,8,9,10},s=0; 5 | for(int i=0;i<10;++i){ 6 | if(v[i]%2)s+=v[i]; 7 | } 8 | cout<<"Suma nr impare: "< 2 | 3 | using namespace std; 4 | int i=0; 5 | void foo1(int); 6 | void foo2(int); 7 | void foo1(int n) 8 | { 9 | if(i<=n) 10 | { 11 | cout<>n; 31 | foo1(n); 32 | return 0; 33 | } 34 | -------------------------------------------------------------------------------- /Grupa 1/Ciobanu_Constantin_GR1/Laborator/Lab 2/fibonacci.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int Fib(int a) { 4 | 5 | if ((a == 0) || (a == 1)) { 6 | return 1; 7 | } else { 8 | return (Fib(a-1) + Fib(a-2)); 9 | } 10 | 11 | } 12 | 13 | int main() { 14 | 15 | int num = 0; 16 | int count = 1; 17 | 18 | printf("Da valoarea : \n"); 19 | scanf("%d", &num); 20 | 21 | for (int i = 0; i < num; i++) { 22 | printf("%d : Valoarea Fibonacci este : %d\n", count, Fib(i)); 23 | count++; 24 | } 25 | 26 | return 0; 27 | } 28 | -------------------------------------------------------------------------------- /Grupa 1/Tutu_Cristian_G1/Laboratoare/Lab 9/ex 3.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | int i=0; 5 | void foo1(int); 6 | void foo2(int); 7 | void foo1(int n) 8 | { 9 | if(i<=n) 10 | { 11 | cout<>n; 31 | foo1(n); 32 | return 0; 33 | } 34 | -------------------------------------------------------------------------------- /Grupa 2/Glont_Tudor_G2/LABORATOARE/15.11.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int functie() 5 | { 6 | static int x=0; 7 | x+=10; 8 | return x; 9 | } 10 | 11 | int functie2() 12 | { 13 | int x=0; 14 | x+=10; 15 | return x; 16 | } 17 | 18 | 19 | void main() 20 | { 21 | int n=10; 22 | printf("fct cu var static: "); 23 | for(int i=0;i 2 | 3 | using namespace std; 4 | 5 | int i=0; 6 | void foo1(int); 7 | void foo2(int); 8 | 9 | void foo1(int n){ 10 | if(i<=n){ 11 | cout<>n; 32 | foo1(n); 33 | return 0; 34 | } 35 | -------------------------------------------------------------------------------- /Grupa 2/Chitu_Gabriela_GR2/Laboratoare/lab9_3.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int i=0; 6 | void foo1(int); 7 | void foo2(int); 8 | void foo1(int n) 9 | { 10 | if(i<=n) 11 | { 12 | cout<< i<< " "; 13 | i++; 14 | foo2(n); 15 | } 16 | else 17 | return; 18 | } 19 | void foo2(int n) 20 | { 21 | if(i<=n) 22 | { 23 | cout<> n; 34 | foo1(n); 35 | return 0; 36 | } 37 | -------------------------------------------------------------------------------- /Grupa 2/Pufulete_Andreea_grupa2/Laboratoare/towerOfHanoi.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | void towrOfHanoi (int n,char source,char auxiliary ,char destination){ 5 | if (n==1){ 6 | cout<<"move disk 1 from"< 2 | using namespace std; 3 | int main() 4 | { 5 | /* 1. Scrieti un program in C++ care va cere sa introduceti de la tastatura initiala numelui si a prenumelui, 6 | il salveaza in doua variabile de tip char nume, prenume si apoi afiseaza mesajul “Salut, nume prenume!” */ 7 | char nume, prenume; 8 | cout << "Initiala nume: "; 9 | cin >> nume; 10 | cout<< "Initiala prenume: "; 11 | cin >> prenume; 12 | cout << "Salut, " << nume << " " << prenume << "!" ; 13 | return 0; 14 | } 15 | -------------------------------------------------------------------------------- /Grupa 2/Virnav_Stefan_GR2/Laborator/lab_9_3.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int i=0; 4 | void foo1(int); 5 | void foo2(int); 6 | void foo1(int n) 7 | { 8 | if (1<=n) 9 | { 10 | cout<>n; 33 | foo1(n); 34 | return 0; 35 | } 36 | -------------------------------------------------------------------------------- /Grupa 1/Ciociu_Alexia_grupa1/laborator/laborator4.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int n,v[10],i,s=0,nrpare=0; 4 | int main() 5 | { cout<<"Introduceti numarul de elemente:"; 6 | cin>>n; 7 | cout<<"Vectorul are elementele:"; 8 | for(i=0;i>v[i]; 9 | for(i=0;i=0;i--) 16 | cout< 3 | 4 | using namespace std; 5 | 6 | int main() 7 | { 8 | int v[10],suma=0,n=10; 9 | cout<<"introduceti v:"; 10 | for(int i=0;i>v[i]; 14 | if(v[i]%2!=0) 15 | suma+=v[i]; 16 | } 17 | cout<<"suma nr impare= "< 2 | #include 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | int v[10]= { 1 , 2 ,3 ,4 ,5 ,6 ,7 ,8 ,9 ,10}; 8 | int suma =0; 9 | 10 | for(int i=0 ; i<9 ; i ++){ 11 | if (v[i] % 2!=0){ 12 | suma+= v[i]; 13 | } 14 | if (v[i]%2==0){ 15 | cout<0 ; i --){ 22 | cout << v[i]< 2 | 3 | using namespace std; 4 | int i=0; 5 | void foo1(int); 6 | void foo2(int); 7 | void foo1(int n){ 8 | if (i<=n){ 9 | cout<>n; 29 | foo1(n); 30 | return 0; 31 | } 32 | -------------------------------------------------------------------------------- /Grupa 2/Suciu_Andrei_Grupa2/teme/suma nr pare vector.cpp: -------------------------------------------------------------------------------- 1 | //suma numerelor pare dintr-un vector// 2 | 3 | #include 4 | 5 | using namespace std; 6 | 7 | int main() 8 | { 9 | int v[101],s=0,i,n; 10 | 11 | cout<<"Introduceti numarul de elemente din vector. "; 12 | cin>>n; 13 | 14 | for(i=0;i>v[i]; 18 | if(v[i]%2==0) 19 | { 20 | s = s + v[i]; 21 | } 22 | } 23 | cout<<"Suma elementelor pare este: "< 2 | 3 | int functie1() 4 | { 5 | static int x=0; 6 | x+= 10; 7 | return x; 8 | } 9 | int functie2() 10 | { 11 | int x=0; 12 | x+= 10; 13 | return x; 14 | } 15 | void main() 16 | { 17 | int n =10; 18 | printf("Functie cu variabila static: "); 19 | for(int i =0 ; i 2 | #include 3 | 4 | using namespace std; 5 | 6 | int numeraAlfabetice(char str[]){ 7 | int numar=0; 8 | for(int i=0; str[i]!='\0'; ++i){ 9 | if(isalpha(str[i])){ 10 | numar++; 11 | } 12 | } 13 | return numar; 14 | } 15 | int main(){ 16 | char input[]="Salut, 123!"; 17 | 18 | int numeraAlfabetice = numeraAlfabetice(input); 19 | cout<<"Numarul de caractere alfabetice:"< 2 | using namespace std; 3 | 4 | int main() 5 | { 6 | int v[10]={1, 2, 3, 4, 5, 6, 7, 8, 9, 10}, p[10], i, j=1, sip=0; 7 | 8 | for (i=1;1<=10;i++){ 9 | if(v[i]%2==0) 10 | {p[j]=v[i];j++;} 11 | else 12 | sip+=v[i]; } 13 | 14 | cout<<"Suma numerelor impare este: "<=1;i--) 23 | cout< 2 | #include 3 | using namespace std; 4 | ofstream fout("SumeDiagonale.txt"); 5 | int main() 6 | { 7 | int v[100][100],n,i,j, s=0; 8 | cout<<"Marimea mat este: "; 9 | cin>>n; 10 | cout<>v[i][j]; 15 | if(i==j || i+j==n-1) 16 | s+=v[i][j];} 17 | } 18 | 19 | fout<<"Suma numerelor de pe diag principala si secundara este:"<<" "< 2 | #include 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | ofstream g("SumaPare.txt"); 8 | int n,suma=0; 9 | cout<<"Introduceti numarul de elemente ale vectorului: "; 10 | cin>>n; 11 | int v[n]; 12 | for(int i=0;i>v[i]; 16 | if(v[i]%2==0) 17 | suma+=v[i]; 18 | } 19 | g< 2 | 3 | int functie1() 4 | { 5 | static int x = 0; 6 | x += 10; 7 | return x; 8 | } 9 | 10 | int functie2(){ 11 | int x = 0; 12 | x += 10; 13 | return x; 14 | } 15 | 16 | int main() 17 | { 18 | int n = 10; 19 | 20 | printf("Functie cu variabila static: "); 21 | for(int i=0 ; i < n ; i++) 22 | { 23 | printf("%d", functie1()); 24 | } 25 | 26 | printf("\nFunctie cu variabila non-static: "); 27 | for (int i=0 ; i 2 | 3 | using namespace std; 4 | 5 | int i=0; 6 | void foo1(int); 7 | void foo2(int); 8 | 9 | void foo1(int n){ 10 | if (i<=n) { 11 | cout<>n; 32 | foo1(n); 33 | return 0; 34 | } 35 | -------------------------------------------------------------------------------- /Grupa 2/Balan_Bianca_GR2/laboratoare/lab9.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int fact_iterativ(int n) 4 | { 5 | int fact = 1; 6 | for (int i = 1; i<=n;i++){ 7 | fact*=i; 8 | } 9 | return fact; 10 | } 11 | 12 | int fact_recursiv(int n){ 13 | if(n==0) 14 | return 1; 15 | else return n*fact_recursiv(n-1); 16 | } 17 | 18 | int main() 19 | { 20 | int n; 21 | cout<<"Dati n: "; 22 | cin>>n; 23 | cout<<"N! cu metoda iterativa este egal cu: "< 2 | 3 | using namespace std; 4 | int fact_iterativ (int n){ 5 | int fact = 1; 6 | for (int i=1; i<=n; i++){ 7 | fact *= i; 8 | } 9 | return fact; 10 | } 11 | int fact_recursiv(int n){ 12 | if (n == 0) 13 | return 1; 14 | else 15 | return n * fact_recursiv(n-1); 16 | 17 | } 18 | int main() 19 | { int n; 20 | cout << "Dati N: "; 21 | cin >> n; 22 | cout << "N! cu metoda iterativa este egal cu: " << fact_iterativ(n) << endl; 23 | cout << "N! cu metoda recursiva este egal cu: "<< fact_recursiv (n); 24 | return 0; 25 | } 26 | -------------------------------------------------------------------------------- /Grupa 2/Glont_Tudor_G2/LABORATOARE/Lab4.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | /*suma nr imp 3 | nr pare 4 | vectorul inversat*/ 5 | using namespace std; 6 | 7 | int main() 8 | { 9 | int v[10], n, i, s=0; 10 | cin>>n; 11 | for(i=1; i<=n;i++) 12 | { 13 | cin>>v[i]; 14 | if(v[i]%2==1) 15 | s=s+v[i]; 16 | } 17 | cout<=1;i--) 25 | cout< 2 | 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | int v[10],si=0; 8 | for(int i=0;i<10;i++) 9 | { 10 | cin>>v[i]; 11 | if(v[i]%2!=0)si+=v[i]; 12 | } 13 | cout<<"Suma nr impare este: "<=0;i--) 21 | { 22 | cout< 2 | #include 3 | 4 | using namespace std; 5 | 6 | int main() 7 | { 8 | int n; 9 | char a[100][100]; 10 | cin >> n; 11 | for(int i = 1; i <= n; i++) 12 | for(int j = 1; j <= i; j++) 13 | { 14 | a[i][j] = '*'; 15 | } 16 | for(int i = 1; i <= n; i++) 17 | { 18 | for(int j = 1; j <= i; j++) 19 | { 20 | cout << a[i][j] << " "; 21 | } 22 | cout << endl; 23 | } 24 | 25 | return 0; 26 | } 27 | 28 | -------------------------------------------------------------------------------- /Grupa 1/Onu_Ada_gr1/Laboratoare/lab4: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | int v[10],n=10, suma=0; 8 | for (int i=0; i>v[i]; 12 | if(v[i]%2!=0) 13 | suma+=v[i]; 14 | 15 | } 16 | cout<<"suma nr impare= "<> n; 12 | for(i = 0; i < n; i++) 13 | { cin >> a[i]; 14 | if(a[i] % 2 == 0) 15 | s += a[i]; 16 | } 17 | cout << "Suma numerelor pare este: " << s << endl; 18 | 19 | file << "Suma numerelor pare este: " << s; 20 | 21 | file.close(); 22 | 23 | return 0; 24 | } 25 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/AB/sir fibanacci ex/main.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | int sirfib1(int n){ 5 | int a, b, c, i; 6 | a=1; 7 | b=1; 8 | if (n<0) { 9 | cout<<"n trebuie mai mare de 0"; 10 | return 0; 11 | } 12 | for(i=0;i>n; 10 | cout<>v[i]; 14 | } 15 | cout< 2 | 3 | int functie1() 4 | { 5 | static int x = 0; 6 | x += 10; 7 | return x; 8 | } 9 | 10 | int functie2(){ 11 | int x = 0; 12 | x += 10; 13 | return x; 14 | } 15 | 16 | int main() 17 | { 18 | int n = 10; 19 | 20 | printf("Functie cu variabila static: "); 21 | for(int i=0 ; i < n ; i++) 22 | { 23 | printf("%d", functie1()); 24 | } 25 | 26 | printf("\nFunctie cu variabila non-static: "); 27 | for (int i=0 ; i 2 | 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | int v[11], s=0, i; 8 | cout<<"Vectorul este: "; 9 | for(i=0;i<10;i++) 10 | cin>>v[i]; 11 | cout<<"Numerele pare sunt: "; 12 | for(i=0;i<10;i++) 13 | { 14 | if(v[i]%2==1) 15 | s+=v[i]; 16 | else 17 | cout<=0;i--) 22 | cout< 2 | #include 3 | 4 | 5 | int functie1() 6 | { 7 | static int x=0; 8 | x+= 10; 9 | return x; 10 | } 11 | int functie2() 12 | { 13 | int x=0; 14 | x+= 10; 15 | return x; 16 | } 17 | 18 | void main() 19 | { 20 | int n = 10; 21 | printf("Functie cu variabila static: "); 22 | for (int i=0; i 2 | using namespace std; 3 | 4 | int i = 0; 5 | void foo1(int); 6 | void foo2(int); 7 | void foo1(int n) 8 | { 9 | if (i <= n) 10 | { 11 | cout<< i << " "; 12 | i++; 13 | foo2(n); 14 | } 15 | else 16 | return; 17 | } 18 | void foo2(int n) 19 | { 20 | if (i <= n) 21 | { 22 | cout<< i << " "; 23 | i++; 24 | foo1(n); 25 | } 26 | else 27 | return; 28 | } 29 | int main (void) 30 | { 31 | int n; 32 | cin>> n; 33 | foo1(n); 34 | return 0; 35 | } 36 | -------------------------------------------------------------------------------- /Grupa 2/Ionita_Radu_Alexandru_G2/Laboratoare/lab4.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() 5 | { 6 | int V[10],i,suimp=0,pare; 7 | for (i=0; i<=9; i++) { 8 | cin>>V[i]; 9 | if (V[i]%2==1) 10 | suimp=suimp+V[i]; 11 | } 12 | cout<=0; i--) { 20 | cout< 2 | #include 3 | int functie1() 4 | { 5 | static int x=0; 6 | x +=10; 7 | return x; 8 | } 9 | 10 | int functie2() 11 | { 12 | int x = 0; 13 | x += 10; 14 | return x; 15 | } 16 | void main() 17 | { 18 | int n = 10; 19 | printf("Functie cu variabila static: "); 20 | for(int i=0;i 3 | #include 4 | using namespace std; 5 | int main(){ 6 | FILE*fp=fopen("abc.txt",w); 7 | char a[i]; 8 | for(int i=0,i<=9,i++){ 9 | cout<<"scrie"; 10 | cin<>a[i]; 18 | cout< 2 | using namespace std; 3 | 4 | void towerOfHanoi(int n,char source, char aux, char dest) 5 | { 6 | if(n == 1) 7 | { 8 | cout<<"Move disk 1 from "<< source << " to " << dest< 2 | 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | /* 3. Scrieți un program care cere utilizatorului să introducă o valoare pentru temperatura măsurată în grade Fahrenheit (F) și 8 | apoi realizează conversia către grade Celsius (C) folosind formula: C = (5 / 9) * (F - 32). */ 9 | 10 | float f,c; 11 | cout << "Introduceti numarul de grade in Fahrenheit: "; 12 | cin >> f; 13 | c = ( 5.0 / 9.0 ) * (f -32); 14 | cout << "Numarul de grade convertit in Celsius este : " << c; 15 | return 0; 16 | } 17 | -------------------------------------------------------------------------------- /Grupa 2/Virnav_Stefan_GR2/Laborator/lab2_prob4_sir_fibonacci.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | void fib(int n) 5 | { 6 | int i=3,a=1,b=1,c; 7 | while(i<=n) 8 | { 9 | c=a+b; 10 | a=b; 11 | b=c; 12 | i++; 13 | cout<>n; 22 | cout << "Sirul Fibonacci: "<< 1 << " " << 1 << " "; 23 | fib(n); 24 | 25 | return 0; 26 | } 27 | 28 | -------------------------------------------------------------------------------- /Grupa 1/Tamasag_Irina_grupa1/Teme/ex.test/e9: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | ofstram o("SumaNumere.txt") 4 | using namespace std; 5 | 6 | int main() 7 | { 8 | int n, i,s=0; 9 | cout<<"Introduceti numarul de elemante din vector:"; 10 | cin>>n; 11 | int* v= new int[n]; 12 | if(v==NULL) 13 | { 14 | cout<<"Alocare dinamica esuata:"; 15 | return -1; 16 | } 17 | cout<<"Introduceti vectorul:"; 18 | for(i=0;i>v[i]; 21 | s+=v[i]; 22 | } 23 | o<<"Suma elementelor din metrice este: "< 2 | #include 3 | 4 | using namespace std; 5 | 6 | void main() 7 | { 8 | long f0=1, f1=1; 9 | long fc; 10 | int i=1,n; 11 | printf("Introduceti numarul de termeni din sirul de fractii: "); 12 | scanf("%d",&n); 13 | //crearea algoritmului Fibonacci 14 | printf("%1d\n", f0); 15 | printf("%1d\n", f1); 16 | while(i<=n) 17 | { 18 | fc=f0+f1; 19 | f0=f1; 20 | f1=fc; 21 | i++; 22 | 23 | printf("%1d\n", fc); 24 | } 25 | 26 | getch(); 27 | } 28 | -------------------------------------------------------------------------------- /Grupa 2/Rusu_Sebastian_Constantin_gr2/Laboratoare/lab10/p2.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | //aloce dinamic 4 variabile int si sa se elibereze memoria corespunzator 5 | int cmmdc(int a1, int b1){ 6 | if(b1==0){ 7 | return a1; 8 | } 9 | else{ 10 | return cmmdc(b1, a1%b1); 11 | } 12 | } 13 | int main() 14 | { 15 | int a,b; 16 | cmmdc(a,b); 17 | cout<<"introduceti numerele: "; 18 | cin>>a>>b; 19 | int r = cmmdc(a,b); 20 | cout<<"Cel mai mic divizor comun pt nr: "< 2 | 3 | using namespace std; 4 | 5 | int i = 0; 6 | 7 | void foo1(int); 8 | void foo2(int); 9 | 10 | void foo1(int n) { 11 | 12 | if (i <= n) { 13 | cout << i << " " << endl; 14 | i++; 15 | foo2(n); 16 | } 17 | } 18 | 19 | void foo2(int n) { 20 | if (i <= n) { 21 | cout << i << " " << endl; 22 | i++; 23 | foo1(n); 24 | } 25 | else 26 | return; 27 | } 28 | 29 | int main(void) { 30 | 31 | int n; 32 | cin >> n; 33 | foo1(n); 34 | 35 | return 0; 36 | } 37 | -------------------------------------------------------------------------------- /Grupa 1/Ene_Ionut_Grupa1/Laborator/Lab9P4.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | void towerOfHanoi(int n, char source, char auxiliary, char destination){ 6 | if(n==1){ 7 | cout<<"Move disk 1 from "< 2 | 3 | using namespace std; 4 | void towerOfHanoi(int n, char source, char auxiliary, char destination) 5 | { 6 | if(n==1) 7 | { 8 | cout<<"Move disk 1 from "< 2 | 3 | using namespace std; 4 | int fact_iterativ(int n) 5 | { 6 | int fact=1; 7 | for(int i=1;i<=n;i++) 8 | fact*=i; 9 | return fact; 10 | } 11 | int fact_recursiv(int n) 12 | { 13 | if(n==0) 14 | return 1; 15 | else return n*fact_recursiv(n-1); 16 | } 17 | int main() 18 | { 19 | int n; 20 | cout<<"Dati n: "; 21 | cin>>n; 22 | cout<<"n! cu metoda iterativa este egal cu "< 2 | 3 | using namespace std; 4 | void towerOfHanoi(int n, char source, char auxiliary, char destination) 5 | { 6 | if(n==1) 7 | { 8 | cout<<"Move disk 1 from "< 2 | using namespace std; 3 | 4 | 5 | int fact_iterativ(int n){ 6 | int fact=1; 7 | for(int i=1;i<=n;i++) 8 | fact*=i; 9 | 10 | return fact; 11 | } 12 | 13 | int fact_recursiv(int n){ 14 | 15 | if(n==0) 16 | return 1; 17 | else 18 | return n*fact_recursiv(n-1);} 19 | int main() 20 | { 21 | int n; 22 | cout<<"dati N:"; 23 | cin>>n; 24 | cout<<"N cu metoda iterativa este egal cu:"< 2 | #include 3 | 4 | int functie1() 5 | { 6 | static int x= 0; 7 | x+= 10; 8 | return x; 9 | } 10 | 11 | int functie2() 12 | { 13 | int x = 0; 14 | x+= 10; 15 | return x; 16 | } 17 | 18 | void main() 19 | { 20 | int n = 10; 21 | 22 | printf("Functie cu variabila static: "); 23 | for(int i=0; i < n; i++) 24 | { 25 | printf("%d ", functie1()); 26 | } 27 | printf("\nFunctie cu variabila non-static: "); 28 | for(int i=0; i 2 | #include 3 | 4 | int a[10], n; 5 | 6 | 7 | int diferenta (int n, int a[10]) 8 | 9 | { 10 | if(n==0) return 1; 11 | else return (a[n]- diferenta(n-1,a)); 12 | 13 | } 14 | 15 | void main() 16 | { 17 | printf("introdu nr de caini: "); 18 | 19 | scanf("%i",&n); 20 | 21 | for (int i= 0;i<=n;i++); 22 | { 23 | printf("Elementul [%i] = " ); 24 | scanf("%i", &a[10]); 25 | } 26 | printf("diferenta = %i", diferenta(n,a)); 27 | return 0; 28 | } 29 | 30 | 31 | -------------------------------------------------------------------------------- /Grupa 2/Sfetcu_Delia_g2/Laboratoare/Lab8/prob3.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int functie1() 5 | { 6 | static int x = 0; 7 | x += 10; 8 | return x; 9 | } 10 | int functie2() 11 | { 12 | int x = 0; 13 | x += 10; 14 | return x; 15 | } 16 | 17 | void main(){ 18 | int n = 10; 19 | printf("Functie cu variabila static: "); 20 | for(int i = 0; i < n; i++) 21 | { 22 | printf(" %d", functie1()); 23 | } 24 | printf("\nFunctie cu variabila non-static: "); 25 | for(int i = 0; i < n; i++) 26 | { 27 | printf("%d", functie2()); 28 | } 29 | } 30 | -------------------------------------------------------------------------------- /Grupa 2/Stefan_Razvan_Grupa 2/Laboratoare/Laborator 9 - Ex1.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int fact_iterativ(int n) 4 | { 5 | int fact = 1; 6 | for (int i = 1; i<=n;i++){ 7 | fact*=i; 8 | } 9 | return fact; 10 | } 11 | 12 | int fact_recursiv(int n){ 13 | if(n==0) 14 | return 1; 15 | else return n*fact_recursiv(n-1); 16 | } 17 | 18 | int main() 19 | { 20 | int n; 21 | cout<<"Dati n: "; 22 | cin>>n; 23 | cout<<"N! cu metoda iterativa este egal cu: "< 2 | using namespace std; 3 | void towerOfHanoi(int n,char source, char auxiliary, char destination) 4 | { 5 | if (n==1) 6 | { 7 | cout<<"Move disk one from "< 2 | 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | int v[10], n, S=0; 8 | cout<<"Cate elemente are vectorul?"; 9 | cin>>n; 10 | for(int i=0;i>v[i]; 13 | if(v[i]%2==0) 14 | S=S+v[i]; 15 | } 16 | cout<<"Suma nr pare: "<=0;i--) 23 | cout< 2 | 3 | using namespace std; 4 | void towerOfHanoi (int n, char source, char auxiliary, char destination) 5 | { 6 | if (n==1) { 7 | cout<<"Move disk 1 from "< 2 | #include 3 | 4 | int functie1() 5 | { 6 | static int x = 0; 7 | x += 10; 8 | return x; 9 | } 10 | int functie2() 11 | { 12 | int x = 0; 13 | x += 10; 14 | return x; 15 | } 16 | 17 | void main(){ 18 | int n = 10; 19 | printf("Functie cu variabila static: "); 20 | for(int i = 0; i < n; i++) 21 | { 22 | printf(" %d", functie1()); 23 | } 24 | printf("\nFunctie cu variabila non-static: "); 25 | for(int i = 0; i < n; i++) 26 | { 27 | printf("%d", functie2()); 28 | } 29 | } 30 | -------------------------------------------------------------------------------- /Grupa 2/Stefan_Razvan_Grupa 2/Laboratoare/Laborator 9 - Ex3.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int i=0; 4 | void foo1(int); 5 | void foo2(int); 6 | 7 | void foo1(int n) 8 | { 9 | if(i<=n) 10 | { 11 | cout<>n; 35 | foo1(n); 36 | return 0; 37 | } 38 | -------------------------------------------------------------------------------- /Grupa 1/Tutu_Cristian_G1/Laboratoare/Laborator4.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | int v[10],i,s=0; 8 | for(i=0;i<10;i++) 9 | { 10 | cout<<"v["<>v[i]; 12 | } 13 | cout<<"Numerele pare sunt: "; 14 | for(i=0;i<10;i++) 15 | { 16 | if(v[i]%2==0) 17 | cout<=0;i--) 24 | cout< 2 | using namespace std; 3 | 4 | 5 | int fact_iterativ(int n){ 6 | int fact=1; 7 | for(int i=1;i<=n;i++) 8 | fact*=i; 9 | 10 | return fact; 11 | } 12 | 13 | int fact_recursiv(int n){ 14 | 15 | if(n==0) 16 | return 1; 17 | else 18 | return n*fact_recursiv(n-1);} 19 | int main() 20 | { 21 | int n; 22 | cout<<"dati N:"; 23 | cin>>n; 24 | cout<<"N cu metoda iterativa este egal cu:"< 2 | using namespace std; 3 | void towerofhanoi(int n, char source, char auxiliary, char destination) 4 | { 5 | if(n==1) 6 | { 7 | cout<<"Move disk 1 from "< 2 | 3 | using namespace std; 4 | int fact_iterativ(int n) 5 | { 6 | int fact=1; 7 | for (int i= 1;i<=n;i++) 8 | fact *= i; 9 | return fact; 10 | } 11 | int fact_recursiv(int n) 12 | { 13 | if(n==0) 14 | return 1; 15 | else 16 | return n * fact_iterativ(n-1); 17 | } 18 | int main() 19 | { 20 | int n; 21 | cout<<"Dati N:"; 22 | cin>>n; 23 | cout<<"N! cu metoda iterativa este egal cu:"< 2 | #include 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | char sir1[101], sir2[101]; 8 | int i,j; 9 | int num=0,temp; 10 | 11 | cout<<"Introduceti sirul 1 de caractere: "; 12 | cin.getline(sir1, 100); 13 | 14 | cout<<"Introduceti sirul 2 de caractere: "; 15 | cin.getline(sir2, 100); 16 | 17 | strcat(sir1, sir2); 18 | cout< 2 | 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | 8 | /* 1. Scrieti un program in C++ care va cere sa introduceti de la tastatura initiala numelui si a prenumelui, 9 | il salveaza in doua variabile de tip char nume, prenume si apoi afiseaza mesajul “Salut, nume prenume!” */ 10 | 11 | char nume, prenume; 12 | cout << "Initiala nume: "; 13 | cin >> nume; 14 | cout<< "Initiala prenume: "; 15 | cin >> prenume; 16 | cout << "Salut, " << nume << " " << prenume << "!" ; 17 | return 0; 18 | } 19 | -------------------------------------------------------------------------------- /Grupa 2/Chitu_Gabriela_GR2/Laboratoare/lab9_4.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | void towerOfHanoi(int n, char source, char auxiliary, char destination) 6 | { 7 | if(n==1) { 8 | cout<< "Move disk 1 from " << source << " to " << destination << endl; 9 | return; 10 | } 11 | towerOfHanoi(n-1, source, destination, auxiliary); 12 | cout<< "Move disk " << n << " from " << source << " to " << destination << endl; 13 | towerOfHanoi(n-1, auxiliary, source, destination); 14 | } 15 | int main() { 16 | int num_disks = 3; 17 | towerOfHanoi(num_disks, 'A', 'B', 'C'); 18 | return 0; 19 | } 20 | -------------------------------------------------------------------------------- /Grupa 1/Catanea_Bianca_grupa1/Laborator/Laborator 1 - Problema 3 - Convertire Celsius.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | /* 3. Scrieți un program care cere utilizatorului să introducă o valoare pentru temperatura măsurată în grade Fahrenheit (F) și 8 | apoi realizează conversia către grade Celsius (C) folosind formula: C = (5 / 9) * (F - 32). */ 9 | 10 | float f,c; 11 | cout << "Introduceti numarul de grade in Fahrenheit: "; 12 | cin >> f; 13 | c = ( 5.0 / 9.0 ) * (f -32); 14 | cout << "Numarul de grade convertit in Celsius este : " << c; 15 | return 0; 16 | } 17 | -------------------------------------------------------------------------------- /Grupa 2/Glont_Tudor_G2/LABORATOARE/lab9 3.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int i=0; 6 | void foo1(int); 7 | void foo2(int); 8 | 9 | void foo1(int n) 10 | { 11 | if(i<=n) 12 | { 13 | cout<>n; 35 | foo1(n); 36 | return 0; 37 | } 38 | -------------------------------------------------------------------------------- /Grupa 2/Margarit_Iustin_Gr2/Laboratoare/lab10_4.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | int main() 7 | {FILE * pFile; 8 | 9 | char a[500]=""; 10 | char linie[70]; 11 | int i,j; 12 | int num=0; 13 | char vocale[]="aeiouAEIOU"; 14 | pFile= fopen("fisier4.txt", "r"); 15 | if(pFile==NULL) 16 | perror("Eroare la deschidere"); 17 | else{ 18 | while(fgets(linie,70,pFile)!=NULL) 19 | strcat(a,linie); 20 | fclose(pFile); 21 | } 22 | for(i=0;i 2 | 3 | using namespace std; 4 | 5 | int fact_iterativ(int n){ 6 | int fact = 1; 7 | for(int i=1; i<=n; i++){ 8 | fact *= i; 9 | } 10 | return fact; 11 | } 12 | 13 | int fact_recursiv(int n){ 14 | if(n==0) 15 | return 1; 16 | else 17 | return n * fact_recursiv(n-1); 18 | } 19 | 20 | int main() 21 | { 22 | int n; 23 | cout<<"Dati N: "; 24 | cin>>n; 25 | cout<<"N! cu metoda iterativa este egal cu: "< 2 | using namespace std; 3 | int main(){ 4 | int v[10], s=0, i; 5 | cout<<"Elementele vectorului sunt: "; 6 | for(i=0; i<10; i++) 7 | cin>>v[i]; 8 | for(i=0; i<10; i++){ 9 | if(v[i]%2==1) 10 | s=s+v[i]; 11 | } 12 | cout<<"Suma cifrelor impare este "<=0; i--){ 21 | cout< 2 | 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | int v[10],i,j,n,s1=0,s2=0; 8 | cin>>n; 9 | for(i=0; i>v[i]; 11 | for(i=0; i 2 | using namespace std; 3 | 4 | void towerOfHanoi(int n, char source, char auxiliary, char destination) { 5 | if(n == 1){ 6 | cout << "Move disk 1 from " << source << " to " << destination << endl; 7 | return; 8 | } 9 | towerOfHanoi(n - 1, source, destination, auxiliary); 10 | cout << "Move disk " << n << " from " << source << " to " << destination << endl; 11 | towerOfHanoi(n - 1, auxiliary, source, destination); 12 | } 13 | 14 | int main() { 15 | int num_disks = 3; 16 | towerOfHanoi(num_disks, 'A', 'B', 'C'); 17 | return 0; 18 | } 19 | -------------------------------------------------------------------------------- /Grupa 2/Chitu_Gabriela_GR2/Laboratoare/lab9_1.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int fact_iterativ(int n) { 6 | int fact = 1; 7 | for(int i=1; i<=n; i++){ 8 | fact*=i; 9 | } 10 | return fact; 11 | 12 | } 13 | int fact_recursiv(int n) { 14 | if(n==0) 15 | return 1; 16 | else 17 | return n* fact_recursiv(n-1); 18 | } 19 | int main () { 20 | int n; 21 | cout<< "Dati N: "; 22 | cin>> n; 23 | cout<< "N! cu metoda iterativa este egal cu :" << fact_iterativ(n) << endl; 24 | cout<< "N! cu metoda recursiva este egal cu: "<< fact_recursiv(n); 25 | return 0; 26 | } 27 | 28 | 29 | -------------------------------------------------------------------------------- /Grupa 1/Catanea_Bianca_grupa1/Laborator/Laborator 2 - Problema 4 - Sir Fibonacci.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | // 4. Scrieti un program care realizeaza generarea a sirului lui Fibonacci. 8 | 9 | long f0=1, f1=1; 10 | long fc; 11 | int i=1,n; 12 | cout << " Pentru cate elemente se genereaza sirul Fibonacci? "; 13 | cin>>n; 14 | cout << "Sirul Fibonacci este: "<< f0 << " " << f1 << " "; 15 | while (i<=n) 16 | { 17 | fc=f0+f1; 18 | f0=f1; 19 | f1=fc; 20 | i++; 21 | cout << fc << " "; 22 | } 23 | return 0; 24 | } 25 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/problema malloc3/main.cpp: -------------------------------------------------------------------------------- 1 | 2 | #include 3 | 4 | int functie1() { 5 | static int x=0; 6 | x+=10; 7 | return x; 8 | } 9 | 10 | int functie2(){ 11 | int x=0; 12 | x+=10; 13 | return x; 14 | } 15 | 16 | void main() 17 | { 18 | int n=10; 19 | 20 | printf("Functie cu variabila static: "); 21 | for( i=0;i 2 | 3 | using namespace std; 4 | 5 | void towerofHanoi(int n, char source, char auxiliary, char destination) 6 | { 7 | if(n==1) 8 | { 9 | cout<<"move disc 1 from "< 2 | 3 | using namespace std; 4 | 5 | void towerOfHanoi(int n, char source, char auxiliary, char destination) { 6 | if (n == 1) { 7 | cout << "Move disk 1 from " << source << " to " << destination << endl; 8 | return; 9 | } 10 | towerOfHanoi(n - 1, source, destination, auxiliary); 11 | cout << "Move disk " << n << " from " << source << " to " << destination << endl; 12 | towerOfHanoi(n - 1, auxiliary, source, destination); 13 | } 14 | 15 | int main() { 16 | int num_disks = 3; 17 | towerOfHanoi(num_disks, 'A', 'B', 'C'); 18 | return 0; 19 | } 20 | -------------------------------------------------------------------------------- /Grupa 2/Rusu_Denice_Grupa2/Laboratoare/Lab9/problema3.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | int i = 0; 5 | void foo1(int); 6 | void foo2(int); 7 | void foo1(int n) 8 | { 9 | if (i <= n) 10 | { 11 | cout << i << " "; 12 | i++; 13 | foo2(n); 14 | } 15 | else 16 | { 17 | return; 18 | } 19 | } 20 | void foo2(int n) 21 | { 22 | if (i <= n) 23 | { 24 | cout << i << " "; 25 | i++; 26 | foo1(n); 27 | } 28 | else 29 | { 30 | return; 31 | } 32 | } 33 | int main(void) 34 | { 35 | int n; 36 | cin >> n; 37 | foo1(n); 38 | return 0; 39 | } 40 | -------------------------------------------------------------------------------- /Grupa 2/Rusu_Denice_Grupa2/Laboratoare/Lab9/problema4.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | void towerOfHanoi(int n, char source, char auxiliary, char destination) 5 | { 6 | if (n == 1) 7 | { 8 | cout << "Move disk 1 from " << source << " to " << destination << endl; 9 | return; 10 | } 11 | towerOfHanoi(n - 1, source, destination, auxiliary); 12 | cout << "Move disk " << n << " from " << source << " to " << destination << endl; 13 | towerOfHanoi(n - 1, auxiliary, source, destination); 14 | } 15 | int main() 16 | { 17 | int num_disks = 3; 18 | towerOfHanoi(num_disks, 'A', 'B', 'C'); 19 | return 0; 20 | } 21 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/problema malloc3nou/main.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int functie1() { 5 | static int x=0; 6 | x+=10; 7 | return x; 8 | } 9 | 10 | int functie2(){ 11 | int x=0; 12 | x+=10; 13 | return x; 14 | } 15 | 16 | void main() 17 | { 18 | int n=10; 19 | 20 | printf("Functie cu variabila static: "); 21 | for( int i=0;i 2 | 3 | using namespace std; 4 | 5 | void towerOfHanoi (int n, char source, char auxiliary, char destination) { 6 | if (n == 1) { 7 | cout << "move disk 1 from " << source << " to " << destination << endl; 8 | return; 9 | } 10 | towerOfHanoi(n - 1, source, destination, auxiliary); 11 | cout << "move disk " << n << " from " << source << " to " << destination << endl; 12 | towerOfHanoi(n - 1, auxiliary, source, destination); 13 | } 14 | 15 | int main() { 16 | int num_disks = 3; 17 | towerOfHanoi(num_disks, 'A', 'B', 'C'); 18 | return 0; 19 | } 20 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/AB/problema turnuri hanoe/main.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | void towerOfHanoi( int n, char source, char auxiliary, char destination) { 6 | if (n==1){ 7 | cout<<"Move disk 1 from "< 2 | 3 | using namespace std; 4 | 5 | void towerOfHanoi(int n, char source, char auxiliary, char destination) 6 | { 7 | if(n == 1) 8 | { 9 | cout << "Move disk 1 from " << source << " to " << destination << endl; 10 | return; 11 | } 12 | towerOfHanoi(n - 1, source, destination, auxiliary); 13 | cout << "Move disk " << n << " from " << source << " to " << destination << endl; 14 | towerOfHanoi(n - 1, auxiliary, source, destination); 15 | } 16 | int main() 17 | { 18 | int num_disks = 4; 19 | towerOfHanoi(num_disks, 'A', 'B', 'C'); 20 | return 0; 21 | } 22 | 23 | 24 | -------------------------------------------------------------------------------- /Grupa 1/Catanea_Bianca_grupa1/Laborator/Laborator 9 - Problema 3 - Turnurile Hanoi.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | void towerOfHanoi(int n, char source, char auxiliary, char destination) { 5 | if (n == 1) { 6 | cout << "Move disk 1 from " << source << " to " << destination << endl; 7 | return; 8 | } 9 | towerOfHanoi(n - 1, source, destination, auxiliary); 10 | cout << "Move disk " << n << " from " << source << " to " << destination << endl; 11 | towerOfHanoi(n - 1, auxiliary, source, destination); 12 | } 13 | 14 | int main() { 15 | int num_disks = 3; 16 | towerOfHanoi(num_disks, 'A', 'B', 'C'); 17 | return 0; 18 | } 19 | -------------------------------------------------------------------------------- /Grupa 1/Sauciuc_Darius_G1/Laborator/Laborator9-towerofhanoi.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | void towerOfHanoi(int n, char source, char auxiliary, char destination) 6 | { 7 | if(n == 1) 8 | { 9 | cout << "Move disk 1 from " << source << " to " << destination << endl; 10 | return; 11 | } 12 | towerOfHanoi(n - 1, source, destination, auxiliary); 13 | cout << "Move disk " << n << " from " << source << " to " << destination << endl; 14 | towerOfHanoi(n - 1, auxiliary, source, destination); 15 | } 16 | 17 | int main() 18 | { 19 | int num_disks = 3; 20 | towerOfHanoi(num_disks, 'A', 'B', 'C'); 21 | return 0; 22 | } 23 | -------------------------------------------------------------------------------- /Grupa 2/Borta_Antonio_GR2/Teme_Programare/Tema12-ex9.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | int main() 7 | { 8 | int s = 0, i, n, *c; 9 | ofstream file("SumaNumere.txt"); 10 | cout << "Introduceti numarul de numere: "; 11 | cin >> n; 12 | c = (int*)malloc(n*sizeof(int)); 13 | if (c == nullptr) 14 | { 15 | cout << "Eroare la alocarea memoriei!" << endl; 16 | return 1; 17 | } 18 | for(i = 0; i < n; i++) 19 | { 20 | cin >> c[i]; 21 | s += c[i]; 22 | } 23 | 24 | file << "Suma calculata este : " << s << endl; 25 | 26 | file.close(); 27 | 28 | return 0; 29 | } 30 | -------------------------------------------------------------------------------- /Grupa 2/DorceaHeia_EduardDamian_2/Laboratoare/cel mai mic div comun recursiv/main.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | int i=2; 5 | 6 | void foo2(int n, int m){ 7 | for(i=2;i> n; 22 | cout<< "N! cu metoda iterativa este egal cu: "< 2 | 3 | using namespace std; 4 | 5 | int main() 6 | { int a[4][4],i,j,n,s; 7 | cout<<"Cate linii/coloane va avea matricea patratica: "; 8 | cin>>n; 9 | cout<<"Citim matricea patratica: "<>a[i][j]; 13 | cout<<"Ëlementele de pe diagonala principala sunt:"; 14 | if(i==j) cout<n=1) cout<<"Elementele de sub diagonala secundara sunt:"<99) s=s+a[i][j]; 19 | cout<<"Suma numerelor de 3 cifre este:"< 2 | #include 3 | 4 | typedef struct { 5 | int x,y; 6 | }Point; 7 | typedef struct { 8 | Point topLeft; 9 | Point bottomRight; 10 | }Rectangle; 11 | int main() 12 | { 13 | Point p1,p2; 14 | p1.x =0; 15 | p1. y= 3; 16 | p2.x = 4; 17 | p2. y= 0; 18 | printf("p1 la (%d, %d)\n", p1.x, p1.y); 19 | printf("p2 la (%d, %d)\n", p2.x, p2.y); 20 | Rectangle rect; 21 | rect.topLeft = p1; 22 | rect.bottomRight= p2; 23 | printf("Stanga sus la (%d,%d)\n", rect.topLeft.x, rect.topLeft.y); 24 | printf("Dreapta jos la (%d,%d)\n", rect.bottomRight.x, rect.bottomRight.y); 25 | return 0; 26 | } 27 | -------------------------------------------------------------------------------- /Grupa 2/Borta_Antonio_GR2/Teme_Programare/Tema12-ex6.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | int main() 7 | { 8 | ofstream file("SumaDiagonala.txt"); 9 | int a[100][100], i, j, n, sdp = 0; 10 | cout << "Introduceti numarul de linii si coloane: "; 11 | cin >> n; 12 | for(i = 0; i < n; i++) 13 | for(j = 0; j < n; j++) 14 | { cin >> a[i][j]; 15 | if(i == j) 16 | sdp += a[i][j]; 17 | } 18 | cout << "Suma elementelor diagnalei principale este: " << sdp << endl; 19 | 20 | file << "Suma elementelor diagnalei principale: " << sdp < 2 | #include 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | char a[101]; 8 | int i,j; 9 | int num=0,temp; 10 | 11 | cout<<"Introduceti sirul de caractere: "; 12 | cin.get(a, 100); 13 | 14 | for (i=0;i 2 | 3 | int functie1() { 4 | 5 | static int x = 0; 6 | 7 | x+= 10; 8 | 9 | return x; 10 | } 11 | 12 | int functie2() { 13 | 14 | int x = 0; 15 | 16 | x += 10; 17 | 18 | return x; 19 | } 20 | 21 | void main() { 22 | 23 | int n = 10; 24 | 25 | printf("Functie cu variabila static: \n"); 26 | for (int i = 0; i < n; i++) { 27 | printf("%d ", functie1()); 28 | } 29 | 30 | printf("\n"); 31 | 32 | printf("Functie cu variabila non-static: "); 33 | for (int i = 0; i < n; i++) { 34 | printf("%d ", functie2()); 35 | } 36 | 37 | printf("\n"); 38 | 39 | } 40 | -------------------------------------------------------------------------------- /Grupa 1/Mandea_Alexandra_Nicoleta_Grupa1/Laborator/Laborator4.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | int v[10],n,i,si=0; 8 | cout<<"Introduceti numarul de elemente: "; 9 | cin>>n; 10 | cout<<"Introduceti elementele vectorului: "; 11 | for(i=0;i>v[i]; 13 | cout<<"Elementele pare: "; 14 | for(i=0;i=0;i--) 23 | cout< 2 | #include 3 | 4 | 5 | using namespace std; 6 | 7 | int main() 8 | { 9 | char sir1[101], sir2[101]; 10 | int i,j; 11 | int num=0,temp; 12 | 13 | cout<<"Introduceti sirul 1 de caractere: "; 14 | cin.getline(sir1, 100); 15 | 16 | cout<<"Introduceti sirul 2 de caractere: "; 17 | cin.getline(sir2, 100); 18 | 19 | strcat(sir1, sir2); 20 | cout< 2 | #include 3 | 4 | int main() 5 | { 6 | int n,max=-1,min=9999999,s=0,i; 7 | for(i=0; i<4; i++) 8 | { 9 | scanf("%d",&n); 10 | if(n>max) 11 | max=n; 12 | if(n 2 | 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | int a[4][4],i,j,s=0; 8 | for(i=0;i<5;i++) 9 | for(j=0;j<5;j++) 10 | cin>>a[i][j]; 11 | cout<<"Nr de pe diag principala"<<" "; 12 | for(i=0;i<5;i++) 13 | for(j=0;j<5;j++) 14 | if(i==j) 15 | cout<=5) 21 | cout< 2 | 3 | using namespace std; 4 | int fact_iterativ(int n) 5 | { 6 | int fact=1; 7 | for(int i=1;i<=n;i++) 8 | { 9 | fact*=i; 10 | } 11 | return fact; 12 | } 13 | int fact_recursiv(int n) 14 | { 15 | if(n==0) 16 | { 17 | return 1; 18 | } 19 | else 20 | { 21 | return n*fact_recursiv(n-1); 22 | } 23 | } 24 | int main() 25 | { 26 | int n; 27 | cout<<"Dati N:"; 28 | cin>>n; 29 | cout<<"N! cu metoda iterativa este egal cu: "< 2 | #include 3 | #include 4 | 5 | using namespace std; 6 | 7 | int main() { 8 | 9 | string s; 10 | 11 | cout << "Scrie ceva" << endl; 12 | 13 | getline(cin, s); 14 | 15 | int result = -1; 16 | 17 | for (int i = 0; i < s.length(); i++) { 18 | 19 | int j = s.length() - 1; 20 | 21 | while (s[i] != s[j]) { 22 | j--; 23 | } 24 | 25 | result = fmax(result, j - i - 1); 26 | 27 | } 28 | 29 | cout << "Lungimea maxima dintre doua caractere identice este : " << result << endl; 30 | 31 | return 0; 32 | } 33 | -------------------------------------------------------------------------------- /Grupa 1/Ene_Ionut_Grupa1/Laborator/Laborator4.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | 8 | int v[10],i,s; 9 | cout<<"Elementele vectorului sunt: "; 10 | for (i=0; i<10; i++) cin>>v[i]; 11 | for (i=0; i<10; i++) if (v[i]%2==1) s=s+v[i]; 12 | 13 | cout<<"Suma cifrelor impare este: "<=0; i--){ 22 | cout<.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | using namespace std; 5 | 6 | int main() 7 | { 8 | int i,j; 9 | int linii = 5; 10 | int coloane = 6; 11 | 12 | int** matrice = new (nothrow) int*[linii]; 13 | for(i=0;i>matrice[i][j]; 21 | 22 | for(i=0;i 2 | #include 3 | 4 | 5 | using namespace std; 6 | 7 | int main() { 8 | 9 | double a, b, c, sum, med; 10 | 11 | cout << "Notele studentului : " << endl; 12 | cin >> setprecision(2) >> a; 13 | cin >> setprecision(2) >> b; 14 | cin >> setprecision(2) >> c; 15 | 16 | sum = a + b + c; 17 | med = sum / 3; 18 | 19 | 20 | if (med >= 6) { 21 | cout << "Studentul are nota de trecere : " << setprecision(6) << fixed << med << endl; 22 | } else { 23 | cout << "Studentul nu are nota de trecere : " << setprecision(6) << fixed << med << endl; 24 | } 25 | 26 | return 0; 27 | } 28 | -------------------------------------------------------------------------------- /Grupa 1/Tutu_Cristian_G1/Teme/Exemple test/problema 9.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | ofstream g("SumaNumere.txt"); 8 | int n,*a,suma=0; 9 | cout<<"Introduceti numarul de numere: "; 10 | cin>>n; 11 | a=(int*)malloc(n*sizeof(int)); 12 | if(!a) 13 | { 14 | cout<<"Eroare la alocarea memoriei"; 15 | return -1; 16 | } 17 | for(int i=0;i>a[i]; 21 | suma+=a[i]; 22 | } 23 | g< 2 | #include 3 | 4 | typedef struct { 5 | int x,y; 6 | }Point; 7 | 8 | typedef struct { 9 | Point topLeft; 10 | Point bottomRight; 11 | }Rectangle; 12 | 13 | int main() 14 | { 15 | Point p1,p2; 16 | p1.x =0; 17 | p1. y= 3; 18 | p2.x = 4; 19 | p2. y= 0; 20 | printf("p1 la (%d, %d)\n", p1.x, p1.y); 21 | printf("p2 la (%d, %d)\n", p2.x, p2.y); 22 | Rectangle rect; 23 | rect.topLeft = p1; 24 | rect.bottomRight= p2; 25 | printf("Stanga sus la (%d,%d)\n", rect.topLeft.x, rect.topLeft.y); 26 | printf("Dreapta jos la (%d,%d)\n", rect.bottomRight.x, rect.bottomRight.y); 27 | return 0; 28 | } 29 | 30 | -------------------------------------------------------------------------------- /Grupa 2/Gheorghe_Alin_g2/lab/lab9.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | int fact_interativ(int n) { 5 | int fact=1; 6 | for(int i=1;i<=n;i++) 7 | { 8 | fact *=i; 9 | } 10 | return fact; 11 | } 12 | int fact_recursiv(int n) 13 | { 14 | //Cazul de baza pt recussivitaate 0! este 1 15 | if(n==0) 16 | return 1; 17 | else //formula recursiva n! = n*(n-1)! 18 | return n * fact_recursiv(n-1); 19 | } 20 | int main() 21 | { 22 | int n; 23 | cout << "Dati n: "; 24 | cin>>n; 25 | cout<<"N! cu metoda iterativa este ="<< fact_interativ(n)< 2 | #include 3 | #include 4 | int main() 5 | { 6 | float *a,x; 7 | int n,i; 8 | printf("Cate numere?"); 9 | scanf("%d", &n); 10 | 11 | a=(float *) malloc(n * sizeof(float)); 12 | if(!a) 13 | printf("Nu pot aloca memorie\n"); 14 | 15 | for(i=0;i 4 | #include 5 | using namespace std; 6 | 7 | int main() 8 | { 9 | int n,i,j,p=1,v[100][100]; 10 | cin>>n; 11 | ofstream g("ProdusDiagonalaSecundara.txt"); 12 | for(i=0;i>v[i][j]; 17 | if(i+j==n-1) 18 | p*=v[i][j]; 19 | } 20 | } 21 | g< 2 | using namespace std; 3 | 4 | //CMMDC - Recursivitate 5 | int cmmd(int a, int b) 6 | { 7 | if(b==0) 8 | { 9 | return a; 10 | } else{ 11 | return cmmd (b, a%b); 12 | } 13 | } 14 | 15 | int main() 16 | { 17 | int x,y; 18 | // x - variabila folosita pentru a stoca primul numar 19 | // y - variabila folosita pentru a stoca al doilea numar 20 | cout << "Introduceti primul numar: "; 21 | cin >> x; 22 | 23 | cout<<"Introduceti al doilea numar: "; 24 | cin>>y; 25 | 26 | int rez = cmmd(x,y); 27 | 28 | cout << "Cel mai mic divizor comun pentru " << x << " si " << y << " este: " << rez < 2 | #include 3 | 4 | using namespace std; 5 | 6 | int main() { 7 | 8 | float a, b, c, d; 9 | 10 | cout << "a = "; cin >> a; 11 | cout << "b = "; cin >> b; 12 | cout << "c = "; cin >> c; 13 | 14 | if (a) { 15 | 16 | d = b*b-4*a*c; 17 | if (d >= 0) { 18 | 19 | cout << "x1 ="; 20 | cout << ((-b+sqrt(d))/(2*a)) << endl; 21 | cout << "x2 ="; 22 | cout << ((-b-sqrt(d))/(2*a)) << endl; 23 | 24 | } else { 25 | 26 | cout << "x1 si x2 nu sunt numere reale" << endl; 27 | 28 | } 29 | 30 | 31 | } 32 | 33 | return 0; 34 | } 35 | -------------------------------------------------------------------------------- /Grupa 1/Tamasag_Irina_grupa1/laborator/lab4.cpp: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | #include 5 | 6 | using namespace std; 7 | 8 | int main() 9 | { 10 | int v[10], si=0, n, i; 11 | cout<<"introduceti marimea vectorului"; 12 | cin>>n; 13 | cout<<"introduceti vectorul"; 14 | 15 | for(i=0;i>v[i]; 18 | 19 | cout<<"numerele pare sunt"; 20 | for(i=0;i=0;i--) 30 | cout< 2 | #include 3 | 4 | using namespace std; 5 | 6 | int main() 7 | { 8 | FILE * pFile; 9 | char a[500]=""; 10 | char linie[70]; 11 | int i,j; 12 | int num=0; 13 | char vocale[]= "aAeEiIoOuU"; 14 | pFile = fopen ("fisier.txt", "r"); 15 | if (pFile == NULL) 16 | perror ("Eroare la deschidere"); 17 | else{ 18 | while (fgets (linie, 70, pFile) != NULL) 19 | strcat(a,linie); 20 | fclose (pFile); 21 | } 22 | for (i=0; i 2 | #include 3 | #include 4 | 5 | int main() 6 | { 7 | float *a, x; 8 | int n,i; 9 | printf("Cate numere? "); 10 | scanf("%d", &n); 11 | 12 | a= (float*)malloc(n * sizeof(float)); 13 | if(!a){ 14 | printf("Nu pot aloca memorie.\n"); 15 | } 16 | for (i=0; i 2 | #include 3 | 4 | using namespace std; 5 | 6 | int main() 7 | { 8 | ofstream file("ProdusDiagonalaSecundara.txt"); 9 | int a[100][100], i, j, n, pds = 1; 10 | cout << "Introduceti numarul de linii si coloane: "; 11 | cin >> n; 12 | for(i = 0; i < n; i++) 13 | for(j = 0; j < n; j++) 14 | { cin >> a[i][j]; 15 | if(i + j == n - 1) 16 | pds *= a[i][j]; 17 | } 18 | cout << "Produsul elementelor diagonalei secundare este: " << pds << endl; 19 | 20 | file << "Produsul elementelor diagonalei secundare este: " << pds < 2 | #include 3 | #include 4 | int main() 5 | { 6 | float* a,x; 7 | int n, i; 8 | printf("Cate numere? "); 9 | scanf("%d", &n); 10 | a = (float *) malloc(n*sizeof(float)); 11 | if (!a){ 12 | printf("Nu pot aloca memorie. \n"); 13 | } 14 | for (i=0; i 2 | #include 3 | using namespace std; 4 | 5 | int main () 6 | { 7 | float a,b,c,d; 8 | cout<<"a="; cin>>a; 9 | cout<<"b="; cin>>b; 10 | cout<<"c="; cin>>c; 11 | 12 | if(a) 13 | { 14 | d=b*b-4*a*c; 15 | if (d>=0) 16 | { 17 | cout<<"x1="; 18 | cout<<((-b+sqrt(d))/(2*a)); 19 | cout<<"x2="<<((-b-sqrt(d))/(2*a)); 20 | } 21 | else cout<<"x1 si x2 nu sunt reale"; 22 | } 23 | else if(b) 24 | cout<<"x="<<(-c/b); 25 | else if(c==0) 26 | cout<<"infinitate de solutii"; 27 | else 28 | cout<<"ecuatia nu are solutii"; 29 | return 0; 30 | } 31 | -------------------------------------------------------------------------------- /Grupa 2/Ionita_Radu_Alexandru_G2/Laboratoare/lab7b.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | typedef struct { 4 | int x,y; 5 | }Point; 6 | typedef struct{ 7 | Point topLeft; 8 | Point bottomRight; 9 | } Rectangle; 10 | 11 | 12 | int main() 13 | { 14 | Point p1,p2; 15 | p1.x = 0; 16 | p1.y = 3; 17 | p2.x = 4; 18 | p2.y = 0; 19 | printf("p1 la ( %d, %d )\n", p1.x, p1.y); 20 | printf("p2 la ( %d, %d )\n", p2.x, p2.y); 21 | Rectangle rect; 22 | rect.topLeft= p1; 23 | rect.bottomRight = p2; 24 | printf("Stanga sus la ( %d, %d )\n", rect.topLeft.x, rect.topLeft.y); 25 | printf("Dreapta jos la ( %d, %d )\n", rect.bottomRight.x, rect.bottomRight.y); 26 | return 0; 27 | } 28 | --------------------------------------------------------------------------------