-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathprogtest12:1.c
66 lines (58 loc) · 1.94 KB
/
progtest12:1.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
65
66
/*
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
int main(void)
{
double *vectors1, *vectors2, sum=0, csm =0, t1=0, t2=0;
int nvectors;
//nacteni poctu vektoru
if((scanf("%d", &nvectors) !=1) || (nvectors <= 0)){
printf("Invalid input.\n");
return EXIT_FAILURE;
}
//alokace poli pro ulozeni vektoru
vectors1 = (double *)malloc(sizeof(double)*nvectors);
vectors2 = (double *)malloc(sizeof(double)*nvectors);
//nacteni samotnych hodnot vektoru
for(int i=0; i<nvectors; i++){
if(scanf("%lf", &vectors1[i]) !=1){
printf("Invalid input.\n");
free(vectors1); free(vectors2);
return EXIT_FAILURE;
}
}
for(int i=0; i<nvectors; i++){
if(scanf("%lf", &vectors2[i]) !=1){
printf("Invalid input.\n");
free(vectors1); free(vectors2);
return EXIT_FAILURE;
}
}
//vypocet vektorove podobnosti
for(int i=0; i<nvectors; i++) {
sum += (vectors1[i]*vectors2[i]);
}
for(int i=0; i<nvectors; i++) {
t1 +=vectors1[i]*vectors1[i];
t2 +=vectors2[i]*vectors2[i];
}
t1 = sqrt(t1);
t2 = sqrt(t2);
csm = sum/(t1*t2);
printf("CSM: %.3f\n", csm);
free(vectors1); free(vectors2);
return EXIT_SUCCESS;
}