11048 - Automatic Correction of Misspellings

///Stone pile
#include<bits/stdc++.h>
using namespace    std;

#define flush        cin.ignore(numeric_limits<streamsize>::max(),'\n')
#define fasterio     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define NL           printf("\n")
#define pi           acos(-1.0) //3.1415926535897932384626
#define mx           7500000
#define dpoint(x)    fixed<<setprecision(x)
#define mod          1000000007
#define pb           push_back
#define scn(x)       scanf("%d",&x)
#define scnd(x)      scanf("%lf",&x)
#define sc(x)        scanf("%s",x)
#define debug(x)     cout<<x<<endl;

typedef long long int       ll;
typedef double              dl;
typedef unsigned long long  ul;

// --------------------------Pre made Functions & Proto Type--------------------------//
template <class T> T gcd(T a, T b){if(a == 0) return b;return gcd ( b%a, a );}
template <class T> T lcm(T a, T b){return ( ( a/gcd ( a, b ) )*b );}
template <class T> T digitsum(T n){T sum=0;while(n!=0){sum+=n%10;n/=10;}return sum;}


int main()
{
//   #ifndef ONLINE_JUDGE
//       freopen("input.txt","r",stdin);
//       freopen("out.txt","w",stdout);
//   #endif
    int test;
    scanf("%d",&test);
    char word[test+5][27];
    for(int i=0; i<n; i++) scanf("%s",word[i]);
    int q;
    scanf("%d",&q);
    for(int i=0; i<q; i++)
    {
       int c_checker=0, m_checker=0, cnt=0;
       char valu[27];
       scanf("%s",valu);
       for(int j=0; j<n; j++)
       {
           if(strcmp(word[j],valu)==0)
           {
               ///
               printf("%s is correct\n",valu);
               c_checker=1;
               break;
           }
       }
       if(c_checker==0)
       {
            for(int j=0; j<n; j++)
            {
                int valu_ln = strlen(valu);
                int word_ln = strlen(word[j]);

                if(valu_ln - word_ln == 1) ///for missing one letter
                {
                    for(int k=0; k<valu_ln; k++)
                    {
                        if(word[j][k])
                    }
                }
            }
       }
    }


    return 0;
}