1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
| //---------------------------------------------------------------------------
#include <vcl.h>
#pragma hdrstop
#include<conio.h>
#include <iostream.h>
#include<stdio.h>
//---------------------------------------------------------------------------
#pragma argsused
int main(int argc, char* argv[])
{ int a[14],i,b[14];
int n=5;
for (int i=0;i<n;i++)
// a[i]=random(16) ;
cin>>a[i];
cout<<"a= \n" ;
for (int i=0;i<n;i++)
cout<<a[i]<<" "; // ??????? ?????? ?
cout<<endl;
//??????? ??????????? ???????? ? ??????? ?
while(i<n-1)
{ int g;
g=i+1;
while (g<n)
if (a[i]==a[g])
{
for (int j=g; j<n-1; j++)
a[j]=a[j+1];
n--;
}
else g++;
i++;
}
cout<<"novi massiv a :\n" ;
for (int i=0;i<n;i++)
cout<<a[i]<<" ";
cout<<endl<<endl;
int m=5;
cout<<"b= \n" ;
for (int l=0;l<m;l++)
// b[l]=random(16) ;
cin>>b[l];
for (int l=0;l<m;l++)
cout<<b[l]<<" "; //??????? ?????? ?
cout<<endl;
int l; //??????? ??????????? ???????? ??????? ?
while(l<m-1)
{ int g;
g=l+1;
while (g<m)
if (b[l]==b[g])
{
for (int i=g; i<m-1; i++)
b[i]=b[i+1];
m--;
}
else g++;
l++;
}
cout<<"novi massiv b:\n" ;
for (int l=0;l<m;l++)
cout<<b[l]<<" ";
cout<<endl;
//---------------------------------------------------------------------------
cout<<"\nDekartovo proizvedenie :AxB= \n {\n";
for (int i=0;i<n;i++)
{
for (int l=0;l<m; l++)
{
if ((i==n-1)&&(l==m-1))
{
cout<<"("<<a[i]<<","<<b[l]<<")";break;
}
cout<<"("<<a[i]<<","<<b[l]<<"), ";
} cout<<endl;
}
cout<<" }"<<endl;
cout<<"\n -------------------------------------------\n";
cout<<"\n bolshe na 2 ili na 3 = \n {\n";
for (int i=0;i<n;i++)
{
for (int l=0;l<m; l++)
{
if (a[i]==(b[l]+2) || a[i]==(b[l]+3)){
if ((i==n-1)&&(l==m-1))
{
cout<<"("<<a[i]<<","<<b[l]<<","<<")";break;
}
cout<<"("<<a[i]<<","<<b[l]<<","<<"),";
}
}
}
cout<<" }"<<endl;
cout<<"\n -------------------------------------------\n";
cout<<"\n obratnor otnoshenie proizvedenie :BxA= \n {\n";
for (int i=0;i<n;i++)
{
for (int l=0;l<m; l++)
{
if ((i==n-1)&&(l==m-1))
{
cout<<"("<<b[l]<<","<<a[i]<<")";break;
}
cout<<"("<<b[l]<<","<<a[i]<<"), ";
} cout<<endl;
}
cout<<" }"<<endl;
cout<<"\n -------------------------------------------\n";
cout<<"\n udvoenie pervoi pozisi = \n {\n";
for (int i=0;i<n;i++)
{
for (int l=0;l<m; l++)
{
if ((i==n-1)&&(l==m-1))
{
cout<<"("<<a[i]<<","<<b[l]<<","<<a[i]<<")";break;
}
cout<<"("<<a[i]<<","<<b[l]<<","<<a[i]<<"), ";
} cout<<endl;
}
cout<<" }"<<endl;
getch();
return 0;
} |
(
Сообщение было отмечено как решение
