-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSource.c
64 lines (53 loc) · 1.16 KB
/
Source.c
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
#include <stdio.h>
#include <stdlib.h>
int main()
{
long double min, max, summ, DR;
long int i, N;
double* mas1;
int* mas2;
DR = 0.0;
summ = 0.0;
min = 0.0;
max = 0.0;
i = 0;
N = 0;
printf("Enter the number of random numbers ");
scanf_s("%d", &N);
printf("Enter the minimum number of the range ");
scanf_s("%lf", &min);
printf("Enter the maximum number of the range ");
scanf_s("%lf", &max);
if ((max <= min) || (max <= 0.0) || (min <= 0.0) || (N <= 0))
{
printf("Error: incorrect data\n");
return 0;
}
mas1 = (double*)malloc(N * sizeof(double));
mas2= (int*)malloc(N * sizeof(int));
for (i = 0; i < N; i++)
{
mas1[i] = (((((double)rand()) / RAND_MAX) * (max - min)) + min);
DR = (mas1[i] - (int)mas1[i]) * 1000000;
if (DR == 0)
mas2[i] = 0;
else
{
mas2[i] = (int)DR;
while (mas2[i] % 10 == 0)
mas2[i] = mas2[i] / 10;
}
}
for (i = 0; i < N; i++)
if (mas2[i] < N)
{
summ = summ - mas1[mas2[i]];
mas1[mas2[i]] = 0.0;
}
for (i = 0; i < N; i++)
summ = summ + mas1[i];
printf("The sum is %lf\n", summ);
free(mas1);
free(mas2);
return 0;
}