Skip to content

Commit d405269

Browse files
committed
não acabado
new file: "Tri\303\242ngulos.cpp"
1 parent 4fe0c78 commit d405269

File tree

4 files changed

+88
-37
lines changed

4 files changed

+88
-37
lines changed

Exercicios/Campo Minado.cpp

Lines changed: 13 additions & 12 deletions
Original file line numberDiff line numberDiff line change
@@ -1,20 +1,21 @@
11
#include<bits/stdc++.h>
2+
using namespace std;
3+
24
int main() {
35
int n;
4-
int c[51];
5-
scanf("%d", &n);
6-
for (int i = 0;i < n;i++) {
7-
scanf("%d", &c[i]);
6+
cin >> n;
7+
int c[n];
8+
9+
for (int i = 0; i < n; i++) {
10+
cin >> c[i];
811
}
9-
for (int i = 0;i < n;i++) {
12+
13+
for (int i = 0; i < n; i++) {
1014
int q = 0;
1115
q = q + c[i];
12-
if (i < n - 1) {
13-
q = q + c[i + 1];
14-
}
15-
if (i > 0) {
16-
q = q + c[i - 1];
17-
}
18-
printf("%d\n", q);
16+
if (i < n - 1) q = q + c[i + 1];
17+
if (i > 0) q = q + c[i - 1];
18+
19+
cout << q << endl;
1920
}
2021
}

Exercicios/Código (OBI 2015).cpp

Lines changed: 11 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -1,18 +1,23 @@
11
#include<bits/stdc++.h>
2+
using namespace std;
23
int main() {
34
int n, cont = 0;
4-
scanf("%d", &n);
5-
int v[n];
6-
for (int i = 0;i < n;i++) {
7-
scanf("%d", &v[i]);
5+
6+
cin >> n;
7+
vector<int>v(n);
8+
9+
for (int i = 0;i < n; i++) {
10+
cin >> v[i];
811
}
9-
for (int i = 0;i < n - 2;i++) {
12+
13+
for (int i = 0;i < n - 2; i++) {
1014
if (v[i] == 1) {
1115
if (v[i + 1] == 0 && v[i + 2] == 0) {
1216
cont++;
1317
}
1418
}
1519
}
16-
printf("%d", cont);
20+
cout << cont;
21+
1722
return 0;
1823
}

Exercicios/Fita Colorida.cpp

Lines changed: 9 additions & 19 deletions
Original file line numberDiff line numberDiff line change
@@ -1,25 +1,23 @@
11
#include <iostream>
2+
#include <bits/stdc++.h>
23
using namespace std;
3-
int main()
4-
{
4+
5+
int main() {
56
int q, c;
67

78
cin >> q;
89

910
int v[q];
1011

11-
for (int i = 0;i < q;i++) {
12-
cin >> v[i];
13-
}
12+
for (int i = 0;i < q;i++) cin >> v[i];
1413

15-
for (int i = 0;i < q;i++) {
14+
for (int i = 0; i < q; i++) {
1615
if (v[i] == 0) {
1716
for (int x = i;x < q;x++) {
1817
if (v[x] != 0) {
1918
c++;
2019
v[x] = min(9, c);
21-
}
22-
else {
20+
} else {
2321
c = 0;
2422
}
2523
}
@@ -34,23 +32,15 @@ else {
3432

3533
if (v[a] != 0) {
3634
c++;
37-
if (v[a] == -1) {
38-
v[a] = min(9, c);
39-
}
40-
else {
41-
v[a] = min(v[a], c);
42-
}
43-
}
44-
else {
35+
v[a] = v[a] == -1 ? min(9, c) : min(v[a], c);
36+
} else {
4537
c = 0;
4638
}
4739
}
4840
}
4941
}
5042

51-
for (int i = 0;i < q;i++) {
52-
cout << v[i] << " ";
53-
}
43+
for (int i = 0; i < q;i++) cout << v[i] << " ";
5444

5545
return 0;
5646
}

Exercicios/Triângulos.cpp

Lines changed: 55 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,55 @@
1+
//https://neps.academy/br/exercise/312
2+
//Triângulos
3+
#include <bits/stdc++.h>
4+
#include <math.h>
5+
using namespace std;
6+
7+
bool condicao(int a, int b, int c) {
8+
/*
9+
1 2 1
10+
| b - c | < a < b + c
11+
| a - c | < b < a + c
12+
| a - b | < c < a + b
13+
*/
14+
int BmenosC = b - c, AmenosC = a - c, AmenosB = a - b;
15+
16+
BmenosC = BmenosC < 0 ? BmenosC * -1 : BmenosC;
17+
AmenosC = AmenosC < 0 ? AmenosC * -1 : AmenosC;
18+
AmenosB = AmenosB < 0 ? AmenosB * -1 : AmenosB;
19+
20+
if (BmenosC < a && a < b + c) {
21+
if (AmenosB < c && c < a + b) {
22+
if (AmenosC < b && b < a + c) return true;
23+
else return false;
24+
} else return false;
25+
} else return false;
26+
}
27+
28+
bool pitagoras(int a, int b, int c) {
29+
// a² = b² + c²
30+
int res = b + c;
31+
return a == res ? true : false;
32+
}
33+
34+
int main() {
35+
int a, b, c;
36+
37+
cin >> a >> b >> c;
38+
bool veradeiroOuFalso = condicao(a, b, c);
39+
bool res = pitagoras(pow(a, 2), pow(b, 2), pow(c, 2));
40+
41+
if (veradeiroOuFalso) {
42+
if (a == b && b == c) {
43+
cout << "a" << endl;
44+
}
45+
else {
46+
cout << (res ? "r" : "o") << endl;
47+
}
48+
}
49+
else {
50+
cout << "n" << endl;
51+
}
52+
53+
//cout << endl << pow(a, 2) << " " << pow(b, 2) << " " << pow(c, 2) << " " << pow(b, 2) + pow(c, 2);
54+
}
55+

0 commit comments

Comments
 (0)