pjastr

#include <stdio.h>

int main() {
    int n, licznik = 0;
    printf("Wprowadz liczbe n: ");
    scanf("%d", &n);

    if (n < 3) {
        printf("Do obliczen potrzebne sa co najmniej 3 liczby.\n");
        return 0;

pjastr

#include <stdio.h>
#include <stdlib.h>

int main()
{
    int a,b,c;
    scanf("%d", &a);
    scanf("%d", &b);
    scanf("%d", &c);
    int x=0;

pjastr

import java.util.Map;
import java.util.Scanner;
import java.util.TreeMap;

public class Main {
    public static void main(String[] args) {
        StudentGrades app = new StudentGrades();
        while (true) {
            System.out.println("1. Add student");
            System.out.println("2. Remove student");

pjastr

import java.time.LocalDate;
import java.util.Arrays;

public class Main {
    public static void main(String[] args) {
        Integer[] intArray1 = {1, 2, 3};
        Integer[] intArray2 = {};
        LocalDate[] dateArray1 = {LocalDate.of(2020, 1, 1), LocalDate.of(2021, 1, 1)};
        LocalDate[] dateArray2 = {};

pjastr

import java.time.LocalDate;

public class Main {
    public static void main(String[] args) {
        Integer[] intArray1 = {1, 2, 3};
        Integer[] intArray2 = {};
        LocalDate[] dateArray1 = {LocalDate.of(2020, 1, 1), LocalDate.of(2021, 1, 1)};
        LocalDate[] dateArray2 = {};

        System.out.println(ArrayUtil.isEmpty(intArray1)); // false

pjastr

import java.util.ArrayList;
import java.util.List;
import java.util.PriorityQueue;
import java.util.Stack;

public class Main {


    public static void main(String[] args) {
        List<Integer> list = new ArrayList<>();

pjastr

import java.time.LocalDate;
public class Main {
    public static void main(String[] args) {
        Integer[] intArray1 = {1, 2, 3, 4, 5};
        Integer[] intArray2 = {1, 2, 3, 2, 1};
        LocalDate[] dateArray1 = {LocalDate.of(2020, 1, 1), LocalDate.of(2020, 2, 1), LocalDate.of(2020, 3, 1)};
        LocalDate[] dateArray2 = {LocalDate.of(2020, 1, 1), LocalDate.of(2020, 2, 1), LocalDate.of(2020, 1, 1)};

        System.out.println(ArrayUtil.jestPalindromem(intArray1)); // false
        System.out.println(ArrayUtil.jestPalindromem(intArray2)); // true

pjastr

import java.util.LinkedList;
import java.util.PriorityQueue;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        PriorityQueue<Task> queue = new PriorityQueue<>((t1, t2) -> t1.priority - t2.priority);
        Scanner scanner = new Scanner(System.in);
        while(true) {
            String input = scanner.nextLine();

pjastr

import java.util.LinkedList;

public class Main {
    public static void main(String[] args) {
        int n = 30;
        LinkedList<Integer> primes = sitoEratostenesa(n);
        System.out.println("Liczby pierwsze mniejsze od " + n + " to: " + primes);
    }

    public static LinkedList<Integer> sitoEratostenesa(int n) {

pjastr

import java.time.LocalDate;
import java.util.Collections;
import java.util.LinkedList;

public class Main {
    public static void main(String[] args) {
        LinkedList<String> lista = new LinkedList<>();
        lista.add("A");
        lista.add("B");
        lista.add("C");