林大神代码

#include <stdio.h>
void qwe(int s[][5],int f)
{
	int i,j;
	i = 0;
	j = 0;
	printf("\n");
	while(f--)
	{
		printf("%d ",s[i][j]);
		j++;
		if(j == 5)
		{
			i++;
			j = 0;
			printf("\n");
		}
	}
	printf("\n");
}

void add(int a[][5],int b[][5],int f)
{
	int c[100][5];
	int i,j,t;
	i = 0;
	j = 0;
	t = f;
	while(t--)
	{
		c[i][j] = a[i][j] + b[i][j];
		j++;
		if(j == 5)
		{
			j = 0;
			i++;
		}
	}
	qwe(c,f);
}

void mny(int a[][5],int b[][5],int f)
{
	int c[100][5];
	int i,j,t;
	i = 0;
	j = 0;
	t = f;
	while(t--)
	{
		c[i][j] = a[i][j] * b[i][j];
		j++;
		if(j == 5)
		{
			j = 0;
			i++;
		}
	}
	qwe(c,f);
}


void main()
{
	int a[100][5]={0};
	int b[100][5]={0};
	int i=0,j=0;
	int n,m,f1,f2,f;
	f1 = 0;
	while(scanf("%d",&a[i][j]) && a[i][j]!=-10)
	{
		f1++;
		j++;
		if(j == 5)
		{
			j = 0;
			i++;
		}
	}
	m = 0;
	n = 0;
	f2 = 0;
	while(scanf("%d",&b[n][m]) && b[n][m]!=-10)
	{
		f2++;
		m++;
		if(m == 5)
		{
			m = 0;
			n++;
		}
	}
	qwe(a,f1);
	qwe(b,f2);
	f = f1>f2?f1:f2;
	add(a,b,f);
	mny(a,b,f);
}