This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
rosedu:cdl:marius-dragus [2010/03/27 10:01] mdragus |
rosedu:cdl:marius-dragus [2010/03/27 10:19] mdragus |
||
---|---|---|---|
Line 11: | Line 11: | ||
== Link-uri spre alti oameni smecheri == | == Link-uri spre alti oameni smecheri == | ||
- | [[rosedu: | + | [[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| |