پاسخ سوالات سایت کوئرا

import java.util.Scanner;

public class Main {

    static Scanner scanner;

    public static void main(String[] args) {
        int i;
        // melon count
        scanner = new Scanner(System.in);
        int n = Integer.parseInt(scanner.nextLine());
        if(n < 1)
            n = 1;

        // weight
        String weightText = scanner.nextLine();
        String[] weightTextArray = weightText.split(" ");

        int s1 = 0;
        int s2 = 1;
        int sNext = 2;
        int min = 0;
        for (i = 0 ; i < n-1; i++) {
            min = Math.min(Integer.parseInt(weightTextArray[s1]), Integer.parseInt(weightTextArray[s2]));
            if(min == Integer.parseInt(weightTextArray[s1])) {
                weightTextArray[s1] = "-1";
                s1 = sNext;
                sNext++;
            }
            else if(min == Integer.parseInt(weightTextArray[s2])) {
                weightTextArray[s2] = "-1";
                s2 = sNext;
                sNext++;
            }

        }
        for (i = 0; i < n; i++)
            if(!weightTextArray[i].equals("-1")) {
                System.out.println(i+1);
                break;
            }

    }

}

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

import java.util.Scanner;

public class Main {

static Scanner scanner;

public static void main(String[] args) {

int i;

// melon count

scanner = new Scanner(System.in);

int n = Integer.parseInt(scanner.nextLine());

if(n < 1)

n = 1;

// weight

String weightText = scanner.nextLine();

String[] weightTextArray = weightText.split(" ");

int s1 = 0;

int s2 = 1;

int sNext = 2;

int min = 0;

for (i = 0 ; i < n-1; i++) {

min = Math.min(Integer.parseInt(weightTextArray[s1]), Integer.parseInt(weightTextArray[s2]));

if(min == Integer.parseInt(weightTextArray[s1])) {

weightTextArray[s1] = "-1";

s1 = sNext;

sNext++;

}

else if(min == Integer.parseInt(weightTextArray[s2])) {

weightTextArray[s2] = "-1";

s2 = sNext;

sNext++;

}

for (i = 0; i < n; i++)

if(!weightTextArray[i].equals("-1")) {

System.out.println(i+1);

break;

}

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int changeStateCount = 0;
        int lastState = 0;
        int tempState = 0;

        for (int i = 1; i<=n; i++) {
            tempState = sc.nextInt();

            if(i == 1) {
                lastState = tempState;
            }
            else if(i > 1 && lastState != tempState) {
                lastState = tempState;
                changeStateCount++;
            }
        }

        System.out.println(changeStateCount);
    }

}

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

import java.util.Scanner;

public class Main {

public static void main(String[] args) {

Scanner sc = new Scanner(System.in);

int n = sc.nextInt();

int changeStateCount = 0;

int lastState = 0;

int tempState = 0;

for (int i = 1; i<=n; i++) {

tempState = sc.nextInt();

if(i == 1) {

lastState = tempState;

}

else if(i > 1 && lastState != tempState) {

lastState = tempState;

changeStateCount++;

}

System.out.println(changeStateCount);

}

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        String n = sc.nextLine();
        int nn = Integer.parseInt(n);
        String myInput = sc.nextLine();
        String[] splited = myInput.split("\\s+");

        if(nn < 0 || nn > 50)
            return;

        for (int i = 2; i<=nn; i++) {
            for (int j = i - 1; j>=1; j--) {
                System.out.println(splited[i - 1] + ": salam " + splited[j - 1] + "!");
            }
        }

        for (int i = 1; i<=nn; i++) {
            System.out.println(splited[i - 1] + ": khodafez bacheha!");
            for(int j = i + 1; j <= nn; j++) {
                System.out.println(splited[j - 1] + ": khodafez  " + splited[i - 1] + "!");
            }
        }

    }

}

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

import java.util.Scanner;

public class Main {

public static void main(String[] args) {

Scanner sc = new Scanner(System.in);

String n = sc.nextLine();

int nn = Integer.parseInt(n);

String myInput = sc.nextLine();

String[] splited = myInput.split("\\s+");

if(nn < 0 || nn > 50)

return;

for (int i = 2; i<=nn; i++) {

for (int j = i - 1; j>=1; j--) {

System.out.println(splited[i - 1] + ": salam " + splited[j - 1] + "!");

}

for (int i = 1; i<=nn; i++) {

System.out.println(splited[i - 1] + ": khodafez bacheha!");

for(int j = i + 1; j <= nn; j++) {

System.out.println(splited[j - 1] + ": khodafez " + splited[i - 1] + "!");

}

import java.math.RoundingMode;
import java.text.DecimalFormat;
import java.util.Scanner;

public class Main {
    static Scanner sc;
    public static void main(String[] args) {
        sc = new Scanner(System.in);

        int number;
        String result = "";
        int counter = 0;

        while (true) {
            number = sc.nextInt();

            if(number == 0)
                break;

            if(counter==0)
                result = String.valueOf(number);
            else
                result = String.valueOf(number) + '\n' + result;

            counter++;
        }

        System.out.println(result);
    }
}

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

import java.math.RoundingMode;

import java.text.DecimalFormat;

import java.util.Scanner;

public class Main {

static Scanner sc;

public static void main(String[] args) {

sc = new Scanner(System.in);

int number;

String result = "";

int counter = 0;

while (true) {

number = sc.nextInt();

if(number == 0)

break;

if(counter==0)

result = String.valueOf(number);

else

result = String.valueOf(number) + '\n' + result;

counter++;

}

System.out.println(result);

}

import java.util.Scanner;

public class Main {
    static Scanner sc;
    public static void main(String[] args) {
        sc = new Scanner(System.in);

        String string = sc.nextLine();
        String numYear = "";
        String numMonth = "";

        int counter = 0;

        for (char ch : string.toCharArray()) {
            counter++;
            if(counter <= 2) {
                numYear = numYear + Character.toString(ch);
            } else {
                numMonth = numMonth + Character.toString(ch);
            }
        }

        System.out.println("saal:" + numYear);
        System.out.println("maah:" + numMonth);
    }
}

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

import java.util.Scanner;

public class Main {

static Scanner sc;

public static void main(String[] args) {

sc = new Scanner(System.in);

String string = sc.nextLine();

String numYear = "";

String numMonth = "";

int counter = 0;

for (char ch : string.toCharArray()) {

counter++;

if(counter <= 2) {

numYear = numYear + Character.toString(ch);

} else {

numMonth = numMonth + Character.toString(ch);

}

System.out.println("saal:" + numYear);

System.out.println("maah:" + numMonth);

}

import java.math.RoundingMode;
import java.text.DecimalFormat;
import java.util.Scanner;

public class Main {

    static Scanner sc;
    public static void main(String[] args) {
        sc = new Scanner(System.in);

        float Numbers[] = new float[4];
        Numbers[0] = sc.nextInt();
        Numbers[1] = sc.nextInt();
        Numbers[2] = sc.nextInt();
        Numbers[3] = sc.nextInt();

        float Sum = Numbers[0] + Numbers[1] + Numbers[2] + Numbers[3];

        float Average;
        if(Sum == 0)
            Average = Sum - Sum;
        else
            Average = Sum / 4;
        float Product = Numbers[0] * Numbers[1] * Numbers[2] * Numbers[3];
        float MAX = Math.max(Numbers[0], Math.max(Numbers[1], Math.max(Numbers[2], Numbers[3])));
        float MIN = Math.min(Numbers[0], Math.min(Numbers[1], Math.min(Numbers[2], Numbers[3])));

        DecimalFormat df = new DecimalFormat("#.000000");
        df.setRoundingMode(RoundingMode.CEILING);

        if(Sum == 0)
            System.out.println("Sum : 0.000000");
        else
            System.out.println("Sum : " + df.format(Sum));

        if(Average == 0)
            System.out.println("Average : 0.000000");
        else
            System.out.println("Average : " + df.format(Average));

        if(Product == 0)
            System.out.println("Product : 0.000000");
        else
            System.out.println("Product : " + df.format(Product));

        if(MAX == 0)
            System.out.println("MAX : 0.000000");
        else
            System.out.println("MAX : " + df.format(MAX));

        if(MIN == 0)
            System.out.println("MIN : 0.000000");
        else
            System.out.println("MIN : " + df.format(MIN));
    }
}

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

import java.math.RoundingMode;

import java.text.DecimalFormat;

import java.util.Scanner;

public class Main {

static Scanner sc;

public static void main(String[] args) {

sc = new Scanner(System.in);

float Numbers[] = new float[4];

Numbers[0] = sc.nextInt();

Numbers[1] = sc.nextInt();

Numbers[2] = sc.nextInt();

Numbers[3] = sc.nextInt();

float Sum = Numbers[0] + Numbers[1] + Numbers[2] + Numbers[3];

float Average;

if(Sum == 0)

Average = Sum - Sum;

else

Average = Sum / 4;

float Product = Numbers[0] * Numbers[1] * Numbers[2] * Numbers[3];

float MAX = Math.max(Numbers[0], Math.max(Numbers[1], Math.max(Numbers[2], Numbers[3])));

float MIN = Math.min(Numbers[0], Math.min(Numbers[1], Math.min(Numbers[2], Numbers[3])));

DecimalFormat df = new DecimalFormat("#.000000");

df.setRoundingMode(RoundingMode.CEILING);

if(Sum == 0)

System.out.println("Sum : 0.000000");

else

System.out.println("Sum : " + df.format(Sum));

if(Average == 0)

System.out.println("Average : 0.000000");

else

System.out.println("Average : " + df.format(Average));

if(Product == 0)

System.out.println("Product : 0.000000");

else

System.out.println("Product : " + df.format(Product));

if(MAX == 0)

System.out.println("MAX : 0.000000");

else

System.out.println("MAX : " + df.format(MAX));

if(MIN == 0)

System.out.println("MIN : 0.000000");

else

System.out.println("MIN : " + df.format(MIN));

}

import java.math.RoundingMode;
import java.text.DecimalFormat;
import java.util.Scanner;

public class Main {
    static Scanner sc;
    public static void main(String[] args) {
        sc = new Scanner(System.in);

        float WeightInKilograms = sc.nextFloat();
        float HeightInMeters = sc.nextFloat();

        if(WeightInKilograms < 1 || WeightInKilograms > 200)
            return;

        if(HeightInMeters < 1 || HeightInMeters > 10)
            return;

        float BMI = WeightInKilograms / (HeightInMeters * HeightInMeters);

        DecimalFormat df = new DecimalFormat("#.00");
        df.setRoundingMode(RoundingMode.CEILING);

        System.out.println(df.format((double) Math.round(BMI * 100) / 100));

        if(BMI < 18.5)
            System.out.println("Underweight");
        else if(BMI >= 18.5 && BMI < 25)
            System.out.println("Normal");
        else if(BMI >= 25 && BMI < 30)
            System.out.println("Overweight");
        else if(BMI > 30)
            System.out.println("Obese");

    }
}

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

import java.math.RoundingMode;

import java.text.DecimalFormat;

import java.util.Scanner;

public class Main {

static Scanner sc;

public static void main(String[] args) {

sc = new Scanner(System.in);

float WeightInKilograms = sc.nextFloat();

float HeightInMeters = sc.nextFloat();

if(WeightInKilograms < 1 || WeightInKilograms > 200)

return;

if(HeightInMeters < 1 || HeightInMeters > 10)

return;

float BMI = WeightInKilograms / (HeightInMeters * HeightInMeters);

DecimalFormat df = new DecimalFormat("#.00");

df.setRoundingMode(RoundingMode.CEILING);

System.out.println(df.format((double) Math.round(BMI * 100) / 100));

if(BMI < 18.5)

System.out.println("Underweight");

else if(BMI >= 18.5 && BMI < 25)

System.out.println("Normal");

else if(BMI >= 25 && BMI < 30)

System.out.println("Overweight");

else if(BMI > 30)

System.out.println("Obese");

}

import java.util.Scanner;

class Main {

    static Scanner sc;

    public static void main(String[]args){
        sc = new Scanner(System.in);
        int N, N1;
        N = sc.nextInt();
        N1 = sc.nextInt();
        ShowFibNth(N, N1);
    }

    public static void ShowFibNth(int N, int N1) {
        if(N==0)
            return;
        System.out.println(N);
        int new_n = N1 - N;
        ShowFibNth(new_n, N);
    }

}

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

import java.util.Scanner;

class Main {

static Scanner sc;

public static void main(String[]args){

sc = new Scanner(System.in);

int N, N1;

N = sc.nextInt();

N1 = sc.nextInt();

ShowFibNth(N, N1);

}

public static void ShowFibNth(int N, int N1) {

if(N==0)

return;

System.out.println(N);

int new_n = N1 - N;

ShowFibNth(new_n, N);

}

import java.util.Scanner;


class Main {

    static Scanner sc;
    static String strInput;

    public static void main(String[]args) {
        sc = new Scanner(System.in);

        int n = Integer.parseInt(sc.nextLine());

        if (n < 1 || n > 20)
            return;

        String[] inputNumbers = new String[n];

        int max_len = 0;

        for (int i = 1; i <= n; i++) {
            inputNumbers[i-1] = sc.nextLine();

            if(max_len < inputNumbers[i-1].length())
                max_len = inputNumbers[i-1].length();
        }

        String[][] myNumbers = new String[n][max_len];
        int j = 0;

        for (int i = 1; i <= n; i++) {
            for (j = 0; j < max_len; j++) {
                myNumbers[i-1][j] = "0";
            }
        }

        int temp_len = 0;
        for (int i = 1; i <= n; i++) {
            temp_len = inputNumbers[i-1].length();
            j = max_len - temp_len;
            for (char ch:inputNumbers[i-1].toCharArray()) {
                myNumbers[i-1][j] = String.valueOf(ch);
                j++;
            }
        }

        String sumNumbers = "";
        int sum = 0;
        int borrow = 0;

        for(j = max_len - 1; j >= 0; j--) {
            for (int i = 1; i <= n; i++) {
                sum += Integer.parseInt(myNumbers[i-1][j]);
            }

            sum += borrow;
            borrow = 0;

            if(sum > 9) {
                borrow = sum / 10;
                sum = sum - (borrow * 10);
            }

            sumNumbers = String.valueOf(sum) + sumNumbers;
            sum = 0;
        }

        if(borrow!=0) {
            max_len++;
            System.out.print(String.valueOf(borrow));
        }

        System.out.println(sumNumbers);


    }

}

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

57

58

59

60

61

62

63

64

65

66

67

68

69

70

71

72

73

74

75

76

77

78

import java.util.Scanner;

class Main {

static Scanner sc;

static String strInput;

public static void main(String[]args) {

sc = new Scanner(System.in);

int n = Integer.parseInt(sc.nextLine());

if (n < 1 || n > 20)

return;

String[] inputNumbers = new String[n];

int max_len = 0;

for (int i = 1; i <= n; i++) {

inputNumbers[i-1] = sc.nextLine();

if(max_len < inputNumbers[i-1].length())

max_len = inputNumbers[i-1].length();

}

String[][] myNumbers = new String[n][max_len];

int j = 0;

for (int i = 1; i <= n; i++) {

for (j = 0; j < max_len; j++) {

myNumbers[i-1][j] = "0";

}

int temp_len = 0;

for (int i = 1; i <= n; i++) {

temp_len = inputNumbers[i-1].length();

j = max_len - temp_len;

for (char ch:inputNumbers[i-1].toCharArray()) {

myNumbers[i-1][j] = String.valueOf(ch);

j++;

}

String sumNumbers = "";

int sum = 0;

int borrow = 0;

for(j = max_len - 1; j >= 0; j--) {

for (int i = 1; i <= n; i++) {

sum += Integer.parseInt(myNumbers[i-1][j]);

}

sum += borrow;

borrow = 0;

if(sum > 9) {

borrow = sum / 10;

sum = sum - (borrow * 10);

}

sumNumbers = String.valueOf(sum) + sumNumbers;

sum = 0;

}

if(borrow!=0) {

max_len++;

System.out.print(String.valueOf(borrow));

}

System.out.println(sumNumbers);

}

import java.util.Scanner;

public class Main {

    public static Scanner sc;


    public static void main(String[] args) {
        sc = new Scanner(System.in);
        int a = sc.nextInt();
        int b = sc.nextInt();
        int count;
        String result = "";
        for(int i=a+1;i<b;i++)
        {
            count = 0;
            for (int j=1;j<=i;j++)
                if(i%j==0)
                    count++;

            if(count==2 && result.equals(""))
                result = String.valueOf(i);
            else if(count==2)
                result += "," + String.valueOf(i);
        }

        System.out.println(result);

    }

}

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

import java.util.Scanner;

public class Main {

public static Scanner sc;

public static void main(String[] args) {

sc = new Scanner(System.in);

int a = sc.nextInt();

int b = sc.nextInt();

int count;

String result = "";

for(int i=a+1;i<b;i++)

{

count = 0;

for (int j=1;j<=i;j++)

if(i%j==0)

count++;

if(count==2 && result.equals(""))

result = String.valueOf(i);

else if(count==2)

result += "," + String.valueOf(i);

}

System.out.println(result);

}

import java.util.Scanner;

class Main {

    static Scanner sc;

    public static void main(String[]args){
        sc = new Scanner(System.in);
        String string = sc.nextLine();

        int r = 0;
        int g = 0;
        int y = 0;

        for (char ch : string.toCharArray()) {
            if(String.valueOf(ch).equals("R") || String.valueOf(ch).equals("r"))
                r++;
            else if(String.valueOf(ch).equals("G") || String.valueOf(ch).equals("g"))
                g++;
            else if(String.valueOf(ch).equals("Y") || String.valueOf(ch).equals("y"))
                y++;
        }

        if( (y == string.length() || r == string.length()) || (r >= 3) || (r >= 2 && y >= 2) || (y==4 && r==1) ) {
            System.out.println("nakhor lite");
        } else {
            System.out.println("rahat baash");
        }
    }

}

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

import java.util.Scanner;

class Main {

static Scanner sc;

public static void main(String[]args){

sc = new Scanner(System.in);

String string = sc.nextLine();

int r = 0;

int g = 0;

int y = 0;

for (char ch : string.toCharArray()) {

if(String.valueOf(ch).equals("R") || String.valueOf(ch).equals("r"))

r++;

else if(String.valueOf(ch).equals("G") || String.valueOf(ch).equals("g"))

g++;

else if(String.valueOf(ch).equals("Y") || String.valueOf(ch).equals("y"))

y++;

}

if( (y == string.length() || r == string.length()) || (r >= 3) || (r >= 2 && y >= 2) || (y==4 && r==1) ) {

System.out.println("nakhor lite");

} else {

System.out.println("rahat baash");

}

#include "iostream"

using namespace std;

int main()
{

	char ch[6];
	int r = 0;
	int g = 0;
	int y = 0;

	cin >> ch;

	for(int i=0; i<=4;i++)
	{
		if((int) ch[i] == (int) 'R' || (int) ch[i] == (int) 'r')
			r++;
		else if((int) ch[i] == (int) 'G' || (int) ch[i] == (int) 'g')
			g++;
		else if((int) ch[i] == (int) 'Y' || (int) ch[i] == (int) 'y')
			y++;
	}

	if( (r == 5 || y == 5) || ( r >= 3 ) || ( r >=2 && y >= 2) || (r == 1 && y == 4) )
		cout << "nakhor lite" << endl;
	else
		cout << "rahat baash" << endl;

	return 0;
}

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

#include "iostream"

using namespace std;

int main()

{

char ch[6];

int r = 0;

int g = 0;

int y = 0;

cin >> ch;

for(int i=0; i<=4;i++)

{

if((int) ch[i] == (int) 'R' || (int) ch[i] == (int) 'r')

r++;

else if((int) ch[i] == (int) 'G' || (int) ch[i] == (int) 'g')

g++;

else if((int) ch[i] == (int) 'Y' || (int) ch[i] == (int) 'y')

y++;

}

if( (r == 5 || y == 5) || ( r >= 3 ) || ( r >=2 && y >= 2) || (r == 1 && y == 4) )

cout << "nakhor lite" << endl;

else

cout << "rahat baash" << endl;

return 0;

}

import java.util.Scanner;

public class Main {

    public static Scanner sc;


    public static void main(String[] args) {
        sc = new Scanner(System.in);
        int n = sc.nextInt();
        int temp_n = n;
        int b=0;
        int count;
        int counter = 1;

        while (n > 0) {
            b += n % 10;
            n = n / 10;
        }

        int i=temp_n;
        int j;
        while(true) {
            i++;
            count = 0;
            for (j=1;j <= i;j++)
                if(i%j==0)
                    count++;

            if(count==2 && counter==b) {
                System.out.println(i);
                break;
            }
            else if(count==2)
                counter++;
        }

    }

}

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

import java.util.Scanner;

public class Main {

public static Scanner sc;

public static void main(String[] args) {

sc = new Scanner(System.in);

int n = sc.nextInt();

int temp_n = n;

int b=0;

int count;

int counter = 1;

while (n > 0) {

b += n % 10;

n = n / 10;

}

int i=temp_n;

int j;

while(true) {

i++;

count = 0;

for (j=1;j <= i;j++)

if(i%j==0)

count++;

if(count==2 && counter==b) {

System.out.println(i);

break;

}

else if(count==2)

counter++;

}

import java.util.Scanner;

public class Main {

    public static Scanner sc;


    public static void main(String[] args) {
        sc = new Scanner(System.in);
        int a = sc.nextInt();
        int b = sc.nextInt();
        int c = sc.nextInt();

        if ( a + b + c != 180 )
            System.out.println("No");
        else if ( a == 0 || b == 0 || c == 0 )
            System.out.println("No");
        else if( (a + b > c) && (a + c > b) && (b + c > a) )
            System.out.println("Yes");
        else
            System.out.println("No");
    }

}

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

import java.util.Scanner;

public class Main {

public static Scanner sc;

public static void main(String[] args) {

sc = new Scanner(System.in);

int a = sc.nextInt();

int b = sc.nextInt();

int c = sc.nextInt();

if ( a + b + c != 180 )

System.out.println("No");

else if ( a == 0 || b == 0 || c == 0 )

System.out.println("No");

else if( (a + b > c) && (a + c > b) && (b + c > a) )

System.out.println("Yes");

else

System.out.println("No");

}

import java.util.Scanner;

public class Main {

    public static Scanner sc;


    public static void main(String[] args) {
        sc = new Scanner(System.in);
        int T = sc.nextInt();

        if(T < -273 || T >= 6000)
            return;

        if(T > 100)
            System.out.println("Steam");
        else if(T < 0)
            System.out.println("Ice");
        else
            System.out.println("Water");

    }

}

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

import java.util.Scanner;

public class Main {

public static Scanner sc;

public static void main(String[] args) {

sc = new Scanner(System.in);

int T = sc.nextInt();

if(T < -273 || T >= 6000)

return;

if(T > 100)

System.out.println("Steam");

else if(T < 0)

System.out.println("Ice");

else

System.out.println("Water");

}

import java.util.Scanner;

public class Main {

    public static Scanner sc;


    public static void main(String[] args) {
        sc = new Scanner(System.in);
        int n = sc.nextInt();

        if(n < 1 || n > 100)
            return;

        for(int i=1; i <=n; i++) {
            for (int j=1; j<=n; j++) {
                System.out.print(i*j);
                System.out.print(" ");
            }
            System.out.println("");
        }

    }

}

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

import java.util.Scanner;

public class Main {

public static Scanner sc;

public static void main(String[] args) {

sc = new Scanner(System.in);

int n = sc.nextInt();

if(n < 1 || n > 100)

return;

for(int i=1; i <=n; i++) {

for (int j=1; j<=n; j++) {

System.out.print(i*j);

System.out.print(" ");

}

System.out.println("");

}

import java.util.Scanner;
import java.lang.Math.*;

public class Main {

    public static Scanner sc;


    public static void main(String[] args) {
        sc = new Scanner(System.in);
        int n = sc.nextInt();
        int m = sc.nextInt();
        int sum = 0;
        int temp = 0;

        if(n < 0 ||m > 10)
            return;

        for (int i = -10; i <= m; i++) {
            for (int j = 1; j <= n; j++) {
                if(j == 0)
                    continue;

                temp = (int)java.lang.Math.pow(i + j, 3);
                sum += temp / (int)java.lang.Math.pow(j, 2);
            }
        }

        System.out.println(sum);


    }

}

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

import java.util.Scanner;

import java.lang.Math.*;

public class Main {

public static Scanner sc;

public static void main(String[] args) {

sc = new Scanner(System.in);

int n = sc.nextInt();

int m = sc.nextInt();

int sum = 0;

int temp = 0;

if(n < 0 ||m > 10)

return;

for (int i = -10; i <= m; i++) {

for (int j = 1; j <= n; j++) {

if(j == 0)

continue;

temp = (int)java.lang.Math.pow(i + j, 3);

sum += temp / (int)java.lang.Math.pow(j, 2);

}

System.out.println(sum);

}

import java.util.Scanner;

public class Main {

    public static Scanner sc;


    public static void main(String[] args) {
        sc = new Scanner(System.in);
        int a = sc.nextInt();
        int b = sc.nextInt();
        int counter = 0;

        if(a < 1 || b > 10000)
            return;

        for(int i=a; i<=b;i++) {
            for (int j=1; j<=i; j++)
            {
                if(i%j==0)
                    counter++;
            }
            if(counter==2)
                System.out.println(i);
            counter=0;
        }


    }

}

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

import java.util.Scanner;

public class Main {

public static Scanner sc;

public static void main(String[] args) {

sc = new Scanner(System.in);

int a = sc.nextInt();

int b = sc.nextInt();

int counter = 0;

if(a < 1 || b > 10000)

return;

for(int i=a; i<=b;i++) {

for (int j=1; j<=i; j++)

{

if(i%j==0)

counter++;

}

if(counter==2)

System.out.println(i);

counter=0;

}

import java.util.Scanner;

public class Main {

    public static Scanner sc;


    public static void main(String[] args) {
        sc = new Scanner(System.in);
        int n = sc.nextInt();
        int nn = 0;
        int max = 0;

        for (int i=1; i<=n; i++) {
             nn = sc.nextInt();
             if(max < nn)
                 max = nn;
        }

        System.out.println(max);


    }

}

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

import java.util.Scanner;

public class Main {

public static Scanner sc;

public static void main(String[] args) {

sc = new Scanner(System.in);

int n = sc.nextInt();

int nn = 0;

int max = 0;

for (int i=1; i<=n; i++) {

nn = sc.nextInt();

if(max < nn)

max = nn;

}

System.out.println(max);

}

import java.util.Scanner;

public class Main {

    public static Scanner sc;


    public static void main(String[] args) {
        sc = new Scanner(System.in);
        int n = sc.nextInt();

        for (int i=1; i <= n; i++)
            System.out.print("*");
        System.out.println("");

        if(n - 2 != 0) {
            for (int i = 1; i <= n-2; i++) {
                System.out.print("*");
                for (int j=1; j <= n-2; j++) {
                    System.out.print(" ");
                }
                System.out.println("*");
            }
        }

        for (int i=1; i <= n; i++)
            System.out.print("*");
        System.out.println("");

    }

}

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

import java.util.Scanner;

public class Main {

public static Scanner sc;

public static void main(String[] args) {

sc = new Scanner(System.in);

int n = sc.nextInt();

for (int i=1; i <= n; i++)

System.out.print("*");

System.out.println("");

if(n - 2 != 0) {

for (int i = 1; i <= n-2; i++) {

System.out.print("*");

for (int j=1; j <= n-2; j++) {

System.out.print(" ");

}

System.out.println("*");

}

for (int i=1; i <= n; i++)

System.out.print("*");

System.out.println("");

}

import java.util.Scanner;

public class Main {

    public static Scanner sc;


    public static void main(String[] args) {
        sc = new Scanner(System.in);
        String inp = sc.nextLine();
        String[] inp_arr = inp.split(" ");


        for (int i = 1; i <= Integer.parseInt(inp_arr[0]);i++)
            System.out.print("copy of ");

        System.out.print(inp_arr[1]);
    }

}

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

import java.util.Scanner;

public class Main {

public static Scanner sc;

public static void main(String[] args) {

sc = new Scanner(System.in);

String inp = sc.nextLine();

String[] inp_arr = inp.split(" ");

for (int i = 1; i <= Integer.parseInt(inp_arr[0]);i++)

System.out.print("copy of ");

System.out.print(inp_arr[1]);

}

import java.util.Scanner;

public class Main {

    public static Scanner sc;


    public static void main(String[] args) {
        sc = new Scanner(System.in);
        int number = sc.nextInt();
        int count = 0;

        for (int i = 1; i <= number / 2;i++) {
            if(count == number) {
                count += i;
            }
        }

        if(count == number) {
            System.out.println("YES");
        }
        else {
            System.out.println("No");
        }
    }

}

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

import java.util.Scanner;

public class Main {

public static Scanner sc;

public static void main(String[] args) {

sc = new Scanner(System.in);

int number = sc.nextInt();

int count = 0;

for (int i = 1; i <= number / 2;i++) {

if(count == number) {

count += i;

}

if(count == number) {

System.out.println("YES");

}

else {

System.out.println("No");

}

#include "iostream.h"

using namespace std;

int main()
{
	long long int a, b, c, n;
	cin>> n;
	
	c = 0;
	
	for(int i =1; i!=n; i++)
	{
		if(n % i == 0)
		{
			c += i;
		}
	}
	
	if(c == n)
	{
		cout <<"YES";
	}
	
	else
	{
		cout<<"NO";
	}
	
	
	return 0;
}

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

#include "iostream.h"

using namespace std;

int main()

{

long long int a, b, c, n;

cin>> n;

c = 0;

for(int i =1; i!=n; i++)

{

if(n % i == 0)

{

c += i;

}

if(c == n)

{

cout <<"YES";

}

else

{

cout<<"NO";

}

return 0;

}

import java.util.Scanner;

public class Main {

    public static Scanner sc;


    public static void main(String[] args) {
        sc = new Scanner(System.in);
        int num = sc.nextInt();

        int arr[] = new int[101];
        arr[0] = 1;
        arr[1] = 2;
        for (int i = 2; i <= 100; i++) {
            arr[i] = arr[i-1] + arr[i-2];
        }

        int j = 0;
        for (int i = 1; i <= num; i++) {
            if(i == arr[j])
            {
                System.out.print("+");
                j++;
            }
            else
                System.out.print("-");
        }

    }

}

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

import java.util.Scanner;

public class Main {

public static Scanner sc;

public static void main(String[] args) {

sc = new Scanner(System.in);

int num = sc.nextInt();

int arr[] = new int[101];

arr[0] = 1;

arr[1] = 2;

for (int i = 2; i <= 100; i++) {

arr[i] = arr[i-1] + arr[i-2];

}

int j = 0;

for (int i = 1; i <= num; i++) {

if(i == arr[j])

{

System.out.print("+");

j++;

}

else

System.out.print("-");

}

import java.util.Scanner;

public class Main {
    static Scanner sc = new Scanner(System.in);
    public static void main(String[] args) {
        int num = sc.nextInt();
        System.out.print("W");
        for (int i=1; i<=num; i++)
            System.out.print("o");
        System.out.print("w!");
    }
}

1

2

3

4

5

6

7

8

9

10

11

12

import java.util.Scanner;

public class Main {

static Scanner sc = new Scanner(System.in);

public static void main(String[] args) {

int num = sc.nextInt();

System.out.print("W");

for (int i=1; i<=num; i++)

System.out.print("o");

System.out.print("w!");

}

import java.util.Scanner;

public class Main {
    static Scanner sc = new Scanner(System.in);
    public static void main(String[] args) {
        int num = sc.nextInt();
        if(num>100)
            num = 100;
        else if(num<0)
            num = 0;
        for (int i=1; i<=num; i++)
            System.out.println("man khoshghlab hastam");
    }
}

1

2

3

4

5

6

7

8

9

10

11

12

13

14

import java.util.Scanner;

public class Main {

static Scanner sc = new Scanner(System.in);

public static void main(String[] args) {

int num = sc.nextInt();

if(num>100)

num = 100;

else if(num<0)

num = 0;

for (int i=1; i<=num; i++)

System.out.println("man khoshghlab hastam");

}

import java.util.Scanner;

public class Main {
    static Scanner sc = new Scanner(System.in);
    public static void main(String[] args) {
        int num = sc.nextInt();
        String currentName;
        int tempCount=0;
        int counter=0;
        int maxCounter=0;
        int tempLength=0;
        char[] ch = {'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y' ,'z'};
        for (int i=0; i<=num; i++)
        {
            currentName = sc.nextLine();
            tempLength = currentName.length();
            for(int j=0; j<=25;j++)
            {
                tempCount = currentName.replace(String.valueOf(ch[j]), "").length();
                if(tempCount==tempLength)
                    continue;
                counter++;
                tempCount=0;
            }
            if(counter>maxCounter)
                maxCounter = counter;
            counter=0;
        }
        System.out.println(maxCounter);
    }
}

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

import java.util.Scanner;

public class Main {

static Scanner sc = new Scanner(System.in);

public static void main(String[] args) {

int num = sc.nextInt();

String currentName;

int tempCount=0;

int counter=0;

int maxCounter=0;

int tempLength=0;

char[] ch = {'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y' ,'z'};

for (int i=0; i<=num; i++)

{

currentName = sc.nextLine();

tempLength = currentName.length();

for(int j=0; j<=25;j++)

{

tempCount = currentName.replace(String.valueOf(ch[j]), "").length();

if(tempCount==tempLength)

continue;

counter++;

tempCount=0;

}

if(counter>maxCounter)

maxCounter = counter;

counter=0;

}

System.out.println(maxCounter);

}

<?php
//$_POST['date'] = "2011-10-12";

if(isset($_POST['date']) && !empty($_POST['date']))
{
  $date = explode("-", $_POST['date']);
  if ($date[0]==date("Y") && $date[1]==date("m") && $date[2]==date("d"))
    echo 0;
  elseif($date[0]<date("Y"))
    echo "gone";
  elseif ($date[0]==date("Y") && $date[1]<date("m"))
    echo "gone";
  elseif($date[0]==date("Y") && $date[1]==date("m") && $date[2]<date("d"))
    echo "gone";
  else {
      $mytime = new DateTime($_POST['date']);
      $now = new DateTime(date("Y") . "-" . date("m") . "-" . date("d"));
      $difference = $mytime->diff($now);
      echo $difference->days;
    }
}

?>

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

<?php

//$_POST['date'] = "2011-10-12";

if(isset($_POST['date']) && !empty($_POST['date']))

{

$date = explode("-", $_POST['date']);

if ($date[0]==date("Y") && $date[1]==date("m") && $date[2]==date("d"))

echo 0;

elseif($date[0]<date("Y"))

echo "gone";

elseif ($date[0]==date("Y") && $date[1]<date("m"))

echo "gone";

elseif($date[0]==date("Y") && $date[1]==date("m") && $date[2]<date("d"))

echo "gone";

else {

$mytime = new DateTime($_POST['date']);

$now = new DateTime(date("Y") . "-" . date("m") . "-" . date("d"));

$difference = $mytime->diff($now);

echo $difference->days;

}

?>

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        // First String To run in programm
        String firstString = "1";
        String lastString = "1";

        // Give Input
        String input = sc.nextLine();
        String[] tempInput = input.split(" ");
        int L = Integer.parseInt(tempInput[0]);
        int R = Integer.parseInt(tempInput[1]);

        String temp;

        for (int i = 0; firstString.length() <= R + 1; i++) {

            if(i == 0) {
                firstString = "10";
                lastString = "01";
            }

            temp = lastString + firstString;
            firstString += lastString;
            lastString = temp;

        }

        System.out.println(firstString.substring(L - 1,R));

    }

}

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

import java.util.Scanner;

public class Main {

public static void main(String[] args) {

Scanner sc = new Scanner(System.in);

// First String To run in programm

String firstString = "1";

String lastString = "1";

// Give Input

String input = sc.nextLine();

String[] tempInput = input.split(" ");

int L = Integer.parseInt(tempInput[0]);

int R = Integer.parseInt(tempInput[1]);

String temp;

for (int i = 0; firstString.length() <= R + 1; i++) {

if(i == 0) {

firstString = "10";

lastString = "01";

}

temp = lastString + firstString;

firstString += lastString;

lastString = temp;

}

System.out.println(firstString.substring(L - 1,R));

}

import java.util.Scanner;

public class Main {
    static Scanner scanner;
    public static void main(String[] args) {
        scanner = new Scanner(System.in);
        int n = Integer.parseInt(scanner.nextLine());
        int tavan = 2;

        for(int i = 0 ; i <= n ; i++) {
            tavan *= 2;
            if(tavan >= n) {
                System.out.println(tavan);
                break;
            }
        }
    }
}

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

import java.util.Scanner;

public class Main {

static Scanner scanner;

public static void main(String[] args) {

scanner = new Scanner(System.in);

int n = Integer.parseInt(scanner.nextLine());

int tavan = 2;

for(int i = 0 ; i <= n ; i++) {

tavan *= 2;

if(tavan >= n) {

System.out.println(tavan);

break;

}

import java.util.Stack;
import java.util.Scanner;

public class Main
{

    static int getMaxArea(int hist[], int n)  
    { 

        Stack<Integer> s = new Stack<>(); 
        
        int max_area = 0; 
        int tp; 
        int area_with_top; 
        int i = 0; 
        while (i < n) 
        { 
            if (s.empty() || hist[s.peek()] <= hist[i]) 
                s.push(i++); 
            
            else
            { 
                tp = s.peek();  
                s.pop();  
                
                area_with_top = hist[tp] * (s.empty() ? i : i - s.peek() - 1); 
                
                if (max_area < area_with_top) 
                    max_area = area_with_top; 
            } 
        } 

        while (s.empty() == false) 
        { 
            tp = s.peek(); 
            s.pop(); 
            area_with_top = hist[tp] * (s.empty() ? i : i - s.peek() - 1); 
            
            if (max_area < area_with_top) 
                max_area = area_with_top; 
        } 
        
        return max_area; 
        
    } 
    
    public static void main(String[] args)  
    { 
        Scanner input = new Scanner(System.in);
        int n = input.nextInt();
        int[] arr = new int[n];
        
        for(int i = 0; i < n; i++){
            arr[i] = input.nextInt();
        }
        
        System.out.println(getMaxArea(arr, arr.length)); 
    } 
}

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

57

58

59

import java.util.Stack;

import java.util.Scanner;

public class Main

{

static int getMaxArea(int hist[], int n)

{

Stack<Integer> s = new Stack<>();

int max_area = 0;

int tp;

int area_with_top;

int i = 0;

while (i < n)

{

if (s.empty() || hist[s.peek()] <= hist[i])

s.push(i++);

else

{

tp = s.peek();

s.pop();

area_with_top = hist[tp] * (s.empty() ? i : i - s.peek() - 1);

if (max_area < area_with_top)

max_area = area_with_top;

}

while (s.empty() == false)

{

tp = s.peek();

s.pop();

area_with_top = hist[tp] * (s.empty() ? i : i - s.peek() - 1);

if (max_area < area_with_top)

max_area = area_with_top;

}

return max_area;

}

public static void main(String[] args)

{

Scanner input = new Scanner(System.in);

int n = input.nextInt();

int[] arr = new int[n];

for(int i = 0; i < n; i++){

arr[i] = input.nextInt();

}

System.out.println(getMaxArea(arr, arr.length));

}

#include <iostream>

using namespace std;

#define MAX 1000 
  
int multiply(int x, int res[], int res_size); 
  
void factorial(int n, int birth) 
{ 
    int res[MAX]; 
    int counter = 0;
  
    res[0] = 1; 
    int res_size = 1; 
  
    for (int x=2; x<=n; x++) 
        res_size = multiply(x, res, res_size); 
  
    for (int i=res_size-1; i>=0; i--) 
        if (res[i] == birth){counter++;}
        cout << counter;
} 
  
int multiply(int x, int res[], int res_size) 
{ 
    int carry = 0; 
  
    for (int i=0; i<res_size; i++) 
    { 
        int prod = res[i] * x + carry; 
  
        res[i] = prod % 10;   
  
        carry  = prod/10;     
    } 
  
    while (carry) 
    { 
        res[res_size] = carry%10; 
        carry = carry/10; 
        res_size++; 
    } 
    return res_size; 
} 

int main()
{
    int n, birth;
    
    cin >> n >> birth;
    
    factorial(n, birth);

    return 0;
}

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

#include <iostream>

using namespace std;

#define MAX 1000

int multiply(int x, int res[], int res_size);

void factorial(int n, int birth)

{

int res[MAX];

int counter = 0;

res[0] = 1;

int res_size = 1;

for (int x=2; x<=n; x++)

res_size = multiply(x, res, res_size);

for (int i=res_size-1; i>=0; i--)

if (res[i] == birth){counter++;}

cout << counter;

}

int multiply(int x, int res[], int res_size)

{

int carry = 0;

for (int i=0; i<res_size; i++)

{

int prod = res[i] * x + carry;

res[i] = prod % 10;

carry = prod/10;

}

while (carry)

{

res[res_size] = carry%10;

carry = carry/10;

res_size++;

}

return res_size;

}

int main()

{

int n, birth;

cin >> n >> birth;

factorial(n, birth);

return 0;

}

#include <iostream>

using namespace std;

int main()
{
    string a,b;
    string command;
    
    cin >> a;
    cin >> command;
    cin >> b;
    
    if (a.length() < b.length()){
        string temp = b;
        b = a;
        a = temp;
    }
    
    if (command == "+"){
        
        a[a.length() - b.length()] = a[a.length() - b.length()] + 1;
        
    }else if (command == "*"){
        for (int i = 1; i < b.length(); i++) {
            a = a + '0';
        }
    }
    
    cout << a;

    return 0;
}

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

#include <iostream>

using namespace std;

int main()

{

string a,b;

string command;

cin >> a;

cin >> command;

cin >> b;

if (a.length() < b.length()){

string temp = b;

b = a;

a = temp;

}

if (command == "+"){

a[a.length() - b.length()] = a[a.length() - b.length()] + 1;

}else if (command == "*"){

for (int i = 1; i < b.length(); i++) {

a = a + '0';

}

cout << a;

return 0;

}

#include <iostream>

using namespace std;

int main()
{
    int arr[6];
    
    for (int i = 0; i < 6; i++) {
         cin >> arr[i];
    }
    
    arr[0] = 1 - arr[0];
    arr[1] = 1 - arr[1];
    arr[2] = 2 - arr[2];
    arr[3] = 2 - arr[3];
    arr[4] = 2 - arr[4];
    arr[5] = 8 - arr[5];
    
    for (int i = 0; i < 6; i++) {
        cout << arr[i] << " ";
    }

    return 0;
}

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

#include <iostream>

using namespace std;

int main()

{

int arr[6];

for (int i = 0; i < 6; i++) {

cin >> arr[i];

}

arr[0] = 1 - arr[0];

arr[1] = 1 - arr[1];

arr[2] = 2 - arr[2];

arr[3] = 2 - arr[3];

arr[4] = 2 - arr[4];

arr[5] = 8 - arr[5];

for (int i = 0; i < 6; i++) {

cout << arr[i] << " ";

}

return 0;

}

#include <iostream>

using namespace std;

int main()
{
    int n;
    cin >> n;
    
    int result = 0;
    
    string s1;
    string s2;
    
    cin >> s1;
    cin >> s2;
    
    for (int i = 0; i < n; i++) {
        if (s1.at(i) != s2.at(i)){
            result++;
        }
    }
    
    cout << result;
    return 0;
}

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

#include <iostream>

using namespace std;

int main()

{

int n;

cin >> n;

int result = 0;

string s1;

string s2;

cin >> s1;

cin >> s2;

for (int i = 0; i < n; i++) {

if (s1.at(i) != s2.at(i)){

result++;

}

cout << result;

return 0;

}

#include <iostream>

using namespace std;

int main()
{
    int a1, a2;
    int a3, a4;
    
    cin >> a1 >> a2;
    cin >> a3 >> a4;
    
    if (a1 >= a3 && a2 >= a4){
        cout << "yes";
    }else {
        cout << "no";
    }

    return 0;
}

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

#include <iostream>

using namespace std;

int main()

{

int a1, a2;

int a3, a4;

cin >> a1 >> a2;

cin >> a3 >> a4;

if (a1 >= a3 && a2 >= a4){

cout << "yes";

}else {

cout << "no";

}

return 0;

}

#include <iostream>

using namespace std;

int main()
{
    int x1,y1,x2,y2;
    cin >> x1 >> y1 >> x2 >> y2;
    
    if (x1 == x2){
        cout << "Vertical";
    }else if (y1 == y2){
        cout << "Horizontal";
    }else {
        cout << "Try again";
    }

    return 0;
}

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

#include <iostream>

using namespace std;

int main()

{

int x1,y1,x2,y2;

cin >> x1 >> y1 >> x2 >> y2;

if (x1 == x2){

cout << "Vertical";

}else if (y1 == y2){

cout << "Horizontal";

}else {

cout << "Try again";

}

return 0;

}

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        int n = input.nextInt();
        int m = input.nextInt();

        String[] a = new String[m];

        int count = 0;

        for (int i = 0; i < n; i++) {
            a = input.next().split("");

            for (int j = 0; j < m; j++) {
                if(a[j].equals("*")){
                    count++;
                }
            }
        }

        System.out.println(count);
    }
}

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

import java.util.Scanner;

public class Main {

public static void main(String[] args) {

Scanner input = new Scanner(System.in);

int n = input.nextInt();

int m = input.nextInt();

String[] a = new String[m];

int count = 0;

for (int i = 0; i < n; i++) {

a = input.next().split("");

for (int j = 0; j < m; j++) {

if(a[j].equals("*")){

count++;

}

System.out.println(count);

}

#include <iostream>

using namespace std;

int main()
{
    string keyvoon = "331122";
    string nezam = "123";
    string shir = "2123";
    
    int k_sum = 0;
    int n_sum = 0;
    int s_sum = 0;
    
    int n;
    string s;
    
    cin >> n;
    cin >> s;
    
    
    for (int i = 0; i < n; i++) {
        if (keyvoon[i % keyvoon.length()] == s[i]){
            k_sum++;
        }
         if (nezam[i % nezam.length()] == s[i]){
            n_sum++;
        }
         if (shir[i % shir.length()] == s[i]){
            s_sum++;
        }
    }
    
    int max;

    if(k_sum >= n_sum && k_sum >= s_sum)
        max = k_sum;

    if(n_sum >= k_sum && n_sum >= s_sum)
        max = n_sum;
    
    if(s_sum >= k_sum && s_sum >= n_sum)
        max = s_sum;
  
    
    cout << max << endl;
    
    if (max == k_sum){
        cout << "keyvoon" << endl;
    }
    if (max == n_sum){
        cout << "nezam" << endl;
    }
    if (max == s_sum){
        cout << "shir farhad" << endl;
    }
    
    
    return 0;
}

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

57

58

59

60

#include <iostream>

using namespace std;

int main()

{

string keyvoon = "331122";

string nezam = "123";

string shir = "2123";

int k_sum = 0;

int n_sum = 0;

int s_sum = 0;

int n;

string s;

cin >> n;

cin >> s;

for (int i = 0; i < n; i++) {

if (keyvoon[i % keyvoon.length()] == s[i]){

k_sum++;

}

if (nezam[i % nezam.length()] == s[i]){

n_sum++;

}

if (shir[i % shir.length()] == s[i]){

s_sum++;

}

int max;

if(k_sum >= n_sum && k_sum >= s_sum)

max = k_sum;

if(n_sum >= k_sum && n_sum >= s_sum)

max = n_sum;

if(s_sum >= k_sum && s_sum >= n_sum)

max = s_sum;

cout << max << endl;

if (max == k_sum){

cout << "keyvoon" << endl;

}

if (max == n_sum){

cout << "nezam" << endl;

}

if (max == s_sum){

cout << "shir farhad" << endl;

}

return 0;

}

import java.util.Scanner;
 
public class Main {
 
    public static Scanner sc;
 
 
    public static void main(String[] args) {
        sc = new Scanner(System.in);
        int a = sc.nextInt();
        int b = sc.nextInt();
        int c = sc.nextInt();
 
        if (a + b + c == 180 && a != 0 && b != 0 && c != 0){
            System.out.println("Yes");
        }else {
            System.out.println("No");
        }
    }
 
}

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

import java.util.Scanner;

public class Main {

public static Scanner sc;

public static void main(String[] args) {

sc = new Scanner(System.in);

int a = sc.nextInt();

int b = sc.nextInt();

int c = sc.nextInt();

if (a + b + c == 180 && a != 0 && b != 0 && c != 0){

System.out.println("Yes");

}else {

System.out.println("No");

}

#include <iostream>

using namespace std;

int main()
{
    string a[5];
    int count = 0;
    
    for (int i = 0; i < 5; i++) {
        cin >> a[i];
    }
    
    for (int i = 0; i < 5; i++) {
        if (a[i].find("MOLANA") != std::string::npos || a[i].find("HAFEZ") != std::string::npos) {
            cout << i + 1 << " ";
            count = count + 1;
        }
    }
    
    if (count == 0){
        cout << "NOT FOUND!";
    }
    return 0;
}

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

#include <iostream>

using namespace std;

int main()

{

string a[5];

int count = 0;

for (int i = 0; i < 5; i++) {

cin >> a[i];

}

for (int i = 0; i < 5; i++) {

if (a[i].find("MOLANA") != std::string::npos || a[i].find("HAFEZ") != std::string::npos) {

cout << i + 1 << " ";

count = count + 1;

}

if (count == 0){

cout << "NOT FOUND!";

}

return 0;

}

target = [int(i) for i in input().split(" ")]
persons = [0 for i in range(4)]
counter = 0
while True:
    if 0 in target:
        break
    else:
        target[0] -= 1
        target.insert(0, target[-1])
        target.pop()
        target.insert(0, target[-1])
        target.pop()
        if counter == 4:
            counter = 0
        persons[counter] += 1
        counter += 1
persons = [str(i) for i in persons]
print(" ".join(persons))

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

target = [int(i) for i in input().split(" ")]

persons = [0 for i in range(4)]

counter = 0

while True:

if 0 in target:

break

else:

target[0] -= 1

target.insert(0, target[-1])

target.pop()

target.insert(0, target[-1])

target.pop()

if counter == 4:

counter = 0

persons[counter] += 1

counter += 1

persons = [str(i) for i in persons]

print(" ".join(persons))

#include <iostream>

using namespace std;

int main()
{
    double n;
    int k;

    cin >> n >> k;

    for (size_t i = 0; i < k; i++)
    {
        n = n / 2;
    }

    if (n < 0 && n != (int) n){
        n -= 1;
    }

    cout << (int)n;
    
    return 0;
}

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

#include <iostream>

using namespace std;

int main()

{

double n;

int k;

cin >> n >> k;

for (size_t i = 0; i < k; i++)

{

n = n / 2;

}

if (n < 0 && n != (int) n){

n -= 1;

}

cout << (int)n;

return 0;

}

#include <iostream>

using namespace std;

int main()
{
    int n;
    int m;
    
    cin >> n;
    cin >> m;
    
    
    int a[n][m];
    
    int sum = 0;
    

    
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
             cin >> a[i][j];
        }
    }
    
    for (int i = 1; i < n - 1; i++) {
        for (int j = 1; j < m - 1; j++) {
             if ((a[i][j] < a[i - 1][j] && a[i][j] < a[i + 1][j] && a[i][j] > a[i][j - 1] && a[i][j] > a[i][j + 1]) || 
                 (a[i][j] > a[i - 1][j] && a[i][j] > a[i + 1][j] && a[i][j] < a[i][j - 1] && a[i][j] < a[i][j + 1])){
                 sum = sum + 1;
             }
        }
    }
    
    cout << sum;

    return 0;
}

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

#include <iostream>

using namespace std;

int main()

{

int n;

int m;

cin >> n;

cin >> m;

int a[n][m];

int sum = 0;

for (int i = 0; i < n; i++) {

for (int j = 0; j < m; j++) {

cin >> a[i][j];

}

for (int i = 1; i < n - 1; i++) {

for (int j = 1; j < m - 1; j++) {

if ((a[i][j] < a[i - 1][j] && a[i][j] < a[i + 1][j] && a[i][j] > a[i][j - 1] && a[i][j] > a[i][j + 1]) ||

(a[i][j] > a[i - 1][j] && a[i][j] > a[i + 1][j] && a[i][j] < a[i][j - 1] && a[i][j] < a[i][j + 1])){

sum = sum + 1;

}

cout << sum;

return 0;

}

#include <iostream>

using namespace std;

int main()
{
    int n;
    int k;
    
    cin >> n;
    cin >> k;
    
    int sum = 0;
    int i = 1;
    
    if (n == 1 || n == k){
        cout << 1;
    }else {
            i = i + k;
            sum = sum + 1;
            while (i != 1){
                i = i + k;
                if (i == 1){
                    break;
                }
                
                if ( i > n){
                    i = i - n;
                    }
    
                
                sum++;
            }
            
            cout << sum;
    }
    


    return 0;
}

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

#include <iostream>

using namespace std;

int main()

{

int n;

int k;

cin >> n;

cin >> k;

int sum = 0;

int i = 1;

if (n == 1 || n == k){

cout << 1;

}else {

i = i + k;

sum = sum + 1;

while (i != 1){

i = i + k;

if (i == 1){

break;

}

if ( i > n){

i = i - n;

}

sum++;

}

cout << sum;

}

return 0;

}

#include <bits/stdc++.h>
using namespace std;


int main()
{
    int n, k;
    cin >> n >> k;
    vector<int> pa;
    for(int i=1; i<= 2*n; i++)
        pa.push_back((i+1)/2);
    
    int curr = 0, cu;
    while((int)pa.size() > 1)
    {
        cout << pa[curr] << " ";
        for(int i=1; i<k; i++)
        {
            cu = (curr+i)%(int)pa.size();
            cout << pa[cu] << " ";
        }
        curr = cu;
        cout << endl;
        pa.erase(pa.begin() + curr);
        if(curr == pa.size()) curr = 0, cu = 0;
        if((int)pa.size() == 2 && pa[0] == pa[1])
            break;
    }
    
    cout << "winner:" << pa[0] << endl;
    return 0;
}

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

#include <bits/stdc++.h>

using namespace std;

int main()

{

int n, k;

cin >> n >> k;

vector<int> pa;

for(int i=1; i<= 2*n; i++)

pa.push_back((i+1)/2);

int curr = 0, cu;

while((int)pa.size() > 1)

{

cout << pa[curr] << " ";

for(int i=1; i<k; i++)

{

cu = (curr+i)%(int)pa.size();

cout << pa[cu] << " ";

}

curr = cu;

cout << endl;

pa.erase(pa.begin() + curr);

if(curr == pa.size()) curr = 0, cu = 0;

if((int)pa.size() == 2 && pa[0] == pa[1])

break;

}

cout << "winner:" << pa[0] << endl;

return 0;

}

#include <bits/stdc++.h> 
using namespace std;
#define ll long long
ll max(int a,ll b){ return max((ll)a,b);}
ll min(int a,ll b){ return min((ll)a,b);} 
ll min(ll a,int b){ return min(a,(ll)b);}
ll max(ll a,int b){ return max(a,(ll)b);}

int main()
{
    //int t; cin >> t; while(t--) solve();
    int n, m, q, t, a;
    cin >> n >> m;
    int chi[n];
    for(int i=0; i<n; i++) cin >> chi[i];
    
    cin >> q;
    vector<int> com[q];
    int ted[q];
    for(int i=0; i<q; i++)
    {
        cin >> t;
        com[i].resize(t);
        for(int j=0; j<t; j++)
            cin >> com[i][j];
        cin >> ted[i];
        for(int j=0; j<t; j++)
        {
            chi[com[i][j]-1] -= ted[i];
        }
    }

    long long cnt, maxi = -1;
    for(int i=0; i<(1<<n); i++)
    {
        if(__builtin_popcount(i) > m)
            continue;
        cnt = 0;
        for(int j=0; j<q; j++)
        {
            for(int k : com[j])
            {
                if( (1<<(k-1)) & i)
                {
                    cnt += ted[j];
                    break;
                }
            }
        }

        for(int j=0; j<n; j++)
        {
            if((1<<j) & i)
                cnt += chi[j];
        }
        maxi = max(cnt, maxi);
    }
    
    cout << maxi << endl;
    return 0;
}

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

57

58

59

60

61

#include <bits/stdc++.h>

using namespace std;

#define ll long long

ll max(int a,ll b){ return max((ll)a,b);}

ll min(int a,ll b){ return min((ll)a,b);}

ll min(ll a,int b){ return min(a,(ll)b);}

ll max(ll a,int b){ return max(a,(ll)b);}

int main()

{

//int t; cin >> t; while(t--) solve();

int n, m, q, t, a;

cin >> n >> m;

int chi[n];

for(int i=0; i<n; i++) cin >> chi[i];

cin >> q;

vector<int> com[q];

int ted[q];

for(int i=0; i<q; i++)

{

cin >> t;

com[i].resize(t);

for(int j=0; j<t; j++)

cin >> com[i][j];

cin >> ted[i];

for(int j=0; j<t; j++)

{

chi[com[i][j]-1] -= ted[i];

}

long long cnt, maxi = -1;

for(int i=0; i<(1<<n); i++)

{

if(__builtin_popcount(i) > m)

continue;

cnt = 0;

for(int j=0; j<q; j++)

{

for(int k : com[j])

{

if( (1<<(k-1)) & i)

{

cnt += ted[j];

break;

}

for(int j=0; j<n; j++)

{

if((1<<j) & i)

cnt += chi[j];

}

maxi = max(cnt, maxi);

}

cout << maxi << endl;

return 0;

}

#include <bits/stdc++.h>
using namespace std;

int main()
{
    long long n, k;
    cin >> n >> k;
    pair<int, int> a[n];
    for(int i=0; i<n; i++) cin >> a[i].first >> a[i].second;
    sort(a, a+n);
    
    for(int i=0; i<n; i++)
    {
        if(k >= a[i].first && a[i].first < a[i].second)
        {
            k -= a[i].first;
            k += a[i].second;
        }
    }
    
    cout << k << endl;
    
    return 0;
}

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

#include <bits/stdc++.h>

using namespace std;

int main()

{

long long n, k;

cin >> n >> k;

pair<int, int> a[n];

for(int i=0; i<n; i++) cin >> a[i].first >> a[i].second;

sort(a, a+n);

for(int i=0; i<n; i++)

{

if(k >= a[i].first && a[i].first < a[i].second)

{

k -= a[i].first;

k += a[i].second;

}

cout << k << endl;

return 0;

}

import math

barcode = []

for i in range(9):
    barcode.append(input())

able = True
halat = 1

for i in range(9):
    for j in range(9):
        if abs(i-4) >= 2 and abs(j-4) >= 2:
            if abs(i-4) == 3 and abs(j-4) == 3:
                if barcode[i][j] == '1':
                    able = False
            else:
                if barcode[i][j] == '0':
                    able = False
        elif barcode[i][j] == '2':
                halat *= 2

if able is False:
    print(0)
else:
    print(halat)

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

import math

barcode = []

for i in range(9):

barcode.append(input())

able = True

halat = 1

for i in range(9):

for j in range(9):

if abs(i-4) >= 2 and abs(j-4) >= 2:

if abs(i-4) == 3 and abs(j-4) == 3:

if barcode[i][j] == '1':

able = False

else:

if barcode[i][j] == '0':

able = False

elif barcode[i][j] == '2':

halat *= 2

if able is False:

print(0)

else:

print(halat)

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int m = scanner.nextInt();
        int A[] = new int[11];
        for (int i = 1; i <= n; i++) {
            A[i] = scanner.nextInt();
        }
        int memo[][] = new int[10001][11];
        int INF = 1000000000;
        for (int i = 1; i <= m; i++) {
            memo[i][0] = INF;
        }
        for (int j = 1; j <= n; j++) {
            for (int i = 0; i <= m; i++) {
                memo[i][j] = INF;
                for (int k = 1; k*k <= i; k++) {
                    if (memo[i][j] > memo[i - k * k][j - 1] + (A[j] - k) * (A[j] - k)) {
                        memo[i][j] = memo[i - k * k][j - 1] + (A[j] - k) * (A[j] - k);
                    }
                }
            }
        }
        if (memo[m][n]==INF){
            System.out.println(-1);
        }else{
            System.out.println(memo[m][n]);
        }
    }
}

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

import java.util.Scanner;

public class Main {

public static void main(String[] args) {

Scanner scanner = new Scanner(System.in);

int n = scanner.nextInt();

int m = scanner.nextInt();

int A[] = new int[11];

for (int i = 1; i <= n; i++) {

A[i] = scanner.nextInt();

}

int memo[][] = new int[10001][11];

int INF = 1000000000;

for (int i = 1; i <= m; i++) {

memo[i][0] = INF;

}

for (int j = 1; j <= n; j++) {

for (int i = 0; i <= m; i++) {

memo[i][j] = INF;

for (int k = 1; k*k <= i; k++) {

if (memo[i][j] > memo[i - k * k][j - 1] + (A[j] - k) * (A[j] - k)) {

memo[i][j] = memo[i - k * k][j - 1] + (A[j] - k) * (A[j] - k);

}

if (memo[m][n]==INF){

System.out.println(-1);

}else{

System.out.println(memo[m][n]);

}

#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll n, k;
ll a[1000001];
ll ans = 0;
int mid_max(int l, int r)
{
    int maxi=-1, max_id;
    int mid = (l+r)/2;
    for(int i=l; i<=r; i++)
    {
        if(a[i] > maxi)
            maxi = a[i], max_id=i;
        else if(a[i] == maxi && abs(mid-i) < abs(mid-max_id))
            max_id = i;
    }
    return max_id;
}

void solve(int l, int r, int e)
{
    if(l > r) return;
    if(l == r)
    {
        ans += k-(a[l]+e);
        return;
    }
    int midmax = mid_max(l, r);
    
    ans += k - (a[midmax]+e);
    e += k - (a[midmax]+e);
    solve(l, midmax-1, e);
    solve(midmax+1, r, e);
}

int main()
{
    cin >> n;
    for(int i=0; i<n; i++) cin >> a[i];
    ll* max_id = max_element(a, a+n);
    k = *max_id;
    solve(0, n-1, 0);
    cout << ans << endl;
    return 0;
}

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

#include <bits/stdc++.h>

#define ll long long

using namespace std;

ll n, k;

ll a[1000001];

ll ans = 0;

int mid_max(int l, int r)

{

int maxi=-1, max_id;

int mid = (l+r)/2;

for(int i=l; i<=r; i++)

{

if(a[i] > maxi)

maxi = a[i], max_id=i;

else if(a[i] == maxi && abs(mid-i) < abs(mid-max_id))

max_id = i;

}

return max_id;

}

void solve(int l, int r, int e)

{

if(l > r) return;

if(l == r)

{

ans += k-(a[l]+e);

return;

}

int midmax = mid_max(l, r);

ans += k - (a[midmax]+e);

e += k - (a[midmax]+e);

solve(l, midmax-1, e);

solve(midmax+1, r, e);

}

int main()

{

cin >> n;

for(int i=0; i<n; i++) cin >> a[i];

ll* max_id = max_element(a, a+n);

k = *max_id;

solve(0, n-1, 0);

cout << ans << endl;

return 0;

}

#include <iostream>
#include <algorithm>
using namespace std;

int main()
{
    int n, x;
    cin >> n >> x;
    int ajnas[n];
    for(int i=0; i<n; i++)
    {
        cin >> ajnas[i];
    }
    
    sort(ajnas, ajnas + n);
    
    int tedad = -1;
    if(n == 1)
    {
        tedad = 1;
    }
    else
    {
        for(int i=1; i<n; i++)
        {
            if(ajnas[i]+ ajnas[i-1] > x)
            {
                tedad = i;
                break;
            }
        }
    }
    
    
    if(tedad == -1)
    {
        tedad = n;
    }
    
    cout << tedad;
    return 0;
}

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

#include <iostream>

#include <algorithm>

using namespace std;

int main()

{

int n, x;

cin >> n >> x;

int ajnas[n];

for(int i=0; i<n; i++)

{

cin >> ajnas[i];

}

sort(ajnas, ajnas + n);

int tedad = -1;

if(n == 1)

{

tedad = 1;

}

else

{

for(int i=1; i<n; i++)

{

if(ajnas[i]+ ajnas[i-1] > x)

{

tedad = i;

break;

}

if(tedad == -1)

{

tedad = n;

}

cout << tedad;

return 0;

}

#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int mod = 1e9+7;
int main()
{
    string s, t;
    cin >> s >> t;
    int mini, maxi;
    ll len = 0, cnt = 1;
    for(char a='a'; a<='z'; a++)
    {
        mini = min(count(s.begin(), s.end(), a), count(t.begin(), t.end(), a));
        maxi = max(count(s.begin(), s.end(), a), count(t.begin(), t.end(), a));
        if(mini == 0) continue;
        len += mini;
        for(int i=maxi; i>maxi-mini; i--)
            cnt = (cnt*i) % mod;
    }
    
    cout << len << " " << cnt << endl;
    return 0;
}

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

#include <bits/stdc++.h>

using namespace std;

#define ll long long

const int mod = 1e9+7;

int main()

{

string s, t;

cin >> s >> t;

int mini, maxi;

ll len = 0, cnt = 1;

for(char a='a'; a<='z'; a++)

{

mini = min(count(s.begin(), s.end(), a), count(t.begin(), t.end(), a));

maxi = max(count(s.begin(), s.end(), a), count(t.begin(), t.end(), a));

if(mini == 0) continue;

len += mini;

for(int i=maxi; i>maxi-mini; i--)

cnt = (cnt*i) % mod;

}

cout << len << " " << cnt << endl;

return 0;

}

#include <iostream>
#include <string>
using namespace std;


int main()
{
    int n;
    cin >> n;
    string temp;
    int bdays[n];
    int monthBeforeDays[12];
    monthBeforeDays[0] = 0;
    monthBeforeDays[1] = 31 + monthBeforeDays[0];
    monthBeforeDays[2] = 28 + monthBeforeDays[1];
    monthBeforeDays[3] = 31 + monthBeforeDays[2];
    monthBeforeDays[4] = 30 + monthBeforeDays[3];
    monthBeforeDays[5] = 31 + monthBeforeDays[4];
    monthBeforeDays[6] = 30 + monthBeforeDays[5];
    monthBeforeDays[7] = 31 + monthBeforeDays[6];
    monthBeforeDays[8] = 31 + monthBeforeDays[7];
    monthBeforeDays[9] = 30 + monthBeforeDays[8];
    monthBeforeDays[10] = 31 + monthBeforeDays[9];
    monthBeforeDays[11] = 30 + monthBeforeDays[10];
    for(int i=0; i<n; i++)
    {
        cin >> temp >> temp;
        int month = stoi(temp.substr(0,2));
        bdays[i] = monthBeforeDays[month-1] + stoi(temp.substr(3,2));
        //cout << bdays[i] << endl;
    }
    
    int maxHappiness = -1;
    int bestDay = -1;
    for(int i=301; i<=365; i++)
    {
        int mhappiness = 1000000000;
        for(int j=0; j<n; j++)
        {
            if(bdays[j] <= i)
            {
                if(i - bdays[j] < mhappiness)
                    mhappiness = i - bdays[j];
            }
            else
            {
                if(365 - (bdays[j] - i) < mhappiness)
                    mhappiness = 365 - (bdays[j] - i);
            }
        }
        
        if(mhappiness > maxHappiness)
        {
            bestDay = i;
            maxHappiness = mhappiness;
        }
    }
    
    for(int i=1; i<=300; i++)
    {
        int mhappiness = 1000000000;
        for(int j=0; j<n; j++)
        {
            if(bdays[j] <= i)
            {
                if(i - bdays[j] < mhappiness)
                    mhappiness = i - bdays[j];
            }
            else
            {
                if(365 - (bdays[j] - i) < mhappiness)
                    mhappiness = 365 - (bdays[j] - i);
            }
        }
        
        if(mhappiness > maxHappiness)
        {
            bestDay = i;
            maxHappiness = mhappiness;
        }
    }
    
    int m = -1;
    for(int i=0; i<12; i++)
    {
        if(monthBeforeDays[i] >= bestDay)
        {
            m = i;
            break;
        }
    }
    if(m == -1)
        m = 12;
    string omonth = to_string(m);
    if(m < 10)
        omonth = "0" + omonth;
    
    int ioday = bestDay - monthBeforeDays[m-1];
    
    string oday = to_string(ioday);
    //cout << ioday;
    if(ioday < 10)
        oday = "0" + oday;
    
    //cout << " check ";
    cout << omonth << "-" << oday;
}

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

57

58

59

60

61

62

63

64

65

66

67

68

69

70

71

72

73

74

75

76

77

78

79

80

81

82

83

84

85

86

87

88

89

90

91

92

93

94

95

96

97

98

99

100

101

102

103

104

105

106

107

#include <iostream>

#include <string>

using namespace std;

int main()

{

int n;

cin >> n;

string temp;

int bdays[n];

int monthBeforeDays[12];

monthBeforeDays[0] = 0;

monthBeforeDays[1] = 31 + monthBeforeDays[0];

monthBeforeDays[2] = 28 + monthBeforeDays[1];

monthBeforeDays[3] = 31 + monthBeforeDays[2];

monthBeforeDays[4] = 30 + monthBeforeDays[3];

monthBeforeDays[5] = 31 + monthBeforeDays[4];

monthBeforeDays[6] = 30 + monthBeforeDays[5];

monthBeforeDays[7] = 31 + monthBeforeDays[6];

monthBeforeDays[8] = 31 + monthBeforeDays[7];

monthBeforeDays[9] = 30 + monthBeforeDays[8];

monthBeforeDays[10] = 31 + monthBeforeDays[9];

monthBeforeDays[11] = 30 + monthBeforeDays[10];

for(int i=0; i<n; i++)

{

cin >> temp >> temp;

int month = stoi(temp.substr(0,2));

bdays[i] = monthBeforeDays[month-1] + stoi(temp.substr(3,2));

//cout << bdays[i] << endl;

}

int maxHappiness = -1;

int bestDay = -1;

for(int i=301; i<=365; i++)

{

int mhappiness = 1000000000;

for(int j=0; j<n; j++)

{

if(bdays[j] <= i)

{

if(i - bdays[j] < mhappiness)

mhappiness = i - bdays[j];

}

else

{

if(365 - (bdays[j] - i) < mhappiness)

mhappiness = 365 - (bdays[j] - i);

}

if(mhappiness > maxHappiness)

{

bestDay = i;

maxHappiness = mhappiness;

}

for(int i=1; i<=300; i++)

{

int mhappiness = 1000000000;

for(int j=0; j<n; j++)

{

if(bdays[j] <= i)

{

if(i - bdays[j] < mhappiness)

mhappiness = i - bdays[j];

}

else

{

if(365 - (bdays[j] - i) < mhappiness)

mhappiness = 365 - (bdays[j] - i);

}

if(mhappiness > maxHappiness)

{

bestDay = i;

maxHappiness = mhappiness;

}

int m = -1;

for(int i=0; i<12; i++)

{

if(monthBeforeDays[i] >= bestDay)

{

m = i;

break;

}

if(m == -1)

m = 12;

string omonth = to_string(m);

if(m < 10)

omonth = "0" + omonth;

int ioday = bestDay - monthBeforeDays[m-1];

string oday = to_string(ioday);

//cout << ioday;

if(ioday < 10)

oday = "0" + oday;

//cout << " check ";

cout << omonth << "-" << oday;

}

#include <iostream>
#include <math.h>
#include <algorithm>
using namespace std;

int main()
{
    int n, d;
    cin >> n >> d;
    int tile[n];
    for(int i=0; i<n; i++)
        cin >> tile[i];
    
    int num=0;
    int index = -1;
    int maxsMinimum = 1000000000;
    int m = -1;
    for(int i=0; i<d; i++)
    {
        int index = i;
        int z=0, f=0;
        while(index < n)
        {
            if(tile[index] % 2 == 0)
                z++;
            else
                f++;
            index += d;
        }
        
        num += min(z , f);
        if(max(z, f) < maxsMinimum)
        {
            maxsMinimum = max(z, f);
            m = min(z, f);
            index = i;
        }
        
        if(min(z, f) == z)
        {
            int ind = i;
            while(ind < n)
            {
                if(tile[ind] % 2 == 0)
                    tile[ind] ++;
                ind += d;
            }
        }
        else
        {
            int ind = i;
            while(ind < n)
            {
                if(tile[ind] % 2 == 1)
                    tile[ind] ++;
                ind += d;
            }
        }
    }
    
    bool zojiat = true;
    for(int i=0; i<d; i++)
    {
        if(tile[i] % 2 == 1)
            zojiat = !zojiat;
    }
    
    if(zojiat)
        cout << num;
    else
    {
        num -= m;
        num += maxsMinimum;
        cout << num;
    }
    
    return 0;
}

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

57

58

59

60

61

62

63

64

65

66

67

68

69

70

71

72

73

74

75

76

77

78

#include <iostream>

#include <math.h>

#include <algorithm>

using namespace std;

int main()

{

int n, d;

cin >> n >> d;

int tile[n];

for(int i=0; i<n; i++)

cin >> tile[i];

int num=0;

int index = -1;

int maxsMinimum = 1000000000;

int m = -1;

for(int i=0; i<d; i++)

{

int index = i;

int z=0, f=0;

while(index < n)

{

if(tile[index] % 2 == 0)

z++;

else

f++;

index += d;

}

num += min(z , f);

if(max(z, f) < maxsMinimum)

{

maxsMinimum = max(z, f);

m = min(z, f);

index = i;

}

if(min(z, f) == z)

{

int ind = i;

while(ind < n)

{

if(tile[ind] % 2 == 0)

tile[ind] ++;

ind += d;

}

else

{

int ind = i;

while(ind < n)

{

if(tile[ind] % 2 == 1)

tile[ind] ++;

ind += d;

}

bool zojiat = true;

for(int i=0; i<d; i++)

{

if(tile[i] % 2 == 1)

zojiat = !zojiat;

}

if(zojiat)

cout << num;

else

{

num -= m;

num += maxsMinimum;

cout << num;

}

return 0;

}

#include <iostream>
#include <cctype>
#include <vector>
#include <cmath>
using namespace std;

int main()
{
    i

پاسخ سوال هندونه خوری

پاسخ سوال کلید چراغ

پاسخ سوال سلام سلام خداحافظ

پاسخ سوال چاپ برعکس

پاسخ سوال تاریخ تولد

پاسخ سوال ساده تر

پاسخ سوال تو چقدر اضافه وزن داری؟

پاسخ سوال دنباله فیبوناچی برگشتی

پاسخ سوال جمع اعداد

پاسخ سوال اول‌بینی

پاسخ سوال رژیم سخت

پاسخ سوال یافتن عدد اول

پاسخ سوال مشق امشب باقر

پاسخ سوال یخدارچی

پاسخ سوال جدول ضرب گنده

پاسخ سوال سیگماگیر

پاسخ سوال اعداد اول

پاسخ سوال ماکزیمم عدد

پاسخ سوال چاپ مربع

پاسخ سوال کمک به کاپی

پاسخ سوال کامل بودن یا نبودن

پاسخ سوال رشته فیبوناچی

پاسخ سوال زرد

پاسخ سوال آقای خوش‌قلب

پاسخ سوال اسم ها

پاسخ سوال چند روزته؟

پاسخ سوال مجید، میلاد، رشته‌سازی

پاسخ سوال توان دو

پاسخ سوال مساحت محصور

پاسخ سوال مسابقه ی آسان

پاسخ سوال جمع بزرگان

پاسخ سوال شطرنج حرفه ای

پاسخ سوال تست بینایی

پاسخ سوال تیشرت برنده

پاسخ سوال دونقطه خط

پاسخ سوال آسمان شکر آباد

پاسخ سوال سیکل گرفتن در برره

پاسخ سوال مشق امشب باقر

پاسخ سوال خُب باقر سرما خورده

پاسخ سوال استارت آپ باکلاس

پاسخ سوال صبا و سوال ساده

پاسخ سوال زینی

پاسخ سوال دایره عجیب

پاسخ سوال اتل متل توتوله

پاسخ سوال اداره مالیات

پاسخ سوال انرژی خور

پاسخ سوال بارکد

پاسخ سوال باقر حال نداره ولی پول داره

پاسخ سوال تتریس

پاسخ سوال تخفیف جشنواره

پاسخ سوال تطابق رشته

پاسخ سوال تولد تاریخی

پاسخ سوال تیله‌های توی کیسه

پاسخ سوال جاستیفای