Skip to content

Instantly share code, notes, and snippets.

View thinkphp's full-sized avatar

Adrian Statescu thinkphp

View GitHub Profile
@thinkphp
thinkphp / template.cpp
Created March 15, 2026 10:53
template.cpp
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
// template<typename T> spune compilatorului T este un tip necunoscut, il deduci din apel
template<typename T>
T maxim(T a,T b) {
@thinkphp
thinkphp / supraincarcare_operator_vector2D.cpp
Created March 15, 2026 10:39
supraincarcare_operator_vector2D.cpp
#include <iostream>
#include <cmath>
using namespace std;
class Vector2D {
public:
double x, y;
Vector2D(double x=0, double y=0): x(x),y(y) {}
@thinkphp
thinkphp / supraincarcare-operatorilor.cpp
Created March 15, 2026 10:17
Supraincare operatori +,-,*,/ < ==
#include <iostream>
#include <numeric> //pentru a utiliza GCD
using namespace std;
class Fractie {
int nr, nm;//date membre private
void simplifica() { //metoda privata
@thinkphp
thinkphp / clasa-abstracta.cpp
Created March 15, 2026 09:38
clasa-abstracta.cpp
/*
Cei 4 piloni fundamentali:
- incapsulare - datele si metodele sunt grupate impreuna,iar detaliile interne sunt ascunse fata de exterior.
- Mostenire - o clasa poate prelua atributele si comportamentele altei clasei, evitand duplicarea coduliu
- Polimorfism - acelasi APEL de metoda poate produce comportamente diferite in functie de tipul real al obiectului
- Abstractizare - complexitatea este ascunsa in spatele unor interfete simple.
@thinkphp
thinkphp / polimorfirsm.cpp
Created March 15, 2026 09:19
Polimorfism OOP pilon de baza
#include <iostream>
#include <vector>
using namespace std;
class Angajat {
protected:
string nume;
@thinkphp
thinkphp / prime.cpp
Created March 14, 2026 10:54
prime.cpp testare
#include <iostream>
using namespace std;
int isPrime(int n) {
int i = 2;
int prime = 1;
@thinkphp
thinkphp / teorema-fundamentala-arit.cpp
Created March 14, 2026 10:40
teorema-fundamentala-arit.cpp
/*Teorema fundamentala a aritmeticii
orice numar poate sa fie descompus in produs de factori primi
10 = 2^1 * 5^1
11 = 11^1
12 = 2^2 * 3
@thinkphp
thinkphp / Greedy.cpp
Created March 14, 2026 10:02
Greedy.cpp Teorie
/*
Greedy
------
Se considera o multime A. Se cere o submultime a sa astfel incat sa fie indeplinite anumite conditii (acestea difera de la o problema la alta).
Structura generala a unei aplicatii Greedy este data mai jos:
@thinkphp
thinkphp / teorie-divide-et-impera
Created March 14, 2026 09:40
teorie-divide-et-impera
Divide Et Impera:
Prezentare generala:
--------------------------------------
Este o tehnica speciala prin care se pot rezolva anumite probleme:
Divide et impera se bazeaza pe un principiu extrem de simplu:
- descompunem problema in doua sau mai multe subprobleme (mai usoare)
care se rezolva, iar solutia pentru problema initiala se obtine combinand solutiile problemelor in care a fost descompusa problema intiala
@thinkphp
thinkphp / divide-et-impera.cpp
Created March 14, 2026 09:39
divide-et-impera.cpp
#include <iostream>
using namespace std;
int v[100];
// 1 5
/*
n=5
10 101 90 23 44