Pg.25 Ex.
11
a) #include <iostream> b) #include <iostream>
using namespace std; using namespace std;
int main() int main()
{ {
typedef int Vector[10]; typedef int Vector[10];
int N; int N;
Vector a; Vector a;
cout << "N= "; cout << "N= ";
cin >> N; cin >> N;
for (int i = 0; i < N; i++) for (int i = 0; i < N; i++)
{ {
cout << "a[" << i+1 << "] = "; cout << "a[" << i+1 << "] = ";
cin >> a[i]; cin >> a[i];
} }
cout << "\n Elementele afisate la un interval de 5 pozitii cout << "\nNumerele in ordine inversa sunt:"
(1, 6, 11...):" << endl; endl;
for (int i = 0; i < N; i += 5) for (int i = N - 1; i >= 0; i--)
{ {
cout << "Pozitia " << i+1 << ": " << a[i] << endl; cout << a[i] << " ";
} }
return 0; cout << endl;
return 0;
}
c) #include <iostream> d) #include <iostream>
using namespace std; using namespace std;
int main() int main()
{ {
typedef int Vector[10]; typedef int Tablou[10];
int N; Tablou a;
Vector a; int N;
cout << "N= "; cout << "N=";
cin >> N; cin >> N;
for (int i = 0; i < N; i++) for (int i = 0; i < N; i++)
{ {
cout << "a[" << i+1 << "] = "; cout << "a[" << i+1 << "] = ";
cin >> a[i]; cin >> a[i];
} }
// Sortare descrescatoare (Bubble Sort simplu) for (int i = 0; i < N; i++)
for (int i = 0; i < N - 1; i++) {
{ if (a[i] % 2 == 0)
for (int j = i + 1; j < N; j++) {
{ cout << a[i] << " ";
if (a[i] < a[j]) }
{ }
int aux = a[i]; }
a[i] = a[j]; cout << endl;
a[j] = aux; return 0;
} }
}
}
cout << "\nElementele sortate descrescator sunt:" <<
endl;
for (int i = 0; i < N; i++)
{
cout << a[i] << " ";
}
cout << endl;
return 0;
}
e) #include <iostream> f) #include <iostream>
using namespace std; using namespace std;
int main() int main()
{ {
typedef int Tablou[10]; typedef int Tablou[10];
Tablou a; Tablou a;
int N; int N;
cout << "N= "; cout << "N=";
cin >> N; cin >> N;
for (int i = 0; i < N; i++)
{ for (int i = 0; i < N; i++)
cout << "a[" << i+1 << "] = "; {
cin >> a[i]; cout << "a[" << i+1 << "] = ";
} cin >> a[i];
}
int suma = 0, nr_pare = 0;
for (int i = 0; i < N; i++) for (int i = 0; i < N; i++)
{ {
if (a[i] % 2 == 0) if (a[i] % 2 != 0)
{ {
suma += a[i]; cout << a[i] << " ";
nr_pare++; }
} }
}
if (nr_pare > 0) cout << endl;
{ return 0;
double media = (double)suma / nr_pare; }
cout << "Media= " << media << endl;
} else
{
cout << "Nu exista numere pare in tablou!" <<
endl;
}
return 0;
}
g) using namespace std; h) using namespace std;
int main() int main()
{ {
typedef int Vector[10]; typedef int Vector[10];
Vector a; Vector a;
int i,n,y; int i,n;
float x; float x, y;
cout<<"n=";cin>>n; cout<<"n=";cin>>n;
for (i=0;i<n;i++) for (i=0;i<n;i++)
{ {
cout<<"a["<<i+1<<"]="; cout<<"a["<<i+1<<"]=";
cin>>a[i]; cin>>a[i];
} }
for (i=0; i<n; i++) cout<<a[i]<<" "; for (i=0; i<n; i++) cout<<a[i]<<" ";
cout<<endl; cout<<endl;
cout<<"x=";cin>>x; cout<<"x=";cin>>x;
cout<<"y=";cin>>y; cout<<"y=";cin>>y;
for (i=0; i<n; i++) for (i=0; i<n; i++)
if (a[i]>x && a[i] % y!=0) cout <<a[i]<<" "; if (a[i]>x && a[i] <y) cout <<a[i]<<"
return 0; return 0;
} }
i) #include<iostream> j) #include<iostream>
using namespace std; using namespace std;
int main() int main()
{ {
typedef int Vector[10]; typedef int Vector[10];
Vector a; Vector a;
int i,n; int i,n;
cout<<"n=";cin>>n; cout<<"n=";cin>>n;
for (i=0; i<n; i++) for (i=0;i<n;i++)
{ {
cout<<"a["<<i+1<<"]="; cout<<"a["<<i+1<<"]=";
cin>>a[i]; cin>>a[i];
} }
for (i=0; i<n; i++) cout<<a[i]<<" "; for (i=0;i<n;i++) cout<<a[i]<<" ";
cout<<endl; cout<<endl;
for (i=0; i<n; i++) for (i=0; i<n; i++)
if (a[i] % 2 !=0 && a[i] <0) cout <<i+1<<" "; if ((a[i]>=10 && a[i] <=99) || (a[i]>= -
return 0; && a[i]<= -10)) cout <<i+1<<" ";
} return 0;
}
k) #include<iostream> l) #include<iostream>
using namespace std; using namespace std;
int main() int main()
{ {
typedef int Vector[10]; typedef int Vector[10];
Vector a; Vector a;
int i,n, Min; int i,n, Min;
cout<<"n=";cin>>n; cout<<"n=";cin>>n;
for (i=0; i<n; i++) for (i=0; i<n; i++)
{ {
cout<<"a["<<i+1<<"]="; cout<<"a["<<i+1<<"]=";
cin>>a[i]; cin>>a[i];
} }
for (i=0; i<n; i++) cout<<a[i]<<" "; for (i=0; i<n; i++) cout<<a[i]<<" ";
cout<<endl; cout<<endl;
Min=a[0]; Min=a[0];
for (i=1; i<n; i++) for (i=1; i<n; i++)
if (a[i]<Min) Min=a[i]; if (a[i]<Min) Min=a[i];
a[0]=Min; for (i=0; i<n; i++)
for (i=0; i<n; i++) cout<<a[i]<<" "; {
return 0; if (a[i]==Min) a[i]=a[0]; cout<<a[i]<<"
} }
return 0;
}
m) #include<iostream> n) #include<iostream>
using namespace std; using namespace std;
int main() int main()
{ {
typedef int Vector[10]; typedef int Vector[10];
Vector a, b; Vector a, b;
int i,n, k; int i,n, k;
cout<<"n=";cin>>n; cout<<"n=";cin>>n;
for (i=0; i<n; i++) for (i=0; i<n; i++)
{ {
cout<<"a["<<i+1<<"]="; cout<<"a["<<i+1<<"]=";
cin>>a[i]; cin>>a[i];
} }
for (i=0; i<n; i++) cout<<a[i]<<" "; for (i=0; i<n; i++) cout<<a[i]<<" ";
cout<<endl; cout<<endl;
k=0; k=0;
for (i=0; i<n; i++) for (i=0; i<n; i++)
if (a[i] % 2 ==0) if (a[i] % 3 ==0)
{ {
b[k]=a[i]; b[k]=a[i];
k=k+1; k=k+1;
} }
for (i=0;i<k;i++) cout<<b[i]<<" "; for (i=0; i<k; i++) cout<<b[i]<<" ";
return 0;
return 0;
}
}
Exercițiul 7, pagina 23 punctul b):
o) #include <iostream>
#include<cmath> #include <iostream>
using namespace std; using namespace std;
int main() int main()
{ {
typedef int Vector[10]; typedef double venit[7];
venit v;
Vector a, b;
float vmax = 0.0;
int n, m = 0; float VS=0.0;
float VM;
int i, j;
int ziuamax = 0;
cout << "n= "; int i;
cin >> n;
for (i = 0; i < n; i++) cout << "Introduceti veniturile zilnice a
{ intreprinderii: " << endl;
cout<<"a["<<i+1<<"]=";
cin >> a[i]; for (i = 0; i<7; i++)
} {
cout << "Ziua " << (i + 1) << ": ";
for (i = 0; i < n; i++) cin >> v[i];
{ }
int cnt = 0;
for (i=0; i<7; i++) VS=VS+v[i];
if (a[i] != 0)
cout<<"a) VS="<<VS<<endl;
{
for (j = 1; j <= abs(a[i]); j++) VM=(float)VS/7;
{ cout<<"b) VM="<<VM<<endl;
if (a[i] % j == 0) cnt++;
} for (i = 0; i<7; i++)
} {
if (v[i] > vmax)
if (cnt > 0 && cnt <= 4) {
{ vmax = v[i];
b[m] = a[i]; ziuamax=i+1;
}
m++;
}
} cout << "c) Ziua cu cel mai mare venit este
} " << ziuamax << endl;
return 0;
for ( i = 0; i < m; i++) }
{
cout << b[i] << " ";
}
cout << endl;
return 0;
}
Pg.25 Ex 14 a) Pg.25 Ex 14 b)
#include <iostream> #include <iostream>
using namespace std; using namespace std;
int main() int main()
{ {
typedef int Matrice[10][10]; typedef int Matrice[10][10];
Matrice a; Matrice a;
int i,j,n; int i,j,n;
int S; int S;
cout << "n="; cout << "n=";
cin >> n; cin >> n;
for (i = 0; i < n; i++) for (i = 0; i < n; i++)
for (j = 0; j < n; j++) for (j = 0; j < n; j++)
{ {
cout<<"a["<<i+1<<","<<j+1<<"]="; cout<<"a["<<i+1<<","<<j+1<<"]=";
cin >> a[i][j]; cin >> a[i][j];
} }
for (i = 0; i < n; i++) for (i = 0; i < n; i++)
{ {
for (j = 0; j < n; j++) cout<<a[i][j]<<" "; for (j = 0; j < n; j++) cout<<a[i][j]<<"
cout<<endl; cout<<endl;
} }
S=0; S=0;
for (i = 0; i < n; i++) for (i = 0; i < n; i++)
for (j = 0; j < n; j++) for (j = 0; j < n; j++)
if (i==j) S=S+a[i][j]; if (i + j == n - 1) S=S+a[i][j];
cout<<"S="<<S; cout<<"S="<<S;
return 0; return 0;
} }
Pg.25 Ex 14 c) Pg.25 Ex 14 d)
#include <iostream> #include <iostream>
using namespace std; using namespace std;
int main() int main()
{ {
typedef int Matrice[10][10]; typedef int Matrice[10][10];
Matrice a; Matrice a;
int i,j,n; int i,j,n;
int S; int S;
cout << "n="; cout << "n=";
cin >> n; cin >> n;
for (i = 0; i < n; i++) for (i = 0; i < n; i++)
for (j = 0; j < n; j++) for (j = 0; j < n; j++)
{ {
cout<<"a["<<i+1<<","<<j+1<<"]="; cout<<"a["<<i+1<<","<<j+1<<"]=";
cin >> a[i][j]; cin >> a[i][j];
} }
for (i = 0; i < n; i++) for (i = 0; i < n; i++)
{ {
for (j = 0; j < n; j++) cout<<a[i][j]<<" "; for (j = 0; j < n; j++) cout<<a[i][j]<<"
cout<<endl; cout<<endl;
} }
S=0; S=0;
for (i = 0; i < n; i++) for (i = 0; i < n; i++)
for (j = 0; j < n; j++) for (j = 0; j < n; j++)
if (i < j) S=S+a[i][j]; if (i > j) S=S+a[i][j];
cout<<"S="<<S; cout<<"S="<<S;
return 0; return 0;
} }
Pg.25 Ex 14 e) Pg.25 Ex 14 f)
#include <iostream> #include <iostream>
using namespace std; using namespace std;
int main() int main()
{ {
typedef int Matrice[10][10]; typedef int Matrice[10][10];
Matrice a; Matrice a;
int i,j,n; int i,j,n;
int S; int S;
cout << "n="; cout << "n=";
cin >> n; cin >> n;
for (i = 0; i < n; i++) for (i = 0; i < n; i++)
for (j = 0; j < n; j++) for (j = 0; j < n; j++)
{ {
cout<<"a["<<i+1<<","<<j+1<<"]=";
cin >> a[i][j]; cout<<"a["<<i+1<<","<<j+1<<"]=";
} cin >> a[i][j];
for (i = 0; i < n; i++) }
{ for (i = 0; i < n; i++)
for (j = 0; j < n; j++) cout<<a[i][j]<<" "; {
cout<<endl; for (j = 0; j < n; j++) cout<<a[i][j]<<
} cout<<endl;
S=0; }
for (i = 0; i < n; i++) S=0;
for (j = 0; j < n; j++) for (i = 0; i < n; i++)
if (i > n-1-j) S=S+a[i][j]; for (j = 0; j < n; j++)
if (i < n-1-j) S=S+a[i][j];
cout<<"S="<<S;
return 0; cout<<"S="<<S;
} return 0;
}
Calculați suma elementelor de pe fiecare coloană Afișați elementul minim și pozițiile lui
#include <iostream> #include <iostream>
using namespace std; using namespace std;
int main() int main()
{ {
typedef int Matrice[10][10]; typedef int Matrice[10][10];
Matrice a; Matrice a;
int i,j, n, m, min; int i,j, n, m, Min;
int S; int S;
cout << "n="; cin >> n; cout << "n="; cin >> n;
cout << "m="; cin >> m; cout << "m="; cin >> m;
for (i = 0; i < n; i++) for (i = 0; i < n; i++)
for (j = 0; j < m; j++) for (j = 0; j < m; j++)
{ {
cout<<"a["<<i+1<<","<<j+1<<"]="; cout<<"a["<<i+1<<","<<j+1<<"]=";
cin >> a[i][j]; cin >> a[i][j];
} }
for (i = 0; i < n; i++) for (i = 0; i < n; i++)
{ {
for (j = 0; j < m; j++) cout<<a[i][j]<<" "; for (j = 0; j < m; j++) cout<<a[i][j]<<"
cout<<endl; cout<<endl;
} }
for (j = 0; j < m; j++) Min=a[1][1];
{ for (i = 0; i < n; i++)
S=0; for (j = 0; j < m; j++)
for (i = 0; i < n; i++) S=S+a[i][j]; if (a[i][j ]< Min) Min=a[i][j];
cout<<"coloana "<<j+1<<":"<<" cout<<"Min="<<Min<<endl;
S="<<S<<endl;
} for (i = 0; i < n; i++)
for (j = 0; j < m; j++)
return 0; if (a[i][j]==Min) cout<<i+1<<" "<<j+1<<
} "<<endl;
return 0;
}