This shows you the differences between two versions of the page.
rosedu:cdl:marius-dragus [2010/03/27 10:19] mdragus |
rosedu:cdl:marius-dragus [2020/07/20 09:16] |
||
---|---|---|---|
Line 1: | Line 1: | ||
- | = Marius Dragus = | ||
- | *Nume complet: Dragus Marius Ioan | ||
- | *Alias-uri: DMI | ||
- | *Data/locul nașterii: 14 octombrie 1990, | ||
- | == Educatie == | ||
- | | ||
- | | ||
- | == Competente == | ||
- | *sunt smecher ce sa mai.... | ||
- | |||
- | == Link-uri spre alti oameni smecheri == | ||
- | [[rosedu: | ||
- | |||
- | [[rosedu: | ||
- | ==Acum niste cod baby== | ||
- | < | ||
- | # | ||
- | # | ||
- | # | ||
- | #define pb push_back | ||
- | #define mkp make_pair | ||
- | |||
- | using namespace std; | ||
- | const int maxn = 340; | ||
- | |||
- | vector< | ||
- | vector< | ||
- | short N, | ||
- | short VER[maxn]; | ||
- | short NRT, | ||
- | short D[maxn][maxn], | ||
- | |||
- | bool cmpf(pair< | ||
- | { | ||
- | short n1 = p1.first; | ||
- | short n2 = p2.first; | ||
- | short i1 = p1.second; | ||
- | short i2 = p2.second; | ||
- | for(;i1 <= N && i2 <= N; | ||
- | { | ||
- | if (D[n1][i1] != D[n2][i2]) return D[n1][i1] < D[n2][i2]; | ||
- | if (D[n1][i1] == 0) return false; | ||
- | } | ||
- | return false; | ||
- | } | ||
- | |||
- | </ | ||
- | |||
- | ==Si un tabel cu giberis== | ||
- | |||
- | ^Ceva ^Blablabla ^altceva ^ | ||
- | |caca |maca|nata| | ||
- | |gata|cu|rimele| |