Articole

int cmmdc(int a, int b) { if(b == 0) return a; return cmmdc(b, a%b); }

Articol

#include <bits/stdc++.h>

using namespace std;

typedef unsigned long long ull;

ull n;
vector<ull> cifre;

inline ull elcif(ull n, int x){ return n/(ull)pow(10, x) * (ull)pow(10, x – 1) + n % (ull)pow(10, x – 1);
}

int main(){ ifstream fin(“numere16.in”); ofstream fout(“numere16.out”);

@#include <iostream>
#include <algorithm>

using namespace std;

int v¹⁰⁰¹;
int main()
{ int n, x; cin >> n; for(int i = 1; i <= n; i++) cin >> v[i];

// facem perechi de elemente distincte for(int i = 1; i < n; i++) { for(int j = i+1; j <= n; j++) { // interschimbam daca e nevoie if(v[i] > v[j]) { int aux = v[i]; v[i] = v[j]; v[j] = aux; } } }

for(int i=1; i<=n; i++) for(int j=i+1; j<=n; j++) for(int k=j+1; k<=n; k++) if(e_triunghi(v[i], v[j], v[k]))

#define e_triunghi(a,b,c) (a + b > c && a + c > b && b + c > a)

@uint64_t p2(uint64_t x)
{ int biti = 0, setati = 0; while(x != 1) { if(x & 1) setati++;

I love DijStef

@#include <iostream>
#include <fstream>

using namespace std;

ifstream in(“interclasare2.in”);
ofstream out(“interclasare2.out”);

int a^1000001;
int b^1000001;
int ic = 1;

void afisare(int x)
{ out << x; if(ic++ % 10 == 0) out << ‘\n’; else out << ‘ ‘;
}

int main()
{ int n, p, ac = 1, bc = 1; in >> n; for(int i = 1; i <= n; i++) in >> a[i];