, , , : .
- , . . .
, . . .
(auto), (extern), (static) (register). , , register int a; static double b; auto .
() N ´ . ( ) . .
:
#include <iostream.h>
#include <conio.h>
int Fun_Sum_Kol(int, int, int**, int*); //
void main()
{
int **a, i, j, n, m, sum, kol;
cout << "\t Input N, M: ";
cin >> n >> m;
a = new int*[n]; //
for(i=0; i<n;i++)
a[i] = new int[m]; //
cout <<"\n Input A" << endl;
for(i=0; i<n; i++)
for(j=0; j<m; j++){
cout << "\t a[" << i+1 << "][" << j+1 << "] = ";
cin >> a[i][j];
}
cout <<"\n Matrix A:" << endl;
for(i=0; i<n; i++) {
for(j=0; j<m; j++)
cout << "\t" << a[i][j];
cout << endl;
}
//
sum = Fun_Sum_Kol(n, m, a, &kol);
cout << "\n Kol-vo = " << kol << "\t Summa = " << sum << endl;
delete []a; //
cout << "\n\t Delete!" << endl;
cout << " Press any key... " << endl;
getch();
}
/* , , */
int Fun_Sum_Kol(int a, int b, int **x, int *k)
{
int i, j, s = 0;
*k = 0;
for(i=0; i<a;i++)
for(j=0; j<b;j++)
if(x[i][j] % 2 ==0){
(*k)++; //
s += x[i][j];
}
return s;
|
|
|
}
, . return (), (): & kol, , * k (* ).
:
( N, M ) .
( new delete), , . .
1. , .
2. , .
3. .
4. .
5. .
6. .
7. .
8. 0- 1- , .
9. , T ( ) .
10. > T* .
11. < T* .
12. < T* .
13. = T* .
14. = T* .
15. .
16. .
6.
: . .
. :
struct erson {
char Fio[30];
double sball;
};
:
Person Stud, *p_Stud;
:
1) (.) :
ID_. ID_ (* ). ID_
2) (>) :
> ID_ &(ID_). ID_
1) Stud.Fio = ..; //
Stud.sball = 5.75;
2) _Stud > Fio = ..;
_Stud > sball =5.75;
C/++ (stream), . .
, . stdio.h io.h.
|
|
|
, , .. , : , .. /++ fopen (), . , .. , . :
FILE * ;
fopen ( 1, 2);
1 , , : d:\\work\\sved.txt sved.txt, d, work; , .
2 :
w , , , , ;
r ; , ;
a ;
r +, w + ;
a + , a, , .
(t), b .
, fopen NULL.
fclose ( ), , fclose (f);
: void fcloseall (void);
, :
#include <stdio.h>
...
FILE *f_my;
if(! (f_my = fopen(rez.txt, r+t))) {
puts(\n !);
return;
}
... //
fclose(f_my);
...
fprintf () fscanf (), printf () scanf (), (. ..1), , .
.
. , fp (FILE * fp;):
1) int fread (void * ptv, int size, int n, fp) n size fp , ptv ( );
2) int fwrite (void * ptv, int size, int n, fp) n size , ptv fp;
3) int fileno (fp) fp ( , );
4) long filelength (int ) ;
5) int chsize (int , long pos) fp, pos;
6) int fseek (fp, long size, int kod) size kod: 0 ; 1 ; 2 ;
7) long ftell (fp) fp (-1 );
8) int feof ( ) ;
9) int fgetpos ( , long * pos) pos ; 0.
, . ... . , . . : , , , , .
|
|
|
fprintf (). :
...
#include <stdio.h>
#include <io.h>
...
struct TZap{
char FIO[30];
double s_b;
} Zap;
int size = sizeof(TZap);
FILE *Fz, *Ft;
char File_Zap[] = "zapisi.dat";
char File_Rez[] = "rezult.txt";
void Out(TZap);
void main()
{
int kod, D_f, i=0, j, kol;
long len;
TZap st, *mas_Z;
Ft = fopen(File_Rez, "w");
while(true) {
puts("\n Create 1\n Add 2\n View 3\n Sort 4\n EXIT 0");
scanf("%d", &kod);
switch(kod) {
case 1:
if ((Fz=fopen(File_Zap,"wb"))==NULL) {
puts("\n Create ERROR!");
return;
}
fclose(Fz);
printf("\n Create New File %s!\n",File_Zap);
break;
case 2:
Fz = fopen(File_Zap,"ab");
printf("\n F.I.O. ");
fflush(stdin);
gets(Zap.FIO);
printf(" Ball ");
scanf("%lf", &Zap.s_b);
fwrite(&Zap, size, 1, Fz);
fclose(Fz);
break;
case 3:
if ((Fz=fopen(File_Zap,"rb"))==NULL) {
puts("\n Open ERROR!");
return;
}
//
printf("\n\t--------- Informations ---------");
// Ft
fprintf(Ft,"\n\t--------- Informations ---------");
while(1) {
if(!fread(&Zap,size,1,Fz)) break;
Out(Zap);
}
fclose(Fz);
break;
case 4:
Fz = fopen(File_Zap,"rb");
D_f = fileno(Fz);
len = filelength(D_f);
kol = len/size;
mas_Z = new TZap[kol];
//
for (i=0; i < kol; i++)
fread((mas_Z+i), size, 1, Fz);
fclose(Fz);
printf("\n\t----- S O R T -----\n");
fprintf(Ft,"\n\t----- S O R T -----\n");
for (i=0; i < kol-1; i++)
for (j=i+1; j < kol; j++)
if (mas_Z[i].s_b > mas_Z[j].s_b) {
st = mas_Z[i];
mas_Z[i] = mas_Z[j];
mas_Z[j] = st;
}
for (i=0; i<kol; i++)
Out(mas_Z[i]);
delete []mas_Z;
break;
case 0:
fclose(Ft);
return;
}
}
}
//----------------- --------------------
void Out(TZap z)
{
printf("\n %20s, %6.3lf.", z.FIO,z.s_b);
fprintf(Ft, "\n %20s, %6.3lf.", z.FIO, z.s_b);
}
1, zapisi. dat, ( ). , 2, 4 . 3, , ( ), 4. :
, : , , ( ), .
:
;
;
;
: , , , ;
.
, .
|
|
|
.
1. , 8, 9 10.
2. -, .
3. - .
4. , , 8 9.
5. , 4 5 8 .
6. . , .
7. , 4 .
8. .
9. , .
10. , ( 4).
11. , 9 10 .
12. , 7 8 9 10 .
13. , .
14. - .
15. , .
16. , 8 9 .
. /++
1. , .
| - | |||
| () | |||
| . | . | ||
| -> | -> | ||
| [ ] | [ ] | ||
| () | ID() | ||
| ++ | lvalue ++ | ||
| -- | lvalue -- | ||
| sizeof | () | sizeof(ID ) | |
| ++ | ++ lvalue | ||
| -- | -- lvalue | ||
| ~ | ~ | ||
| ! | ! | ||
| - (+) | () | - (+) | |
| * | * | ||
| & | & | ||
| () | () | ||
| * | * | ||
| / | / | ||
| % | % | ||
| + (-) | () | + (-) | |
| << | << | ||
| >> | >> | ||
| < | < | ||
| <= | <= | ||
| > | > | ||
| >= | >= | ||
| == | == | ||
| != | != | ||
| & | & | ||
| ^ | . | ^ | |
| | | | | ||
| && | && | ||
| || | || |
| - | |||
| ?: | () | ? : | |
| = | lvalue = | ||
| *= | lvalue *= | ||
| /= | lvalue /= | ||
| %= | - | lvalue %= | |
| += | lvalue += | ||
| - = | lvalue -= | ||
| <<= | lvalue <<= | ||
| >>= | lvalue >>= | ||
| &= | - | lvalue &= | |
| |= | - | lvalue |= | |
| ^= | ޭ | lvalue ^= | |
| , | , |
|
|
|
1. .., .., .., .. . : . . : , 2007.
2. .., .., .. . - .: , 2004.
3. .., .., .., .. ++ Builder: . . 1 2- . 2 . .1. : , 2007.
1. , . / . , . . .: , 1992.
2. , . C++ / . : 2- .: 2 . : , 1993.
3. , . . . / . . . : , 2001.
4. , . Borland ++ / . . : , 1999.
* , .
* .
