## Pangrams

QUESTION

Roy wanted to increase his typing speed for programming contests. So, his friend advised him to type the sentence \”The quick brown fox jumps over the lazy dog\” repeatedly, because it is a pangram. (Pangrams are sentences constructed by using every letter of the alphabet at least once.)\n\nAfter typing the sentence several times, Roy became bored with it. So he started to look for other pangrams.\n\nGiven a sentence s, tell Roy if it is a pangram or not.\n\nInput Format\n\nInput consists of a string s.\n\nConstraints \nLength of s can be at most 10^3(1<=|s|<=10^3) and it may contain spaces, lower case and upper case letters. Lower-case and upper-case instances of a letter are considered the same.\n\nOutput Format\n\nOutput a line containing pangram if s is a pangram, otherwise output not pangram.

``````#include<stdio.h>
char st[100000];
int i,ind[1000];
int main()
{
while(fgets(st,100,stdin))
{
for(i='A';i<='Z';i++)
ind[i]=0;

for(i=0;st[i];i++)
{
if(st[i]>='a' && st[i]<='z')
st[i]-=32;

ind[st[i]]++;
}
for(i='A';i<='Z';i++)
if(ind[i]==0)
break;

if(i=='Z'+1)
printf("pangram\n");
else
printf("not pangram\n");
}
return 0;
}
Ghost of Tsushima``````