For this Question: Given a string S check if it is Pangram or not. A pangram is a sentence containing all 26 letters of the English Alphabet.First line of input contains of an integer T denoting number od test cases then T test cases follow. Each testcase contains a String S.

Constraints:
1 <= T <= 100
1 <= |S| <= 1000

Note:- String will not contain any spacesFor each test case print in a new line 1 if its a pangram else print 0.Input:
2
Bawdsjogflickquartzvenymph
sdfs

Output:
0
0

Explanation :
Testcase 1: In the given input, the letter 'x' of the english alphabet is not present. Hence, the output is 0.
Testcase 2: In the given input, there aren't all the letters present in the english alphabet. Hence, the output is 0., I have written this Solution Code: #include<bits/stdc++.h>
using namespace std;

#define pu push_back
#define fi first
#define se second
#define mp make_pair
#define int long long
#define pii pair<int,int>
#define mm (s+e)/2
#define all(x) x.begin(), x.end()
#define For(i, st, en) for(int i=st; i<en; i++)
#define tr(x) for(auto it=x.begin(); it!=x.end(); it++)
#define fast std::ios::sync_with_stdio(false);cin.tie(NULL);
#define sz 200000
int A[26],B[26];
signed main()
{
	

		int t;
		cin>>t;
		string p;
		getline(cin,p);
		while(t>0)
		{
         t--;
			string s;
			getline(cin,s);
			int n=s.size();
			memset(A,0,sizeof(A));
			int ch=1;
			for(int i=0;i<n;i++)
			{
				int x=s[i]-'a';
				if(x>=0 && x<26)
				{
					A[x]++;
				}
				x=s[i]-'A';
				if(x>=0 && x<26)
				{
					A[x]++;
				}
			}
			for(int i=0;i<26;i++)
			{
				if(A[i]==0) ch=0;
			}
			cout<<ch<<endl;
		}

	
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?