From a6b59dec4211a296ab8259a776367c2650e130a0 Mon Sep 17 00:00:00 2001
From: stuffacc <st141867@spbu.ru>
Date: Fri, 17 Oct 2025 17:19:13 +0300
Subject: [PATCH] Control Task

---
 kr1/1.c      | 53 ++++++++++++++++++++++++++++++++++++++++++++++++++++
 kr1/2.c      | 39 ++++++++++++++++++++++++++++++++++++++
 kr1/monkey.c | 30 +++++++++++++++++++++++++++++
 3 files changed, 122 insertions(+)
 create mode 100644 kr1/1.c
 create mode 100644 kr1/2.c
 create mode 100644 kr1/monkey.c

diff --git a/kr1/1.c b/kr1/1.c
new file mode 100644
index 0000000..f31ee95
--- /dev/null
+++ b/kr1/1.c
@@ -0,0 +1,53 @@
+#include <stdio.h>
+
+void to2(char string[], int num);
+int palindrom(char string[]);
+int sizeOfString(char string[]);
+
+void main() {
+        int n = 1;
+        scanf("%d", &n);
+        for (int i = 1; i <= n; i++) {
+                char string[200] = {' '};
+                to2(string, i);
+                
+                int res = palindrom(string);
+                if (res == 1) {
+                        printf("%d\n", i);
+                }
+        }
+}
+
+void to2(char string[], int num) {
+        int index = 0;
+        while (num > 0) {
+                int ost = num % 2;
+                num = num / 2;
+                string[index] = (char) (ost);
+                index++;
+        }
+        string[index] = '\t';
+}
+
+
+int palindrom(char string[]) {
+        int res = 1;
+        int size = sizeOfString(string);
+        for (int i = 0; i < size; i++) {
+                if (string[i] != string[size-1-i]) {
+                        res = 0;
+                        break;
+                }
+        }
+        
+        return res;
+}
+
+int sizeOfString(char string[]) {
+        int size = 0;
+        while (string[size] != '\t') {
+                size++;
+        }
+        
+        return size;
+}
diff --git a/kr1/2.c b/kr1/2.c
new file mode 100644
index 0000000..19fad42
--- /dev/null
+++ b/kr1/2.c
@@ -0,0 +1,39 @@
+#include <stdio.h> 
+
+int getSum(int n);
+
+void main() {
+        int arr[] = {2, 4, 6, 8, 10, 35};
+        int size = sizeof(arr) / sizeof(int);
+        
+        int mx = 0;
+        
+        for (int i = 0; i < size; i++) {
+                int sm = getSum(arr[i]);
+                if (sm > mx) {
+                        mx = sm;
+                }
+        }
+        
+        
+        for (int i = 0; i < size; i++) {
+                int sm = getSum(arr[i]);
+                if (sm == mx) {
+                        printf("%d\n", arr[i]);
+                }
+        }
+        
+        
+        
+        
+        
+}
+
+int getSum(int n) { 
+      int sum = 0;
+      while (n != 0) {
+          sum = sum + n % 10;
+          n = n / 10;
+      }
+      return sum;
+}
diff --git a/kr1/monkey.c b/kr1/monkey.c
new file mode 100644
index 0000000..619b731
--- /dev/null
+++ b/kr1/monkey.c
@@ -0,0 +1,30 @@
+#include <stdio.h>
+
+int isSorted(int arr[], int size);
+void swap(int arr[]);
+
+void main() {
+        int arr[] = {2, 4, 6, 8, 10};
+        int size = sizeof(arr) / sizeof(int);
+        printf("%d\n", isSorted(arr, size));
+        for (int i = 0; i < size; i++) {
+                printf("%d ", arr[i]);
+        }
+        
+        
+        
+}
+
+int isSorted(int arr[], int size) {
+        for (int i = 0; i < size - 1; i++) {
+                if (arr[i] > arr[i+1]) {
+                        return 0;
+                }
+        }
+        
+        return 1;
+}
+
+void swap(int arr[]) {
+        
+}