Articolele lui Tudurachi Călin (colan007)

#include <bits/stdc++.h> using namespace std; ifstream fin (“ghicitoare.in”); ofstream fout (“ghicitoare.out”); #define cin fin #define cout fout int n, x, T, k; int xor_n (int n) { switch(n % 4){ case 0: return n; break; case 1: return 1; break; case 2: return n + 1; break; ... (mai mult)

#include <bits/stdc++.h> using namespace std; int NrSwipe, n; struct pereche{ int p, sw; }f5001; int Rucsac(int Sw, int n){ int dp[Sw + 1]; memset(dp, 0, sizeof(dp)); for(int i = 1; i <= n; i++) for(int j = Sw; j >= 0; j—) if(f[i].sw <= j) dp[j] = max(dp[j], dp[j – f[i].sw] + f[i].p); return dp[Sw]; } int main(){ ... (mai mult)

#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”); fin >> n; ull cn = n; for (int i = 1; cn; i++, cn /= 10) { ... (mai mult)

#include <fstream> #include <climits> using namespace std; ifstream fin (“mouse.in”); ofstream fout (“mouse.out”); const int nMAX = 100; const int mMAX = 100; int n, m; int mat[nMAX + 1][mMAX + 1]; int main() { fin >> n >> m; int sum = 0, minim = INT_MAX; for (int i = 1; i <= n; ++i) for (int j = 1; j <= m; ++j) { fin >&g ... (mai mult)

#include <fstream> using namespace std; ifstream cin(“qtsume.in”); ofstream cout(“qtsume.out”); long long s100001, q, a, b, n, x100001, s1100001; int main(){ cin >> n; for(int i = 1; i <= n; i++) cin >> x[i]; s1 = x1; s11 = x1; for(int i = 2; i <= n; i++){ s[i] = s[i – 1] + i * x[i]; s1[i]= s1[i – 1] + x[i]; } cin &g ... (mai mult)

#include <fstream> #include <cstring> using namespace std; const int MAX = int(1e7); bool E[MAX]; short nrdiv[MAX]; ifstream cin(“eratostene4.in”); ofstream cout(“eratostene4.out”); void ciur(){ memset(E, 1, MAX); for(int i = 2; i * i < MAX; i++) if(E[i]) for(int j = i * i; j < MAX; j+=i) E[j] = 0; for(int i = 2; i < ... (mai mult)

#include <fstream> using namespace std; ifstream cin(“nr_pal.in”); ofstream cout(“nr_pal.out”); int pow(int a, int b){ int p = 1; for(int i = 1; i <= b; i++) p*=a; return p; } int og(int n){ int ogl = 0; while(n){ ogl = ogl*10 + n%10; n/=10; } return ogl; } int nrcif(int n){ int cf = 0; if(n == 0) return 1 ... (mai mult)

#include <fstream> using namespace std; ifstream cin(“cochilie.in”); ofstream cout(“cochilie.out”); int m10011001, fib30, c, lin1, lin2, col1, col2, n, p; void generare_mat(); void fibo(); void first(); void second(); void generare_mat(){ lin1 = 500, col1 = 500, lin2 = 500, col2 = 501; m[lin1][col1] = 1, m[lin2][col2] = 2; for(int i = 3; i <= n; i++){ if(i ... (mai mult)

#include <iostream> using namespace std; int main(){ int n, a10011001, b10011001, s10011001; cin >> n; for(int i = 1; i <= n; i++) for(int j = 1; j <= n; j++) cin >> a[i][j]; s11 = a11; for(int i = 1; i <= n; i++) s[i]1 = s[i-1]1 * a[i]1; for(int j = 1; j <= n; j++) s1[j] = s1[j-1] * a1[j]; for( ... (mai mult)

#include <iostream> #include <deque> using namespace std; long long c401401; deque <long long> Q; int op, n, m, k; int main(){ cin >> op >> n >> m >> k; for(int i = 1; i <= n; i++) for(int j = 1; j <=m; j++) cin >> c[i][j]; long long maxi = -1LL << 63, up, down, left, right; if(op == 1){ ... (mai mult)