September 2015 – Live with passion

314

Asif NaeemSeptember 23, 2015

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

#define NORTH 0
#define EAST 1
#define SOUTH 2
#define WEST 3

using namespace std;

struct State{
	int x,y,dir;
	int val;
};

int r,c;
int gr[55][55][4];
string face;
int bx,by,ex,ey;

void bfs()
{
	int dir;
	queue<int> q;
	if(face=="south")
	dir=SOUTH;
	else if(face=="north")
	dir=NORTH;
	else if(face=="east")
	dir=EAST;
	else if(face=="west")
	dir=WEST;
	q.push(bx);q.push(by);q.push(dir);q.push(0);
	int x,y,d,v;
	while(!q.empty())
	{
		x = q.front();q.pop();
		y = q.front();q.pop();
		d = q.front();q.pop();
		v = q.front();q.pop();
		//cout<<x<<" "<<y<<"\n";
		gr[x][y][d]=1;
		if(ex==x && ey==y)
		{
			printf("%d\n",v);return;
		}
		if(d==NORTH)
		{
			if(gr[x][y][WEST]==0)
			{
				q.push(x);q.push(y);
				q.push(WEST);
				q.push(v+1);
			}
			if(gr[x][y][EAST]==0)
			{
				q.push(x);q.push(y);
				q.push(EAST);
				q.push(v+1);
			}

			if(x-1>0 && gr[x-1][y][d]==0)
			{
				q.push(x-1);q.push(y);q.push(d);
				q.push(v+1);
			}
			if(x-2>0 && gr[x-2][y][d]==0 && gr[x-1][y][d]==0)
			{
				q.push(x-2);q.push(y);q.push(d);
				q.push(v+1);
			}
			if(x-3>0 && gr[x-3][y][d]==0 && gr[x-2][y][d]==0 && gr[x-1][y][d]==0)
			{
				q.push(x-3);q.push(y);q.push(d);
				q.push(v+1);
			}
		}
		else if(d==EAST)
		{
			if(gr[x][y][NORTH]==0)
			{
				q.push(x);q.push(y);
				q.push(NORTH);
				q.push(v+1);
			}
			if(gr[x][y][SOUTH]==0)
			{
				q.push(x);q.push(y);
				q.push(SOUTH);
				q.push(v+1);
			}

			if(y+1<c && gr[x][y+1][d]==0)
			{
				q.push(x);q.push(y+1);q.push(d);
				q.push(v+1);
			}
			if(y+2<c && gr[x][y+2][d]==0 && gr[x][y+1][d]==0)
			{
				q.push(x);q.push(y+2);q.push(d);
				q.push(v+1);
			}
			if(y+3<c && gr[x][y+3][d]==0 && gr[x][y+2][d]==0 && gr[x][y+1][d]==0)
			{
				q.push(x);q.push(y+3);q.push(d);
				q.push(v+1);
			}
		}
		else if(d==WEST)
		{
			if(gr[x][y][NORTH]==0)
			{
				q.push(x);q.push(y);
				q.push(NORTH);
				q.push(v+1);
			}
			if(gr[x][y][SOUTH]==0)
			{
				q.push(x);q.push(y);
				q.push(SOUTH);
				q.push(v+1);
			}

			if(y-1>0 && gr[x][y-1][d]==0)
			{
				q.push(x);q.push(y-1);q.push(d);
				q.push(v+1);
			}
			if(y-2>0 && gr[x][y-2][d]==0 && gr[x][y-1][d]==0)
			{
				q.push(x);q.push(y-2);q.push(d);
				q.push(v+1);
			}
			if(y-3>0 && gr[x][y-3][d]==0 && gr[x][y-2][d]==0 && gr[x][y-1][d]==0)
			{
				q.push(x);q.push(y-3);q.push(d);
				q.push(v+1);
			}
		}
		else if(d==SOUTH)
		{
			if(gr[x][y][WEST]==0)
			{
				q.push(x);q.push(y);
				q.push(WEST);
				q.push(v+1);
			}
			if(gr[x][y][EAST]==0)
			{
				q.push(x);q.push(y);
				q.push(EAST);
				q.push(v+1);
			}

			if(x+1<r && gr[x+1][y][d]==0)
			{
				q.push(x+1);q.push(y);q.push(d);
				q.push(v+1);
			}
			if(x+2<r && gr[x+2][y][d]==0 && gr[x+1][y][d]==0)
			{
				q.push(x+2);q.push(y);q.push(d);
				q.push(v+1);
			}
			if(x+3<r && gr[x+3][y][d]==0 && gr[x+2][y][d]==0 && gr[x+1][y][d]==0)
			{
				q.push(x+3);q.push(y);q.push(d);
				q.push(v+1);
			}
		}


	}
	printf("-1\n");return;
}

int main()
{
	int a;
	while(scanf("%d%d",&r,&c))
	{
		if(r+c==0)
		break;
		memset(gr,0,sizeof(gr));

		for(int i=0;i<r;i++)
		{
			for(int j=0;j<c;j++)
				{
					scanf("%d",&a);
					if(a)
					{
						for(int k=0;k<4;k++)
						{
							gr[i][j][k]=a;gr[i+1][j+1][k]=a;
							gr[i+1][j][k]=a;gr[i][j+1][k]=a;
						}
					}
				}
		}
		scanf("%d%d%d%d",&bx,&by,&ex,&ey);
		cin>>face;
		bfs();
	}
	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

#include <iostream>

#include <cstdio>

#include <cstring>

#include <queue>

#include <string>

#define NORTH 0

#define EAST 1

#define SOUTH 2

#define WEST 3

using namespace std;

struct State{

int x,y,dir;

int val;

};

int r,c;

int gr[55][55][4];

string face;

int bx,by,ex,ey;

void bfs()

{

int dir;

queue<int> q;

if(face=="south")

dir=SOUTH;

else if(face=="north")

dir=NORTH;

else if(face=="east")

dir=EAST;

else if(face=="west")

dir=WEST;

q.push(bx);q.push(by);q.push(dir);q.push(0);

int x,y,d,v;

while(!q.empty())

{

x = q.front();q.pop();

y = q.front();q.pop();

d = q.front();q.pop();

v = q.front();q.pop();

//cout<<x<<" "<<y<<"\n";

gr[x][y][d]=1;

if(ex==x && ey==y)

{

printf("%d\n",v);return;

}

if(d==NORTH)

{

if(gr[x][y][WEST]==0)

{

q.push(x);q.push(y);

q.push(WEST);

q.push(v+1);

}

if(gr[x][y][EAST]==0)

{

q.push(x);q.push(y);

q.push(EAST);

q.push(v+1);

}

if(x-1>0 && gr[x-1][y][d]==0)

{

q.push(x-1);q.push(y);q.push(d);

q.push(v+1);

}

if(x-2>0 && gr[x-2][y][d]==0 && gr[x-1][y][d]==0)

{

q.push(x-2);q.push(y);q.push(d);

q.push(v+1);

}

if(x-3>0 && gr[x-3][y][d]==0 && gr[x-2][y][d]==0 && gr[x-1][y][d]==0)

{

q.push(x-3);q.push(y);q.push(d);

q.push(v+1);

}

else if(d==EAST)

{

if(gr[x][y][NORTH]==0)

{

q.push(x);q.push(y);

q.push(NORTH);

q.push(v+1);

}

if(gr[x][y][SOUTH]==0)

{

q.push(x);q.push(y);

q.push(SOUTH);

q.push(v+1);

}

if(y+1<c && gr[x][y+1][d]==0)

{

q.push(x);q.push(y+1);q.push(d);

q.push(v+1);

}

if(y+2<c && gr[x][y+2][d]==0 && gr[x][y+1][d]==0)

{

q.push(x);q.push(y+2);q.push(d);

q.push(v+1);

}

if(y+3<c && gr[x][y+3][d]==0 && gr[x][y+2][d]==0 && gr[x][y+1][d]==0)

{

q.push(x);q.push(y+3);q.push(d);

q.push(v+1);

}

else if(d==WEST)

{

if(gr[x][y][NORTH]==0)

{

q.push(x);q.push(y);

q.push(NORTH);

q.push(v+1);

}

if(gr[x][y][SOUTH]==0)

{

q.push(x);q.push(y);

q.push(SOUTH);

q.push(v+1);

}

if(y-1>0 && gr[x][y-1][d]==0)

{

q.push(x);q.push(y-1);q.push(d);

q.push(v+1);

}

if(y-2>0 && gr[x][y-2][d]==0 && gr[x][y-1][d]==0)

{

q.push(x);q.push(y-2);q.push(d);

q.push(v+1);

}

if(y-3>0 && gr[x][y-3][d]==0 && gr[x][y-2][d]==0 && gr[x][y-1][d]==0)

{

q.push(x);q.push(y-3);q.push(d);

q.push(v+1);

}

else if(d==SOUTH)

{

if(gr[x][y][WEST]==0)

{

q.push(x);q.push(y);

q.push(WEST);

q.push(v+1);

}

if(gr[x][y][EAST]==0)

{

q.push(x);q.push(y);

q.push(EAST);

q.push(v+1);

}

if(x+1<r && gr[x+1][y][d]==0)

{

q.push(x+1);q.push(y);q.push(d);

q.push(v+1);

}

if(x+2<r && gr[x+2][y][d]==0 && gr[x+1][y][d]==0)

{

q.push(x+2);q.push(y);q.push(d);

q.push(v+1);

}

if(x+3<r && gr[x+3][y][d]==0 && gr[x+2][y][d]==0 && gr[x+1][y][d]==0)

{

q.push(x+3);q.push(y);q.push(d);

q.push(v+1);

}

printf("-1\n");return;

}

int main()

{

int a;

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

{

if(r+c==0)

break;

memset(gr,0,sizeof(gr));

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

{

for(int j=0;j<c;j++)

{

scanf("%d",&a);

if(a)

{

for(int k=0;k<4;k++)

{

gr[i][j][k]=a;gr[i+1][j+1][k]=a;

gr[i+1][j][k]=a;gr[i][j+1][k]=a;

}

scanf("%d%d%d%d",&bx,&by,&ex,&ey);

cin>>face;

bfs();

}

return 0;

}

11970

Asif NaeemSeptember 22, 2015

#include <iostream>
#include <cstdio>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
#include <cstring>
#include <cmath>

#define ll long long
using namespace std;
vector<ll> v;
int main()
{
	int t;
	ll n,sq,sq_root,x;
	int kase=1;
	scanf("%d",&t);

	while(t--)
	{
		scanf("%lld",&n);
		sq=0;
		int k=0;
		v.clear();
		for(ll i=0;;i++)
		{
			sq += 2*i+1;
			sq_root=i+1;
			if(sq>=n)
			break;
			x = n-sq;
			if(x%sq_root==0 && x!=0)
			v.push_back(x);
		}
		printf("Case %d:",kase++);
		for(int i=v.size()-1;i>=0;i--)
		printf(" %lld",v[i]);
		printf("\n");
	}
	return 0;
}

#include <iostream>

#include <cstdio>

#include <queue>

#include <sstream>

#include <string>

#include <vector>

#include <cstring>

#include <cmath>

#define ll long long

using namespace std;

vector<ll> v;

int main()

{

int t;

ll n,sq,sq_root,x;

int kase=1;

scanf("%d",&t);

while(t--)

{

scanf("%lld",&n);

sq=0;

int k=0;

v.clear();

for(ll i=0;;i++)

{

sq += 2*i+1;

sq_root=i+1;

if(sq>=n)

break;

x = n-sq;

if(x%sq_root==0 && x!=0)

v.push_back(x);

}

printf("Case %d:",kase++);

for(int i=v.size()-1;i>=0;i--)

printf(" %lld",v[i]);

printf("\n");

}

return 0;

}

12136

Asif NaeemSeptember 22, 2015

#include <iostream>
#include <cstdio>
#include <queue>
#include <sstream>
#include <string>
#include <cstring>
#include <cmath>

using namespace std;

int main()
{
	int t;
	int kase=1;
	int hr1,hr2,hr3,hr4;
	int t1,t2,t3,t4;
	int mn1,mn2,mn3,mn4;
	string str1,str2,str3,str4;
	scanf("%d",&t);

	while(t--)
	{
		cin>>str1>>str2;
		cin>>str3>>str4;

		hr1=hr2=hr3=hr4=0;
		mn1=mn2=mn3=mn4=0;

		hr1=str1[0]-'0';hr1*=10;
		hr1+=(str1[1]-'0');

		hr2=str2[0]-'0';hr2*=10;
		hr2+=(str2[1]-'0');

		hr3=str3[0]-'0';hr3*=10;
		hr3+=(str3[1]-'0');

		hr4=str4[0]-'0';hr4*=10;
		hr4+=(str4[1]-'0');

		mn1=str1[3]-'0';mn1*=10;
		mn1+=(str1[4]-'0');

		mn2=str2[3]-'0';mn2*=10;
		mn2+=(str2[4]-'0');

		mn3=str3[3]-'0';mn3*=10;
		mn3+=(str3[4]-'0');

		mn4=str4[3]-'0';mn4*=10;
		mn4+=(str4[4]-'0');

		t1 = hr1*60+mn1;
		t2 = hr2*60+mn2;
		t3 = hr3*60+mn3;
		t4 = hr4*60+mn4;

		/*
		if(hr3>=hr1 && hr3<=hr2)
		{
			printf("Case %d: Mrs Meeting\n",kase++);
		}
		else if(hr3==hr2)
		{
			if(mn3<=mn2)
			printf("Case %d: Mrs Meeting\n",kase++);
			else
			printf("Case %d: Hits Meeting\n",kase++);
		}
		else if(hr4==hr1)
		{
			if(mn1<=mn4)
			printf("Case %d: Mrs Meeting\n",kase++);
			else
			printf("Case %d: Hits Meeting\n",kase++);
		}
		else
		printf("Case %d: Hits Meeting\n",kase++);
		*/
		if(t1>=t3 && t1<=t4)
		printf("Case %d: Mrs Meeting\n",kase++);
		else if(t3>=t1 && t3<=t2)
		printf("Case %d: Mrs Meeting\n",kase++);
		else
		printf("Case %d: Hits Meeting\n",kase++);

	}
	return 0;
}

#include <iostream>

#include <cstdio>

#include <queue>

#include <sstream>

#include <string>

#include <cstring>

#include <cmath>

using namespace std;

int main()

{

int t;

int kase=1;

int hr1,hr2,hr3,hr4;

int t1,t2,t3,t4;

int mn1,mn2,mn3,mn4;

string str1,str2,str3,str4;

scanf("%d",&t);

while(t--)

{

cin>>str1>>str2;

cin>>str3>>str4;

hr1=hr2=hr3=hr4=0;

mn1=mn2=mn3=mn4=0;

hr1=str1[0]-'0';hr1*=10;

hr1+=(str1[1]-'0');

hr2=str2[0]-'0';hr2*=10;

hr2+=(str2[1]-'0');

hr3=str3[0]-'0';hr3*=10;

hr3+=(str3[1]-'0');

hr4=str4[0]-'0';hr4*=10;

hr4+=(str4[1]-'0');

mn1=str1[3]-'0';mn1*=10;

mn1+=(str1[4]-'0');

mn2=str2[3]-'0';mn2*=10;

mn2+=(str2[4]-'0');

mn3=str3[3]-'0';mn3*=10;

mn3+=(str3[4]-'0');

mn4=str4[3]-'0';mn4*=10;

mn4+=(str4[4]-'0');

t1 = hr1*60+mn1;

t2 = hr2*60+mn2;

t3 = hr3*60+mn3;

t4 = hr4*60+mn4;

if(hr3>=hr1 && hr3<=hr2)

{

printf("Case %d: Mrs Meeting\n",kase++);

}

else if(hr3==hr2)

{

if(mn3<=mn2)

printf("Case %d: Mrs Meeting\n",kase++);

else

printf("Case %d: Hits Meeting\n",kase++);

}

else if(hr4==hr1)

{

if(mn1<=mn4)

printf("Case %d: Mrs Meeting\n",kase++);

else

printf("Case %d: Hits Meeting\n",kase++);

}

else

printf("Case %d: Hits Meeting\n",kase++);

if(t1>=t3 && t1<=t4)

printf("Case %d: Mrs Meeting\n",kase++);

else if(t3>=t1 && t3<=t2)

printf("Case %d: Mrs Meeting\n",kase++);

else

printf("Case %d: Hits Meeting\n",kase++);

}

return 0;

}

298

Asif NaeemSeptember 21, 2015

#include <iostream>
#include <cstdio>
#include <queue>
#include <sstream>
#include <string>
#include <cstring>
#include <cmath>

using namespace std;

bool gr[30][30][7][7];
//bool gr2D[30][30];

struct Point{
	int x,y,velocity,accleration;
	int val;
};
Point St,Fn;
int m,n;

void bfs()
{
	int x,y,v,a,val;
	int dx,dy,tx,ty;
	queue<int> q;
	q.push(St.x);q.push(St.y);
	q.push(0);q.push(0);q.push(0);
	gr[St.x][St.y][0+3][0+3]=1;

	while(!q.empty())
	{
		x=q.front();q.pop();
		y=q.front();q.pop();
		v=q.front();q.pop();
		a=q.front();q.pop();
		val = q.front();q.pop();
		//cout<<x<<" "<<y<<" "<<v<<" "<<a<<" "<<val<<"\n";
		if(x==Fn.x && y ==Fn.y)
		{
			printf("Optimal solution takes %d hops.\n", val);
			return;
		}
		for(int i=-1;i<=1;i++)
			for(int j=-1;j<=1;j++)
			{
				tx = v+i; ty = a+j;
				if(abs(tx)<=3 && abs(ty)<=3)
				{
					dx = x+v+i; dy = y+a+j;
					if(dx>=0 && dx<m && dy>=0 && dy<n && gr[dx][dy][tx+3][ty+3]==0)
					{
						//if(gr2D[dx][dy])
						//continue;
						gr[dx][dy][tx+3][ty+3]=1;
						q.push(dx); q.push(dy); q.push(tx); q.push(ty);
						q.push(val+1);
					}
				}
			}
	}
	printf("No solution.\n");
}

int main()
{
	int t,p;
	scanf("%d",&t);
	int x1,x2,y1,y2;
	Point A,B;
	while(t--)
	{
		scanf("%d%d",&m,&n);
		memset(gr,0,sizeof(gr));
		//memset(gr,0,sizeof(gr2D));
		scanf("%d%d%d%d",&St.x,&St.y,&Fn.x,&Fn.y);
		scanf("%d",&p);
		bool flag=1;
		while(p--)
		{
			scanf("%d%d%d%d",&x1,&x2,&y1,&y2);
			for(int i=x1;i<=x2;i++)
			{
				for(int j=y1;j<=y2;j++)
				{
					//gr2D[i][j]=1;
					for(int k=0;k<7;k++)
					{
						for(int l=0;l<7;l++)
						{
							gr[i][j][k][l]=1;
							if(i==Fn.x && j==Fn.y)
								flag=0;
						}
					}
				}
			}
		}
		if(St.x==Fn.x && St.y==Fn.y)
		printf("Optimal solution takes 0 hops.\n");
		else
		{
			if(flag==0)
			printf("No solution.\n");
			else
			bfs();
		}
	}
	return 0;
}

100

101

102

103

104

105

106

107

108

109

#include <iostream>

#include <cstdio>

#include <queue>

#include <sstream>

#include <string>

#include <cstring>

#include <cmath>

using namespace std;

bool gr[30][30][7][7];

//bool gr2D[30][30];

struct Point{

int x,y,velocity,accleration;

int val;

};

Point St,Fn;

int m,n;

void bfs()

{

int x,y,v,a,val;

int dx,dy,tx,ty;

queue<int> q;

q.push(St.x);q.push(St.y);

q.push(0);q.push(0);q.push(0);

gr[St.x][St.y][0+3][0+3]=1;

while(!q.empty())

{

x=q.front();q.pop();

y=q.front();q.pop();

v=q.front();q.pop();

a=q.front();q.pop();

val = q.front();q.pop();

//cout<<x<<" "<<y<<" "<<v<<" "<<a<<" "<<val<<"\n";

if(x==Fn.x && y ==Fn.y)

{

printf("Optimal solution takes %d hops.\n", val);

return;

}

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

for(int j=-1;j<=1;j++)

{

tx = v+i; ty = a+j;

if(abs(tx)<=3 && abs(ty)<=3)

{

dx = x+v+i; dy = y+a+j;

if(dx>=0 && dx<m && dy>=0 && dy<n && gr[dx][dy][tx+3][ty+3]==0)

{

//if(gr2D[dx][dy])

//continue;

gr[dx][dy][tx+3][ty+3]=1;

q.push(dx); q.push(dy); q.push(tx); q.push(ty);

q.push(val+1);

}

printf("No solution.\n");

}

int main()

{

int t,p;

scanf("%d",&t);

int x1,x2,y1,y2;

Point A,B;

while(t--)

{

scanf("%d%d",&m,&n);

memset(gr,0,sizeof(gr));

//memset(gr,0,sizeof(gr2D));

scanf("%d%d%d%d",&St.x,&St.y,&Fn.x,&Fn.y);

scanf("%d",&p);

bool flag=1;

while(p--)

{

scanf("%d%d%d%d",&x1,&x2,&y1,&y2);

for(int i=x1;i<=x2;i++)

{

for(int j=y1;j<=y2;j++)

{

//gr2D[i][j]=1;

for(int k=0;k<7;k++)

{

for(int l=0;l<7;l++)

{

gr[i][j][k][l]=1;

if(i==Fn.x && j==Fn.y)

flag=0;

}

if(St.x==Fn.x && St.y==Fn.y)

printf("Optimal solution takes 0 hops.\n");

else

{

if(flag==0)

printf("No solution.\n");

else

bfs();

}

return 0;

}

11121

Asif NaeemSeptember 18, 2015

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

#define INF 1000000
#define ll long long

using namespace std;

int main()
{
	int t,kase=1;
	ll n;
	int a=-2,b=-3;
	//cout<<a%2<<" "<<b%2<<"\n";
	string str;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%lld",&n);
		if(n==0)
		{
			printf("Case #%d: ",kase++);
			printf("0\n");
			continue;
		}
		str="";
		while(n)
		{
			if(n%2)
			{
				//cout<<"got\n";
				str.append(1u,'1');
				n -= 1;n/=(-2);
			}
			else
			{
				n/=(-2);
				//if(str.size())
				str.append(1u,'0');
			}
		}
		printf("Case #%d: ",kase++);
		for(int i=str.size()-1;i>=0;i--)
		printf("%c",str[i]);
		printf("\n");
	}
	return 0;
}

#include <iostream>

#include <cstdio>

#include <cstring>

#include <string>

#include <vector>

#include <cmath>

#include <cstdlib>

#define INF 1000000

#define ll long long

using namespace std;

int main()

{

int t,kase=1;

ll n;

int a=-2,b=-3;

//cout<<a%2<<" "<<b%2<<"\n";

string str;

scanf("%d",&t);

while(t--)

{

scanf("%lld",&n);

if(n==0)

{

printf("Case #%d: ",kase++);

printf("0\n");

continue;

}

str="";

while(n)

{

if(n%2)

{

//cout<<"got\n";

str.append(1u,'1');

n -= 1;n/=(-2);

}

else

{

n/=(-2);

//if(str.size())

str.append(1u,'0');

}

printf("Case #%d: ",kase++);

for(int i=str.size()-1;i>=0;i--)

printf("%c",str[i]);

printf("\n");

}

return 0;

}

12459

Asif NaeemSeptember 17, 2015

#include <iostream>
#include <cstdio>
#include <cstdio>
#include <cstring>
#include <vector>
#include <cmath>
#include <cstdlib>
#include <fstream>

#define INF 1000000
#define ll long long

using namespace std;

struct node{
ll female,male,sum;
};
int main()
{

	node fib[85];
	fib[1].female=0;
	fib[1].male=1;
	fib[1].sum=1;

	fib[2].female=1;
	fib[2].male=1;
	fib[2].sum=2;

	for(int i=3;i<85;i++)
	{
		fib[i].female=fib[i-1].sum;
		fib[i].male=fib[i-1].female;
		fib[i].sum=fib[i].male+fib[i].female;
	}
	int n;
	while(scanf("%d",&n))
	{
		if(n==0)
		break;
		printf("%lld\n",fib[n].sum);
	}
	return 0;
}

#include <iostream>

#include <cstdio>

#include <cstring>

#include <vector>

#include <cmath>

#include <cstdlib>

#include <fstream>

#define INF 1000000

#define ll long long

using namespace std;

struct node{

ll female,male,sum;

};

int main()

{

node fib[85];

fib[1].female=0;

fib[1].male=1;

fib[1].sum=1;

fib[2].female=1;

fib[2].male=1;

fib[2].sum=2;

for(int i=3;i<85;i++)

{

fib[i].female=fib[i-1].sum;

fib[i].male=fib[i-1].female;

fib[i].sum=fib[i].male+fib[i].female;

}

int n;

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

{

if(n==0)

break;

printf("%lld\n",fib[n].sum);

}

return 0;

}

12468

Asif NaeemSeptember 16, 2015

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

#define INF 1000000
#define ll long long

using namespace std;

int main()
{
	int m,n,diff1,diff2;
	while(scanf("%d%d",&m,&n) && m!=-1 && n!=-1)
	{
		if(m==-1 && n==-1)
		break;
		diff1 = abs(m-n);
		if(diff1<=50)
		printf("%d\n",diff1);
		else
		printf("%d\n",100-diff1);
	}
	return 0;
}

#include <iostream>

#include <cstdio>

#include <cstring>

#include <vector>

#include <cmath>

#include <cstdlib>

#define INF 1000000

#define ll long long

using namespace std;

int main()

{

int m,n,diff1,diff2;

while(scanf("%d%d",&m,&n) && m!=-1 && n!=-1)

{

if(m==-1 && n==-1)

break;

diff1 = abs(m-n);

if(diff1<=50)

printf("%d\n",diff1);

else

printf("%d\n",100-diff1);

}

return 0;

}

12611

Asif NaeemSeptember 16, 2015

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

#define INF 1000000
#define ll long long

using namespace std;

int main()
{
	int t,kase=1;
	double r,len,width;
	double up_left_x,up_left_y,up_right_x,up_right_y,lo_right_x,lo_right_y,lo_left_x,lo_left_y;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%lf",&r);
		len = r/.2;
		width = len*.6;

		up_left_x = (-len)*.45;
		up_left_y = width/2;

		up_right_x = (len)*.55;
		up_right_y = width/2;

		lo_right_x = (len)*.55;
		lo_right_y = (-width)/2;

		lo_left_x =  (-len)*.45;
		lo_left_y =  (-width)/2;

		printf("Case %d:\n",kase++);
		printf("%.0lf %.0lf\n",up_left_x,up_left_y);
		printf("%.0lf %.0lf\n",up_right_x,up_right_y);
		printf("%.0lf %.0lf\n",lo_right_x,lo_right_y);
		printf("%.0lf %.0lf\n",lo_left_x,lo_left_y);

	}
	return 0;
}

#include <iostream>

#include <cstdio>

#include <cstring>

#include <vector>

#include <cmath>

#include <cstdlib>

#define INF 1000000

#define ll long long

using namespace std;

int main()

{

int t,kase=1;

double r,len,width;

double up_left_x,up_left_y,up_right_x,up_right_y,lo_right_x,lo_right_y,lo_left_x,lo_left_y;

scanf("%d",&t);

while(t--)

{

scanf("%lf",&r);

len = r/.2;

width = len*.6;

up_left_x = (-len)*.45;

up_left_y = width/2;

up_right_x = (len)*.55;

up_right_y = width/2;

lo_right_x = (len)*.55;

lo_right_y = (-width)/2;

lo_left_x = (-len)*.45;

lo_left_y = (-width)/2;

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

printf("%.0lf %.0lf\n",up_left_x,up_left_y);

printf("%.0lf %.0lf\n",up_right_x,up_right_y);

printf("%.0lf %.0lf\n",lo_right_x,lo_right_y);

printf("%.0lf %.0lf\n",lo_left_x,lo_left_y);

}

return 0;

}

11715

Asif NaeemSeptember 15, 2015

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

#define INF 1000000
#define ll long long

using namespace std;

int main()
{
	int kase=1;
	int n;
	double u,v,t,a,s;
	while(scanf("%d",&n),n)
	{
		if(n==1)
		{
			scanf("%lf%lf%lf",&u,&v,&t);
			a = (v-u)/t;
			s=u*t+.5*a*(t*t);
			printf("Case %d: %.3lf %.3lf\n",kase++,s,a);
		}
		else if(n==2)
		{
			scanf("%lf%lf%lf",&u,&v,&a);
			t = (v-u)/a;
			s=u*t+.5*a*(t*t);
			printf("Case %d: %.3lf %.3lf\n",kase++,s,t);
		}
		else if(n==3)
		{
			scanf("%lf%lf%lf",&u,&a,&s);
			v = sqrt(u*u+2*a*s);
			t = (v-u)/a;
			printf("Case %d: %.3lf %.3lf\n",kase++,v,t);
		}
		else if(n==4)
		{
			scanf("%lf%lf%lf",&v,&a,&s);
			u = sqrt(v*v-2*a*s);
			t = (v-u)/a;
			printf("Case %d: %.3lf %.3lf\n",kase++,u,t);
		}
	}
	return 0;
}

#include <iostream>

#include <cstdio>

#include <cstring>

#include <vector>

#include <cmath>

#include <cstdlib>

#define INF 1000000

#define ll long long

using namespace std;

int main()

{

int kase=1;

int n;

double u,v,t,a,s;

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

{

if(n==1)

{

scanf("%lf%lf%lf",&u,&v,&t);

a = (v-u)/t;

s=u*t+.5*a*(t*t);

printf("Case %d: %.3lf %.3lf\n",kase++,s,a);

}

else if(n==2)

{

scanf("%lf%lf%lf",&u,&v,&a);

t = (v-u)/a;

s=u*t+.5*a*(t*t);

printf("Case %d: %.3lf %.3lf\n",kase++,s,t);

}

else if(n==3)

{

scanf("%lf%lf%lf",&u,&a,&s);

v = sqrt(u*u+2*a*s);

t = (v-u)/a;

printf("Case %d: %.3lf %.3lf\n",kase++,v,t);

}

else if(n==4)

{

scanf("%lf%lf%lf",&v,&a,&s);

u = sqrt(v*v-2*a*s);

t = (v-u)/a;

printf("Case %d: %.3lf %.3lf\n",kase++,u,t);

}

return 0;

}

11428

Asif NaeemSeptember 15, 2015

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

#define INF 1000000
#define ll long long

using namespace std;

struct node{
	int x,y;
};
node arr[10005];
int main()
{
	int n,diff;
	int difference_arr[10005];

	for(int i=2;i<61;i++)
	{
		for(int j=1;j<i;j++)
		{
			diff = i*i*i - j*j*j;
			if(diff>10001)
			continue;

			difference_arr[diff]=1;
			if(arr[diff].x==0 || arr[diff].y==0)
			{
				arr[diff].x=i;
				arr[diff].y=j;
			}
			else
			{
				if(arr[diff].y>j)
				{
					arr[diff].x=i;
					arr[diff].y=j;
				}
			}

		}
	}
	while(scanf("%d",&n),n)
	{

		if(difference_arr[n]==1)
			printf("%d %d\n",arr[n].x,arr[n].y);
		else
			printf("No solution\n");

	}
	return 0;
}

#include <iostream>

#include <cstdio>

#include <cstring>

#include <vector>

#include <cmath>

#include <cstdlib>

#define INF 1000000

#define ll long long

using namespace std;

struct node{

int x,y;

};

node arr[10005];

int main()

{

int n,diff;

int difference_arr[10005];

for(int i=2;i<61;i++)

{

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

{

diff = i*i*i - j*j*j;

if(diff>10001)

continue;

difference_arr[diff]=1;

if(arr[diff].x==0 || arr[diff].y==0)

{

arr[diff].x=i;

arr[diff].y=j;

}

else

{

if(arr[diff].y>j)

{

arr[diff].x=i;

arr[diff].y=j;

}

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

{

if(difference_arr[n]==1)

printf("%d %d\n",arr[n].x,arr[n].y);

else

printf("No solution\n");

}

return 0;

}

Month: September 2015

314

11970

12136

298

11121

12459

12468

12611

11715

11428

Archives

Categories