-
Notifications
You must be signed in to change notification settings - Fork 0
/
Kategorite.java
189 lines (151 loc) · 3.72 KB
/
Kategorite.java
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
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
package gui;
import java.util.Arrays;
public class Kategorite {
public static int kategori1(int []a){
int shuma=0;
for(int i=0; i<5; i++){
if(a[i]==1){
shuma+=a[i];
}
}
return shuma;
}
public static int kategori2(int []a){
int shuma=0;
for(int i=0; i<5; i++){
if(a[i]==2){
shuma+=a[i];
}
}
return shuma;
}
public static int kategori3(int []a){
int shuma=0;
for(int i=0 ; i<5; i++){
if(a[i]==3){
shuma+=a[i];
}
}
return shuma;
}
public static int kategori4(int []a){
int shuma=0;
for(int i=0; i<5; i++){
if(a[i]==4){
shuma+=a[i];
}
}
return shuma;
}
public static int kategori5(int []a){
int shuma=0;
for(int i=0; i<5; i++){
if(a[i]==5){
shuma+=a[i];
}
}
return shuma;
}
public static int kategori6(int []a){
int shuma=0;
for(int i=0; i<5; i++){
if(a[i]==6){
shuma+=a[i];
}
}
return shuma;
}
public static int kategori7(int a[]) {//tre me nje vlere
int[] perseritje=new int[]{ 0,0,0,0,0,0 };
int shuma=0;
for(int i=0; i<a.length; i++) {
perseritje[a[i]-1]++;
shuma=shuma+a[i];
}
for(int i=0; i<perseritje.length; i++) {
if(perseritje[i]>=3)
return shuma;
}
return 0;
}
public static int kategori8(int a[]) {//kater me nje vlere
int[] perseritje=new int[]{ 0,0,0,0,0,0 };
int shuma=0;
for(int i=0; i<a.length; i++) {
perseritje[a[i]-1]++;
shuma=shuma+a[i];
}
for(int i=0; i<perseritje.length; i++) {
if(perseritje[i]>=4)
return shuma;
}
return 0;
}
public static int kategori9(int a[]) {//tre me dy
int[] perseritje=new int[]{ 0,0,0,0,0,0 };
int shuma=0;
for(int i=0; i<a.length; i++) {
perseritje[a[i]-1]++;
shuma=shuma+a[i];
}
for(int i=0; i<perseritje.length; i++) {
if(perseritje[i]==2)
for(int j=i+1; j<perseritje.length; j++) {
if(perseritje[j]==3)
return 25;
}
else if(perseritje[i]==3)
for(int j=i+1; j<perseritje.length; j++) {
if(perseritje[j]==2)
return 25;
}
}
return 0;
}
public static int kategori10(int a[]) { //kater te njepasnjeshme
int[] arr=Arrays.copyOf(a, 5);
Arrays.sort(arr);
int count=1; //mban sa numra te njepasnjeshem kemi
int piket;
for(int i=1;i<a.length;i++){
if(arr[i]==arr[i-1]+1)
count++;
else continue;
}
if(count==4)
piket=30;
else piket=0;
return piket;
}
public static int kategori11(int a[]) { // pese te njepasnjeshme
int[] arr=Arrays.copyOf(a, 5);
Arrays.sort(arr);
int count=1; //mban sa numra te njepasnjeshem kemi
int piket;
for(int i=1; i<arr.length; i++) {
if(arr[i]==arr[i-1]+1)
count++;
else continue;
}
if(count==5)
piket=40;
else piket=0;
return piket;
}
public static int kategori12(int a[]) { // e njejta vlere
int i;
for (i=1; i<a.length; i++) {
if(a[0]!=a[i])
break;
}
if(i==a.length)
return 50;
else return 0;
}
public static int kategori13(int a[]){ //cdo rast
int sum=0;
for(int i=0; i<a.length; i++)
sum=sum+a[i];
return sum;
}
}