Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- bool verifica(int *v, int n) {
- for (int i = 1; i < n; i++) {
- if (v[i] != i + v[i - 1]) { //la proprieta' non vale
- return false;
- }
- }
- return true;
- }
- bool sommeCrescenti(int **A, int n, int m) {
- int s_a = 0;
- int s_b = 0;
- for (int i = 0; i < n - 1; i++) {
- //1ma sol
- //(n-1)*(1+1+m(1+1)+1)
- //(n-1)*(3+2m) O(n*m)
- //
- // int s_a = 0;
- // int s_b = 0;
- // for (int j = 0; j < m; j++) {
- // s_a += A[i][j];
- // s_b += A[i + 1][j];
- // }
- // if (s_a >= s_b)
- // return false;
- //2da sol
- s_a = s_b;
- s_b = 0;
- for (int j = 0; j < m; j++) {
- if (i == 0) {
- if (j == 0)
- s_a = 0;
- s_a += A[i][j];
- }
- s_b += A[i + 1][j];
- }
- if (s_a >= s_b)
- return false;
- //3za sol
- //(n-1)*(1+1+m(1+1)+1)
- //(n-1)*(3+2m) O(n*m)
- //
- // int s_a = 0;
- // for (int j = 0; j < m; j++) {
- // s_a += A[i][j];
- // s_a -= A[i + 1][j];
- // }
- // if (s_a >= 0)
- // return false;
- }
- return true;
- }
- int* estraiArray(int **A, int n, int m, int h, int k) {
- int *v = new int[((n - h) * (m - k))];
- int c = 0;
- for (int i = h; i < n; i++) {
- for (int j = k; j < m; j++) {
- v[c++] = A[i][j];
- }
- }
- return v;
- }
- int** annulladuplicati(int **A, int n, int m) {
- int **M = new int*[n];
- for (int i = 0; i < n; i++) {
- M[i] = new int[m];
- }
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < m; j++) {
- bool duplicato=false;
- for(int k=0;k<n;k++){
- if(A[i][j]==A[k][j] && k!=i){
- duplicato=true;
- break;
- }
- }
- if (!duplicato)
- M[i][j] = A[i][j];
- else
- M[i][j] = 0;
- }
- }
- return M;
- }
- int main() {
- cout << "!!!Esercizio per casa!!!" << endl;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement