-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathminipoker.c
82 lines (58 loc) · 1.78 KB
/
minipoker.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
#include <stdio.h>
int pontuacao(int mao[5]) {
int teste = 1;
for (int j = 1; j < 5; j++)
if (mao[0] + j != mao[j]) {
teste = 0;
break;
}
if (teste) return 200 + mao[0];
int cont = 0, repeticao[2][2] = {{-1,1},{-1,1}};
for (int i = 0; i < 4; i++)
if (mao[i] == mao[i+1])
{
if(repeticao[cont][0] != -1 && repeticao[cont][0] != mao[i]) cont++;
repeticao[cont][0] = mao[i];
repeticao[cont][1]++;
}
if(repeticao[0][0] != -1 && repeticao[1][0] != -1) {
if (repeticao[0][1] == 2 && repeticao[1][1] == 2) return 3* repeticao[1][0] + 2*repeticao[0][0] + 20;
else if(repeticao[0][1] == 3) return 160 +repeticao[0][0];
return 160 +repeticao[1][0];
}
if (repeticao[0][0] != -1 && repeticao[0][1] == 4)
return repeticao[0][0] + 180;
if (repeticao[0][0] != -1 && repeticao[0][1] == 3)
return repeticao[0][0] + 140;
if (repeticao[0][0] != -1 && repeticao[0][1] == 2)
return repeticao[0][0];
return 0;
}
int main() {
int n, mao[5], mediador =0;
scanf("%d",&n);
int pontos[n];
for (int i = 0; i < n; i++)
{
for (int j = 0; j < 5; j++)
{
scanf("%d",&mao[j]);
for (int x = j; x > 0; x--)
{
if(mao[x] < mao[x-1]) {
mediador = mao[x-1];
mao[x-1] = mao[x];
mao[x] = mediador;
}
else break;
}
}
pontos[i] = pontuacao(mao);
}
for (int i = 0; i < n; i++)
{
printf("Teste %d\n",i+1);
printf("%d\n",pontos[i]);
printf("\n");
}
}