├── 2022 ├── Task1 │ ├── Main.java │ └── Task1.jpg ├── Task2 │ ├── Main.java │ └── Task2.jpg ├── Task3 │ ├── Main.java │ └── Task3.jpg ├── Task4 │ ├── Main.java │ └── Task4.jpg ├── Task5 │ ├── Main.java │ └── Task5.jpg └── test.docx ├── 2023 ├── Result.png ├── Tasks │ ├── Task1 │ │ ├── Main.java │ │ └── Task1.jpg │ ├── Task2 │ │ ├── Main.java │ │ └── Task2.jpg │ ├── Task3 │ │ ├── Main.java │ │ └── Task3.jpg │ ├── Task4 │ │ ├── Main.java │ │ └── Task4.jpg │ └── Task5 │ │ ├── Main.java │ │ └── Task5.jpg ├── rating.png └── ТЕСТ.docx ├── 2023_Summer_internship ├── 1 │ ├── Main.java │ └── task1.png ├── 2 │ ├── Main.java │ └── task2.png ├── 3 │ ├── Main.java │ └── task3.png ├── 4 │ ├── Main.java │ └── task4.png ├── 5 │ └── task5.png ├── 6 │ └── task6.png ├── rating.png └── Тест.docx ├── 2024_Summer_internship ├── 1 │ ├── task1.png │ └── untitled │ │ ├── pom.xml │ │ ├── src │ │ └── main │ │ │ └── java │ │ │ └── org │ │ │ └── example │ │ │ └── Main.java │ │ └── target │ │ └── classes │ │ └── org │ │ └── example │ │ └── Main.class ├── 2 │ └── task2.png ├── 3 │ └── task3.png ├── 4 │ └── task4.png ├── 5 │ └── task5.png ├── 6 │ └── task6.png └── Тест.docx └── README.md /2022/Task1/Main.java: -------------------------------------------------------------------------------- 1 | import java.util.Scanner; 2 | 3 | public class Main { 4 | public static void main(String[] args) { 5 | Scanner scanner = new Scanner(System.in); 6 | int a = scanner.nextInt(); 7 | int b = scanner.nextInt(); 8 | int n = scanner.nextInt(); 9 | int x = (a+b)/2; 10 | if (a<=b){ 11 | System.out.println("NO"); 12 | }else if(a%2 != b%2){ 13 | System.out.println("NO"); 14 | }else if (a - x < n){ 15 | System.out.println("NO"); 16 | }else { 17 | System.out.println("YES"); 18 | } 19 | } 20 | } -------------------------------------------------------------------------------- /2022/Task1/Task1.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/svytoq/tinkoff_java_school_contest/2ffee5f57d57f537a071b81177ef592739bb5109/2022/Task1/Task1.jpg -------------------------------------------------------------------------------- /2022/Task2/Main.java: -------------------------------------------------------------------------------- 1 | import java.util.Scanner; 2 | 3 | public class Main { 4 | public static void main(String[] args) { 5 | Scanner scanner = new Scanner(System.in); 6 | long n = scanner.nextLong(); 7 | long m = scanner.nextLong(); 8 | long count = 0; 9 | while ( n > 0 & m > 0){ 10 | if (n > m){ 11 | n -= m; 12 | ++count; 13 | }else { 14 | m -= n; 15 | ++count; 16 | } 17 | } 18 | System.out.println(count); 19 | } 20 | } -------------------------------------------------------------------------------- /2022/Task2/Task2.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/svytoq/tinkoff_java_school_contest/2ffee5f57d57f537a071b81177ef592739bb5109/2022/Task2/Task2.jpg -------------------------------------------------------------------------------- /2022/Task3/Main.java: -------------------------------------------------------------------------------- 1 | import java.util.Scanner; 2 | 3 | public class Main { 4 | public static void main(String[] args) { 5 | Scanner scanner = new Scanner(System.in); 6 | int n = scanner.nextInt(); 7 | long[] mas = new long[n]; 8 | int x = 1; 9 | boolean flag = false; 10 | for (int i = 0; i < n; i++) { 11 | mas[i] = scanner.nextLong(); 12 | } 13 | x = ((int) Math.sqrt(mas[0])) + 1; 14 | long x1 = x; 15 | while (!flag){ 16 | for (int i = 0; i < n;i++){ 17 | if (ToDo(x1,mas[i]) < 0 ){ 18 | ++x; 19 | x1 = x; 20 | flag = false; 21 | break; 22 | } 23 | x1 = ToDo(x1,mas[i]); 24 | flag = true; 25 | } 26 | } 27 | System.out.println(x); 28 | } 29 | 30 | public static long ToDo(long k, long a){ 31 | return k*k -a; 32 | } 33 | } -------------------------------------------------------------------------------- /2022/Task3/Task3.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/svytoq/tinkoff_java_school_contest/2ffee5f57d57f537a071b81177ef592739bb5109/2022/Task3/Task3.jpg -------------------------------------------------------------------------------- /2022/Task4/Main.java: -------------------------------------------------------------------------------- 1 | import java.util.Scanner; 2 | 3 | public class Main { 4 | public static void main(String[] args) { 5 | Scanner scanner = new Scanner(System.in); 6 | int n = scanner.nextInt(); 7 | int m = scanner.nextInt(); 8 | int count = 0; 9 | if (((2*n - m - 1) % 3 == 0) & ((2*m - n - 1) % 3 == 0)) { 10 | int x = (2 * n - m - 1) / 3 ; 11 | int y = (2 * m - n - 1) / 3 ; 12 | count = getFactorial(x+y)/(getFactorial(x)*getFactorial(y)); 13 | } 14 | System.out.println(count); 15 | } 16 | 17 | public static int getFactorial(int f) { 18 | int result = 1; 19 | for (int i = 1; i <= f; i++) { 20 | result = result * i; 21 | } 22 | return result; 23 | } 24 | } -------------------------------------------------------------------------------- /2022/Task4/Task4.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/svytoq/tinkoff_java_school_contest/2ffee5f57d57f537a071b81177ef592739bb5109/2022/Task4/Task4.jpg -------------------------------------------------------------------------------- /2022/Task5/Main.java: -------------------------------------------------------------------------------- 1 | import java.util.Scanner; 2 | 3 | public class Main { 4 | public static void main(String[] args) { 5 | Scanner scanner = new Scanner(System.in); 6 | int n = scanner.nextInt(); 7 | int a[] = new int[n]; 8 | int b[] = new int[n]; 9 | boolean check[] = new boolean[n]; 10 | for (int i = 0; i < n; i++){ 11 | a[i] = scanner.nextInt(); 12 | } 13 | for (int i = 0; i < n; i++){ 14 | b[i] = scanner.nextInt(); 15 | } 16 | boolean flag = false; 17 | int l = 0; 18 | int count = 0; 19 | int max = 0; 20 | metka: 21 | while (!flag){ 22 | if (!check[l]) { 23 | check[l] = true; 24 | for (int i = 1; i <= a[n-l-1]; i++){ 25 | int l1 = l + i; 26 | if (l1 >= n) { 27 | flag = true; 28 | break metka; 29 | } else { 30 | l1 = l1 - b[n - l1 - 1]; 31 | } 32 | max = Math.max(max, l1); 33 | 34 | } 35 | count++; 36 | l = max; 37 | max = 0; 38 | } else{ 39 | break; 40 | } 41 | } 42 | if (flag){ 43 | System.out.println(count+1); 44 | }else { 45 | System.out.println(-1); 46 | } 47 | } 48 | } -------------------------------------------------------------------------------- /2022/Task5/Task5.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/svytoq/tinkoff_java_school_contest/2ffee5f57d57f537a071b81177ef592739bb5109/2022/Task5/Task5.jpg -------------------------------------------------------------------------------- /2022/test.docx: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/svytoq/tinkoff_java_school_contest/2ffee5f57d57f537a071b81177ef592739bb5109/2022/test.docx -------------------------------------------------------------------------------- /2023/Result.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/svytoq/tinkoff_java_school_contest/2ffee5f57d57f537a071b81177ef592739bb5109/2023/Result.png -------------------------------------------------------------------------------- /2023/Tasks/Task1/Main.java: -------------------------------------------------------------------------------- 1 | import java.util.ArrayList; 2 | import java.util.List; 3 | import java.util.Scanner; 4 | import java.util.function.Function; 5 | import java.util.stream.Collectors; 6 | 7 | public class Main { 8 | public static void main(String[] args) { 9 | Scanner scanner = new Scanner(System.in); 10 | String number = scanner.nextLine(); 11 | int longOfLine = number.length(); 12 | int countOf = 0; 13 | boolean[] chekerArray = new boolean[10]; 14 | boolean flag = false; 15 | 16 | for (int i = 0; i <= longOfLine - 10; i++){ 17 | String str = number.substring(i, i+10); 18 | String newStr = str.replaceAll("\\?", ""); 19 | countOf = 10 - newStr.length(); 20 | Long intStr = Long.parseLong(newStr); 21 | while (intStr > 0){ 22 | int b = (int) (intStr % 10); 23 | chekerArray[b] = true; 24 | intStr /=10; 25 | } 26 | for (boolean bool: chekerArray){ 27 | if (bool){ 28 | countOf++; 29 | } 30 | } 31 | if( countOf >=10){ 32 | flag = true; 33 | } 34 | chekerArray = new boolean[10]; 35 | } 36 | if (flag){ 37 | System.out.println("YES"); 38 | }else { 39 | System.out.println("NO"); 40 | } 41 | } 42 | } 43 | 44 | -------------------------------------------------------------------------------- /2023/Tasks/Task1/Task1.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/svytoq/tinkoff_java_school_contest/2ffee5f57d57f537a071b81177ef592739bb5109/2023/Tasks/Task1/Task1.jpg -------------------------------------------------------------------------------- /2023/Tasks/Task2/Main.java: -------------------------------------------------------------------------------- 1 | import java.util.ArrayList; 2 | import java.util.List; 3 | import java.util.Scanner; 4 | 5 | public class Main { 6 | public static void main(String[] args) { 7 | Scanner scanner = new Scanner(System.in); 8 | int n = Integer.parseInt(scanner.nextLine()); 9 | int[] intArray = new int[n]; 10 | int count = 0; 11 | 12 | int startDegree = -1; 13 | 14 | int maxDegree = 0; 15 | boolean plusINF = true; 16 | boolean[] boolArray = new boolean[n]; 17 | for (int i = 0; i < n; i++){ 18 | String[] str1 = scanner.nextLine().split("\\s"); 19 | intArray[i] = Integer.parseInt(str1[0]); 20 | if (str1[1].equals("-")){ 21 | boolArray[i] = false; 22 | }else { 23 | boolArray[i] = true; 24 | } 25 | } 26 | 27 | for (int i = 0; i= 0){ 43 | checker = true; 44 | }else { 45 | checker = false; 46 | } 47 | if (!(checker == boolArray[i])) { 48 | flag = false; 49 | break; 50 | } else { 51 | flag = true; 52 | } 53 | } 54 | 55 | if (flag) { 56 | break; 57 | } else { 58 | startDegree--; 59 | } 60 | } 61 | System.out.println(maxDegree); 62 | }else{ 63 | System.out.println("inf"); 64 | } 65 | } 66 | } -------------------------------------------------------------------------------- /2023/Tasks/Task2/Task2.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/svytoq/tinkoff_java_school_contest/2ffee5f57d57f537a071b81177ef592739bb5109/2023/Tasks/Task2/Task2.jpg -------------------------------------------------------------------------------- /2023/Tasks/Task3/Main.java: -------------------------------------------------------------------------------- 1 | import java.util.Arrays; 2 | import java.util.Scanner; 3 | 4 | public class Main { 5 | public static void main(String[] args) { 6 | Scanner scanner = new Scanner(System.in); 7 | int n, m, k; 8 | n = scanner.nextInt(); 9 | m = scanner.nextInt(); 10 | k = scanner.nextInt(); 11 | int[] p = new int[n]; 12 | int[] a = new int[m]; 13 | int[] b = new int[m]; 14 | boolean[] checkDone = new boolean[m]; 15 | int countOfCheckDone = 0; 16 | int count = 0; 17 | 18 | for (int i = 0; i < n; i++){ 19 | p[i] = scanner.nextInt(); 20 | } 21 | 22 | for (int i = 0; i < m; i++){ 23 | a[i] = scanner.nextInt(); 24 | b[i] = scanner.nextInt(); 25 | if(p[a[i]-1] == p[b[i]-1]){ 26 | checkDone[i] = true; 27 | countOfCheckDone++; 28 | } 29 | } 30 | 31 | 32 | 33 | while (countOfCheckDone < m) { 34 | 35 | int[] countMaxP = new int[k]; 36 | int maxP = 0; 37 | int numberOfMaxP = 0; 38 | for (int i = 0; i < m; i++) { 39 | if (!checkDone[i]) { 40 | countMaxP[p[a[i]-1]-1]++; 41 | countMaxP[p[b[i]-1]-1]++; 42 | } 43 | } 44 | 45 | for (int i = 0; i < k; i++) { 46 | if (numberOfMaxP <= countMaxP[i]) { 47 | maxP = i+1; 48 | numberOfMaxP = countMaxP[i]; 49 | } 50 | } 51 | 52 | for (int i = 0; i < m; i++) { 53 | if (!checkDone[i]) { 54 | if (a[i] == maxP) { 55 | b[i] = maxP; 56 | count++; 57 | break; 58 | } 59 | if (b[i] == maxP) { 60 | a[i] = maxP; 61 | count++; 62 | break; 63 | } 64 | } 65 | } 66 | 67 | for (int i = 0; i < m; i++) { 68 | if (p[a[i]-1] == p[b[i]-1]) { 69 | checkDone[i] = true; 70 | countOfCheckDone++; 71 | } 72 | } 73 | } 74 | System.out.println(count); 75 | } 76 | } -------------------------------------------------------------------------------- /2023/Tasks/Task3/Task3.jpg: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/svytoq/tinkoff_java_school_contest/2ffee5f57d57f537a071b81177ef592739bb5109/2023/Tasks/Task3/Task3.jpg -------------------------------------------------------------------------------- /2023/Tasks/Task4/Main.java: -------------------------------------------------------------------------------- 1 | import java.util.Arrays; 2 | import java.util.Scanner; 3 | 4 | public class Main { 5 | public static void main(String[] args) { 6 | Scanner scanner = new Scanner(System.in); 7 | int n = scanner.nextInt(); 8 | Filter[] filters = new Filter[n]; 9 | int[] a = new int[n]; 10 | int[] p = new int[n]; 11 | int[] l = new int[n]; 12 | for (int i = 0; i=fullLength){ 28 | if(filterNow.getP() == 0){ 29 | break; 30 | } 31 | filterNow = filters[filterNow.getP()-1]; 32 | filterNow.setCount(filterNow.getCount()+1); 33 | fullLength += filterNow.getL(); 34 | } 35 | 36 | } 37 | 38 | for (int i = 0; i 0){ 34 | t = array[q]; 35 | qq = q; 36 | array[q] = 0; 37 | break; 38 | } 39 | } 40 | for (int q = 0; q= h[1])&&(h[1] >= h[2])&&(h[2] >= h[3]))||((h[0] <= h[1])&&(h[1] <= h[2])&&(h[2] <= h[3]))){ 12 | System.out.println("YES"); 13 | }else { 14 | System.out.println("NO"); 15 | } 16 | } 17 | } -------------------------------------------------------------------------------- /2023_Summer_internship/1/task1.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/svytoq/tinkoff_java_school_contest/2ffee5f57d57f537a071b81177ef592739bb5109/2023_Summer_internship/1/task1.png -------------------------------------------------------------------------------- /2023_Summer_internship/2/Main.java: -------------------------------------------------------------------------------- 1 | import java.util.Scanner; 2 | 3 | public class Main { 4 | public static void main(String[] args) { 5 | Scanner scanner = new Scanner(System.in); 6 | int n,m, k, result; 7 | n = scanner.nextInt(); 8 | m = scanner.nextInt(); 9 | k = scanner.nextInt(); 10 | 11 | if (n*k % m == 0){ 12 | result = (n * k)/m; 13 | }else { 14 | result = (n * k)/m + 1; 15 | } 16 | System.out.println(result); 17 | } 18 | } -------------------------------------------------------------------------------- /2023_Summer_internship/2/task2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/svytoq/tinkoff_java_school_contest/2ffee5f57d57f537a071b81177ef592739bb5109/2023_Summer_internship/2/task2.png -------------------------------------------------------------------------------- /2023_Summer_internship/3/Main.java: -------------------------------------------------------------------------------- 1 | import java.util.Scanner; 2 | public class Main { 3 | public static void main(String[] args) { 4 | int indexToA = -1, indexToB = -1, indexToC = -1, indexToD =-1; 5 | int n; 6 | char charNow; 7 | boolean flag = false; 8 | Scanner scanner = new Scanner(System.in); 9 | n = scanner.nextInt(); 10 | int result = n; 11 | String str = scanner.next(); 12 | for (int i = 0; i < n; i++){ 13 | charNow = str.charAt(i); 14 | if(charNow == 'a'){ 15 | indexToA = i; 16 | } 17 | if(charNow == 'b'){ 18 | indexToB = i; 19 | } 20 | if(charNow == 'c'){ 21 | indexToC = i; 22 | } 23 | if(charNow == 'd'){ 24 | indexToD = i; 25 | } 26 | 27 | if(Math.min(indexToA, indexToB) >= 0 && Math.min(indexToC, indexToD) >= 0){ 28 | flag = true; 29 | result = Math.min(result, Math.max(indexToA, Math.max(indexToB, Math.max(indexToC, indexToD))) + 1 - Math.min(indexToA, Math.min(indexToB, Math.min(indexToC, indexToD)))) ; 30 | if (result == 4){ 31 | break; 32 | } 33 | } 34 | 35 | 36 | } 37 | if (flag){ 38 | System.out.println(result); 39 | }else { 40 | System.out.println(-1); 41 | } 42 | } 43 | } -------------------------------------------------------------------------------- /2023_Summer_internship/3/task3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/svytoq/tinkoff_java_school_contest/2ffee5f57d57f537a071b81177ef592739bb5109/2023_Summer_internship/3/task3.png -------------------------------------------------------------------------------- /2023_Summer_internship/4/Main.java: -------------------------------------------------------------------------------- 1 | import java.util.HashMap; 2 | import java.util.Map; 3 | import java.util.Scanner; 4 | import java.util.TreeMap; 5 | 6 | public class Main { 7 | public static void main(String[] args) { 8 | Scanner scanner = new Scanner(System.in); 9 | int n = scanner.nextInt(); 10 | int[] a = new int[n]; 11 | int maxTt =0; 12 | Map map1 = new HashMap<>(); 13 | Map map2 = new HashMap<>(); 14 | int result = 2; 15 | for (int i=0; i < n; i++){ 16 | a[i] = scanner.nextInt(); 17 | int t = map1.getOrDefault(a[i], 0) + 1; 18 | map1.put(a[i], t); 19 | int tt = map2.getOrDefault(t, 0) + 1; 20 | if (t > 1 && map2.getOrDefault(t - 1, 0) == 1){ 21 | map2.remove(t-1); 22 | } else if(t > 1){ 23 | map2.put(t - 1, map2.getOrDefault(t - 1, 0) - 1); 24 | } 25 | map2.put(t, tt); 26 | if (t > maxTt){ 27 | maxTt = t; 28 | } 29 | } 30 | 31 | for (int i = n-1; i > 0; i--){ 32 | if((map2.size() == 1) || (map2.size() == 2 && map2.getOrDefault(1, 0) == 1) || (map2.size() == 2 && map2.getOrDefault(maxTt, 0) == 1 && map2.getOrDefault(maxTt -1, 0) != 0)){ 33 | result = i+1; 34 | break; 35 | } 36 | 37 | int t = map1.get(a[i]) - 1; 38 | if (maxTt == t+1 && map2.get(t + 1) == 1){ 39 | maxTt -=1; 40 | } 41 | if(t == 0){ 42 | map1.remove(a[i]); 43 | }else { 44 | map1.put(a[i], t); 45 | } 46 | int tt = map2.get(t+1) - 1; 47 | if (tt == 0){ 48 | map2.remove(t + 1); 49 | }else { 50 | map2.put(t + 1, tt); 51 | } 52 | if (t != 0) { 53 | map2.put(t, map2.getOrDefault(t, 0) + 1); 54 | } 55 | } 56 | 57 | System.out.println(result); 58 | 59 | } 60 | } -------------------------------------------------------------------------------- /2023_Summer_internship/4/task4.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/svytoq/tinkoff_java_school_contest/2ffee5f57d57f537a071b81177ef592739bb5109/2023_Summer_internship/4/task4.png -------------------------------------------------------------------------------- /2023_Summer_internship/5/task5.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/svytoq/tinkoff_java_school_contest/2ffee5f57d57f537a071b81177ef592739bb5109/2023_Summer_internship/5/task5.png -------------------------------------------------------------------------------- /2023_Summer_internship/6/task6.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/svytoq/tinkoff_java_school_contest/2ffee5f57d57f537a071b81177ef592739bb5109/2023_Summer_internship/6/task6.png -------------------------------------------------------------------------------- /2023_Summer_internship/rating.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/svytoq/tinkoff_java_school_contest/2ffee5f57d57f537a071b81177ef592739bb5109/2023_Summer_internship/rating.png -------------------------------------------------------------------------------- /2023_Summer_internship/Тест.docx: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/svytoq/tinkoff_java_school_contest/2ffee5f57d57f537a071b81177ef592739bb5109/2023_Summer_internship/Тест.docx -------------------------------------------------------------------------------- /2024_Summer_internship/1/task1.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/svytoq/tinkoff_java_school_contest/2ffee5f57d57f537a071b81177ef592739bb5109/2024_Summer_internship/1/task1.png -------------------------------------------------------------------------------- /2024_Summer_internship/1/untitled/pom.xml: -------------------------------------------------------------------------------- 1 | 2 | 5 | 4.0.0 6 | 7 | org.example 8 | untitled 9 | 1.0-SNAPSHOT 10 | 11 | 12 | 17 13 | 17 14 | UTF-8 15 | 16 | 17 | -------------------------------------------------------------------------------- /2024_Summer_internship/1/untitled/src/main/java/org/example/Main.java: -------------------------------------------------------------------------------- 1 | package org.example; 2 | 3 | import java.util.*; 4 | 5 | public class Main { 6 | public static void main(String[] args) { 7 | 8 | } 9 | } 10 | -------------------------------------------------------------------------------- /2024_Summer_internship/1/untitled/target/classes/org/example/Main.class: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/svytoq/tinkoff_java_school_contest/2ffee5f57d57f537a071b81177ef592739bb5109/2024_Summer_internship/1/untitled/target/classes/org/example/Main.class -------------------------------------------------------------------------------- /2024_Summer_internship/2/task2.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/svytoq/tinkoff_java_school_contest/2ffee5f57d57f537a071b81177ef592739bb5109/2024_Summer_internship/2/task2.png -------------------------------------------------------------------------------- /2024_Summer_internship/3/task3.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/svytoq/tinkoff_java_school_contest/2ffee5f57d57f537a071b81177ef592739bb5109/2024_Summer_internship/3/task3.png -------------------------------------------------------------------------------- /2024_Summer_internship/4/task4.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/svytoq/tinkoff_java_school_contest/2ffee5f57d57f537a071b81177ef592739bb5109/2024_Summer_internship/4/task4.png -------------------------------------------------------------------------------- /2024_Summer_internship/5/task5.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/svytoq/tinkoff_java_school_contest/2ffee5f57d57f537a071b81177ef592739bb5109/2024_Summer_internship/5/task5.png -------------------------------------------------------------------------------- /2024_Summer_internship/6/task6.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/svytoq/tinkoff_java_school_contest/2ffee5f57d57f537a071b81177ef592739bb5109/2024_Summer_internship/6/task6.png -------------------------------------------------------------------------------- /2024_Summer_internship/Тест.docx: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/svytoq/tinkoff_java_school_contest/2ffee5f57d57f537a071b81177ef592739bb5109/2024_Summer_internship/Тест.docx -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # tinkoff_java_school_contest 2 | Задания и решение вступительных испытаний для весенний школы по java 2022 от fintech.tinkoff 3 | Не уверен в правильности всех заданий, но это может помочь кому-нибудь для подготовки. 4 | --------------------------------------------------------------------------------