I have to find sentences is pangram(Pangrams are sentences constructed by using every letter of the alphabet at least once) or not 

Terminated due to timeout . why it seems ok to me ? how thinks work . i m using this on hackerrank . t

plz tell what is a better ways to solve with logical reasoning. THis is too much but plz help :)

This is best what i can do plz help me .. thanks in advance and if something big mistake in program sorry 

```
#include <stdio.h>

int main()
{
    int i,n=0,l;
    char str[1000];

    scanf("%[^\n]%*c",str);

    for(l=65;i<91;l++)
    {
        for(i=0;str[i]!='\0';)
        {
            if(l==str[i]&&l+31==str[i])
            {
               n++;
            }

            if(str[i+1]=='\0')
            {  i=i+2;

            }
            else
            i++;
        }
    }

    if(n==26)
        printf("pangram ");
    else
        printf(" not pangram ");

    return 0;
}

```