.


:




:

































 

 

 

 





. :

void f (int a)

{ a = 10; //

}...

int k = 0;f(k); //k ,

. , , .

, .

, .

. . - . :

_[ ][ ];

 

, 10 20 :

int d[10] [20];

. , , .

3, 5 d

d[3] [5]

, , . , , , , . . .


1. c++

#include <iostream.h>
int main(){
const int n = 10;
int i,. sum;
int marks[n] = {3, 4, 5, 4, 4};
for (i = 0, sum = 0; i<n; i++) sum += marks[1];
cout << " : " << sum;
return 0;
}

int N, S;

cout<<" : ";

cin>>N;

int *arr = new int[N];

for(int i = 0; i<N; i++)

{

cout<<endl<<" "<<i<<" : ";

cin>>arr[i];

S+=arr[i];

}

cout<<" = "<<S/N<<endl;

delete [] arr;

system("pause");

return 0;

#include <iostream>

#include <ctime>

 

using namespace std;

 

int main()

{

int min =0;

int max =0;

srand(time(NULL));

int n = 0;

int sum = 0;

cin >> n; // n

int **a = new int* [n]; //

for (int i = 0; i < n; i++)

{

a[i] = new int [n]; //

}

// .

for (int i = 0; i < n; i++)

{

for (int j = 0; j < n; j++)

{

a[i][j] = rand() % 10;

cout << a[i][j] << " "; //

}

cout << endl; // . ,

}

//

min = a[0][0];// , .

max = a[0][0];// .

 

for (int i = 0; i < n; i++)

{

for (int j = 0; j < n; j++)

{

if (a[i][j] < min) min = a[i][j];

if (a[i][j] > max) max = a[i][j];

}

}

cout << "min = " << min << endl << "max = " << max << endl;

//

for (int i = 0; i < n; i++)

{

delete[]a[i]; //

}

delete [] a; //

return 0;

}

#include <iostream>using namespace std; int main(){ // dat i, nommin int dat [5],i,nommin;dat[1]=3;dat[2]=4;dat[3]=5;dat[4]=7;dat[5]=9; // nommin nommin=1; // i for (i=2;i<=5;i++){ // , nommin,// nommin () if (dat[i]<dat[nommin]){nommin=i;}} // nommin cout << "index minimalnogo chisla massiva = "<< nommin; }

 

7.





:


: 2015-11-23; !; : 537 |


:

:

, .
==> ...

1403 - | 1167 -


© 2015-2024 lektsii.org - -

: 0.009 .