Scribd
Upload
51 views11 pages

Stef & Radu

The document contains several C++ programs that perform operations on matrices and vectors such as: 1. Summing the elements of matrices and vectors. 2. Checking properties of vectors like primality. 3. Sorting vectors. 4. Traversing matrices and vectors in different orders. 5. Inserting and deleting elements from vectors. The programs take matrices and vectors as input, perform various operations like summing, sorting, checking properties, and outputting results. They demonstrate basic operations on 2D arrays and 1D arrays in C++.

Uploaded by

stef.kndm
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
51 views11 pages

Stef & Radu

The document contains several C++ programs that perform operations on matrices and vectors such as: 1. Summing the elements of matrices and vectors. 2. Checking properties of vectors like primality. 3. Sorting vectors. 4. Traversing matrices and vectors in different orders. 5. Inserting and deleting elements from vectors. The programs take matrices and vectors as input, perform various operations like summing, sorting, checking properties, and outputting results. They demonstrate basic operations on 2D arrays and 1D arrays in C++.

Uploaded by

stef.kndm
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 11

STEF & RADU

MATRICE

#659( mat oarecare)

#include <iostream>

using namespace std;

int main()
{
int n,m,a[101][101],i,j,s,maxl;
cin>>n>>m;
for(i=1;i<=n;i++) {
for(j=1;j<=m;j++) {
cin>>a[i][j];
}
}
for(i=1;i<=n;i++) {
s=0;
maxl=a[i][1];
for(j=1;j<=m;j++) {
s+=a[i][j];
if(maxl<a[i][j]) maxl=a[i][j];
}
s-=maxl;
cout<<s<<" ";
}
return 0;
}

#658( mat oarecare)


#include <iostream>

using namespace std;

int main()
{
///matrice cu n linii si m coloane
int n,m,a[101][101],i,j,s;
cin>>n>>m;
for(i=1;i<=n;i++) {
for(j=1;j<=m;j++) {
cin>>a[i][j];
}
}
for(i=1;i<=n;i++) {
s=0;
for(j=1;j<=m;j++) {
s+=a[i][j];
}
cout<<s<<" ";
}
return 0;
}

#666( mat oarecare)


#include <iostream>
using namespace std;

int main()
{
int n,m,a[101][101],i,j,nr=0,d,ok;
cin>>n>>m;
for(i=1;i<=n;i++) {
for(j=1;j<=m;j++) {
cin>>a[i][j];
}
}
for(i=2;i<=n;i+=2) {
for(j=1;j<=m;j++) {
if(a[i][j]<2) ok=0;
else if(a[i][j]==2) ok=1;
else if(a[i][j]%2==0) ok=0;
else {
ok=1;d=3;
while(d*d<=a[i][j] && ok==1) {
if(a[i][j]%d==0) ok=0;
else d+=2;
}
}
if(ok==1) nr++;

}
}
cout<<nr;
return 0;
}

#776( mat oarecare)


#include <iostream>

using namespace std;

int main()
{
int n,m,i,j,a[101][101],ok,x,nr=0;
cin>>n>>m;
for(i=1;i<=n;i++) {
for(j=1;j<=m;j++) {
cin>>a[i][j];
}
}
for(i=1;i<=n;i++) {
x=a[i][1];ok=1;
for(j=2;j<=m && ok==1;j++) {
if(a[i][j]!=x) ok=0;
}
if(ok==1) nr++;
}
cout<<nr;
return 0;
}

#767( mat oarecare)


#include <iostream>
using namespace std;

int main()
{
int m,n,i,j,a[101][101],s=0;
cin>>n>>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]%2==0)
s=s+a[i][j];
}
}
cout<<s;

return 0;
}

#773( mat oarecare)


#include <iostream>

using namespace std;

int main()
{
int n,m,i,j,a[101][101],maxi=-1,mini=1000001,maxfr=-1,x;
cin>>n>>m;
for(i=1;i<=n;i++) {
for(j=1;j<=m;j++) {
cin>>a[i][j];
if(maxi<a[i][j]) maxi=a[i][j];
if(mini>a[i][j]) mini=a[i][j];
}
}
int fr[maxi+1];
for(i=mini;i<=maxi;i++) {
fr[i]=0;
}
for(i=1;i<=n;i++) {
for(j=1;j<=m;j++) {
x=a[i][j];
fr[x]++;
}
}
for(i=mini;i<=maxi;i++) {
if(maxfr<fr[i]) maxfr=fr[i];
}
x=maxi;
while(x>=mini && fr[x]<maxfr) {
x--;
}
cout<<x;
return 0;
}
#1007( mat oarecare)
#include <fstream>
using namespace std;
ifstream fin("matrice7.in");
ofstream fout("matrice7.out");
int main()
{
int n,m,i,k, a[101][101],maxx=0,minn,j;
fin >> n >> m;
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
fin>>a[i][j];
if(a[i][j]>maxx)
maxx=a[i][j];
}
}
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
if(a[i][j]==maxx)
{
minn=1000000001;
for(k=1;k<=n;k++)
{
if(a[k][j]<minn)
minn=a[k][j];
}
fout<<minn<< " ";
}
else fout<<a[i][j]<< " ";
}
fout<<endl;
}
return 0;
}

#780( matrice patratica)


#include <iostream>

using namespace std;

int main()
{
int n,m[21][21],i,j,s1=0,s2=0,a,b,r,cmmdc;
cin>>n;
for(i=1;i<=n;i++) {
for(j=1;j<=n;j++) {
cin>>m[i][j];
}
}
for(i=1;i<=n;i++) {
for(j=1;j<=n;j++) {
if(i<j) s1+=m[i][j];
else if(i>j) s2+=m[i][j];
}
}
a=s1;
b=s2;
while(b!=0) {
r=a%b;
a=b;
b=r;
}
cmmdc=a;
cout<<cmmdc;
return 0;
}

#783( matrice patratica)


#include <iostream>

using namespace std;

int main()
{
int n,a[101][101],i,j,s=0;
cin>>n;
for(i=1;i<=n;i++) {
for(j=1;j<=n;j++) {
cin>>a[i][j];
}
}
for(i=1;i<=n-1;i++) {
s+=a[i][i+1] +a[i+1][i];
}
cout<<s;
return 0;
}

#1749( mat patratica)


#include <iostream>
using namespace std;
int main() {

int a[202][202], n, z,s= 0,i,j;


cin >> n >> z;
for (i = 1; i <= n; i++)
for ( j = 1; j <= n; j++)
cin >> a[i][j];
for ( i = 1; i <= n; i++)
for ( j = 1; j <= n; j++) {
if (z== 1 && (i < j && i + j < n + 1))
s = s + a[i][j];
if (z == 2 && (i < j && i + j > n + 1))
s = s + a[i][j];
if (z == 3 && (i > j && i + j > n + 1))
s = s + a[i][j];
if (z == 4 && (i > j && i + j < n + 1))
s = s + a[i][j];
}
cout << s;
return 0;
}
#781( matrice patratica)
#include <iostream>
using namespace std;
int main() {

int n , a[101][101] , nord = 0, sud = 0, vest = 0, est = 0 , v[5],i,j;


cin >> n;
for(i=1;i<=n;i++) {
for(j=1;j<=n;j++) {
cin >> a[i][j];
}
}
for(i=1;i<=n;i++) {
for(j=1;j<=n;j++) {
{
if(i<j && i+j<n+1) nord+=a[i][j];
else if(i<j && i+j>n+1) est+=a[i][j];
else if(i>j && i+j<n+1) vest+=a[i][j];
else if(i>j && i+j>n+1) sud+=a[i][j];
}
}
}
v[1]=nord;
v[2]=sud ;
v[3]=est;
v[4]=vest;
for(i=1;i<=3;i++) {
for(j=i+1;j<=4;j++) {
if(v[i]>v[j]) swap(v[i],v[j]);
}
}
for(i = 1 ; i<= 4 ; i++) {
cout <<v[i] << " ";
}
return 0;
}

#215( generari de matrice)


#include <iostream>

using namespace std;

int main()
{
int a[7][7]={0},n,i,j;
cin>>n;
for(i=1;i<=6;i++) {
for(j=1;j<=6;j++) {
if(i!=j) {
if(i==1 || j==1) a[i][j]=n%10;
else if(i==2 || j==2) a[i][j]=n/10%10;
else if(i==3 || j==3) a[i][j]=n/100%10;
else if(i==4 || j==4) a[i][j]=n/1000%10;
else if(i==5 || j==5) a[i][j]=n/10000%10;
}
}
}
for(i=1;i<=6;i++) {
for(j=1;j<=6;j++) {
cout<<a[i][j]<<" ";
}
cout<<endl;
}
return 0;
}

VECTORI

#4382( parcurgere vectori)

#include <iostream>

using namespace std;

int main()
{
int n,v[1001],i,ok,d;
cin>>n;
for(i=1; i<=n; i++)
{
cin>>v[i];

}
for(i=1;i<=n;i++) {
if(v[i]<2) ok=0;
else if(v[i]==2) ok=1;
else if(v[i]%2==0) ok=0;
else
{
d=3;
ok=1;
while(d*d<=v[i] && ok==1)
{
if(v[i]%d==0) ok=0;
else d+=2;
}

}
if(ok==1) v[i]=0;
}
for(i=1; i<=n; i++)
{
cout<<v[i]<<" ";
}
return 0;
}

#546( parcurgerea vectorilor)

#include <iostream>

using namespace std;

int main()
{
int n,v[1001],i;
cin>>n;
for(i=1;i<=n;i++) {
cin>>v[i];
}
for(i=1;i<=n;i++) {
if(v[i]%v[n]==0) {
cout<<v[i]<<" ";
}
}
return 0;
}

#489( parcurgerea vectorilor)


#include <iostream>

using namespace std;

int main()
{
int n,v[1001],i,j;
cin>>n;
for(i=1;i<=n;i++) {
cin>>v[i];
}
i=1;j=n;
while(i<j) {
cout<<v[i]<<" "<<v[j]<<" ";
i++;
j--;
}
if(n%2!=0) cout<<v[i];
return 0;
}

#2858( parcurgerea vectorilor)


#include <iostream>

using namespace std;

int main()
{
int n,v[101],i,sp=0,spp=0,nr=0,sd3i=0;
cin>>n;
for(i=1;i<=n;i++) {
cin>>v[i];
}
for(i=n;i>=1;i--) {
cout<<v[i]<<" ";
}
cout<<endl;
for(i=1;i<=n;i++) {
if(v[i]%2==0) sp+=v[i];
}
cout<<sp<<endl;
for(i=2;i<=n;i+=2) {
spp+=v[i];
}
cout<<spp<<endl;
for(i=1;i<=n;i++) {
if(v[i]%10==0) nr++;
}
cout<<nr<<endl;
for(i=1;i<=n;i+=2) {
if(v[i]%3==0) sd3i+=v[i];
}
cout<<sd3i;
return 0;
}

#506(verificarea proprietatilor)
#include <iostream>

using namespace std;

int main()
{
int v[201],n,i,ok,logic,d;
cin>>n;
for(i=1;i<=n;i++) {
cin>>v[i];

}
logic=0;
for(i=1;i<=n && logic==0;i++) {
if(v[i]<2) ok=0;
else if(v[i]==2) ok=1;
else if(v[i]%2==0) ok=0;
else {
ok=1;
d=3;
while(d*d<=v[i] && ok==1){
if(v[i]%d==0) ok=0;
else d=d+2;
}
}
if(ok==1) logic=1;

}
if(logic==1) cout<<"DA";
else cout<<"NU";
return 0;
}

#502( verificarea proprietatlor)

#include <iostream>

using namespace std;

int main()
{
int v[501],n,i,j,ok;
cin>>n;
for(i=1;i<=n;i++) {
cin>>v[i];
}
ok=1;
for(i=1;i<=n-1 && ok==1;i++) {
for(j=i+1;j<=n && ok==1;j++) {
if(v[i]==v[j]) ok=0;
}
}
if(ok==1) cout<< "DA";
else cout<< "NU";
return 0;
}

#509( sortarea vectorilor)


#include <iostream>

using namespace std;

int main()
{
int n,v[1001],i,j;
cin>>n;
for(i=1;i<=n;i++) {
cin>>v[i];
}
for(i=1;i<=n;i++) {
for(j=i+1;j<=n;j++) {
if(v[i]>v[j]) swap(v[i],v[j]);
}
}
for(i=1;i<=n;i++) {
cout<<v[i]<<" ";
}
return 0;
}

#4386( stergeri inserari)


#include <iostream>

using namespace std;

int main()
{
int v[2001],n,i,j,minim;
cin>>n;
for(i=1;i<=n;i++) {
cin>>v[i];
}
minim=v[1];
for(i=2;i<=n;i++) {
if(minim>v[i]) minim=v[i];
}
for(i=1;i<=n;i++) {
if(v[i]==minim) {
for(j=n;j>=i+1;j--) {
v[j+1]=v[j];
}
v[i+1]=minim;
n++;
i++;
}
}
for(i=1;i<=n;i++) {
cout<<v[i]<<" ";
}
return 0;
}

You might also like