nyoj-639-找规律

#include<stdio.h>
int main()
{
    int a[10],i,t1,t2,k1,k2,k3;
    while(scanf("%d%d%d%d%d",&a[0],&a[1],&a[2],&a[3],&a[4])!=EOF)
    {
        k1=k2=k3=1;
        t1=a[1]-a[0];
        for(i=2;i<5;i++)
        if(a[i]-a[i-1]!=t1)
        {
            k1=0;
            break;
        }
         for(i=1;i<4;i++)
         if(a[i]*a[i]!=a[i-1]*a[i+1]||a[i]==0||a[i-1]==0||a[i+1]==0)
         {
            k2=0;
            break;
         }
        for(i=2;i<5;i++)
        if(a[i]!=a[i-1]+a[i-2])
        {
            k3=0;
            break;
        }
        if(k1)
        {
            for(i=5;i<10;i++)
            {
                a[i]=a[i-1]+t1;
                printf("%d ",a[i]);
            }
        }
        else if(k3)
        {
            for(i=5;i<10;i++)
            {
                a[i]=a[i-1]+a[i-2];
                printf("%d ",a[i]);
            }
        }
        else if(k2)
        {
            t2=a[1]/a[0];
            for(i=5;i<10;i++)
            {
                a[i]=a[i-1]*t2;
                printf("%d ",a[i]);
            }
        }
        else
        printf("None");
        printf("\n");
    }
    return 0;
}