UVA 11349 Symmetric Matrix

/***
Md. Nazmul Hasan
Shahjalal University of Science & Technology,Sylhet.
hasan08sust@gmail.com
***/
#include<iostream>
#include<cstdio>
#include<stack>
#include<queue>
#include<map>
#include<vector>
#include<algorithm>
#include<cstring>
#include<sstream>
#include<cmath>
#include <iomanip>
using namespace std ;
typedef long long ll ;
typedef int in ;
typedef unsigned long long ull ;
const double pi = 2*acos(0) ;
#define maxi 40000
#define pf printf
#define sc scanf
#define pb push_back
#define MEM(x,y) (memset((x),(y),sizeof(x)))
#define MIN(x,y) ((x) < (y) ? (x) : (y))
#define MAX(x,y) ((x) > (y) ? (x) : (y))
#define load(array,size)  for(int i=0 ; i<size ; i++) cin>>array[i]  ;
#define new_line  pf("\n")
#define clear_data(array) memset(array,0,sizeof(array))
#define highest_int 2147483647

int test,dimen,cs=1;
long long matrix[105][105];
bool symetry;

void is_symetry()
{
    if(!symetry)
        return;
    for(int i=0 ; i<dimen ; i++)
    {
        for(int j=0 ; j<dimen ; j++)
        {
            if(matrix[i][j] != matrix[dimen-1-i][dimen-1-j])
            {
                symetry = false;
                return ;
            }
        }
    }
}

int main()
{
    char str[1001];

    sc("%d",&test);

    while(test--)
    {
        getchar();
        gets(str);
        symetry = true ;
        sscanf(str,"%c = %d",&str[0],&dimen);

        for(int i=0 ; i<dimen ; i++)
        {
            for(int j=0 ; j<dimen ; j++)
            {
                sc("%lld",&matrix[i][j]);
                if(matrix[i][j]<0)
                    symetry = false;
            }
        }
        pf("Test #%d: ",cs++);

        if(!symetry)
        {
           pf("Non-symmetric.\n");
           continue;
        }

        is_symetry();
        if(symetry)
            pf("Symmetric.\n");
        else
            pf("Non-symmetric.\n");
    }

    return 0;
}

UVA 11078 - Open Credit System

/***
	Md. Nazmul Hasan
	Shahjalal University of Science & Technology,Sylhet.
	hasan08sust@gmail.com
	***/
	#include<iostream>
	#include<cstdio>
	#include<stack>
	#include<queue>
	#include<map>
	#include<vector>
	#include<algorithm>
	#include<cstring>
	#include<sstream>
	#include<cmath>
	#include <iomanip>
	using namespace std ;
	typedef long long ll ;
	typedef int in ;
	typedef unsigned long long ull ;
	const double pi = 2*acos(0) ;
	#define maxi 40000
	#define pf printf
	#define sc scanf
	#define pb push_back
	#define MEM(x,y) (memset((x),(y),sizeof(x)))
	#define MIN(x,y) ((x) < (y) ? (x) : (y))
	#define MAX(x,y) ((x) > (y) ? (x) : (y))
	#define load(array,size) for(int i=0 ; i<size ; i++) cin>>array[i] ;
	#define new_line pf("\n")
	#define clear_data(array) memset(array,0,sizeof(array))
	#define highest_int 2147483647
	int main()
	{
	int test,n,p;
	vector<int> data;
	map<int,int>my_map;
	sc("%d",&test);
	while(test--)
	{
	sc("%d",&n);
	int mx = -200000;
	int mx_diff = -200000;
	for(int k=0 ; k<n ; k++)
	{
	sc("%d",&p);
	data.pb(p);
	}
	for(int i=0 ; i<data.size()-1 ; i++)
	{
	if(data[i]>mx)
	mx = data[i];
	if(mx - data[i+1] > mx_diff)
	mx_diff = mx - data[i+1];
	}
	pf("%d\n",mx_diff);
	data.clear();
	}
	return 0;
	}

UVA 1237 Expert Enough?

/***
	Md. Nazmul Hasan
	Shahjalal University of Science & Technology,Sylhet.
	hasan08sust@gmail.com
	***/
	#include<iostream>
	#include<cstdio>
	#include<stack>
	#include<queue>
	#include<map>
	#include<vector>
	#include<algorithm>
	#include<cstring>
	#include<sstream>
	#include<cmath>
	#include <iomanip>
	using namespace std ;
	typedef long long ll ;
	typedef int in ;
	typedef unsigned long long ull ;
	const double pi = 2*acos(0) ;
	#define maxi 40000
	#define pf printf
	#define sc scanf
	#define pb push_back
	#define MEM(x,y) (memset((x),(y),sizeof(x)))
	#define MIN(x,y) ((x) < (y) ? (x) : (y))
	#define MAX(x,y) ((x) > (y) ? (x) : (y))
	#define load(array,size) for(int i=0 ; i<size ; i++) cin>>array[i] ;
	#define new_line pf("\n")
	#define clear_data(array) memset(array,0,sizeof(array))
	#define highest_int 2147483647
	int main()
	{
	int test,n,m,q,a,p,l,h;
	map<int,string>map1;
	map<int,int>map2;
	map<int,int>map3;
	vector<int>data;
	string str;
	sc("%d",&test);
	while(test--)
	{
	sc("%d",&p);
	for(int i=1;i<=p ; i++)
	{
	cin>>str>>l>>h;
	data.pb(l);
	map1[i] = str;
	map2[i] = h;
	map3[i]=l;
	}
	sc("%d",&q);
	int k;
	for(int i=1 ; i<=q ; i++)
	{
	sc("%d",&a);
	l=0;
	int got=0;
	for(int j=0 ; j<data.size() ; j++)
	{
	n = data[j];
	k = j+1;
	m = map2[k];
	if(a>=n && a<=m)
	{
	//pf("Datas are %d %d",n,m);
	//cout<<map1[n]<<endl;
	got=j+1;;
	l++;
	}
	//l++;
	}
	if(l>1 || l==0)
	pf("UNDETERMINED\n");
	else if(l==1)
	cout<<map1[got]<<endl;
	}
	data.clear();
	map1.clear();
	map2.clear();
	if(test)
	pf("\n");
	}
	return 0;
	}
	/*
	2
	3
	ami 10000 20000
	tumi 10000 25000
	she 10000 12000
	2
	12000
	24000
	*/