Articole

#include <iostream>

using namespace std;

int main()
{ int n; cin >> n; if( n % 100 != 0 && n % 4 0 || n % 400 0){ std::cout << “ ESTE AN BISECT “ << std::endl; } else { std::cout << “ NU ESTE AN BISECT “ << std::endl;

glhf

Nota: MakeIncreasing inca ii WIP

#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 < 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;
}

Se da o matrice mat cu m>=1 linii si n>=1 coloane, avand toate elementele distincte. Sa se interschimbe liniile pe care se afla cel mai mic si respectiv cel mai mare element din matrice.- de facut in CodeBlocks

2)Se da o matrice A cu m>=1 linii si n>=1 coloane. De asemenea, se dau q numere intregi. Pentru fiecare dintre acestea, sa se determine daca apare in matrice.- de facut in CodeBlocks

3)Se da o matrice cu m>=1 linii si n>=1 coloane. Sa se roteasca cu 90 de grade in sensul acelor de ceasornic matricea data.- de facut in CodeBlocks

4)Se da o matrice A cu m>=1 linii, n>=1 coloane. Se se permute circular coloanele matricei cu o pozitie la stanga.- de gandit

#include <iostream>
using namespace std;
#define MOD 1000000007

/*ifstream fin(“file.in”);
ofstream fout(“file.out”);*/

int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); int n; long long sum; long long a, a1, a2, a3, x; long long k1, k2; long long fact2, fact4; cin >> n; for(int i = 1; i <= n; ++i){ cin >> x; sum = 1; k1 = x, k2 = x – 1; a = x, a1 = x – 1, a2 = x – 2, a3 = x – 3; if(k1 % 2 == 0) k1 /= 2; else k2 /= 2;

#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; 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;

#include <fstream>
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 <iostream>
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;
}

nu mai zi ca stii C++ ca de fapt faci C cu iostream si fstream si folosesti neironic cstring si <bits/stdc++.h> si using namespace std haha

#include <iostream>
#include <deque>
using namespace std;

long long c⁴⁰¹⁴⁰¹;
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];