Articolele lui Tudurachi Călin (colan007)

#include
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; case 3: return 0; break; }

}

int main()
{ cin >> T; while(T—){ cin >> n >> k; x = xor_n(n); x ^= k; cout << x << “\n”; } return 0;

}

#include
using namespace std;

int NrSwipe, n;

struct pereche{ int p, sw;
}f⁵⁰⁰¹;

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(){ cin >> n >> NrSwipe; for(int i = 1; i <= n; i++) cin >> f[i].p >> f[i].sw; cout << Rucsac(NrSwipe, n); return 0;
}

#include

using namespace std;

typedef unsigned long long ull;

ull n;
vector 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) { ull x = elcif(n, i); if (x && __gcd(x, n) == 1) cifre.push_back(x); } if (cifre.empty()) fout << “NU EXISTA”; else { sort(cifre.begin(), cifre.end()); for (ull x : cifre) fout << x << ‘ ‘; } return 0; }

#include
#include
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 >> mat[i][j]; sum += mat[i][j]; if ( (i & 1 || j & 1) && (i != 1 || j != 1) && (i != n || j != m)) minim = min(minim, mat[i][j]); } if (n % 2 0 && m % 2 0) { fout << n * m – 1 << ‘ ‘ << sum – minim; } else fout << n * m << ‘ ‘ << sum; }

#include
using namespace std;

ifstream cin(“qtsume.in”);
ofstream cout(“qtsume.out”);

long long s¹⁰⁰⁰⁰¹, q, a, b, n, x¹⁰⁰⁰⁰¹, s1¹⁰⁰⁰⁰¹;

int main(){ cin >> n; for(int i = 1; i <= n; i++) cin >> x[i]; s¹ = x¹; s1¹ = x¹; for(int i = 2; i <= n; i++){ s[i] = s[i – 1] + i * x[i]; s1[i]= s1[i – 1] + x[i]; } cin >> q; while(q—){ cin >> a >> b; long long s2 = s1[b] – s1[a – 1]; long long s3 = s[b] – s[a – 1]; cout << s3 – s2 * (a – 1) << ‘\n’; } return 0;
}

#include
#include

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 < MAX; i++) if(E[i]) for(int j = i; j < MAX; j += i) nrdiv[j]++;

}

int main(){ ciur(); int n, x; cin >> n; for(int i = 1; i <= n; i++){ cin >> x; cout << (1 << nrdiv[x]) << ‘ ‘; } return 0;
}

#include

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; while(n) n/=10, cf++; return cf;
}

int nr_pal(int n){ if(n==-1) return 0; int cif = nrcif(n), rasp = 1; if(cif & 1){ rasp += 2*(pow(10, cif/2)-1); int pal = n/pow(10, cif/2) * pow(10, cif/2) – og(n/pow(10, cif/2 + 1)); if(n >= pal) rasp += n/pow(10, cif/2) – pow(10, cif/2) + 1; else rasp += n/pow(10, cif/2) – pow(10, cif/2); } else { rasp += 2*(pow(10, (cif-1)/2)-1) + 9*(pow(10, (cif-1)/2)); int pal = n/pow(10, cif/2) * pow(10, cif/2) + og(n/pow(10, cif/2)); if(n >= pal) rasp += n/pow(10, cif/2) – pow(10, cif/2-1) + 1; else rasp += n/pow(10, cif/2) – pow(10, cif/2-1); } return rasp;
}

int main()
{ int n, a, b; cin >> n; for(int i = 1; i <= n; i++){ cin >> a >> b; cout << nr_pal(b) – nr_pal(a-1) << endl;

} return 0; }

#include
using namespace std;
ifstream cin(“cochilie.in”);
ofstream cout(“cochilie.out”);

int m^10011001, fib³⁰, 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 % 4 1){ for(int col = col1; col <= col2; col++) m[lin1 - 1][col] = i; lin1--; } else if(i % 4 2){ for(int lin = lin1; lin <= lin2; lin++) m[lin][col2 + 1] = i; col2++; } else if(i % 4 == 3){ for(int col = col1; col <= col2; col++) m[lin2 + 1][col] = i; lin2++; } else { for(int lin = lin1; lin <= lin2; lin++) m[lin][col1 – 1] = i; col1—; } }
}

void fibo(){ fib¹ = fib² = 1; for(int i = 3; i <= 29; i++) fib[i] = fib[i – 1] + fib[i – 2];
}

void first(){ int NRLIN = 0, NRCOL = 0; for(int i = lin1; i <= lin2; i++) if(m[i][col1] != m[i-1][col1]) NRLIN += fib[m[i][col1]]; for(int j = col1; j <= col2; j++) if(m[lin1][j] != m[lin1][j-1]) NRCOL += fib[m[lin1][j]]; cout << NRLIN <<’ ‘<< NRCOL;
}

void second(){ cin >> p; int slinii = 0; for(int i = lin1; i <= lin2; i++){ int mini = 100; for(int j = col1; j <= col2; j++) mini = min(mini, m[i][j]); slinii += fib[mini]; if(p <= slinii){ for(int j = col1; j <= col2; j++) if(m[i][j] != m[i][j-1]) for(int k = 1; k <= fib[m[i][j]]; k++) cout << m[i][j] << ‘ ‘; break; } }
}

int main(){ cin >> c >> n; generare_mat(); fibo(); if(c == 1) first(); else second(); return 0;
}

#include
using namespace std;

int main(){ int n, a^10011001, b^10011001, s^10011001; cin >> n; for(int i = 1; i <= n; i++) for(int j = 1; j <= n; j++) cin >> a[i][j]; s¹¹ = a¹¹; for(int i = 1; i <= n; i++) s[i]¹ = s[i-1]¹ * a[i]¹; for(int j = 1; j <= n; j++) s¹[j] = s¹[j-1] * a¹[j]; for(int i = 1; i <= n; i++) for(int j = 1; j <= n; j ++) s[i][j] = a[i][j] + s[i-1][j] + s[i][j-1] – s[i-1][j-1]; b¹¹ = 0; for(int i = 1; i <= n; i++) b[i]¹ = b[i-1]¹ + s[i-1]¹ * a[i]¹; for(int j = 1; j <= n; j++) b¹[j] = b¹[j-1] + s¹[j-1] * a¹[j]; for(int i = 1; i <= n; i++) for(int j = 1; j <= n; j++) b[i][j] = b[i][j-1] + (s[i][j-1] + s[i-1]¹ – s[i-1][j-1]) * a[i][j]; for(int i = 1; i <= n; i++, cout<<’\n’) for(int j = 1; j <= n; j++ ) cout << b[i][j] << ‘ ‘; return 0;
}

#include
#include
using namespace std;

long long c⁴⁰¹⁴⁰¹;
deque 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){ for(int i = 1; i <= n; i++) for(int j = 1; j <= m; j++) c[i][j] += c[i-1][j] + c[i][j-1] – c[i-1][j-1]; for(int i = k; i <= n; i++) for(int j = k; j <= m; j++){ long long s = c[i][j] – c[i-k][j] – c[i][j-k] + c[i-k][j-k]; if(s > maxi){ maxi = s; up = i – k + 1; down = i; left = j – k + 1; right = j; } } cout << maxi << ‘\n’; cout << up << ‘ ‘ << left << ‘ ‘ << down << ‘ ‘ << right; } else{ for(int i = 1; i <= n; i++) for(int j = 1; j <= m; j++) c[i][j] += c[i-1][j]; for(int i = 1; i <= n; i++) for(int j = i; j <= n && j <= i + k – 1; j ++){ long long H⁴⁰¹; H⁰ = 0; while(Q.size()) Q.pop_back(); for(int f = 1; f <= m; f++) H[f] = H[f – 1] + c[j][f] – c[i – 1][f]; for(int f = 1; f <= m; f++){ while(Q.size() && H[Q.back()] >= H[f]) Q.pop_back(); Q.push_back(f); while(Q.front() < f – k) Q.pop_front(); if(H[f] – H[Q.front()] >= maxi){ maxi = H[f] – H[Q.front()]; up = i; left = Q.front() + 1; down = j; right = f; } } } cout << maxi << “\n” << up << ‘ ‘ << left << ‘ ‘ << down << ‘ ‘ << right; } return 0; }