April 2016 – Live with passion

10170

Asif NaeemApril 16, 2016

#include <iostream>
#include <cstdio>

#define ul unsigned long long//double//long long

using namespace std;

int main()
{
	ul s,d,a,b;
	ul subtract;
	ul lw,hi,mid,res;
	while(scanf("%llu%llu",&s,&d)!=EOF)
	{
		if(d<=s)
		{
			printf("%llu\n",s);
			continue;
		}
		subtract=(s*(s-1))/2;
		lw=s;
		hi=s+d/s;
		res=-1;
		while(hi-lw>1)
		{
			mid=(lw+hi)/2;
			if(((mid*(mid+1))/2-subtract) <d)
			lw=mid+1;
			else if(((mid*(mid+1))/2-subtract)>d)
			hi=mid;
			else if(((mid*(mid+1))/2-subtract)==d)
			{
				res=mid;
				break;
			}
		}
		if(res!=-1)
		printf("%llu\n",res);
		else
		{
			//cout<<lw<<" "<<hi<<"\n";
			a=(hi*(hi+1))/2-subtract;
			b=(lw*(lw+1))/2-subtract;
			if(a>=d && b<d)
			printf("%llu\n",hi);
			else
			printf("%llu\n",lw);
		}
	}
	return 0;
}

#include <iostream>

#include <cstdio>

#define ul unsigned long long//double//long long

using namespace std;

int main()

{

ul s,d,a,b;

ul subtract;

ul lw,hi,mid,res;

while(scanf("%llu%llu",&s,&d)!=EOF)

{

if(d<=s)

{

printf("%llu\n",s);

continue;

}

subtract=(s*(s-1))/2;

lw=s;

hi=s+d/s;

res=-1;

while(hi-lw>1)

{

mid=(lw+hi)/2;

if(((mid*(mid+1))/2-subtract) <d)

lw=mid+1;

else if(((mid*(mid+1))/2-subtract)>d)

hi=mid;

else if(((mid*(mid+1))/2-subtract)==d)

{

res=mid;

break;

}

if(res!=-1)

printf("%llu\n",res);

else

{

//cout<<lw<<" "<<hi<<"\n";

a=(hi*(hi+1))/2-subtract;

b=(lw*(lw+1))/2-subtract;

if(a>=d && b<d)

printf("%llu\n",hi);

else

printf("%llu\n",lw);

}

return 0;

}

974

Asif NaeemApril 15, 2016

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <vector>

#define ll long long

using namespace std;

ll arr[40001];
vector<int> vb;

ll _pow(int pwr)
{
	if(pwr==0)
	return 1;
	else
	return 10*_pow(pwr-1);
}

bool Isfunc(ll a,int b)
{
	int tmp;
	tmp=a;
	int pwr=0;
	int num=0;
	while(tmp)
	{
		num=num + (tmp%10)*_pow(pwr);
		tmp/=10;
		if(tmp+num==b && tmp!=0 && num!=0)
		return 1;
		pwr+=1;
	}
	return 0;
}

int main()
{
	int lw,hi;
	int t;
	int kase=1;
	vb.push_back(9);
	vb.push_back(45);
	vb.push_back(55);
	for(int i=91;i<=40000;i++)
	{
		if(Isfunc(i*i,i))
		vb.push_back(i);
	}
	//cout<<vb.size()<<"\n";
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d%d",&lw,&hi);
		printf("case #%d\n",kase++);
		bool found=0;
		for(int i=0;i<19;i++)
		{
			if(vb[i]>=lw && vb[i]<=hi)
			found=1,
			printf("%d\n",vb[i]);
		}
		if(found==0)
		printf("no kaprekar numbers\n");
		if(t)
		printf("\n");
	}
	return 0;
}

#include <iostream>

#include <cstdio>

#include <cstring>

#include <string>

#include <vector>

#define ll long long

using namespace std;

ll arr[40001];

vector<int> vb;

ll _pow(int pwr)

{

if(pwr==0)

return 1;

else

return 10*_pow(pwr-1);

}

bool Isfunc(ll a,int b)

{

int tmp;

tmp=a;

int pwr=0;

int num=0;

while(tmp)

{

num=num + (tmp%10)*_pow(pwr);

tmp/=10;

if(tmp+num==b && tmp!=0 && num!=0)

return 1;

pwr+=1;

}

return 0;

}

int main()

{

int lw,hi;

int t;

int kase=1;

vb.push_back(9);

vb.push_back(45);

vb.push_back(55);

for(int i=91;i<=40000;i++)

{

if(Isfunc(i*i,i))

vb.push_back(i);

}

//cout<<vb.size()<<"\n";

scanf("%d",&t);

while(t--)

{

scanf("%d%d",&lw,&hi);

printf("case #%d\n",kase++);

bool found=0;

for(int i=0;i<19;i++)

{

if(vb[i]>=lw && vb[i]<=hi)

found=1,

printf("%d\n",vb[i]);

}

if(found==0)

printf("no kaprekar numbers\n");

if(t)

printf("\n");

}

return 0;

}

696

Asif NaeemApril 14, 2016

#include <iostream>
#include <cstdio>

using namespace std;

int main()
{
	int r,c,tmp,res;
	int row,col;
	//FILE *fp;
	//fp=fopen("out.txt","w");
	while(scanf("%d%d",&r,&c))
	{
		if(r+c==0)
		break;
		if((r==1 || c==1) || r==0 || c==0)
		{
			printf("%d knights may be placed on a %d row %d column board.\n",r*c,r,c);
			//fprintf(fp,"%d knights may be placed on a %d row %d column board.\n",r*c,r,c);
			continue;
		}
		if((r==2 || c==2))
		{
			if(r!=2)
			{
				col=r;
				row=2;
			}
			else
			{
				row=r;
				col=c;
			}
			tmp=col/2;
			if(tmp%2==0)
			{
				res=(tmp/2)*4;
			}
			else
			{
				res=(tmp/2+1)*4;
			}
			if(col%4==1)
				res+=2;
			printf("%d knights may be placed on a %d row %d column board.\n",res,r,c);
			//fprintf(fp,"%d knights may be placed on a %d row %d column board.\n",res,r,c);
			continue;
		}
		tmp=(r*c)/2;
		if(tmp*2== r*c)
		{
			printf("%d knights may be placed on a %d row %d column board.\n",tmp,r,c);
			//fprintf(fp,"%d knights may be placed on a %d row %d column board.\n",tmp,r,c);
		}
		else
		{
			printf("%d knights may be placed on a %d row %d column board.\n",tmp+1,r,c);
			//fprintf(fp,"%d knights may be placed on a %d row %d column board.\n",tmp+1,r,c);
		}
	}
	//fclose(fp);
	return 0;
}

#include <iostream>

#include <cstdio>

using namespace std;

int main()

{

int r,c,tmp,res;

int row,col;

//FILE *fp;

//fp=fopen("out.txt","w");

while(scanf("%d%d",&r,&c))

{

if(r+c==0)

break;

if((r==1 || c==1) || r==0 || c==0)

{

printf("%d knights may be placed on a %d row %d column board.\n",r*c,r,c);

//fprintf(fp,"%d knights may be placed on a %d row %d column board.\n",r*c,r,c);

continue;

}

if((r==2 || c==2))

{

if(r!=2)

{

col=r;

row=2;

}

else

{

row=r;

col=c;

}

tmp=col/2;

if(tmp%2==0)

{

res=(tmp/2)*4;

}

else

{

res=(tmp/2+1)*4;

}

if(col%4==1)

res+=2;

printf("%d knights may be placed on a %d row %d column board.\n",res,r,c);

//fprintf(fp,"%d knights may be placed on a %d row %d column board.\n",res,r,c);

continue;

}

tmp=(r*c)/2;

if(tmp*2== r*c)

{

printf("%d knights may be placed on a %d row %d column board.\n",tmp,r,c);

//fprintf(fp,"%d knights may be placed on a %d row %d column board.\n",tmp,r,c);

}

else

{

printf("%d knights may be placed on a %d row %d column board.\n",tmp+1,r,c);

//fprintf(fp,"%d knights may be placed on a %d row %d column board.\n",tmp+1,r,c);

}

//fclose(fp);

return 0;

}

661

Asif NaeemApril 14, 2016

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>

using namespace std;

int capacity[21];
bool isTurnOn[21];
int main()
{
	int n,m,c;
	int MX=0;
	int device;
	int kase=1;
	bool IsFUSE;
	long long total;
	while(scanf("%d%d%d",&n,&m,&c))
	{
		if(n+m+c==0)
		break;
		//memset(capacity,0,sizeof(capacity));
		//memset(isTurnOn,0,sizeof(isTurnOn));
		IsFUSE=0;
		for(int i=1;i<=n;i++)
		{
			scanf("%d",&capacity[i]);
			isTurnOn[i]=0;
		}
		total=0;
		MX=0;
		for(int i=1;i<=m;i++)
		{
			scanf("%d",&device);
			if(IsFUSE)
			continue;
			if(isTurnOn[device]==0)
			{
				isTurnOn[device]=1;
				total+=capacity[device];
			}
			else if(isTurnOn[device]==1)
			{
				isTurnOn[device]=0;
				total-=capacity[device];
			}

			if(total>c)
			{
				IsFUSE=1;
			}
			if(total>MX)
			MX=total;
		}
		printf("Sequence %d\n",kase++);
		if(IsFUSE)
		printf("Fuse was blown.\n");
		else
		{
			printf("Fuse was not blown.\n");
			printf("Maximal power consumption was %d amperes.\n",MX);
		}
		printf("\n");
	}
	return 0;
}

#include <iostream>

#include <cstdio>

#include <cstring>

#include <string>

using namespace std;

int capacity[21];

bool isTurnOn[21];

int main()

{

int n,m,c;

int MX=0;

int device;

int kase=1;

bool IsFUSE;

long long total;

while(scanf("%d%d%d",&n,&m,&c))

{

if(n+m+c==0)

break;

//memset(capacity,0,sizeof(capacity));

//memset(isTurnOn,0,sizeof(isTurnOn));

IsFUSE=0;

for(int i=1;i<=n;i++)

{

scanf("%d",&capacity[i]);

isTurnOn[i]=0;

}

total=0;

MX=0;

for(int i=1;i<=m;i++)

{

scanf("%d",&device);

if(IsFUSE)

continue;

if(isTurnOn[device]==0)

{

isTurnOn[device]=1;

total+=capacity[device];

}

else if(isTurnOn[device]==1)

{

isTurnOn[device]=0;

total-=capacity[device];

}

if(total>c)

{

IsFUSE=1;

}

if(total>MX)

MX=total;

}

printf("Sequence %d\n",kase++);

if(IsFUSE)

printf("Fuse was blown.\n");

else

{

printf("Fuse was not blown.\n");

printf("Maximal power consumption was %d amperes.\n",MX);

}

printf("\n");

}

return 0;

}

594

Asif NaeemApril 14, 2016

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>

using namespace std;

int main()
{
	int n,res;
	int positionInByte,byteNo;
	while(scanf("%d",&n)!=EOF)
	{
		res=0;
		for(int i=0;i<32;i++)
		{
			if((1<<i)&n)
			{
				byteNo=i/8;
				positionInByte=i%8;
				res |= (1<<((3-byteNo)*8+positionInByte));
			}
		}
		printf("%d converts to %d\n",n,res);
	}
	return 0;
}

#include <iostream>

#include <cstdio>

#include <cstring>

#include <string>

using namespace std;

int main()

{

int n,res;

int positionInByte,byteNo;

while(scanf("%d",&n)!=EOF)

{

res=0;

for(int i=0;i<32;i++)

{

if((1<<i)&n)

{

byteNo=i/8;

positionInByte=i%8;

res |= (1<<((3-byteNo)*8+positionInByte));

}

printf("%d converts to %d\n",n,res);

}

return 0;

}

There is a problem with online judge results for this problem. It accepts for n=6 as AC result as : 2^-6 = 1.562e-2 and for n=7 AC result as : 2^-7 = 7.812e-3 But it should be 2^-6 = 1.563e-2 and 2^-7 = 7.813e-3 respectively using approximation method after 3rd decimal. So to get AC from UVA OJ I

Continue Reading “474” →

471

Asif NaeemApril 10, 2016

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <vector>

#define ll long long
#define LIMIT 9876543210

using namespace std;


vector<int> vb;

bool isRepeated(ll num)
{
	if(num>=0 && num<=10)
	return 0;
	bool digits[10];
	memset(digits,0,sizeof(digits));
	while(num)
	{
		if(digits[num%10])
		return 1;
		digits[num%10]=1;
		num/=10;
	}
	return 0;
}
int main()
{
	int t;
	ll n;
	ll num;
	for(int i=1;i<1000005;i++)
	{
		if(isRepeated(i)==0)
		vb.push_back(i);
	}
	scanf("%d",&t);
	while(t--)
	{
		scanf("%lld",&n);
		for(int i=0;i<vb.size();i++)
		{
			num=vb[i]*n;
			if(num>LIMIT)
			{
				break;
			}
			if(isRepeated(num)==0)
			{
				printf("%lld / %d = %lld\n",num,vb[i],n);
			}
		}
		if(t)
		printf("\n");
	}
}

#include <iostream>

#include <cstdio>

#include <cstring>

#include <string>

#include <vector>

#define ll long long

#define LIMIT 9876543210

using namespace std;

vector<int> vb;

bool isRepeated(ll num)

{

if(num>=0 && num<=10)

return 0;

bool digits[10];

memset(digits,0,sizeof(digits));

while(num)

{

if(digits[num%10])

return 1;

digits[num%10]=1;

num/=10;

}

return 0;

}

int main()

{

int t;

ll n;

ll num;

for(int i=1;i<1000005;i++)

{

if(isRepeated(i)==0)

vb.push_back(i);

}

scanf("%d",&t);

while(t--)

{

scanf("%lld",&n);

for(int i=0;i<vb.size();i++)

{

num=vb[i]*n;

if(num>LIMIT)

{

break;

}

if(isRepeated(num)==0)

{

printf("%lld / %d = %lld\n",num,vb[i],n);

}

if(t)

printf("\n");

}

460

Asif NaeemApril 10, 2016

#include <iostream>
#include <cstdlib>
#include <cmath>
#include <cstdio>

using namespace std;

struct point{
	int x,y;
};
point LL1,LL2,LR1,LR2,UL1,UL2,UR1,UR2;
point New_LL,New_LR,New_UL,New_UR;

bool isOverlap()
{
	if(LL1.x>=LR2.x)
	return 0;
	if(LR1.x<=LL2.x)
	return 0;

	if(LL1.y>=UL2.y)
	return 0;
	if(UL1.y<=LL2.y)
	return 0;
	return 1;
}

bool isTotalInside()
{
	if((LL1.x>=LL2.x && LL1.x <= UR2.x) && (LL1.y>=LL2.y && LL1.y <= UR2.y))
	{
		if((LR1.x>=LL2.x && LR1.x <= UR2.x) && (LR1.y>=LL2.y && LR1.y <= UR2.y))
		{
			if((UR1.x>=LL2.x && UR1.x <= UR2.x) && (UR1.y>=LL2.y && UR1.y <= UR2.y))
			{
				if((UL1.x>=LL2.x && UL1.x <= UR2.x) && (UL1.y>=LL2.y && UL1.y <= UR2.y))
				{
					New_LL.x=LL1.x;
					New_LL.y=LL1.y;

					New_UR.x=UR1.x;
					New_UR.y=UR1.y;
					return 1;
				}
			}
		}
	}
	if((LL2.x>=LL1.x && LL2.x <= UR1.x) && (LL2.y>=LL1.y && LL2.y <= UR1.y))
	{
		if((LR2.x>=LL1.x && LR2.x <= UR1.x) && (LR2.y>=LL1.y && LR2.y <= UR1.y))
		{
			if((UR2.x>=LL1.x && UR2.x <= UR1.x) && (UR2.y>=LL1.y && UR2.y <= UR1.y))
			{
				if((UL2.x>=LL1.x && UL2.x <= UR1.x) && (UL2.y>=LL1.y && UL2.y <= UR1.y))
				{
					New_LL.x=LL2.x;
					New_LL.y=LL2.y;

					New_UR.x=UR2.x;
					New_UR.y=UR2.y;
					return 1;
				}
			}
		}
	}
	return 0;

}
int InsidePoints()
{
	if(isTotalInside())
	return 0;
	if(LL1.x>=LL2.x && LL1.x <= UR2.x)
	{
		if(LL1.y>=LL2.y && LL1.y <= UR2.y)
		{
			//vb.push_back(LL1);
			New_LL.x=LL1.x;
			New_LL.y=LL1.y;

			New_LR.x= (LR2.x<=LR1.x?LR2.x:LR1.x);
			New_LR.y= New_LL.y;

			New_UL.x=New_LL.x;
			New_UL.y=(UL2.y<=UL1.y?UL2.y:UL1.y);

			New_UR.x=New_LR.x;
			New_UR.y=New_UL.y;
			return 0;
		}

		New_LL.x=LL1.x;
		New_LL.y=LL2.y;

		New_UR.x=(LR1.x<=LR2.x?LR1.x:LR2.x);
		New_UR.y=(UR1.y<=UR2.y?UR1.y:UR2.y);
		return 0;
	}
	if(LR1.x>=LL2.x && LR1.x <= UR2.x)
	{
		if(LR1.y>=LL2.y && LR1.y <= UR2.y)
		{
			//vb.push_back(LL1);
			New_LR.x=LR1.x;
			New_LR.y=LR1.y;

			New_LL.x= (LL2.x<=LL1.x?LL1.x:LL2.x);
			New_LL.y= New_LR.y;

			New_UL.x=New_LL.x;
			New_UL.y=(UL2.y<=UL1.y?UL2.y:UL1.y);

			New_UR.x=New_LR.x;
			New_UR.y=New_UL.y;
			return 0;
		}
		New_LL.x=LL2.x;
		New_LL.y=LL2.y;

		New_UR.x=LR1.x;
		New_UR.y=(UR1.y<=UR2.y?UR1.y:UR2.y);
		return 0;
	}

	if(UR1.x>=LL2.x && UR1.x <= UR2.x)
	{
		if(UR1.y>=LL2.y && UR1.y <= UR2.y)
		{
			//vb.push_back(LL1);
			New_UR.x=UR1.x;
			New_UR.y=UR1.y;

			New_UL.x=(UL1.x<=UL2.x?UL2.x:UL1.x);
			New_UL.y=New_UR.y;

			New_LL.x= New_UL.x;
			New_LL.y= (LL1.y<=LL2.y?LL2.y:LL1.y);

			New_LR.x=New_UR.x;
			New_LR.y=New_LL.y;
			return 0;
		}
		New_UR.x=UR1.x;
		New_UR.y=(UR1.y<=UR2.y?UR1.y:UR2.y);

		New_LL.x=(LL1.x>=LL2.x?LL1.x:LL2.x);
		New_LL.y=(LL1.y>=LL2.y?LL1.y:LL2.y);
		return 0;
	}

	if(UL1.x>=LL2.x && UL1.x <= UR2.x)
	{
		if(UL1.y>=LL2.y && UL1.y <= UR2.y)
		{
			//vb.push_back(LL1);
			New_UL.x=UL1.x;
			New_UL.y=UL1.y;

			New_UR.x=(UR1.x<=UR2.x?UR1.x:UR2.x);
			New_UR.y=New_UL.y;

			New_LL.x= New_UL.x;
			New_LL.y= (LL1.y<=LL2.y?LL2.y:LL1.y);

			New_LR.x=New_UR.x;
			New_LR.y=New_LL.y;
			return 0;
		}
		New_LL.x=UL1.x;
		New_LL.y=(LL1.y>=LL2.y?LL1.y:LL2.y);

		New_UR.x=(UR1.x<=UR2.x?UR1.x:UR2.x);
		New_UR.y=(UR1.y<=UR2.y?UR2.y:UR1.y);
		return 0;
	}
	return -1;
}
int main()
{
	int t;
	int length1,length2,width1,width2;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d%d%d%d",&LL1.x,&LL1.y,&UR1.x,&UR1.y);
		scanf("%d%d%d%d",&LL2.x,&LL2.y,&UR2.x,&UR2.y);

		length1 = abs(LL1.x - UR1.x);
		width1 = abs(LL1.y - UR1.y);
		length2 = abs(LL2.x - UR2.x);
		width2 = abs(LL2.y - UR2.y);

		LR1.x = UR1.x; 	LR1.y = LL1.y;
		UL1.x = LL1.x;	UL1.y = UR1.y;
		LR2.x = UR2.x;	LR2.y = LL2.y;
		UL2.x = LL2.x;	UL2.y = UR2.y;

		if(!isOverlap())
		{
			printf("No Overlap\n");
			if(t)
			printf("\n");
			continue;
		}
		if(InsidePoints()==0)
		printf("%d %d %d %d\n",New_LL.x,New_LL.y,New_UR.x,New_UR.y);
		if(t)
			printf("\n");
	}
	return 0;
}

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

117

118

119

120

121

122

123

124

125

126

127

128

129

130

131

132

133

134

135

136

137

138

139

140

141

142

143

144

145

146

147

148

149

150

151

152

153

154

155

156

157

158

159

160

161

162

163

164

165

166

167

168

169

170

171

172

173

174

175

176

177

178

179

180

181

182

183

184

185

186

187

188

189

190

191

192

193

194

195

196

197

198

199

200

201

202

203

204

205

206

207

208

209

210

211

#include <iostream>

#include <cstdlib>

#include <cmath>

#include <cstdio>

using namespace std;

struct point{

int x,y;

};

point LL1,LL2,LR1,LR2,UL1,UL2,UR1,UR2;

point New_LL,New_LR,New_UL,New_UR;

bool isOverlap()

{

if(LL1.x>=LR2.x)

return 0;

if(LR1.x<=LL2.x)

return 0;

if(LL1.y>=UL2.y)

return 0;

if(UL1.y<=LL2.y)

return 0;

return 1;

}

bool isTotalInside()

{

if((LL1.x>=LL2.x && LL1.x <= UR2.x) && (LL1.y>=LL2.y && LL1.y <= UR2.y))

{

if((LR1.x>=LL2.x && LR1.x <= UR2.x) && (LR1.y>=LL2.y && LR1.y <= UR2.y))

{

if((UR1.x>=LL2.x && UR1.x <= UR2.x) && (UR1.y>=LL2.y && UR1.y <= UR2.y))

{

if((UL1.x>=LL2.x && UL1.x <= UR2.x) && (UL1.y>=LL2.y && UL1.y <= UR2.y))

{

New_LL.x=LL1.x;

New_LL.y=LL1.y;

New_UR.x=UR1.x;

New_UR.y=UR1.y;

return 1;

}

if((LL2.x>=LL1.x && LL2.x <= UR1.x) && (LL2.y>=LL1.y && LL2.y <= UR1.y))

{

if((LR2.x>=LL1.x && LR2.x <= UR1.x) && (LR2.y>=LL1.y && LR2.y <= UR1.y))

{

if((UR2.x>=LL1.x && UR2.x <= UR1.x) && (UR2.y>=LL1.y && UR2.y <= UR1.y))

{

if((UL2.x>=LL1.x && UL2.x <= UR1.x) && (UL2.y>=LL1.y && UL2.y <= UR1.y))

{

New_LL.x=LL2.x;

New_LL.y=LL2.y;

New_UR.x=UR2.x;

New_UR.y=UR2.y;

return 1;

}

return 0;

}

int InsidePoints()

{

if(isTotalInside())

return 0;

if(LL1.x>=LL2.x && LL1.x <= UR2.x)

{

if(LL1.y>=LL2.y && LL1.y <= UR2.y)

{

//vb.push_back(LL1);

New_LL.x=LL1.x;

New_LL.y=LL1.y;

New_LR.x= (LR2.x<=LR1.x?LR2.x:LR1.x);

New_LR.y= New_LL.y;

New_UL.x=New_LL.x;

New_UL.y=(UL2.y<=UL1.y?UL2.y:UL1.y);

New_UR.x=New_LR.x;

New_UR.y=New_UL.y;

return 0;

}

New_LL.x=LL1.x;

New_LL.y=LL2.y;

New_UR.x=(LR1.x<=LR2.x?LR1.x:LR2.x);

New_UR.y=(UR1.y<=UR2.y?UR1.y:UR2.y);

return 0;

}

if(LR1.x>=LL2.x && LR1.x <= UR2.x)

{

if(LR1.y>=LL2.y && LR1.y <= UR2.y)

{

//vb.push_back(LL1);

New_LR.x=LR1.x;

New_LR.y=LR1.y;

New_LL.x= (LL2.x<=LL1.x?LL1.x:LL2.x);

New_LL.y= New_LR.y;

New_UL.x=New_LL.x;

New_UL.y=(UL2.y<=UL1.y?UL2.y:UL1.y);

New_UR.x=New_LR.x;

New_UR.y=New_UL.y;

return 0;

}

New_LL.x=LL2.x;

New_LL.y=LL2.y;

New_UR.x=LR1.x;

New_UR.y=(UR1.y<=UR2.y?UR1.y:UR2.y);

return 0;

}

if(UR1.x>=LL2.x && UR1.x <= UR2.x)

{

if(UR1.y>=LL2.y && UR1.y <= UR2.y)

{

//vb.push_back(LL1);

New_UR.x=UR1.x;

New_UR.y=UR1.y;

New_UL.x=(UL1.x<=UL2.x?UL2.x:UL1.x);

New_UL.y=New_UR.y;

New_LL.x= New_UL.x;

New_LL.y= (LL1.y<=LL2.y?LL2.y:LL1.y);

New_LR.x=New_UR.x;

New_LR.y=New_LL.y;

return 0;

}

New_UR.x=UR1.x;

New_UR.y=(UR1.y<=UR2.y?UR1.y:UR2.y);

New_LL.x=(LL1.x>=LL2.x?LL1.x:LL2.x);

New_LL.y=(LL1.y>=LL2.y?LL1.y:LL2.y);

return 0;

}

if(UL1.x>=LL2.x && UL1.x <= UR2.x)

{

if(UL1.y>=LL2.y && UL1.y <= UR2.y)

{

//vb.push_back(LL1);

New_UL.x=UL1.x;

New_UL.y=UL1.y;

New_UR.x=(UR1.x<=UR2.x?UR1.x:UR2.x);

New_UR.y=New_UL.y;

New_LL.x= New_UL.x;

New_LL.y= (LL1.y<=LL2.y?LL2.y:LL1.y);

New_LR.x=New_UR.x;

New_LR.y=New_LL.y;

return 0;

}

New_LL.x=UL1.x;

New_LL.y=(LL1.y>=LL2.y?LL1.y:LL2.y);

New_UR.x=(UR1.x<=UR2.x?UR1.x:UR2.x);

New_UR.y=(UR1.y<=UR2.y?UR2.y:UR1.y);

return 0;

}

return -1;

}

int main()

{

int t;

int length1,length2,width1,width2;

scanf("%d",&t);

while(t--)

{

scanf("%d%d%d%d",&LL1.x,&LL1.y,&UR1.x,&UR1.y);

scanf("%d%d%d%d",&LL2.x,&LL2.y,&UR2.x,&UR2.y);

length1 = abs(LL1.x - UR1.x);

width1 = abs(LL1.y - UR1.y);

length2 = abs(LL2.x - UR2.x);

width2 = abs(LL2.y - UR2.y);

LR1.x = UR1.x; LR1.y = LL1.y;

UL1.x = LL1.x; UL1.y = UR1.y;

LR2.x = UR2.x; LR2.y = LL2.y;

UL2.x = LL2.x; UL2.y = UR2.y;

if(!isOverlap())

{

printf("No Overlap\n");

if(t)

printf("\n");

continue;

}

if(InsidePoints()==0)

printf("%d %d %d %d\n",New_LL.x,New_LL.y,New_UR.x,New_UR.y);

if(t)

printf("\n");

}

return 0;

}

107

Asif NaeemApril 5, 2016

#include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>

#define ll long long
#define MOD 1000000007
using namespace std;

int _pow(int n,int p)
{
	if(p==0)
		return 1;
	else
		return n*_pow(n,p-1);
}

int isAnyRoot(int a,int b)
{
	if(a%b!=0)
		return -1;
	int cnt=0;
	while(a>=b)
	{
		cnt+=1;
		a=a/b;
		if(a>=b && a%b!=0)
			return -1;
	}
	return cnt;
}
int main()
{
	//cout<<_pow(6,2)<<"\n";
	int H,W,m,n,non_working_cat;
	int c1,c2;
	int total_non_working_cat , height_of_the_cat_stack , height_of_each_internal_cat;
	while(scanf("%d%d",&H,&W),H!=0,W!=0)
	{
		if(H==1)
		{
			printf("%d %d\n",0,H);
			continue;
		}
		//that means there is one working cat ; so there can be two possible scenarios
		//1. if the height of the initial cat is nth power of 2,
		//i.e. just next(inside of which hat working cat is staying) non working cat
		//whose height should be 2 so that 2/N+1==1;
		// In this acse total non working cat will be n (2^n=initial height), and height of the cat stack = 2+4+...2^n
		//2. if the height of the initial cat is not nth power of 2; then 1=(Height)/N+1, so N+1=Height,
		//means total cat= Height of the initial cat
		//only one is non working rest are working cat
		//and total height should be (N*1+initial height) or (N*1+1) if they are considered in a same ground
		if(W==1)
		{
			m = isAnyRoot(H,2);
			if(m!=-1)
			{
				printf("%d %d\n",m,_pow(2,m+1)-1);
			}
			else
			{
				printf("%d %d\n",1,2*H-1);
			}
			continue;
		}
		/*
		m=0;
		while(++m)
		{
			n = pow(W*1.0,1.0/m);
			if(H<=pow(n+1, m))
			break;
		}*/
		n=1;
		while(1)
		{
			n+=1;
			c1 = isAnyRoot(W,n);
			c2 = isAnyRoot(H,n+1);
			if(c1==c2 && c1!=-1)
				break;
		}
		m=c1;
		total_non_working_cat = 0;
		height_of_the_cat_stack = 0;
		for(int i=0;i<m;i++)
		{
			non_working_cat = _pow(n,i);
			total_non_working_cat += non_working_cat;
			height_of_each_internal_cat = (H/_pow(n+1,i));
			height_of_the_cat_stack += (non_working_cat*height_of_each_internal_cat);
		}
		height_of_the_cat_stack += W;//as working cats are of height 1.
		printf("%d %d\n",total_non_working_cat,height_of_the_cat_stack);
	}
	return 0;
}

#include <iostream>

#include <cstdio>

#include <cmath>

#include <vector>

#define ll long long

#define MOD 1000000007

using namespace std;

int _pow(int n,int p)

{

if(p==0)

return 1;

else

return n*_pow(n,p-1);

}

int isAnyRoot(int a,int b)

{

if(a%b!=0)

return -1;

int cnt=0;

while(a>=b)

{

cnt+=1;

a=a/b;

if(a>=b && a%b!=0)

return -1;

}

return cnt;

}

int main()

{

//cout<<_pow(6,2)<<"\n";

int H,W,m,n,non_working_cat;

int c1,c2;

int total_non_working_cat , height_of_the_cat_stack , height_of_each_internal_cat;

while(scanf("%d%d",&H,&W),H!=0,W!=0)

{

if(H==1)

{

printf("%d %d\n",0,H);

continue;

}

//that means there is one working cat ; so there can be two possible scenarios

//1. if the height of the initial cat is nth power of 2,

//i.e. just next(inside of which hat working cat is staying) non working cat

//whose height should be 2 so that 2/N+1==1;

// In this acse total non working cat will be n (2^n=initial height), and height of the cat stack = 2+4+...2^n

//2. if the height of the initial cat is not nth power of 2; then 1=(Height)/N+1, so N+1=Height,

//means total cat= Height of the initial cat

//only one is non working rest are working cat

//and total height should be (N*1+initial height) or (N*1+1) if they are considered in a same ground

if(W==1)

{

m = isAnyRoot(H,2);

if(m!=-1)

{

printf("%d %d\n",m,_pow(2,m+1)-1);

}

else

{

printf("%d %d\n",1,2*H-1);

}

continue;

}

m=0;

while(++m)

{

n = pow(W*1.0,1.0/m);

if(H<=pow(n+1, m))

break;

}*/

n=1;

while(1)

{

n+=1;

c1 = isAnyRoot(W,n);

c2 = isAnyRoot(H,n+1);

if(c1==c2 && c1!=-1)

break;

}

m=c1;

total_non_working_cat = 0;

height_of_the_cat_stack = 0;

for(int i=0;i<m;i++)

{

non_working_cat = _pow(n,i);

total_non_working_cat += non_working_cat;

height_of_each_internal_cat = (H/_pow(n+1,i));

height_of_the_cat_stack += (non_working_cat*height_of_each_internal_cat);

}

height_of_the_cat_stack += W;//as working cats are of height 1.

printf("%d %d\n",total_non_working_cat,height_of_the_cat_stack);

}

return 0;

}

278

Asif NaeemApril 3, 2016

#include <iostream>
#include <cstdio>

using namespace std;

int main()
{
	int t;
	int row,col;
	char ch,c;
	scanf("%d%c",&t,&ch);
	while(t--)
	{
		scanf("%c%d%d%c",&ch,&row,&col,&c);
		if(ch=='r')
		{
			printf("%d\n",(row<=col?row:col));
		}
		else if(ch=='k')
		{
			//knight alwsy attacks of the other color squares, so total non attacking
			//knighta are = half of the area
			//if total square is odd, i.e. dimensions are odd then total non attacking knights = half of the area +1
			printf("%d\n",((row*col)+1)/2);
		}
		else if(ch=='K')
		{
			//for each 2x2 there is one King can be set
			printf("%d\n",((row+1)/2)*((col+1)/2));
		}
		else if(ch=='Q')
		{
			printf("%d\n",(row<=col?row:col));
		}
	}
	return 0;
}

#include <iostream>

#include <cstdio>

using namespace std;

int main()

{

int t;

int row,col;

char ch,c;

scanf("%d%c",&t,&ch);

while(t--)

{

scanf("%c%d%d%c",&ch,&row,&col,&c);

if(ch=='r')

{

printf("%d\n",(row<=col?row:col));

}

else if(ch=='k')

{

//knight alwsy attacks of the other color squares, so total non attacking

//knighta are = half of the area

//if total square is odd, i.e. dimensions are odd then total non attacking knights = half of the area +1

printf("%d\n",((row*col)+1)/2);

}

else if(ch=='K')

{

//for each 2x2 there is one King can be set

printf("%d\n",((row+1)/2)*((col+1)/2));

}

else if(ch=='Q')

{

printf("%d\n",(row<=col?row:col));

}

return 0;

}

Month: April 2016

10170

974

696

661

594

474

471

460

107

278

Archives

Categories