Skip to content

Commit b2efaa4

Browse files
committed
cwiczenia petle3
1 parent 5062113 commit b2efaa4

File tree

13 files changed

+289
-67
lines changed

13 files changed

+289
-67
lines changed

.idea/workspace.xml

Lines changed: 92 additions & 67 deletions
Some generated files are not rendered by default. Learn more about customizing how changed files appear on GitHub.
1.06 KB
Binary file not shown.
1.27 KB
Binary file not shown.
1.06 KB
Binary file not shown.
1.17 KB
Binary file not shown.
1.7 KB
Binary file not shown.
1.06 KB
Binary file not shown.

src/jp/JP14.java

Lines changed: 18 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,18 @@
1+
package jp;
2+
3+
public class JP14 {
4+
public static void main(String[] args) {
5+
6+
int[] numbers = {1, 2, 9, 3, 7, 8, 8, 9, 9, 1, 1, 2, 3, 4, 5};
7+
int suma = 20;
8+
int licznik;
9+
10+
for (licznik = 1; licznik < numbers.length; licznik++) {
11+
System.out.println("(" + numbers[licznik - 1] + ")+(" + numbers[licznik] + ")=(" + (numbers[licznik - 1] + numbers[licznik]) + ")");
12+
if (numbers[licznik - 1] + numbers[licznik] < suma) {
13+
suma = (numbers[licznik - 1] + numbers[licznik]);
14+
}
15+
}
16+
System.out.println("Najmniejsza suma to : " + suma);
17+
}
18+
}

src/jp/JP15.java

Lines changed: 49 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,49 @@
1+
package jp;
2+
3+
public class JP15 {
4+
public static void main(String[] args) {
5+
int[] numbers = {1, 2, 2, 4, 1, 1, 1, 8, 9};
6+
int[] ciagi = {0, 0, 0, 0, 0, 0, 0, 0, 0};
7+
int licznik;
8+
int key = 0;
9+
10+
for (licznik = 0; licznik < numbers.length; licznik++) {
11+
key = numbers[licznik];
12+
switch (key) {
13+
case 1:
14+
ciagi[0]++;
15+
break;
16+
case 2:
17+
ciagi[1]++;
18+
break;
19+
case 3:
20+
ciagi[2]++;
21+
break;
22+
case 4:
23+
ciagi[3]++;
24+
break;
25+
case 5:
26+
ciagi[4]++;
27+
break;
28+
case 6:
29+
ciagi[5]++;
30+
break;
31+
case 7:
32+
ciagi[6]++;
33+
break;
34+
case 8:
35+
ciagi[7]++;
36+
break;
37+
case 9:
38+
ciagi[8]++;
39+
break;
40+
}
41+
42+
}
43+
for (licznik = 0; licznik < numbers.length; licznik++) {
44+
if (ciagi[licznik] > 1) {
45+
System.out.println("Liczba " + (licznik + 1) + " wykryto " + (ciagi[licznik]) + " razy.");
46+
}
47+
}
48+
}
49+
}

src/jp/JP16.java

Lines changed: 25 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,25 @@
1+
package jp;
2+
3+
public class JP16 {
4+
public static void main(String[] args) {
5+
int[] numbers = {3, 2, 3, 1, 5, 6, 7, 1, 9};
6+
int najmniejszaSuma = 20;
7+
int licznik1;
8+
int licznik2;
9+
int suma = 20;
10+
11+
for (licznik1 = 0; licznik1 < numbers.length; licznik1++) {
12+
for (licznik2 = 0; licznik2 < numbers.length; licznik2++) {
13+
if (licznik1 != licznik2) {
14+
suma = (numbers[licznik1]) + (numbers[licznik2]);
15+
16+
}
17+
if (suma < najmniejszaSuma) {
18+
najmniejszaSuma = suma;
19+
}
20+
}
21+
}
22+
System.out.println("Najmniejsza suma to: " + najmniejszaSuma);
23+
}
24+
25+
}

0 commit comments

Comments
 (0)