citire si afisare

#include <iostream>

using namespace std;

int main()
{
int a[101][101];
int n,m;//dimensiuni n linii m coloane
int i,j;//linie coloana
cout<<"linii:";
cin>>n;
cout<<"coloane:";
cin>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
{
cout<<"a["<<i<<"]["<<j<<"]=";
cin>>a[i][j];
}
for (i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
cout<<a[i][j]<<' ';
cout<<'\n';
}
return 0;
}
fie a cu n linii si m coloane. determinati suma elementelor
#include <iostream>

using namespace std;

int main()
{
int a[101][101];
int n,m;//dimensiuni n linii m coloane
int i,j;//linie coloana
cout<<"linii:";
cin>>n;
cout<<"coloane:";
cin>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
{
cout<<"a["<<i<<"]["<<j<<"]=";
cin>>a[i][j];
}
int s=0;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
s=s+a[i][j];
cout<<"s="<<s;
return 0;
}
fie a cu n si m coloane
produsul valorilor pare
#include <iostream>
using namespace std;

int main()
{
int a[101][101];
int n,m;//dimensiuni n linii m coloane
int i,j;//linie coloana
cout<<"linii:";
cin>>n;
cout<<"coloane:";
cin>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
cin>>a[i][j];
int p=1;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
if(a[i][j]%2==0)
p=p*a[i][j];
cout<<"p="<<p;
return 0;
}
a cu n linii si m coloane. cate elemente divizibile cu 3 se afla pe linii impare?
#include <iostream>

using namespace std;

int main()
{
int a[101][101];
int n,m;//dimensiuni n linii m coloane
int i,j;//linie coloana
cout<<"linii:";
cin>>n;
cout<<"coloane:";
cin>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
cin>>a[i][j];
int k=0;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
if(i%2!=0&&a[i][j]%3==0)
k++;
cout<<k;

return 0;
}
sau eficient dupa citire
#include <iostream>

using namespace std;

int main()
{
int a[101][101];
int n,m;//dimensiuni n linii m coloane
int i,j;//linie coloana
cout<<"linii:";
 cin>>n;
cout<<"coloane:";
cin>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
cin>>a[i][j];
int k=0;
for(i=1;i<=n;i+=2)
for(j=1;j<=m;j++)
if(a[i][j]%3==0)
k++;
cout<<k;

return 0;
}
fie a cu n linii si m coloane. cate elemente sunt pozitive, negative si nule?
#include<iostream>
///l.)fie a cu n linii si m coloane,cate elemente sunt pozitive ,negative si nule
using namespace std;

int main()
{int n,m,p=0,neg=0,nule=0,i,j;
cin>>n;
cin>>m;
int a[n+1][m+1];
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
cin>>a[i][j];
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
if(a[i][j]>0)
p++;
else
if(a[i][j]==0)
nule++;
else
if(a[i][j]<0)
neg++;
cout<<p<<endl<<neg<<endl;
cout<<nule;
return 0;
}

fie a cu n linii si m coloane

determinati valoarea maxima
#include <iostream>
#include <climits>
using namespace std;

int main()
{
int a[101][101],max=INT_MIN;
int n,m;//dimensiuni n linii m coloane
int i,j;//linie coloana
cout<<"linii:";
cin>>n;
cout<<"coloane:";
cin>>m;
for(i=1;i<=n;i++)
 for(j=1;j<=m;j++)
cin>>a[i][j];
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
if(a[i][j]>max)
max=a[i][j];
cout<<max;
return 0;
}
fie a cu n linii si m coloane
determinati valoarea minima si nr de aparitii
#include <iostream>
#include <climits>
using namespace std;

int main()
{
int a[101][101],k=0,min=INT_MAX;
int n,m;//dimensiuni n linii m coloane
int i,j;//linie coloana
cout<<"linii:";
cin>>n;
cout<<"coloane:";
cin>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
cin>>a[i][j];
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
if(a[i][j]<min)
{min=a[i][j];k=1;}
else
if (a[i][j]==min)
k++;
cout<<min<<' '<<k;
return 0;
}
sau ineficient
#include <iostream>
#include <climits>
using namespace std;

int main()
{
int a[101][101],k=0,min=INT_MAX;
int n,m;//dimensiuni n linii m coloane
int i,j;//linie coloana
cout<<"linii:";
cin>>n;
cout<<"coloane:";
cin>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
cin>>a[i][j];
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
if(a[i][j]<min)
min=a[i][j];
for(i=1;i<=n;i++)
 for(j=1;j<=m;j++)
if(a[i][j]==min)
k++;
cout<<min<<' '<<k;
return 0;
}