//////2 zadanie
#include <malloc.h>
#include <stdio.h>
#include <stdlib.h>
void min_max(double* arr, int str, int stl, double* min, double* max, double* sum)
{
*min = *(arr + stl * str + 0);
*max = *(arr + stl * str + 0);
*sum = 0;
for (int i = 0; i < stl - 3; i++)
{
if (*min > * (arr + stl * str + i))
{
*min = *(arr + stl * str + i);
}
if (*max < *(arr + stl * str + i))
{
*max = *(arr + stl * str + i);
}
*sum += *(arr + stl * str + i);
}
}
int main(int argc, char* argv[])
{
setlocale(LC_ALL, "ru");
char path[250];
if (argc == 1)
{
printf("Enter file path:");
gets(path);
}
else
{
strcpy(path, argv[1]);
}
FILE* file = fopen(path, "r");
int N, M;
char c = '1';
M = N = 0;
while (!feof(file))
{
do
{
double tmp;
if (fscanf(file, "%lf", &tmp));
{
N++;
}
c = fgetc(file);
if (c == '\n')
{
M++;
}
} while (c == ' ');
}
double min, max, sum;
double* arr;
M++;
N /= M;
N += 3;
arr = calloc(N * M, sizeof(double));
rewind(file);
for (int i = 0; i < M; i++)
{
for (int j = 0; j < N - 3; j++)
{
fscanf(file, "%lf", (arr + i * N + j));
}
}
for (int i = 0; i < M; i++)
{
min_max(arr, i, N, &min, &max, &sum);
*(arr + i * N + (N - 3)) = sum;
*(arr + i * N + (N - 2)) = min;
*(arr + i * N + (N - 1)) = max;
}
fclose(file);
remove(path);
file = fopen(path, "w");
for (int i = 0; i < M; i++)
{
for (int j = 0; j < N; j++)
{
if (j == N - 1)
{
fprintf(file, "%3.3lf", *(arr + i * N + j));
}
else
{
fprintf(file, "%3.3lf ", *(arr + i * N + j));
}
}
fprintf(file, "\n");
}
fclose(file);
free(arr);
return 0;
}
//////3 zadanie
Для создания бинарного файла:
#include <malloc.h>
#include <stdio.h>
#include <stdlib.h>
#include <locale.h>
int randomno()
{
return rand()%25 - rand()%30;
}
int main(int argc, char* argv[])
{
setlocale(LC_ALL, "ru");
char path[250];
char path_dec[250];
if (argc == 1)
{
printf("Enter file path:");
gets(path);
}
else
{
strcpy(path, argv[1]);
}
strcpy(path_dec, path);
strcat(path, "\\file.bin");
strcat(path_dec,"\\file_dec.txt");
FILE* file = fopen(path, "wb+");
FILE* file_dec = fopen(path_dec, "wt+");
int N;
printf("Vvedite kol-vo chisel:");
scanf("%d", &N);
for (int i = 0; i < N; i++)
{
int tmp = randomno();
fprintf(file_dec, "%3d ", tmp);
fwrite(&tmp, sizeof(int), 1, file);
}
fclose(file);
fclose(file_dec);
return 0;
}
Основной код:
int main(int argc, char* argv[])
{
setlocale(LC_ALL, "ru");
char path[250];
if (argc == 1)
{
printf("Enter file path:");
gets(path);
}
else
{
strcpy(path, argv[1]);
}
FILE* file = fopen(path, "rb+");
fseek(file, 0, SEEK_END);
int n = ftell(file)/sizeof(int);
int* arr;
arr = calloc(n, sizeof(int));
rewind(file);
fread(arr, sizeof(int), n, file);
int i_fp, i_lp, k;
i_fp = i_lp = k = 0;
for (int i = 0; i < n; i++)
{
if (k == 0 && (*(arr + i) > 0))
{
i_fp = i;
k++;
}
if (k == 1 && (*(arr + i) > 0))
{
i_lp = i;
}
}
fclose(file);
remove(path);
int* array;
int tmp_size = n - (i_lp - i_fp) + 1;
array = calloc(tmp_size, sizeof(int));
file = fopen(path, "wb+");
int j = 0;
for (int i = 0; i < n; i++)
{
*(array + j) = *(arr + i);
if (i == i_fp)
{
i = i_lp-1;
}
j++;
}
for (int i = 0; i < n; i++)
{
printf("%3d ", *(arr + i));
}
printf("\n\n");
for (int i = 0; i < tmp_size; i++)
{
printf("%3d ", *(array + i));
}
fwrite(array, sizeof(int), tmp_size, file);
free(arr);
free(array);
fclose(file);
return 0;
}