update dailycode code variant gen

data/1.dailycode初阶/1.cpp/1.exercises/solution.md

@@ -23,7 +23,7 @@ int main()
 	}
 	j = j1 + j2 + shiftj;
 	
-	_____________________
+	_____________________;
 
 	y = y1 + y2 + shifty;
 	ss = y + j/10.0 + f/100.0;

data/1.dailycode初阶/1.cpp/10.exercises/solution.md

@@ -35,7 +35,7 @@ int main()
 		else
 			a[10]++;
 	}
-	________________
+	________________;
 }
 ```
 

data/1.dailycode初阶/1.cpp/11.exercises/solution.md

@@ -24,7 +24,7 @@ int main()
         for (i = 0; i < n - 2; i++)
         {
             double exp = a2 / b2;
-            _____________________
+            _____________________;
             sum += exp;
             double a = a1 + a2;
             double b = b1 + b2;

data/1.dailycode初阶/1.cpp/12.exercises/solution.md

@@ -36,7 +36,7 @@ int main()
             a[i].push_back('A' + j + p);
         b[i] = a[i];
         reverse(b[i].begin(), b[i].end());
-        ___________________
+        ___________________;
         p++;
     }
     p = 0;

data/1.dailycode初阶/1.cpp/13.exercises/solution.md

@@ -28,7 +28,7 @@ int main()
     scanf("%d %d", &n, &m);
     m = m % n;
     int count = m;
-    ______________
+    ______________;
     for (int i = 0; i < count; i++)
         scanf("%d", &a[i]);
     int first = 1;

data/1.dailycode初阶/1.cpp/14.exercises/solution.md

@@ -12,7 +12,7 @@ int isPrime(int n)
     int i;
     if (n < 2)
         return 0;
-    _______________
+    _______________;
     return 1;
 }
 int CountPrime(int a[], int size)

data/1.dailycode初阶/1.cpp/15.exercises/solution.md

@@ -24,7 +24,7 @@ int main()
     {
         printf("\n请输入购货金额:\n");
         scanf("%f", &money);
-        ____________________
+        ____________________;
     }
     return 0;
 }

data/1.dailycode初阶/1.cpp/16.exercises/solution.md

@@ -32,7 +32,7 @@ int main()
         b[i] = a[i];
     for (i = 0; i < n; i++)
     {
-        __________________
+        __________________;
     }
     for (i = 0; i < n; i++)
         printf("%d\n", a[i]);

data/1.dailycode初阶/1.cpp/18.exercises/solution.md

@@ -51,7 +51,7 @@ int main()
         {
             if (arr[j] > arr[j + 1])
             {
-                ____________________
+                ____________________;
             }
         }
         for (int j = 0; j < n; j++)

data/1.dailycode初阶/1.cpp/19.exercises/solution.md

@@ -27,7 +27,7 @@ int main()
                 x = i;
                 while (x > 0)
                 {
-                    ________________
+                    ________________;
                 }
                 score += temp;
             }

data/1.dailycode初阶/1.cpp/2.exercises/solution.md

@@ -20,7 +20,7 @@ int main(){
 		if(i==0)
 			min = a[i];
 		sum+=a[i];
-		____________
+		____________;
 	}
 	ave=sum/10;
 	for(i=0;i<5;i++)

data/1.dailycode初阶/1.cpp/20.exercises/solution.md

@@ -52,7 +52,7 @@ int main()
             num = a * b;
             printf("%d\n", num);
         }
-        _________________________
+        _________________________;
         else
         {
             printf("%s\n", "WA");

data/1.dailycode初阶/1.cpp/21.exercises/solution.md

@@ -25,7 +25,7 @@
 using namespace std;
 int diff(char ch1, char ch2)
 {
-    __________________
+    __________________;
 }
 int main()
 {

data/1.dailycode初阶/1.cpp/22.exercises/solution.md

@@ -49,7 +49,7 @@ int main()
     {
         for (int j = i + 1; j < n; j++)
         {
-            __________________
+            __________________;
         }
     }
     for (int i = 0; i < n; i++)

data/1.dailycode初阶/1.cpp/23.exercises/solution.md

@@ -36,7 +36,7 @@ int main()
         {
             if (b[j] == a[k])
             {
-                __________________
+                __________________;
             }
         }
     }

data/1.dailycode初阶/1.cpp/24.exercises/solution.md

@@ -17,7 +17,7 @@ int main()
     if (c >= 'A' && c <= 'z')
     {
         m = c - 'A' + 1;
-        _____________________
+        _____________________;
     }
     if (n > 0)
         printf("%c在第%d个位置,其后面第四个字母是%c\n", c, m, c2);

data/1.dailycode初阶/1.cpp/25.exercises/solution.md

@@ -12,7 +12,7 @@ int oneNum(int x)
 	int cnt = 0;
 	while(x)
 	{
-		____________
+		____________;
 	}
 	return cnt;
 }

data/1.dailycode初阶/1.cpp/26.exercises/solution.md

@@ -21,7 +21,7 @@ int main()
     a = n % 1000 / 100;
     b = n % 100 / 10;
     c = n % 10 / 1;
-    ___________________
+    ___________________;
     if (y == n)
         cout << n << "是水仙花数" << endl;
     else

data/1.dailycode初阶/1.cpp/27.exercises/solution.md

@@ -29,7 +29,7 @@ int main()
 {
     scanf("%d", &n);
     int s, f, m;
-	____________
+	____________;
     print(s);
     printf(":");
     print(f);

data/1.dailycode初阶/1.cpp/28.exercises/solution.md

@@ -36,7 +36,7 @@ int main()
         int a[256] = {0};
         bool flag = false;
         for (int i = 0; i < str.size(); ++i)
-            ____________________
+            ____________________;
         for (int i = 0; i < str.size(); ++i)
         {
             if (a[str[i]] == 1)

data/1.dailycode初阶/1.cpp/29.exercises/solution.md

@@ -19,7 +19,7 @@ int main()
     ave = sum * 1.0 / n;
     for (i = 0; i < n; i++)
     {
-        __________________
+        __________________;
     }
     return 0;
 }

data/1.dailycode初阶/1.cpp/3.exercises/solution.md

@@ -19,7 +19,7 @@ int main(){
 	scanf("%d %lf", &fruit, &amount);
 	purchase = (fruits)fruit;	 
 	
-	________________________
+	________________________;
 
 	return 0; 
 }

data/1.dailycode初阶/1.cpp/30.exercises/solution.md

@@ -26,12 +26,7 @@ int fun(int n, int *x, int *y)
         size = 2 * (*x) - 1;
         dd = (*x);
         for (i = 2; i <= (*y); i++)
-        {
-            if (i <= (*x))
-                dd *= 2;
-            else
-                dd /= 2;
-        }
+        __________________________;
         return dd;
     }
     else
@@ -58,7 +53,13 @@ int main()
 ## 答案
 
 ```cpp
-
+for (i = 2; i <= (*y); i++)
+    {
+        if (i <= (*x))
+            dd *= 2;
+        else
+            dd /= 2;
+    }
 ```
 
 ## 选项
@@ -66,17 +67,35 @@ int main()
 ### A
 
 ```cpp
-
+for (i = 2; i <= (*y); i++)
+    {
+        if (i <= (*x))
+            dd /= 2;
+        else
+            dd *= 2;
+    }
 ```
 
 ### B
 
 ```cpp
-
+for (i = 2; i <= (*y); i++)
+    {
+        if (i <= (*x))
+            dd += 2;
+        else
+            dd -= 2;
+    }
 ```
 
 ### C
 
 ```cpp
-
+for (i = 2; i <= (*y); i++)
+    {
+        if (i <= (*x))
+            dd -= 2;
+        else
+            dd += 2;
+    }
 ```
\ No newline at end of file

data/1.dailycode初阶/1.cpp/31.exercises/solution.md

@@ -13,7 +13,7 @@ int solve(string s)
 	if (s.length() == 0) return 0;
 	int n = 0;
 	for (int i = 1; i < s.length(); i++)
-		if (s.c_str()[i] < s.c_str()[i - 1]) n++;
+		___________________;
 	return n;
 }
 int main()
@@ -28,7 +28,7 @@ int main()
 ## 答案
 
 ```cpp
-
+if (s.c_str()[i] < s.c_str()[i - 1]) n++;
 ```
 
 ## 选项
@@ -36,17 +36,17 @@ int main()
 ### A
 
 ```cpp
-
+if (s.c_str()[i] > s.c_str()[i - 1]) n++;
 ```
 
 ### B
 
 ```cpp
-
+if (s.c_str()[i] < s.c_str()[i + 1]) n++;
 ```
 
 ### C
 
 ```cpp
-
+if (s.c_str()[i] > s.c_str()[i + 1]) n++;
 ```
\ No newline at end of file

data/1.dailycode初阶/1.cpp/32.exercises/solution.md

@@ -10,41 +10,52 @@
 ## template
 
 ```cpp
-#include "stdio.h" 
-int main(){
-	int score;
-	scanf("%d",&score);
-	if(score>=95){
-		printf("A\n");	
-	}else if(score>=85 && score<=94){
-		printf("B\n");
-	}else if(score>=75 && score<=84){
-		printf("C\n");
-	}else if(score>=65 && score<=74){
-		printf("D\n");
-	}else{
-		printf("E\n");
-	}
-	printf("以下用switch语句实现相同功能\n");
-	score = score-5;
-	score = score/10;
-	switch(score){
-		case 9:
-			printf("A\n");	
-			break;
-		case 8:
-			printf("B");	
-			break;
-		case 7:
-			printf("C\n");	
-			break;
-		case 6:
-			printf("D\n");	
-			break;
-		default:
-			printf("E\n");
-			break;
-	}
+#include "stdio.h"
+int main()
+{
+    int score;
+    scanf("%d", &score);
+    if (score >= 95)
+    {
+        printf("A\n");
+    }
+    else if (score >= 85 && score <= 94)
+    {
+        printf("B\n");
+    }
+    else if (score >= 75 && score <= 84)
+    {
+        printf("C\n");
+    }
+    else if (score >= 65 && score <= 74)
+    {
+        printf("D\n");
+    }
+    else
+    {
+        printf("E\n");
+    }
+    printf("以下用switch语句实现相同功能\n");
+    score = score - 5;
+    score = score / 10;
+    switch (score)
+    {
+    case 9:
+        printf("A\n");
+        break;
+    case 8:
+        printf("B");
+        break;
+    case 7:
+        printf("C\n");
+        break;
+    case 6:
+        printf("D\n");
+        break;
+    default:
+        printf("E\n");
+        break;
+    }
 }
 ```
 

data/1.dailycode初阶/1.cpp/4.exercises/solution.md

@@ -13,7 +13,7 @@ int isp(int n)
 		return 0;
 	for (i=2;i*i<=n;++i)
 	{
-		_______________
+		_______________;
 	}
 	return 1;
 }

data/1.dailycode初阶/1.cpp/5.exercises/solution.md

@@ -46,7 +46,7 @@ void merge(int * a1, int m, int * a2, int n)
 	{
 		if (m1 < 0) a1[i] = a2[n1--];
 		else if (n1 < 0) a1[i] = a1[m1--];
-		__________________
+		__________________;
 	}
 }
 int main()

data/1.dailycode初阶/1.cpp/7.exercises/solution.md

@@ -13,12 +13,12 @@ int main()
 	scanf("%c",&x);
 	if(x>='A'&&x<='Z')
 	{
-		(1)___________
+		(1)___________;
 		printf("此字母是一个大写字母,转换后的小写字母是：%c",y);
 	}
 	else if(x>='a'&&x<='z')
 	{
-		(2)___________
+		(2)___________;
 		printf("此字母是一个小写字母,转换后的大写字母是%c",y);
 	}
 	else

data/1.dailycode初阶/1.cpp/8.exercises/solution.md

@@ -32,7 +32,7 @@ int isprime(int n)
 	int i;
 	if(n<=1) return 0;
 	for(i=2;i*i<=n;i++)
-		_______________
+		_______________;
 	return 1;
 }
 ```

data/1.dailycode初阶/1.cpp/9.exercises/solution.md

@@ -21,7 +21,7 @@ int main()
 		scanf("%d",&a[i]);
 	for(i=0;i<n;i++){
 		for(j=0;j<n;j++){
-			_____________
+			_____________;
 		}
 	}
 	for(i=0;i<n;i++)

data/2.dailycode中阶/1.cpp/1.exercises/solution.md

@@ -14,45 +14,45 @@ defghijkabc
 ## template
 
 ```cpp
-#include<iostream>
+#include <iostream>
 #include <string.h>
 using namespace std;
-void reverse(char *a,int start, int end)
+void reverse(char *a, int start, int end)
 {
-	int i ,j,temp;
-	for(i = start,j = end; i < j; i++,j--)
-	{
-		temp = a[i];
-		a[i] = a[j];
-		a[j] = temp;
-	}  
+    int i, j, temp;
+    for (i = start, j = end; i < j; i++, j--)
+    {
+        temp = a[i];
+        a[i] = a[j];
+        a[j] = temp;
+    }
 }
-void turnleft(char *a,int i,int n)
+void turnleft(char *a, int i, int n)
 {
-	int left = i % n;
-	if(left == 0)
-		return ;
-	reverse(a,0,left-1);
-	reverse(a,left,n-1);
-	reverse(a,0,n-1);
-	return ;
+    int left = i % n;
+    if (left == 0)
+        return;
+	______________
+    return;
 }
 int main()
 {
-	char a[1024];
-	int i;	
-	cin>>i;
-	cin>>a;
-	int n = strlen(a);
-	turnleft(a,i,n);
-	cout<<a<<endl;
+    char a[1024];
+    int i;
+    cin >> i;
+    cin >> a;
+    int n = strlen(a);
+    turnleft(a, i, n);
+    cout << a << endl;
 }
 ```
 
 ## 答案
 
 ```cpp
-
+reverse(a, 0, left - 1);
+reverse(a, left, n - 1);
+reverse(a, 0, n - 1);
 ```
 
 ## 选项
@@ -60,17 +60,20 @@ int main()
 ### A
 
 ```cpp
-
+reverse(a, left, n - 1);
+reverse(a, 0, n - 1);
 ```
 
 ### B
 
 ```cpp
-
+reverse(a, 0, left - 1);
+reverse(a, left, n - 1);
 ```
 
 ### C
 
 ```cpp
-
+reverse(a, 0, left - 1);
+reverse(a, 0, n - 1);
 ```
\ No newline at end of file

data/2.dailycode中阶/1.cpp/2.exercises/solution.md

@@ -24,32 +24,34 @@
 #include <stdio.h>
 #include <string.h>
 int result[10];
-int main(void) {
-	memset(result, 0, sizeof(int) * 10);
-	int n;
-	int arr[10];
-	while (scanf("%d", &n) != EOF)
-	{
-		memset(arr, 0, sizeof(int) * 10);
-		if (n == 0) arr[0] = 1;
-		while (n > 0)
-		{
-			arr[n % 10] = 1;
-			n = n / 10;
-		}
-		for (int i = 0; i < 10; i++)
-			result[i] += arr[i];
-	}
-	for (int i = 0; i < 10; i++)
-		printf("%d: %d\n", i, result[i]);
-	return 0;
+int main(void)
+{
+    memset(result, 0, sizeof(int) * 10);
+    int n;
+    int arr[10];
+    while (scanf("%d", &n) != EOF)
+    {
+        memset(arr, 0, sizeof(int) * 10);
+        if (n == 0)
+            arr[0] = 1;
+        while (n > 0)
+        {
+			____________
+        }
+        for (int i = 0; i < 10; i++)
+            result[i] += arr[i];
+    }
+    for (int i = 0; i < 10; i++)
+        printf("%d: %d\n", i, result[i]);
+    return 0;
 }
 ```
 
 ## 答案
 
 ```cpp
-
+arr[n % 10] = 1;
+n = n / 10;
 ```
 
 ## 选项
@@ -57,17 +59,20 @@ int main(void) {
 ### A
 
 ```cpp
-
+arr[n % 10] = 1;
+n = n % 10;
 ```
 
 ### B
 
 ```cpp
-
+arr[n / 10] = 1;
+n = n / 10;
 ```
 
 ### C
 
 ```cpp
-
+arr[n % 10] = 1;
+n++;
 ```
\ No newline at end of file

data/2.dailycode中阶/1.cpp/3.exercises/solution.md

@@ -12,29 +12,29 @@ EDCBABC
 ## template
 
 ```cpp
-#include<stdio.h>
-#include<math.h>
+#include <stdio.h>
+#include <math.h>
 int main()
 {
-	int m,n;
-	scanf("%d%d",&n,&m);
-	int i,j;
-	for(i=0;i<n;i++)
-	{
-		 for(j=0;j<m;j++)
-		 {
-			  printf("%c",65+abs(i-j)); 
-		 }
-		 printf("\n");
-	} 
-   return 0;
+    int m, n;
+    scanf("%d%d", &n, &m);
+    int i, j;
+    for (i = 0; i < n; i++)
+    {
+        for (j = 0; j < m; j++)
+        {
+            ______________
+        }
+        printf("\n");
+    }
+    return 0;
 }
 ```
 
 ## 答案
 
 ```cpp
-
+printf("%c", 65 + abs(i - j));
 ```
 
 ## 选项
@@ -42,17 +42,17 @@ int main()
 ### A
 
 ```cpp
-
+printf("%c", 65 + i - j);
 ```
 
 ### B
 
 ```cpp
-
+printf("%c", 65 + i + j);
 ```
 
 ### C
 
 ```cpp
-
+printf("%c", 65 - i + j);
 ```
\ No newline at end of file

data/2.dailycode中阶/1.cpp/4.exercises/solution.md

@@ -11,33 +11,33 @@
 #include <stdio.h>
 int main()
 {
-	int a[10],i,n;
-	int isfind = 0;
-	printf("please set array values:");
-	for(i=0;i<10;i++)
-		scanf("%d",&a[i]);
-	printf("please enter one num:");
-	scanf("%d",&n);
-	for (i=0;i<10;i++)
-	{
-		if(a[i] < n)
-		{
-			isfind = 1;
-			printf("%d ",a[i]);
-		}
-	}
-	if(isfind)
-		printf("\n");
-	else
-		printf("not find\n");
-	return 0;
+    int a[10], i, n;
+    int isfind = 0;
+    printf("please set array values:");
+    for (i = 0; i < 10; i++)
+        scanf("%d", &a[i]);
+    printf("please enter one num:");
+    scanf("%d", &n);
+    for (i = 0; i < 10; i++)
+    {
+		______________
+    }
+    if (isfind)
+        printf("\n");
+    else
+        printf("not find\n");
+    return 0;
 }
 ```
 
 ## 答案
 
 ```cpp
-
+if (a[i] < n)
+{
+	isfind = 1;
+	printf("%d ", a[i]);
+}
 ```
 
 ## 选项
@@ -45,17 +45,29 @@ int main()
 ### A
 
 ```cpp
-
+if (a[i] < n)
+{
+	isfind = 0;
+	printf("%d ", a[i]);
+}
 ```
 
 ### B
 
 ```cpp
-
+if (a[i] > n)
+{
+	isfind = 1;
+	printf("%d ", a[i]);
+}
 ```
 
 ### C
 
 ```cpp
-
+if (a[i] > n)
+{
+	isfind = 0;
+	printf("%d ", a[i]);
+}
 ```
\ No newline at end of file

data/2.dailycode中阶/1.cpp/5.exercises/solution.md

@@ -19,44 +19,45 @@
 
 ```cpp
 #include <stdio.h>
-int main ()
+int main()
 {
-	int a[6][6];
-	int m,n;
-	int i,j;
-	int max;
-	int indexx=0,indexy=0;
-	scanf("%d %d",&m,&n);
-	for (i = 0;i<m;i++)
-	{
-		for (j = 0;j<n;j++)
-		{
-			scanf("%d",&a[i][j]);
-			if(i == 0 && j==0)
-			{
-				max = a[i][j];
-				indexx = 0;
-				indexy = 0;
-			}else
-			{
-				if (a[i][j] > max)
-				{
-					max = a[i][j];
-					indexx = i;
-					indexy = j;
-				}
-			}
-		}
-	}
-	printf("%d,%d,%d\n",max,indexx,indexy);
-	return 0;
+    int a[6][6];
+    int m, n;
+    int i, j;
+    int max;
+    int indexx = 0, indexy = 0;
+    scanf("%d %d", &m, &n);
+    for (i = 0; i < m; i++)
+    {
+        for (j = 0; j < n; j++)
+        {
+            scanf("%d", &a[i][j]);
+            if (i == 0 && j == 0)
+            {
+                max = a[i][j];
+                indexx = 0;
+                indexy = 0;
+            }
+            else
+            {
+                _____________
+            }
+        }
+    }
+    printf("%d,%d,%d\n", max, indexx, indexy);
+    return 0;
 }
 ```
 
 ## 答案
 
 ```cpp
-
+if (a[i][j] > max)
+{
+	max = a[i][j];
+	indexx = i;
+	indexy = j;
+}
 ```
 
 ## 选项
@@ -64,17 +65,32 @@ int main ()
 ### A
 
 ```cpp
-
+if (a[i][j] < max)
+{
+	max = a[i][j];
+	indexx = i;
+	indexy = j;
+}
 ```
 
 ### B
 
 ```cpp
-
+if (a[i][j] > max)
+{
+	max = a[i][j];
+	indexx = j;
+	indexy = i;
+}
 ```
 
 ### C
 
 ```cpp
-
+if (a[i][j] <= max)
+{
+	max = a[i][j];
+	indexx = i;
+	indexy = j;
+}
 ```
\ No newline at end of file

data/2.dailycode中阶/1.cpp/6.exercises/solution.md

@@ -10,31 +10,35 @@ B=1 C=5
 ```cpp
 #include <stdio.h>
 #include <math.h>
-int main () {
-	float A = 0.2f;
-	int x = 0;
-	if (A < 0) { x = 1; A = 1/A; }
-	float delta = 1;
-	int B = 1, C = 1;
-	do
-	{
-		C = (int)(B * A);
-		delta = fabs(C/(float)B-A);
-		B++;
-	}
-	while (delta > 0.000001); 
-	if (x == 0)
-		printf("%d / %d", C, B - 1);
-	else
-		printf("%d / %d", B - 1, C);
-	return 0;
+int main()
+{
+    float A = 0.2f;
+    int x = 0;
+    if (A < 0)
+    {
+        x = 1;
+        A = 1 / A;
+    }
+    float delta = 1;
+    int B = 1, C = 1;
+    do
+    {
+        ____________
+    } while (delta > 0.000001);
+    if (x == 0)
+        printf("%d / %d", C, B - 1);
+    else
+        printf("%d / %d", B - 1, C);
+    return 0;
 }
 ```
 
 ## 答案
 
 ```cpp
-
+C = (int)(B * A);
+delta = fabs(C / (float)B - A);
+B++;
 ```
 
 ## 选项
@@ -42,17 +46,23 @@ int main () {
 ### A
 
 ```cpp
-
+C = B * A;
+delta = fabs(C / (float)B - A);
+B++;
 ```
 
 ### B
 
 ```cpp
-
+C = B * A;
+delta = fabs(C / B - A);
+B++;
 ```
 
 ### C
 
 ```cpp
-
+C = B * A;
+delta = fabs(C / (float)B - A);
+B++;
 ```
\ No newline at end of file

data/2.dailycode中阶/1.cpp/7.exercises/solution.md

@@ -3,11 +3,15 @@
 题目描述
 编写以下函数：
 （1）在一个二维数组中形成以下形式的n阶矩阵：
+
+```json
 [1 1 1 1 1
 2 1 1 1 1
 3 2 1 1 1
 4 3 2 1 1
 5 4 3 2 1]
+```
+
 （2）去掉靠边的元素，生成新的n-2阶矩阵；
 （3）求生成的n阶矩阵主对角线上的元素之和；
 （4）以方阵形式输出数组。
@@ -20,15 +24,22 @@
 5
 样例输出
 Generated matrix:
+
+```json
 1 1 1 1 1
 2 1 1 1 1
 3 2 1 1 1
 4 3 2 1 1
 5 4 3 2 1
+```
 del the elements on the side:
+
+```json
 1 1 1
 2 1 1
 3 2 1
+```
+
 The sum of the diagonal:5
 
 
@@ -36,47 +47,49 @@ The sum of the diagonal:5
 
 ```cpp
 #include <iostream>
-using namespace std; 
-int main() {
-	while(1){
-		int a;
-		cin>>a;
-		int array[a][a];
-		for (int i=0;i<a;i++)
-			for (int j=0;j<a;j++)
-			{
-				if(j<i)
-					array[i][j]=i+1-j;
-				else 
-					array[i][j]=1;
-			}
-		cout<<"Generated matrix:"<<endl; 
-		for (int i=0;i<a;i++)
-		{	
-			for (int j=0;j<a;j++)
-			{
-				cout<<array[i][j];
-			}
-			cout<<endl;
-		}
-		cout<<"del the elements on the side:"<<endl; 
-		for (int i=1;i<a-1;i++)
-		{	
-			for (int j=1;j<a-1;j++)
-			{
-				cout<<array[i][j];
-			}
-			cout<<endl;
-		}
-		int sum=0;
-		int i,j;
-		for (i = a - 2 ,j = 1 ; i >= 1 ; i-- , j++)
-		{	
-			sum+=array[i][j];
-		}
-		cout<<"The sum of the diagonal:"<<sum<<endl;
-	}
-	return 0;
+using namespace std;
+int main()
+{
+    while (1)
+    {
+        int a;
+        cin >> a;
+        int array[a][a];
+        for (int i = 0; i < a; i++)
+            for (int j = 0; j < a; j++)
+            {
+                if (j < i)
+                    array[i][j] = i + 1 - j;
+                else
+                    array[i][j] = 1;
+            }
+        cout << "Generated matrix:" << endl;
+        for (int i = 0; i < a; i++)
+        {
+            for (int j = 0; j < a; j++)
+            {
+                cout << array[i][j];
+            }
+            cout << endl;
+        }
+        cout << "del the elements on the side:" << endl;
+        for (int i = 1; i < a - 1; i++)
+        {
+            for (int j = 1; j < a - 1; j++)
+            {
+                cout << array[i][j];
+            }
+            cout << endl;
+        }
+        int sum = 0;
+        int i, j;
+        for (i = a - 2, j = 1; i >= 1; i--, j++)
+        {
+            sum += array[i][j];
+        }
+        cout << "The sum of the diagonal:" << sum << endl;
+    }
+    return 0;
 }
 ```