UVA 541 - Error Correction

Problem PDF

Solution:

/*************************************
******** Team : BUBT_HIDDEN **********
**************************************
*********** Shipu Ahamed *************
*************************************/

#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include

#define sc scanf
#define pf printf
#define ll long long
#define pi 2*acos(0.0)

#define ff first
#define se second
#define inf (1<<30)                                              //infinity value
#define pb push_back
#define mod  1000000007
#define ST(v) sort(v.begin(),v.end())
#define cover(a,d) memset(a,d,sizeof(a))
#define input freopen("in.txt","r",stdin)
#define output freopen("out.txt","w",stdout)
#define maxall(v) *max_element(v.begin(),v.end())
#define minall(v) *min_element(v.begin(),v.end())
#define un(v) ST(v), v.erase(unique(v.begin(),v.end()),v.end())

using namespace std;
int main()
{
    int n;
    while(sc("%d",&n))
    {
        if(n==0) break;
        char a[110][110],row[110]={0},cal[110]={0};
        int p=-1,q=-1,flag=0,i,j,f=0,cl,ro;
        for(i=0;i1||cl>1||ro+cl==1)
            pf("Corrupt\n");
        else if(ro && cl)
            pf("Change bit (%d,%d)\n",p+1,q+1);
        else
            pf("OK\n");

    }

    return 0;
}
https://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/541/541.cpp