oj 基础练习
1.数列排序
#include<stdio.h>
#include<stdlib.h>
int main()
{
int a[1000];
int i,n,t;
scanf("%d",&n);
for (i = 0; i < n; i++)
{
scanf("%d",&a[i]);
}
for (int i1 = (n-1); i1>=1 ; i1--)
{
for (int i2 = i1 - 1; i2 >=0; i2--)
{
if (a[i1] < a[i2])
{
t=a[i1];
a[i1] = a[i2];
a[i2] = t;
}
}
}
for (int i3 = 0; i3 < n; i3++)
{
printf("%d ", a[i3]);
}
return 0;}
2. 闰年判断
#include <stdio.h>
int main()
{
int year,a;
scanf("%d",&year);
if(year%400==0)
a=1;
else
{
if(year%4==0&&year%100!=0)
a=1;
else
a=0;
}
if(a==1)
{
printf("yes");
}
else
{
printf("no");
}
return 0;
}3. 01字符串
#include<stdio.h>
int main()
{
printf("00000\n");
printf("00001\n");
printf("00010\n");
printf("00011\n");
printf("00100\n");
printf("00101\n");
printf("00110\n");
printf("00111\n");
printf("01000\n");
printf("01001\n");
printf("01010\n");
printf("01011\n");
printf("01100\n");
printf("01101\n");
printf("01110\n");
printf("01111\n");
printf("10000\n");
printf("10001\n");
printf("10010\n");
printf("10011\n");
printf("10100\n");
printf("10101\n");
printf("10110\n");
printf("10111\n");
printf("11000\n");
printf("11001\n");
printf("11010\n");
printf("11011\n");
printf("11100\n");
printf("11101\n");
printf("11110\n");
printf("11111");
return 0;}
4.时间转换
#include<stdio.h>
#include<math.h>
int main()
{
int n, h, m, s;
scanf(“%d”, &n);
h = n / 3600;
n = n % 3600;
m = n / 60;
s = n % 60;
printf(“%d:%d:%d”, h, m, s);
return 0;
}
5.特殊的数字
#include<stdio.h>
#include<math.h>
int main()
{
int x,s,a,b,c;
for (int i = 100; i < 1000; i++)
{
x = i;
a = x / 100;
x = x % 100;
b = x / 10;
c = x % 10;
s = a * a a+ b * bb + c * c*c;
if (s == i)
{
printf(“%d\n”, i);
}
}
return 0;}
6.查找整数
#include<stdio.h>
#include<math.h>
int main()
{
int n,x,t,k=-1;
int a[1000];
scanf("%d", &n);
for (int i = 0; i < n; i++)
{
scanf("%d", &a[i]);
}
scanf("%d", &x);
t = 1;
for (int i = 0; i < n; i++)
{
if (x != a[i])
{
t++;
}
else
{
printf("%d", t);
break;
}
}
if (t == (n + 1))
{
printf("%d",k);
}
return 0;}
7. 数列特征
#include<stdio.h>
#include<math.h>
int main()
{
int a[10000];
int n,t,s;
scanf("%d", &n);
for (int i = 0; i < n; i++)
{
scanf("%d", &a[i]);
}
for (int i = 0; i < (n - 1); i++)
{
for (int i1 = i + 1; i1 < n; i1++)
{
if (a[i] < a[i1])
{
t = a[i];
a[i] = a[i1];
a[i1] = t;
}
}
}
s = 0;
for (int i = 0; i < n; i++)
{
s = s + a[i];
}
printf("%d\n%d\n%d", a[0], a[n - 1], s);
return 0;}
8.特殊回文数
#include<stdio.h>
#include<math.h>
int main()
{
int n,a,b,c,d,e,f,g,k,q,s;
k = q = 0;
scanf("%d", &n);
for (int i = 10000; i < 100000; i++)
{
e = i;
a = e / 10000;
e = e - a * 10000;
b = e / 1000;
e = e - b * 1000;
f = e / 100;
e = e % 100;
c = e / 10;
d = e % 10;
if (a == d && b == c)
{
s = a + b + c + d + f;
if (s == n)
{
printf("%d\n", i);
}
}
}
for (int i = 100000; i < 1000000; i++)
{
g = i;
a = g / 100000;
g = g % 100000;
b = g / 10000;
g = g % 10000;
c = g / 1000;
g = g % 1000;
d = g / 100;
g = g % 100;
e = g / 10;
f = g % 10;
if (a == f && b == e && c == d)
{
s = a + b + c + d + e + f;
if (s == n)
{
printf("%d\n", i);
}
}
}
return 0;}
9. 字符串对比
#include<stdio.h>
#include<math.h>
#include<string.h>
int main()
{
int a1, b1,t,k;
char a[20], b[20];
int c[20], d[20];
scanf("%s\n%s", &a[0], &b[0]);
a1 = strlen(a);
b1 = strlen(b);
t = 0;
k = 0;
for (int i = 0; i < a1; i++)
{
c[i] = a[i];
}
for (int i = 0; i < b1; i++)
{
d[i] = b[i];
}
if (a1 == b1)
{
for (int i = 0; i < a1; i++)
{
if (c[i] == d[i])
{
t++;
}
}
for (int i = 0; i < a1; i++)
{
if ((c[i] + 32) == d[i] || c[i] == (d[i] + 32)||(c[i]-32)==d[i]||c[i]==(d[i]-32)||c[i]==d[i])
{
k++;
}
}
if (t == a1)
{
printf("2");
}
else
{
if (k == a1)
{
printf("3");
}
else
{
printf("4");
}
}
}
else
{
printf("1");
}
return 0;}
10. Huffuman树
#include<stdio.h>
int main()
{
int n,t,s;
int a[100];
scanf("%d", &n);
for (int i = 0; i < n; i++)
{
scanf("%d",& a[i]);
}
for (int i = 0; i < n-1; i++)
{
for (int i1 = i + 1; i1 < n; i1++)
{
if (a[i] < a[i1])
{
t = a[i];
a[i] = a[i1];
a[i1] = t;
}
}
}
s = 0;
for (int i2 = n - 2; i2 >= 0; i2--)
{
s = s + a[i2+1] + a[i2];
a[i2] = a[i2+1] + a[i2];
a[i2+1] = -1;
for (int i = 0; i < n - 1; i++)
{
for (int i1 = i + 1; i1 < n; i1++)
{
if (a[i] < a[i1])
{
t = a[i];
a[i] = a[i1];
a[i1] = t;
}
}
}
}
printf("%d", s);
return 0;}
11. 字母图形
#include<stdio.h>
int main()
{
char a[100] = {"ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZ"};
int n, m,t,k;
scanf("%d%d", &n, &m);
t = 0;
for (int i = 0; i < n; i++)
{
k = 0;
for (int i2 = i; i2 > 0; i2--)
{
printf("%c", a[i2]);
k++;
if (k >= m)
{
break;
}
}
for (int i1 = 0; i1 <m-i; i1++)
{
printf("%c", a[i1]);
}
if (t < (n - 1))
{
printf("\n");
t++;
}
}
return 0;}
算法提高
1.一元一次方程
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
int main()
{
double a, b, x；
scanf("%lf%lf",&a,&b);
x = -b / a;
printf("%.2lf", x);
return 0;}
2.前10名
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
int main()
{
int n,i,t;
int a[1000];
scanf("%d\n", &n);
for (i = 0; i < n; i++)
{
scanf("%d", &a[i]);
}
for (int j = 0; j < n - 1; j++)
{
for (int i1 = j + 1; i1 < n; i1++)
{
if (a[j] < a[i1])
{
t = a[j];
a[j] = a[i1];
a[i1] = t;
}
}
}
for (int i3 = 0; i3 < 10; i3++)
{
printf("%d ", a[i3]);
}
return 0;}
3.计算时间
#include<stdio.h>
int main()
{
int n,i,h,m,s,i1;
scanf("%d", &n);
int a[n];
for (i = 0; i < n; i++)
{
scanf("%d", &a[i]);
}
for (i1 = 0; i1 < n; i1++)
{
h = a[i1]/3600;
a[i1] = a[i1]%3600;
m = a[i1] / 60;
s = a[i1] % 60;
printf("%02d:%02d:%02d\n", h, m, s);
}
return 0;}
4.陶陶摘苹果
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
int main()
{
int n, x;
int t = 0;
int a[200];
scanf("%d%d",&n,&x);
for (int i = 0; i < n; i++)
{
scanf("%d",&a[i]);
}
for (int i1 = 0; i1 < n; i1++)
{
if (x + 30 >= a[i1])
{
t = t + 1;
}
}
printf("%d", t);
return 0;}
5.理财计划
#include<stdio.h>
int main()
{
float k, n, p,t,s;
scanf("%f%f%f", &k, &n, &p);
s = k;
for (int i = 0; i < n; i++)
{
t = k * p;
k = k + t + s;
}
k = k - n*s-s;
printf("%.2f", k);
return 0;}
6.淘淘摘苹果2
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
int main()
{
int n, x,j;
int t = 0;
int a[200];
scanf("%d%d", &n, &x);
for (int i = 0; i < n; i++)
{
scanf("%d", &a[i]);
}
for (int i1 = 0; i1 < n; i1++)
{
if (x + 30 >= a[i1])
{
t = t + 1;
}
}
j = n - t;
printf("%d", j);
return 0;}
7.解二元一次方程组
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
int main()
{
int a, b, c, d, e, f,x,y;
scanf("%d%d%d%d%d%d", &a, &b, &c, &d, &e, &f);
y = (a * f - c * d) / (a*e-d*b);
x = (c - b * y) / a;
printf("%d %d", x, y);
return 0;}
8.单词个数统计
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
int main()
{
int a,i,n,t,s;
char b[100];
s = 0;
gets(b);
n = strlen(b);
for (int i1 = 0; i1 < n; i1++)
{
t = b[i1];
if (t == 32)
{
s++;
}
}
s++;
printf("%d", s);
return 0;}
9.c++_ch02_02
#include<stdio.h>
#include<math.h>
int main()
{
int a, b, s;
char c;
scanf("%d%d\t%c", &a, &b, &c);
switch (c)
{
case '+':printf("%d\n", a + b); break;
case '-':printf("%d\n", a - b); break;
case '*':printf("%d\n", a * b); break;
case '/':printf("%d\n", a/ b); break;
case '%':printf("%d\n", a % b); break;
default:break;
}
return 0;}
10.复数求和
#include<stdio.h>
#include<math.h>
int main()
{
int a[1000];
int b[1000];
int i,n,i1,x,y;
x = 0;
y = 0;
scanf("%d", & n);
for (i = 0; i < n; i++)
{
scanf("%d", &a[i]);
scanf("%d", &b[i]);
}
for (i1 = 0; i1 < n; i1++)
{
x = x + a[i1];
y = y + b[i1];
}
printf("%d+%di", x, y);
return 0;}
11.交换Easy
#include<stdio.h>
#include<math.h>
int main()
{
int a[1000];
int b[1000];
int c[1000];
int t,i1,n,i,m,i2;
scanf("%d%d", &n,&m);
for (i = 0; i < n; i++)
{
scanf("%d", &c[i]);
}
for (i1 = 0; i1 < m; i1++)
{
scanf("%d%d", &a[i1], &b[i1]);
}
for (i2 = 0; i2 < m; i2++)
{
t = c[a[i2]-1];
c[a[i2]-1] = c[b[i2]-1];
c[b[i2]-1] = t;
}
for (int i3 = 0; i3 < n; i3++)
{
printf("%d\n", c[i3]);
}
return 0;}
12. 3-2字符串输入输出函数
#include<stdio.h>
#include<math.h>
#include<string.h>
int main()
{
char a[100];
char b[100];
int c, d;
printf("please input a number:\n");
scanf("%s",& a[0]);
printf("please input a string:\n");
scanf("%s",&b[0]);
c = strlen(a);
d = strlen(b);
for (int i = 0; i < c; i++)
{
printf("%c", a[i]);
}
printf("\n");
for (int i = 0; i < d; i++)
{
printf("%c", b[i]);
}
return 0;}
13. 质数的后代
#include<stdio.h>
#include<math.h>
int main()
{
int t, x, h;
int n[10000];
int a, b,k;
int p;
scanf("%d",&t);
for (int i = 0; i < t; i++)
{
scanf("%d",&n[i]);
}
for (int i = 0; i < t; i++)
{
p = 0;
x = n[i];
if (x == 0 || x == 1||x==3)
{
printf("No\n");
continue;
}
if (x == 2)
{
printf("Yes\n");
continue;
}
for (int i1 = 2; i1 <= x - 1; i1++)
{
if (x % i1 == 0)
{
a = i1;
b = x / i1;
h = 0;
k = 0;
for (int i2 = 2; i2 <= a - 1; i2++)
{
if (a % i2 != 0)
{
h++;
}
}
for (int i2 = 2; i2 <= b - 1; i2++)
{
if (b % i2 != 0)
{
k++;
}
}
if (h == (a - 2) && k == (b - 2))
{
printf("Yes\n");
break;
}
else
{
printf("No\n");
break;
}
}
else
{
p++;
}
}
if (p == x-2)
{
printf("No\n");
}
}
return 0;}
14. c++_ch02_03
#include<stdio.h>
int main()
{
int x,y;
scanf(“%d%d”,&x,&y);
if(x==0&&y==0)
{
printf("0");
}
if(x==0&&y==1)
{
printf("-1");
}
if(x==0&&y==2)
{
printf("1");
}
if(x==1&&y==0)
{
printf("1");
}
if(x==1&&y==1)
{
printf("0");
}
if(x==1&&y==2)
{
printf("-1");
}
if(x==2&&y==0)
{
printf("-1");
}
if(x==2&&y==1)
{
printf("1");
}
if(x==2&&y==2)
{
printf("0");
}
return 0;}
15. 淘淘的名单
#include<stdio.h>
#include<string.h>
#include<math.h>
int main()
{
int k,n,t;
char a[10000][5];
t = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++)
{
scanf("%s", &a[i][0]);
}
for (int i = 0; i < n; i++)
{
k=strlen(a[i]);
if (a[i][0] == 'W' && a[i][1] == 'Y' && a[i][2] == 'S'&&k==3)
{
printf("KXZSMR");
}
else if (a[i][0] == 'C' && a[i][1] == 'Q'&&k==2)
{
printf("CHAIQIANG");
}
else if (a[i][0] == 'L' && a[i][1] == 'C'&&k==2)
{
printf("DRAGONNET");
}
else if (a[i][0] == 'S' && a[i][1] == 'Y' && a[i][2] == 'T'&&k==3)
{
printf("STUDYFATHER");
}
else if (a[i][0] == 'S' && a[i][1] == 'S' && a[i][2] == 'D'&&k==3)
{
printf("STUDYFATHER");
}
else if (a[i][0] == 'L' && a[i][1] == 'S' && a[i][2] == 'S'&&k==3)
{
printf("STUDYFATHER");
}
else if (a[i][0] == 'L' && a[i][1] == 'Y' && a[i][2] == 'F'&&k==3)
{
printf("STUDYFATHER");
}
else
{
printf("DENOMINATOR");
}
if (t < (n - 1))
{
printf("\n");
t++;
}
}
return 0;}
16.Quadratic Equation
#include<stdio.h>
#include<math.h>
int main()
{
float a, b, c, x1, x2,t;
scanf("%f%f%f", &a, &b, &c);
t = sqrt(b * b - 4 * a * c);
x1 = (-b + t) / (2 * a);
x2 = (-b - t) / (2 * a);
if (x1 > x2)
{
printf("%.2f %.2f", x1, x2);
}
else
{
printf("%.2f %.2f", x2, x1);
}
return 0;}
算法训练
1.A+B Problem
#include<stdio.h>
#include<math.h>
int main()
{
int a, b;
scanf("%d%d", &a, &b);
printf("%d", a + b);
return 0;}
2. 数的统计
#include<stdio.h>
#include<math.h>
int main()
{
int n,t,k,q;
int a[1000];
int b[1000] = {0};
scanf("%d", & n);
for (int i = 0; i < n; i++)
{
scanf("%d", &a[i]);
}
k = 0;
for (int i = 0; i < n ; i++)
{
if (a[i] != 0)
{
for (int i1 = i + 1; i1 < n; i1++)
{
if (a[i] == a[i1])
{
a[i1] = 0;
b[i]++;
}
}
}
}
for (int i = 0; i < n - 1; i++)
{
for (int i1 = i+1; i1 < n; i1++)
{
if (a[i] > a[i1])
{
t = a[i];
a[i] = a[i1];
a[i1] = t;
q = b[i];
b[i] = b[i1];
b[i1] = q;
}
}
}
for (int i = 0; i < n;i++)
{
if (a[i] != 0)
{
printf("%d %d", a[i],b[i]+1);
if (i < n)
{
printf("\n");
}
}
}
return 0;}
3.特殊的数字四十
#include<stdio.h>
#include<math.h>
int main()
{
int i1,a,b,c,d,s,i;
i1=a = s=b = c = d = 0;
for ( i = 1000; i < 10000; i++)
{
i1 = i;
a = i1 / 1000;
i1 = i1 % 1000;
b = i1 / 100;
i1 = i1 % 100;
c = i1 / 10;
i1 = i1 % 10;
d = i1;
s = a + b + c + d;
if (s == 10)
{
printf("%d\n", i);
}
}
return 0;}
4.学做菜
#include<stdio.h>
#include<math.h>
int main()
{
int i1, i2, i3, i4, i5, a, b, c, d;
i1 = i2 = i3 = i4 = i5 = 0;
scanf("%d\n%d\n%d\n%d", &a, &b, &c, &d);
while (1)
{
if (a >= 2 && b >= 1 && d >= 2)
{
a = a - 2;
b = b - 1;
d = d - 2;
i1++;
}
else
{
break;
}
}
while (1)
{
if (a >= 1 && b >= 1 && c >= 1 && d >= 1)
{
a--;
b--;
c--;
d--;
i2++;
}
else
{
break;
}
}
while (1)
{
if (c >= 2 && d >= 1)
{
c = c - 2;
d--;
i3++;
}
else
{
break;
}
}
while (1)
{
if (b >= 3)
{
b = b - 3;
i4++;
}
else
{
break;
}
}
while (1)
{
if (a >= 1 && d >= 1)
{
a--;
d--;
i5++;
}
else
{
break;
}
}
printf("%d\n%d\n%d\n%d\n%d", i1, i2, i3, i4, i5);
return 0;}
5.水仙花
#include<stdio.h>
#include<math.h>
int main()
{
int l,n,a,b,c,s;
scanf("%d",&n);
l = n;
a = n / 100;
n = n % 100;
b = n / 10;
c = n % 10;
s = pow(a, 3) + pow(b, 3) + pow(c, 3);
if (s == l)
{
printf("YES");
}
else
{
printf("NO");
}
return 0;}
6. 9-7链表数据求和操作
#include<stdio.h>
#include<math.h>
int main()
{
int a[10];
int b[10];
int x=0, y=0;
for (int i = 0; i < 10; i++)
{
scanf("%d%d", &a[i], &b[i]);
}
for (int i = 0; i < 10; i++)
{
x = x + a[i];
y = y + b[i];
}
printf("%d+%di", x, y);
return 0;}
7. 友好数
#include<stdio.h>
#include<math.h>
int main()
{
int a[1000];
int b[1000];
int n, m,c,d,x,y;
c = 0;
d = 0;
x = 0;
y = 0;
scanf("%d%d", &n, &m);
for (int i = n-1; i > 0; i--)
{
if ((n % i) == 0)
{
a[c] = i;
c++;
}
}
for (int i = m - 1; i > 0; i--)
{
if ((m % i) == 0)
{
b[d] = i;
d++;
}
}
for (int i = 0; i < c; i++)
{
x = x + a[i];
}
for (int i = 0; i < d; i++)
{
y = y + b[i];
}
if (x == m && y == n)
{
printf("yes");
}
else
{
printf("no");
}
return 0;}
8.数对
#include<stdio.h>
#include<math.h>
int main()
{
int a[1000];
int b[1000];
int n,c;
c = 0;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
{
if ((n % i) == 0)
{
a[c] = i;
b[c] = (n / i);
c++;
}
}
for (int i = 0; i < c; i++)
{
printf("%d * %d = %d\n", a[i], b[i], n);
}
return 0;}
9. 蜜蜂飞舞
#include<stdio.h>
#include<math.h>
int main()
{
double s,x1,y1,z1,x2,y2,z2;
int n;
int a[100][7];
scanf("%d", &n);
for (int i = 0; i < n; i++)
{
scanf("%d%d%d%d%d%d%d\n", &a[i][0], &a[i][1], &a[i][2], &a[i][3], &a[i][4], &a[i][5], &a[i][6]);
}
scanf("%lf%lf%lf%lf%lf%lf", &x1, &y1, &z1, &x2, &y2, &z2);
for (int i = 0; i < n; i++)
{
x1 = x1 + a[i][0] * a[i][6];
y1 = y1 + a[i][1] * a[i][6];
z1 = z1 + a[i][2] * a[i][6];
x2 = x2 + a[i][3] * a[i][6];
y2 = y2 + a[i][4] * a[i][6];
z2 = z2 + a[i][5] * a[i][6];
}
s = sqrt((x1 - x2)* (x1 - x2)+(y1 - y2)* (y1 - y2)+ (z1 - z2)* (z1 - z2));
printf("%.4lf", s);
return 0;}
10.最长字符串
#include<stdio.h>
#include<string.h>
#include<math.h>
int main()
{
char a[100], b[100], c[100], d[100], e[100];
scanf("%s %s %s %s %s", &a[0], &b[0], &c[0], &d[0], &e[0]);
int a1 = strlen(a);
int b1 = strlen(b);
int c1 = strlen(c);
int d1 = strlen(d);
int e1 = strlen(e);
if (a1 > b1&& a1 > c1&& a1 > d1&& a1 > e1)
{
for (int i = 0; i < a1; i++)
{
printf("%c", a[i]);
}
}
if (b1 > a1&& b1 > c1&& b1 > d1&& b1 > e1)
{
for (int i = 0; i < b1; i++)
{
printf("%c", b[i]);
}
}
if (c1 > b1&& c1 > a1&& c1 > d1&& c1 > e1)
{
for (int i = 0; i < c1; i++)
{
printf("%c", c[i]);
}
}
if (d1 > b1&& d1 > c1&& d1 > a1&& d1 > e1)
{
for (int i = 0; i < d1; i++)
{
printf("%c", d[i]);
}
}
if (e1 > b1&& e1 > c1&& e1 > d1&& e1 > a1)
{
for (int i = 0; i < e1; i++)
{
printf("%c", e[i]);
}
}
return 0;}
11. 简单加法（基本型）
#include<stdio.h>
#include<math.h>
int main()
{
int n,x,t,y,k,s;
scanf("%d", &n);
s = 0;
for (int i = 0; i < n; i++)
{
x = i;
y = i + i + 1 + i + 2;
t = 1;
k = 1;
while (1)
{
x = x / 10;
if (x > 0)
{
t++;
}
else
{
break;
}
}
while (1)
{
y = y / 10;
if (y > 0)
{
k++;
}
else
{
break;
}
}
if (t == k)
{
s++;
}
}
printf("%d", s);
return 0;}
12.数位分离
#include<stdio.h>
#include<string.h>
#include<math.h>
int main()
{
char n[10],a;
scanf("%s", &n);
a = strlen(n);
for (int i = 0; i < a; i++)
{
printf("%c ", n[i]);
}
return 0;}
13. 矩阵加法
#include<stdio.h>
#include<math.h>
int main()
{
int n, m;
int a[100][100];
int b[100][100];
int c[100][100];
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i++)
{
for (int i1 = 0; i1 < m; i1++)
{
scanf("%d", &a[i][i1]);
}
}
for (int i = 0; i < n; i++)
{
for (int i1 = 0; i1 < m; i1++)
{
scanf("%d", &b[i][i1]);
}
}
for (int i = 0; i < n; i++)
{
for (int i1 = 0; i1 < m; i1++)
{
c[i][i1] = a[i][i1] + b[i][i1];
}
}
for (int i = 0; i < n; )
{
for (int i1 = 0; i1 < m; )
{
printf("%d", c[i][i1]);
i1++;
if (i1 < m)
{
printf(" ");
}
}
i++;
if (i < n)
{
printf("\n");
}
}
return 0;}
