-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path1183.c
89 lines (60 loc) · 1.27 KB
/
1183.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
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
// ####################### fast one ##############
#include<stdio.h>
#include<string.h>
int main()
{
int j=0,i=0,c=0,b=1;
double a,total= 0;
char word[2];
scanf(" %s",&word);
for (i=0;i<12;i++){
for (j=0;j<12;j++){
if (c<b){
scanf("%lf",&a);
c++;
}
else {
scanf("%lf",&a);
total += a;
c++;
}
}
c=0;
b++;
}
if (word[0]=='S'){
printf("%.1lf\n",total);
}
else {
printf("%.1lf\n",total/66);
}
return 0;
}
// ############################# second one solutation #######################
#include<stdio.h>
#include<string.h>
int main()
{
int j=0,i=0,c=-1,b=1;
double a,total= 0,array[12][12];
char word[2];
scanf(" %s",&word);
for (i=0;i<12;i++){
for (j=0;j<12;j++){
scanf("%lf",&array[i][j]);
}
}
for (i=0;i<12;i++){
for (j=b;j<12;j++){
total += array[i][j];
}
b++;
}
if (word[0]=='S'){
printf("%.1lf\n",total);
}
else {
printf("%.1lf\n",total/66);
}
return 0;
}