1a:I[83391,["/_next/static/chunks/01ctw1akxhipf.js","/_next/static/chunks/0es-u.8d.mnrl.js","/_next/static/chunks/0dy1a2.mvnkkn.js","/_next/static/chunks/1490m.ueos6wm.js","/_next/static/chunks/0e0r8s6q6rqo3.js","/_next/static/chunks/06ql-volcxfrm.js"],"ProblemWorkspace",1] 1e:I[27201,["/_next/static/chunks/01xlw8hd842-c.js","/_next/static/chunks/0-mla.nmfqw.d.js"],"IconMark"] 1b:T4a3,class Utilizator { private: string nume; public: Utilizator(string n = "") : nume(n) {} string getNume() { return nume; } }; class ReteaSociala { private: vector utilizatori; map> prietenii; public: int adaugaUtilizator(string nume) { utilizatori.push_back(Utilizator(nume)); return utilizatori.size() - 1; } bool valid(int id) { return id >= 0 && id < (int)utilizatori.size(); } bool adaugaPrietenie(int id1, int id2) { if (!valid(id1) || !valid(id2) || id1 == id2) return false; if (prietenii[id1].count(id2)) return false; prietenii[id1].insert(id2); prietenii[id2].insert(id1); return true; } bool suntPrieteni(int id1, int id2) { if (!valid(id1) || !valid(id2)) return false; return prietenii[id1].count(id2) > 0; } int numarPrieteni(int id) { if (!valid(id)) return 0; return prietenii[id].size(); } int prieteniComuni(int id1, int id2) { if (!valid(id1) || !valid(id2)) return 0; int c = 0; for (int x : prietenii[id1]) if (prietenii[id2].count(x)) c++; return c; } }; 1c:T4a3,class Utilizator { private: string nume; public: Utilizator(string n = "") : nume(n) {} string getNume() { return nume; } }; class ReteaSociala { private: vector utilizatori; map> prietenii; public: int adaugaUtilizator(string nume) { utilizatori.push_back(Utilizator(nume)); return utilizatori.size() - 1; } bool valid(int id) { return id >= 0 && id < (int)utilizatori.size(); } bool adaugaPrietenie(int id1, int id2) { if (!valid(id1) || !valid(id2) || id1 == id2) return false; if (prietenii[id1].count(id2)) return false; prietenii[id1].insert(id2); prietenii[id2].insert(id1); return true; } bool suntPrieteni(int id1, int id2) { if (!valid(id1) || !valid(id2)) return false; return prietenii[id1].count(id2) > 0; } int numarPrieteni(int id) { if (!valid(id)) return 0; return prietenii[id].size(); } int prieteniComuni(int id1, int id2) { if (!valid(id1) || !valid(id2)) return 0; int c = 0; for (int x : prietenii[id1]) if (prietenii[id2].count(x)) c++; return c; } }; 1d:T509,class Utilizator: def __init__(self, nume=""): self.__nume = nume def getNume(self): return self.__nume class ReteaSociala: def __init__(self): self.__utilizatori = [] self.__prietenii = {} def __valid(self, id): return 0 <= id < len(self.__utilizatori) def adaugaUtilizator(self, nume): self.__utilizatori.append(Utilizator(nume)) idNou = len(self.__utilizatori) - 1 self.__prietenii[idNou] = set() return idNou def adaugaPrietenie(self, id1, id2): if not self.__valid(id1) or not self.__valid(id2) or id1 == id2: return False if id2 in self.__prietenii[id1]: return False self.__prietenii[id1].add(id2) self.__prietenii[id2].add(id1) return True def suntPrieteni(self, id1, id2): if not self.__valid(id1) or not self.__valid(id2): return False return id2 in self.__prietenii[id1] def numarPrieteni(self, id): if not self.__valid(id): return 0 return len(self.__prietenii[id]) def prieteniComuni(self, id1, id2): if not self.__valid(id1) or not self.__valid(id2): return 0 return len(self.__prietenii[id1] & self.__prietenii[id2])