{
cout<<x=<<x<< endl; //4
cout<<y=<<y<< endl; // 5
cout<<z=<<z<< endl; // 10
z=x+y;
cout<<z=<<z<< endl; // 9
}
void plus1 (int x, int y, int &z)
{
cout<<x=<<x<< endl; //4
cout<<y=<<y<< endl; // 5
cout<<z=<<z<< endl; // 10
z=x+y;
cout<<z=<<z<< endl; // 9
}
Int plus2 (int x, int y)
{
cout<<x=<<x<< endl; //4
cout<<y=<<y<< endl; // 5
cout<<x+y<<x+y<< endl; // 9
return x+y;
}
plus2() .
plus2(a+b*c,2*c);
plus2(5,7);
.
2.
# include <iostream.h>
const int n=10;
void create (int x[], int k);
// void vvod (int x[n])
void show (int x[], int k);
int max (int x[], int k);
void main()
{
int a[n];
create(a,n);
show (a, n);
cout<< max(a,n)= <<max(a,n)<<endl;;
}
void create (int x[], int k)
{
int i;
for (i=0; i<k; i++)
{
cout<<x[<<i<<]=;
cin>>x[i];}
}
}
void show (int x[], int k)
{
int i;
for (i=0; i<k; i++)
cout<<x[i]<<_;
}
int max(int x[], int k)
{
int i;
int m;
m=a[0];
for (i=0; i<k; i++)
if (m<x[i]) m=x[i];
return m;
}
9
const int n=10;
int a[n];
int n;
cout<< Enter n:;
cin>>n;
int*b //
b= new int[n];
delete [] b - b.
,
void vvod (int x[], int n);
void vvod (int *x, int n);
void vvod (int x[n])
int*p;
p=new int;
*p=10; ( )
delete p; ( )
2 : , .
int colstr; colstb;
cout<< Enter colstr:;
cin>> colstr;
cout<< Enter colstb:;
cin>> colstb;
int **b;
b=new int*[colstr];
for (int i<0;i<colstr;i++)
b[i]=new int[colstb];
, delete[][]b;
void create (int **x, int n, int m);
void show(int **x, int n, int m);
1.
A B ( ).
= A* B, . = A+ B
# include <iostream.h>
|
|
|
# include <math.h>
void create (int **, int);
void show(int **, int);
Bool prime (int);
bool EA(int **, int);
void mult (int **, int**, int**);
void add (int **, int**, int**);
Void main()
{
int n;
cout<<enter size=;
cin>>n;
int **a, **b, **c;
a= new int*[n];
int i;
for (i<0;i<n;i++)
a[i]=new int[n];
b= new int*[n];
for (i<0;i<n;i++)
b[i]=new int[n];
c= new int*[n];
for (i<0;i<n;i++)
c[i]=new int[n];
create(a,n);
create(b,n);
if (EA(a,n)) mult(a,b,c);
else add(a,b,c);
cout<<array c:<<endl;
show(c,n);
delete[][]a;
delete[][]b;
delete[][]c;
}
void create(int**x, int n)
{
int i,j;
for (i=0; i<n; i++)
for (j=0; j<n; j++)
cin>>x[i][j];
}
void show(int**x, int n)
{
int i,j;
for (i=0; i<n; i++)
{
for (j=0; j<n; j++)
cout<<a[i][j]<< ;
cout<<endl;
}
}
Bool prime(int x)
{
bool t;
int i;
if (x<=1) return false;
if (x==2) return true;
t=true;
i=2;
while (i<=sqrt(x)&&t)
{
if (x% i==0) t=false;
i++;
}
return t;
}
bool EA(int**x, int n)
{
bool p,q;
int i,j;
bool p=false;
for (i=0;i<n&&!p;i++)
{
bool q=true;
for (j=0; j<n&&q; j++)
if (!prime(x[i][j])) q=false;
p=q;
}
return p;
}
void mult (int **x, int**y, int**z)
{
int i, j, k;
for (i=0; i<n; i++)
for (j=0; j<n; j++)
{
z[i][j]=0;
for (k=0; k<n; k++)
z[i][j]=z[i][j]+x[i][k]*y[k][j];
}
}
void add (int **x, int**y, int**z)
{
int i, j;
for (i=0; i<n; i++)
for (j=0; j<n; j++)
z[i][j]= x[i][k]+y[k][j];
}
ALGEBRA OF SETS
A,B,C P(Z). Z .
P(Z) Z.
