/
Problem039.java
56 lines (53 loc) · 1.8 KB
/
Problem039.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
/*
* The MIT License (MIT)
*
* Copyright (c) 2016 Luís Ramalho
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
* THE SOFTWARE.
*/
package euler;
/**
* Integer right triangles.
*
* @author luisramalho
*/
public class Problem039 {
public int solve() {
int c;
int counter;
int max = 0;
int perimeter = 0;
for (int p = 3; p <= 1000; p++) {
counter = 0;
for (int a = 1; a < p / 2; a++) {
for (int b = 1; b < a; b++) {
c = p - a - b;
if (a * a + b * b == c * c) {
counter++;
}
}
}
if (counter > max) {
max = counter;
perimeter = p;
}
}
return perimeter;
}
}