Articolele lui Moldovan Alexandru Bogdan (AlexMoldovan)

void sorteaza(int ii, int jj) { for(int i = ii; i <= jj; i++) for(int p = i; p > ii && a[p] < a[p-1]; p--) swap(a[p], a[p-1]); }

void sorteaza(int ii, int jj) { for(int i = ii; i < jj; i++) for(int j = i+1; j <= jj; j++) if(a[i] > a[j]) swap(a[i], a[j]); }

void sorteaza(int ii, int jj) { bool sortat = false; while(!sortat) { sortat = true; for(int i = ii; i < jj; i++) { if(a[i] > a[i+1]) { swap(a[i], a[i+1]); sortat = false; } } } }

int x = a[1]; // retinem primul element for(int i = 1; i < n; i++) // il stergem a[i] = a[i+1]; a[n] = x; // il inseram la final

Doua variabile intregi au aceeasi paritate ↔ (x%2 0) (y%2 == 0)

Pm = n!
Pm – nr. de permutari posibile a multimii m, unde n e numarul de elemente

https://imgur.com/a/egqKVaq

for(int i = 1; i <= q; i++) { int l1, c1, l2, c2, v; cin >> l1 >> c1 >> l2 >> c2 >> v; // "smenul lui mars" M[l1][c1] += v; M[l1][c2+1] -= v; M[l2+1][c1] -= v; M[l2+1][c2+1] += v; } // sume partiale for(int i = 1; i <= n; i ++) for(int j = 1; j <= n; j ++) M[i][j] = M[i-1][j] + M[i][j-1] - M[i-1][j-1] + M[i][j];

#include <cstring> #define vocala(x) (strchr("aeiou", (x))) #define consoana(x) (!vocala((x)) && (x) >= 'a' && (x) <= 'z')

#pragma GCC optimize("Ofast","unroll-loops") #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")

@bool este_fibo(int n)
{ if(n == 1) return true;