#include<stdio.h>
int main()
{
    int m,n,i,a[100][100];
    while(~scanf("%d",&m))
    {
        for(n=1;n<=m;n++)
        {
            for(i=1;i<=m;i++)
            {
                if(n==1);
                {
                    a[1][1]=1;
                    printf("1\n");
                    break;
                }
                if(n!=1)
                {
                    a[1][n]=0;
                    a[n][n]=0;
                    if(i!=1&&i!=n)
                    {
                        a[i][n]=a[i-1][n-1]+a[i][n-1];
                    }
                    if(i==1)
                    {
                        printf("%d",a[i][n]);
                    }
                    if(i!=1&&i!=n)
                    {
                        printf(" %d",a[i][n]);
                    }
                    if(i==n)
                    {
                        printf(" %d\n",a[i][n]);
                    }
                }
            }
        }
                printf("\n");
    }return 0;
}

if(n==1);

多了分号，还存在其他逻辑问题，自己考虑一下吧

看多遍了，实在看不懂，虚心请教题主：您是如何将一段简单代码写得如斯晦涩复杂的？

#include <stdio.h>

int main( void )
{
    for( unsigned n; scanf("%u",&n)==1; )
    {
        unsigned a[100] = { 1 };
        for( unsigned r=0; r!=n; ++r )
        {
            for( unsigned c=r; c!=0; --c )
            {
                a[c] += a[c-1];
                printf( "%u ", a[c] );
            }

            puts( "1" );
        }
    }
}

...非常感谢..我会再去学习算法..