M. N. Hasan

21 October 2017

uva 11348 (Exhibition)

/***
	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,cs=1,m,p;
	int num[10001],uni[10001];
	vector<int>data[10001];
	char ch='%';
	map<int,int>my_map;

	sc("%d",&test);

	while(test--){
	memset(num,0,sizeof(num));
	memset(uni,0,sizeof(uni));
	sc("%d",&n);
	for(int i=0 ; i<n ; i++){
	sc("%d",&m);
	while(m--){
	sc("%d",&p);
	data[i].pb(p);
	}
	sort(data[i].begin(),data[i].end());
	if(data[i].size() > 0){
	num[data[i][0]]++;
	}
	for(int j=1 ; j<data[i].size() ; j++){
	if(data[i][j] != data[i][j-1])
	num[data[i][j]]++;
	}
	}

	int sum=0 ;
	for(int i=0 ; i<n ; i++){
	if(data[i].size()>0 && num[data[i][0]]==1)
	uni[i]++;
	for(int j=1 ; j<data[i].size() ; j++){
	if(data[i][j]!=data[i][j-1] && num[data[i][j]]==1)
	uni[i]++;
	}
	sum += uni[i];

	}
	pf("Case %d:",cs++);
	for(int i=0 ; i<n ; i++){
	double result = (double)uni[i]*100/(double)sum;
	pf(" %.6lf%%",result);
	data[i].clear();
	}
	pf("\n");
	}

	return 0;
	}

UVA 11777 (Automate the Grades)

/***
	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,cs=1;
	sc("%d",&test);
	float Term1,Term2,Final,Attendance,Class_Test1,Class_Test2,Class_Test3;
	float max1, max2,avg,total;

	while(test--){
	sc("%f %f %f %f %f %f %f",&Term1,&Term2,&Final,&Attendance,&Class_Test1,&Class_Test2,&Class_Test3);

	if(Class_Test1 >= Class_Test3 && Class_Test2 >= Class_Test3){
	avg = (Class_Test1 + Class_Test2)/2.0 ;
	}else if(Class_Test1 >= Class_Test2 && Class_Test3 >= Class_Test2){
	avg = (Class_Test1 + Class_Test3)/2.0 ;
	}else if(Class_Test2 >= Class_Test1 && Class_Test3 >= Class_Test1){
	avg = (Class_Test2 + Class_Test3)/2.0 ;
	}

	total = Term1 + Term2+Final+Attendance+avg;
	pf("Case %d:",cs++);
	if(total>= 90.0){
	pf(" A\n");
	}else if(total >=80.0 && total <90.0){
	pf(" B\n");
	}else if(total >=70.0 && total <80.0){
	pf(" C\n");
	}else if(total >=60.0 && total <70.0){
	pf(" D\n");
	}else if(total <60.0){
	pf(" F\n");
	}
	}

	return 0;
	}

UVA 11039 (Building designing)

/***
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,p;
vector<int> data;
map<int,int>my_map ;

sc("%d",&test);

while(test--){
int n;
sc("%d",&n);

for(int i=0 ; i<n ; i++){
sc("%d",&p);
if(p<0){
p = p*(-1);
my_map[p] =-1;
}else{
my_map[p] =1;
}

data.pb(p);
}

sort(data.begin(),data.end());

int l= -1;
int cnt =0;
for(int i=0 ; i<data.size() ; i++){

p = data[i];
if(l == -1){
if(my_map[p] == -1){
l=0; // negative
}else{
l =1 ; // positive
}
cnt++;
continue;
}

if(my_map[p] == -1){
if(l==1){
cnt++;
l=0;
}else if(l==0){
continue;
}
}else if(my_map[p] == 1){
if(l==1){
continue;
}else if(l==0){
cnt++;
l=1;
}
}
}
pf("%d\n",cnt);
data.clear();
my_map.clear();
}

return 0;
}

03 October 2017

UVA 10879

/***
Md. Namzul 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 n, cnt=1,l,test;
int visited[100001], data[100001];

sc("%d",&test);
while(test--){
sc("%d",&n);
memset(visited,0,sizeof(visited));
l=0;

for(int i=2 ; i<=n/2 ; i++){
if(n%i==0){
if(visited[i] == 0){
visited[i] = n/i;
data[l] = i;
l++;
if(l==2){
break;
}
}
}
}

pf("Case #%d: %d = %d * %d = %d * %d\n",cnt++,n,data[0],visited[data[0]],data[1],visited[data[1]]);
}

return 0;
}