Link:http://codeforces.com/problemset/problem/520/A
AC code:
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<queue>
#include<cstdio>
#define LL long long
#define MAXN 100010
using namespace std;
int num[27];
int main()
{
int n,i,sum;
while(~scanf("%d",&n))
{
char s[111];
scanf("%s",s);
memset(num,0,sizeof(num));
int len=strlen(s);
sum=0;
if(len<26)
{
printf("NO\n");
}
else
{
for(i=0;i<len;i++)
{
if(!num[tolower(s[i])-'a'])
{
num[tolower(s[i])-'a']=1;
sum++;
}
}
if(sum==26)
{
printf("YES\n");
}
else
{
printf("NO\n");
}
}
}
return 0;
}