February 2015 – Live with passion

532

Asif NaeemFebruary 15, 2015

#include <iostream>
#include <string.h>
#include <vector>
#include <cstdio>
#include <queue>

#define ll long long
#define INF 100000000
using namespace std;


int gr[32][32][32];
bool visit[32][32][32];
int dist[32][32][32];
int x,y,z;
int ex,ey,ez;
int L,R,C;



void bfs()
{
	int tmp_x,tmp_y,tmp_z;
	queue<int> q;
	q.push(x);
	q.push(y);
	q.push(z);

	visit[x][y][z]=1;
	dist[x][y][z] = 0;
	while(!q.empty())
	{
		tmp_x = q.front();
		q.pop();
		tmp_y = q.front();
		q.pop();
		tmp_z = q.front();
		q.pop();

		if(tmp_z+1<L && !visit[tmp_x][tmp_y][tmp_z+1] && gr[tmp_x][tmp_y][tmp_z+1]!=4)
		{
			visit[tmp_x][tmp_y][tmp_z+1]=1;
			dist[tmp_x][tmp_y][tmp_z+1] = min(dist[tmp_x][tmp_y][tmp_z+1],dist[tmp_x][tmp_y][tmp_z]+1);
			q.push(tmp_x);
			q.push(tmp_y);
			q.push(tmp_z+1);
		}
		if(tmp_z-1>=0 && !visit[tmp_x][tmp_y][tmp_z-1] && gr[tmp_x][tmp_y][tmp_z-1]!=4)
		{
			visit[tmp_x][tmp_y][tmp_z-1]=1;
			dist[tmp_x][tmp_y][tmp_z-1] = min(dist[tmp_x][tmp_y][tmp_z-1],dist[tmp_x][tmp_y][tmp_z]+1);
			q.push(tmp_x);
			q.push(tmp_y);
			q.push(tmp_z-1);
		}
		if(tmp_x+1<R && !visit[tmp_x+1][tmp_y][tmp_z] && gr[tmp_x+1][tmp_y][tmp_z]!=4)
		{
			visit[tmp_x+1][tmp_y][tmp_z]=1;
			dist[tmp_x+1][tmp_y][tmp_z] = min(dist[tmp_x+1][tmp_y][tmp_z],dist[tmp_x][tmp_y][tmp_z]+1);
			q.push(tmp_x+1);
			q.push(tmp_y);
			q.push(tmp_z);
		}
		if(tmp_x-1>=0 && !visit[tmp_x-1][tmp_y][tmp_z] && gr[tmp_x-1][tmp_y][tmp_z]!=4)
		{
			visit[tmp_x-1][tmp_y][tmp_z]=1;
			dist[tmp_x-1][tmp_y][tmp_z] = min(dist[tmp_x-1][tmp_y][tmp_z],dist[tmp_x][tmp_y][tmp_z]+1);
			q.push(tmp_x-1);
			q.push(tmp_y);
			q.push(tmp_z);
		}
		if(tmp_y-1>=0 && !visit[tmp_x][tmp_y-1][tmp_z] && gr[tmp_x][tmp_y-1][tmp_z]!=4)
		{
			visit[tmp_x][tmp_y-1][tmp_z]=1;
			dist[tmp_x][tmp_y-1][tmp_z] = min(dist[tmp_x][tmp_y-1][tmp_z],dist[tmp_x][tmp_y][tmp_z]+1);
			q.push(tmp_x);
			q.push(tmp_y-1);
			q.push(tmp_z);
		}
		if(tmp_y+1<C && !visit[tmp_x][tmp_y+1][tmp_z] && gr[tmp_x][tmp_y+1][tmp_z]!=4)
		{
			q.push(tmp_x);
			q.push(tmp_y+1);
			q.push(tmp_z);
			visit[tmp_x][tmp_y+1][tmp_z]=1;
			dist[tmp_x][tmp_y+1][tmp_z]=min(dist[tmp_x][tmp_y+1][tmp_z],dist[tmp_x][tmp_y][tmp_z]+1);
		}
	}
}


int main()
{
	char c;
	while(cin>>L)
	{
		cin>>R>>C;
		if(L+R+C==0)
		break;

		for(int i=0;i<L;i++)
		{
			for(int j=0;j<R;j++)
			{
				for(int k=0;k<C;k++)
				{
					dist[j][k][i]=INF;
					visit[j][k][i]=0;
					cin>>c;
					if(c=='S')
					{
						gr[j][k][i]=0;//src = 0
						x=j;y=k;z=i;//R,C,L
					}
					if(c=='E')
					{
						gr[j][k][i]=2;//exit = 2;
						ex=j;ey=k;ez=i;
					}
					if(c=='.')
					{
						gr[j][k][i]=1;//can move =1
					}
					if(c=='#')
					{
						gr[j][k][i]=4;//cant move = 4
					}
				}//1st for loop
			}//2nd for loop
			getchar();
		}//3rd for loop
		bfs();
		if(dist[ex][ey][ez]==INF)
		{
			cout<<"Trapped!\n";
		}
		else
		{
			cout<<"Escaped in ";
			cout<<dist[ex][ey][ez]<<" minute(s).\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

#include <iostream>

#include <string.h>

#include <vector>

#include <cstdio>

#include <queue>

#define ll long long

#define INF 100000000

using namespace std;

int gr[32][32][32];

bool visit[32][32][32];

int dist[32][32][32];

int x,y,z;

int ex,ey,ez;

int L,R,C;

void bfs()

{

int tmp_x,tmp_y,tmp_z;

queue<int> q;

q.push(x);

q.push(y);

q.push(z);

visit[x][y][z]=1;

dist[x][y][z] = 0;

while(!q.empty())

{

tmp_x = q.front();

q.pop();

tmp_y = q.front();

q.pop();

tmp_z = q.front();

q.pop();

if(tmp_z+1<L && !visit[tmp_x][tmp_y][tmp_z+1] && gr[tmp_x][tmp_y][tmp_z+1]!=4)

{

visit[tmp_x][tmp_y][tmp_z+1]=1;

dist[tmp_x][tmp_y][tmp_z+1] = min(dist[tmp_x][tmp_y][tmp_z+1],dist[tmp_x][tmp_y][tmp_z]+1);

q.push(tmp_x);

q.push(tmp_y);

q.push(tmp_z+1);

}

if(tmp_z-1>=0 && !visit[tmp_x][tmp_y][tmp_z-1] && gr[tmp_x][tmp_y][tmp_z-1]!=4)

{

visit[tmp_x][tmp_y][tmp_z-1]=1;

dist[tmp_x][tmp_y][tmp_z-1] = min(dist[tmp_x][tmp_y][tmp_z-1],dist[tmp_x][tmp_y][tmp_z]+1);

q.push(tmp_x);

q.push(tmp_y);

q.push(tmp_z-1);

}

if(tmp_x+1<R && !visit[tmp_x+1][tmp_y][tmp_z] && gr[tmp_x+1][tmp_y][tmp_z]!=4)

{

visit[tmp_x+1][tmp_y][tmp_z]=1;

dist[tmp_x+1][tmp_y][tmp_z] = min(dist[tmp_x+1][tmp_y][tmp_z],dist[tmp_x][tmp_y][tmp_z]+1);

q.push(tmp_x+1);

q.push(tmp_y);

q.push(tmp_z);

}

if(tmp_x-1>=0 && !visit[tmp_x-1][tmp_y][tmp_z] && gr[tmp_x-1][tmp_y][tmp_z]!=4)

{

visit[tmp_x-1][tmp_y][tmp_z]=1;

dist[tmp_x-1][tmp_y][tmp_z] = min(dist[tmp_x-1][tmp_y][tmp_z],dist[tmp_x][tmp_y][tmp_z]+1);

q.push(tmp_x-1);

q.push(tmp_y);

q.push(tmp_z);

}

if(tmp_y-1>=0 && !visit[tmp_x][tmp_y-1][tmp_z] && gr[tmp_x][tmp_y-1][tmp_z]!=4)

{

visit[tmp_x][tmp_y-1][tmp_z]=1;

dist[tmp_x][tmp_y-1][tmp_z] = min(dist[tmp_x][tmp_y-1][tmp_z],dist[tmp_x][tmp_y][tmp_z]+1);

q.push(tmp_x);

q.push(tmp_y-1);

q.push(tmp_z);

}

if(tmp_y+1<C && !visit[tmp_x][tmp_y+1][tmp_z] && gr[tmp_x][tmp_y+1][tmp_z]!=4)

{

q.push(tmp_x);

q.push(tmp_y+1);

q.push(tmp_z);

visit[tmp_x][tmp_y+1][tmp_z]=1;

dist[tmp_x][tmp_y+1][tmp_z]=min(dist[tmp_x][tmp_y+1][tmp_z],dist[tmp_x][tmp_y][tmp_z]+1);

}

int main()

{

char c;

while(cin>>L)

{

cin>>R>>C;

if(L+R+C==0)

break;

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

{

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

{

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

{

dist[j][k][i]=INF;

visit[j][k][i]=0;

cin>>c;

if(c=='S')

{

gr[j][k][i]=0;//src = 0

x=j;y=k;z=i;//R,C,L

}

if(c=='E')

{

gr[j][k][i]=2;//exit = 2;

ex=j;ey=k;ez=i;

}

if(c=='.')

{

gr[j][k][i]=1;//can move =1

}

if(c=='#')

{

gr[j][k][i]=4;//cant move = 4

}

}//1st for loop

}//2nd for loop

getchar();

}//3rd for loop

bfs();

if(dist[ex][ey][ez]==INF)

{

cout<<"Trapped!\n";

}

else

{

cout<<"Escaped in ";

cout<<dist[ex][ey][ez]<<" minute(s).\n";

}

return 0;

}

10364

Asif NaeemFebruary 15, 2015

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>

#define ll long long

using namespace std;

int sz[25];
ll sum;
bool f;
int total_piece;
int stick_size;
bool visit[25];
int M;

bool cmp(int a,int b)
{
	return a>b;
}

bool backtrack(int present_size,int index,int piece_cnt)
{
	if(stick_size*piece_cnt==sum)
		return 1;
	for(int i=index;i<M;i++)
	{
		if(visit[i])
		continue;
		if(i>0 && !visit[i-1] && sz[i]==sz[i-1])
		continue;

		if(present_size+sz[i]==stick_size)
		{
			visit[i]=1;
			if(backtrack(0,0,piece_cnt+1))
			return 1;
			visit[i]=0;
			return 0;
		}
		else if(present_size+sz[i]<stick_size)
		{
			visit[i]=1;
			if(backtrack(present_size+sz[i],i+1,piece_cnt))
			return 1;
			visit[i]=0;
			if(present_size==0)
			return 0;
		}
	}
	return 0;
}

int main()
{
	int t;
	int mx_sz;
	cin>>t;

	while(t--)
	{
		cin>>M;
		mx_sz = 0;
		sum = 0;
		for(int i=0;i<M;i++)
		{
			cin>>sz[i];
			sum+=sz[i];
			if(sz[i]>mx_sz)
				mx_sz = sz[i];
		}
		if(sum%4)
		{
			cout<<"no\n";
			continue;
		}
		if(mx_sz>sum/4)
		{
			cout<<"no\n";
			continue;
		}
		sort(sz,sz+M,cmp);
		memset(visit,0,sizeof(visit));
		stick_size = sum/4;
		if(backtrack(0,0,0))
		cout<<"yes\n";
		else
		cout<<"no\n";
	}

	return 0;
}

#include <iostream>

#include <cstring>

#include <cstdio>

#include <algorithm>

#define ll long long

using namespace std;

int sz[25];

ll sum;

bool f;

int total_piece;

int stick_size;

bool visit[25];

int M;

bool cmp(int a,int b)

{

return a>b;

}

bool backtrack(int present_size,int index,int piece_cnt)

{

if(stick_size*piece_cnt==sum)

return 1;

for(int i=index;i<M;i++)

{

if(visit[i])

continue;

if(i>0 && !visit[i-1] && sz[i]==sz[i-1])

continue;

if(present_size+sz[i]==stick_size)

{

visit[i]=1;

if(backtrack(0,0,piece_cnt+1))

return 1;

visit[i]=0;

return 0;

}

else if(present_size+sz[i]<stick_size)

{

visit[i]=1;

if(backtrack(present_size+sz[i],i+1,piece_cnt))

return 1;

visit[i]=0;

if(present_size==0)

return 0;

}

return 0;

}

int main()

{

int t;

int mx_sz;

cin>>t;

while(t--)

{

cin>>M;

mx_sz = 0;

sum = 0;

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

{

cin>>sz[i];

sum+=sz[i];

if(sz[i]>mx_sz)

mx_sz = sz[i];

}

if(sum%4)

{

cout<<"no\n";

continue;

}

if(mx_sz>sum/4)

{

cout<<"no\n";

continue;

}

sort(sz,sz+M,cmp);

memset(visit,0,sizeof(visit));

stick_size = sum/4;

if(backtrack(0,0,0))

cout<<"yes\n";

else

cout<<"no\n";

}

return 0;

}

307

Asif NaeemFebruary 14, 2015

#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>

#define ll long long

/*
9
5 2 1 5 2 1 5 2 1
4
1 2 3 4
38
2 6 6 8 7 4 1 8 4 1 4 4 3 3 2 3 3 4 6 8 8 7 2 4 1 1 5 8 4 7 6 5 1 3 3 3 1 6
*/

using namespace std;
int sz[101];
ll sum;
bool f;
int total_piece;
int stick_size;
bool visit[101];
int n;

bool cmp(int a,int b)
{
	return a>b;
}

bool backtrack(int present_size,int index,int piece_count)//gainedlength,sticksize,piece count
{
	if(piece_count*stick_size==sum)
		return true;

	for(int i=index;i<n;i++)
	{
		if(visit[i])
			continue;
		if(i>0 && !visit[i-1] && sz[i]==sz[i-1])
			continue;
		if(sz[i]+present_size<stick_size)
		{
			visit[i] = 1;
			f = backtrack(sz[i]+present_size,i+1,piece_count);
			if(f)
			return 1;
			visit[i] = 0;
			if(present_size==0)
			return 0;
		}
		else if(sz[i]+present_size == stick_size)
		{
			visit[i] = 1;
			f = backtrack(0,0,piece_count+1);
			if(f)
			return 1;
			visit[i] = 0;
			return 0;
		}
	}

	return 0;
}

int main()
{
	int max_sz;

	while(cin>>n)
	{
		if(n==0)
		break;
		sum = 0;
		max_sz = 0;
		for(int i=0;i<n;i++)
		{
			cin>>sz[i];
			sum+=sz[i];
			if(sz[i]>max_sz)
			max_sz = sz[i];
		}

		sort(sz,sz+n,cmp);
		bool found = false;
		for(int stk= max_sz;stk<=sum;stk++)
		{
			if(sum%stk)
			continue;
			memset(visit,0,sizeof(visit));
			total_piece = sum/stk;
			stick_size = stk;

			if(backtrack(0,0,0))
			{
				cout<<stk<<"\n";
				found = 1;
				break;
			}
		}
	}

	return 0;
}

100

101

102

103

104

#include <iostream>

#include <cstring>

#include <cstdio>

#include <algorithm>

#define ll long long

5 2 1 5 2 1 5 2 1

1 2 3 4

2 6 6 8 7 4 1 8 4 1 4 4 3 3 2 3 3 4 6 8 8 7 2 4 1 1 5 8 4 7 6 5 1 3 3 3 1 6

using namespace std;

int sz[101];

ll sum;

bool f;

int total_piece;

int stick_size;

bool visit[101];

int n;

bool cmp(int a,int b)

{

return a>b;

}

bool backtrack(int present_size,int index,int piece_count)//gainedlength,sticksize,piece count

{

if(piece_count*stick_size==sum)

return true;

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

{

if(visit[i])

continue;

if(i>0 && !visit[i-1] && sz[i]==sz[i-1])

continue;

if(sz[i]+present_size<stick_size)

{

visit[i] = 1;

f = backtrack(sz[i]+present_size,i+1,piece_count);

if(f)

return 1;

visit[i] = 0;

if(present_size==0)

return 0;

}

else if(sz[i]+present_size == stick_size)

{

visit[i] = 1;

f = backtrack(0,0,piece_count+1);

if(f)

return 1;

visit[i] = 0;

return 0;

}

return 0;

}

int main()

{

int max_sz;

while(cin>>n)

{

if(n==0)

break;

sum = 0;

max_sz = 0;

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

{

cin>>sz[i];

sum+=sz[i];

if(sz[i]>max_sz)

max_sz = sz[i];

}

sort(sz,sz+n,cmp);

bool found = false;

for(int stk= max_sz;stk<=sum;stk++)

{

if(sum%stk)

continue;

memset(visit,0,sizeof(visit));

total_piece = sum/stk;

stick_size = stk;

if(backtrack(0,0,0))

{

cout<<stk<<"\n";

found = 1;

break;

}

return 0;

}

622

Asif NaeemFebruary 13, 2015

#include <iostream>
#include <string.h>
#include <cstring>
#include <vector>
#include <cstdio>
#include <stack>
#include <queue>
#include <algorithm>

#define ll long long

using namespace std;

int error;
string valu,res;

int isOprtr(char c)
{
	if(c=='+' || c=='-')
	return 1;
	if(c=='*' || c=='/' ||c=='%')
	return 2;
	return 0;
}

//1*(2+3*23+12*34)+3 = 482
//1*(2+3*23+12*34)+3*(4+5*65-13+8-2) = 1445
//2+3*(2+2-1+3+(12+12*3)+3+4)
//1*2+3*23+12*34+3*4+5*65-13+8-2
//((20*((((((((100)))))))*100)))
int getvalu(string tmp)
{
	int pos,ind;
	ll num[300];
	char op[300];
	char newop[300];
	ll v=0;
	stack<ll>  res;
	queue<char> q;

	ind = 0;
	for(int i=tmp.size()-1;i>=0;i--)
	{
		if(isOprtr(tmp[i]))
		{
			v = 0;
			while(isOprtr(q.front())==0 && !q.empty())
			{
				v*=10;
				v+=(q.front()-'0');
				q.pop();
			}
			op[ind]=tmp[i];
			num[ind++]=v;
		}
		else
		{
			q.push(tmp[i]);
		}
	}
	v = 0;
	while(isOprtr(q.front())==0 && !q.empty())
	{
		v*=10;
		v+=(q.front()-'0');
		q.pop();
	}
	num[ind++]=v;

	pos =0;
	res.push(num[0]);
	for(int i=0;i<ind-1;i++)
	{
		if(op[i]=='+')
		{
			res.push(num[i+1]);
			newop[pos++]=op[i];
		}
		else if(op[i]=='-')
		{
			res.push(num[i+1]*(-1));
			newop[pos++]='+';
		}
		else if(op[i]=='*')
		{
			v = res.top();
			res.pop();
			v = v*num[i+1];
			res.push(v);
		}
		else if(op[i]=='/')
		{
			v = res.top();
			res.pop();
			v = v/num[i+1];
			res.push(v);
		}
		else if(op[i]=='%')
		{
			v = res.top();
			res.pop();
			v = v%num[i+1];
			res.push(v);
		}
	}

	v = 0;
	while(!res.empty())
	{
		v+=res.top();
		res.pop();
	}

	valu = "";
	while(v)
	{
		valu.append(1u,v%10+'0');
		v/=10;
	}

	int last_position = valu.size()-1;
	for(int i=0;i<valu.size()/2;i++)
	{
		char ch = valu[i];
		valu[i] = valu[last_position-i];
		valu[last_position-i] = ch;
	}
	return 0;
}
void parenthesis(string s,int parenthesis_Pair)
{
	string pp="",tmp;
	stack<char> stck;
	for(int i=0;i<s.size();i++)
	{
		pp.append(1u,s[i]);
		if(s[i]==')')
		{
			tmp = "";

			while(stck.top()!='(' && !stck.empty())
			{
				tmp.append(1u,stck.top());
				stck.pop();
			}

			error = getvalu(tmp);
			if(error)
			return;
			else
			pp.replace(pp.size()-1-(tmp.size()+1),(tmp.size()+3),valu);

			s.replace(0,i+1,pp);
			if(parenthesis_Pair)
			parenthesis(s,parenthesis_Pair-1);
			else
			res = s;
			return;

		}
		else
		{
			stck.push(s[i]);
		}

	}
	res = pp;

}

void fincalc(string s)
{
	ll v=0;
	char op[300];
	ll num[300];
	int ind=0;
	stack<ll> vlu;
	for(int i=0;i<s.size();i++)
	{
		if(isOprtr(s[i]))
		{
			num[ind++]=v;
			op[ind]=s[i];
			v = 0;
		}
		else
		{
			v*=10;
			v+=(s[i]-'0');
		}
	}

	num[ind++]=v;
	v = 0;

	vlu.push(num[0]);
	int oprtcnt = 0;
	for(int i=1;i<ind;i++)
	{
		if(op[i]=='-')
		{
			vlu.push(num[i]*(-1)); oprtcnt+=1;
		}
		else if(op[i]=='+')
		{
			vlu.push(num[i]);oprtcnt+=1;
		}
		else if(op[i]=='*')
		{
			v = vlu.top();
			vlu.pop();
			vlu.push(v*num[i]);oprtcnt+=1;
		}
		else if(op[i]=='/')
		{
			v = vlu.top();
			vlu.pop();
			vlu.push(v/num[i]);oprtcnt+=1;
		}
		else if(op[i]=='%')
		{
			v = vlu.top();
			vlu.pop();
			vlu.push(v%num[i]);oprtcnt+=1;
		}
	}

	v = 0;
	while(!vlu.empty())
	{
		v+=vlu.top();
		vlu.pop();
	}
	cout<<v<<"\n";

}


int main()
{
	int t,num_cnt,op_cnt,cnt;
	string ss,s;
	cin>>t;
	getchar();

	while(t--)
	{
		getline(cin,ss);
		 s = "";
		 error = 0;
		 op_cnt = 0;
		 num_cnt = 0;
		 stack<char> parenth;
		 int ind = 0;
		 for(ind = 0;ind<ss.size();ind++)
		 {
			 if(isalpha(ss[ind]))
			 {
				 error = 1;
				 break;
			 }
			 else if(ss[ind]<='9' && ss[ind]>='0')
			 {
				while(ss[ind]<='9' && ss[ind]>='0')
				{
					s.append(1u,ss[ind]);
					ind+=1;
				}
				ind-=1;
				num_cnt+=1;
			 }
			 else if(ss[ind]==' ')
			 {
				while(ss[ind]==' ')
					ind+=1;
				ind-=1;
			 }
			 else if(ss[ind]=='(')
			 {
				 if(s.size())
				 {
					 if(s[s.size()-1]>='0' && s[s.size()-1]<='9')
					 {
						 error = 1;
						 break;
					 }
				 }
				 while(ss[ind]=='(')
				 {
					s.append(1u,ss[ind]);
					parenth.push('(');
					ind+=1;
					cnt+=1;
				 }
				ind-=1;
			 }
			 else if(ss[ind]==')')
			 {
				 if(s.size())
				 {
					 if(isOprtr(s[s.size()-1]))
					 {
						 error = 1;
						 break;
					 }
				 }
				 s.append(1u,ss[ind]);
				 parenth.pop();
			 }
			 else if(isOprtr(ss[ind]))
			 {
				 if(s.size()==0)
				 {
					 error = 1;
					 break;
				 }
				 else
				 {
					 if(isOprtr(s[s.size()-1]))
					 {
						 error = 1;
						 break;
					 }
				 }
				 s.append(1u,ss[ind]);
				 op_cnt+=1;
			 }
		 }
		 if(parenth.size())
			error = 1;
		 if(isOprtr(s[s.size()-1]))
			error = 1;
		 if(num_cnt - op_cnt!=1)
		 	error = 1;
		 if(error)
		 cout<<"ERROR\n";
		 else
		 {
			 parenthesis(s,cnt);
			 fincalc(res);
		 }
	}
	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

212

213

214

215

216

217

218

219

220

221

222

223

224

225

226

227

228

229

230

231

232

233

234

235

236

237

238

239

240

241

242

243

244

245

246

247

248

249

250

251

252

253

254

255

256

257

258

259

260

261

262

263

264

265

266

267

268

269

270

271

272

273

274

275

276

277

278

279

280

281

282

283

284

285

286

287

288

289

290

291

292

293

294

295

296

297

298

299

300

301

302

303

304

305

306

307

308

309

310

311

312

313

314

315

316

317

318

319

320

321

322

323

324

325

326

327

328

329

330

331

332

333

334

335

336

337

338

339

340

341

342

343

344

#include <iostream>

#include <string.h>

#include <cstring>

#include <vector>

#include <cstdio>

#include <stack>

#include <queue>

#include <algorithm>

#define ll long long

using namespace std;

int error;

string valu,res;

int isOprtr(char c)

{

if(c=='+' || c=='-')

return 1;

if(c=='*' || c=='/' ||c=='%')

return 2;

return 0;

}

//1*(2+3*23+12*34)+3 = 482

//1*(2+3*23+12*34)+3*(4+5*65-13+8-2) = 1445

//2+3*(2+2-1+3+(12+12*3)+3+4)

//1*2+3*23+12*34+3*4+5*65-13+8-2

//((20*((((((((100)))))))*100)))

int getvalu(string tmp)

{

int pos,ind;

ll num[300];

char op[300];

char newop[300];

ll v=0;

stack<ll> res;

queue<char> q;

ind = 0;

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

{

if(isOprtr(tmp[i]))

{

v = 0;

while(isOprtr(q.front())==0 && !q.empty())

{

v*=10;

v+=(q.front()-'0');

q.pop();

}

op[ind]=tmp[i];

num[ind++]=v;

}

else

{

q.push(tmp[i]);

}

v = 0;

while(isOprtr(q.front())==0 && !q.empty())

{

v*=10;

v+=(q.front()-'0');

q.pop();

}

num[ind++]=v;

pos =0;

res.push(num[0]);

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

{

if(op[i]=='+')

{

res.push(num[i+1]);

newop[pos++]=op[i];

}

else if(op[i]=='-')

{

res.push(num[i+1]*(-1));

newop[pos++]='+';

}

else if(op[i]=='*')

{

v = res.top();

res.pop();

v = v*num[i+1];

res.push(v);

}

else if(op[i]=='/')

{

v = res.top();

res.pop();

v = v/num[i+1];

res.push(v);

}

else if(op[i]=='%')

{

v = res.top();

res.pop();

v = v%num[i+1];

res.push(v);

}

v = 0;

while(!res.empty())

{

v+=res.top();

res.pop();

}

valu = "";

while(v)

{

valu.append(1u,v%10+'0');

v/=10;

}

int last_position = valu.size()-1;

for(int i=0;i<valu.size()/2;i++)

{

char ch = valu[i];

valu[i] = valu[last_position-i];

valu[last_position-i] = ch;

}

return 0;

}

void parenthesis(string s,int parenthesis_Pair)

{

string pp="",tmp;

stack<char> stck;

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

{

pp.append(1u,s[i]);

if(s[i]==')')

{

tmp = "";

while(stck.top()!='(' && !stck.empty())

{

tmp.append(1u,stck.top());

stck.pop();

}

error = getvalu(tmp);

if(error)

return;

else

pp.replace(pp.size()-1-(tmp.size()+1),(tmp.size()+3),valu);

s.replace(0,i+1,pp);

if(parenthesis_Pair)

parenthesis(s,parenthesis_Pair-1);

else

res = s;

return;

}

else

{

stck.push(s[i]);

}

res = pp;

}

void fincalc(string s)

{

ll v=0;

char op[300];

ll num[300];

int ind=0;

stack<ll> vlu;

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

{

if(isOprtr(s[i]))

{

num[ind++]=v;

op[ind]=s[i];

v = 0;

}

else

{

v*=10;

v+=(s[i]-'0');

}

num[ind++]=v;

v = 0;

vlu.push(num[0]);

int oprtcnt = 0;

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

{

if(op[i]=='-')

{

vlu.push(num[i]*(-1)); oprtcnt+=1;

}

else if(op[i]=='+')

{

vlu.push(num[i]);oprtcnt+=1;

}

else if(op[i]=='*')

{

v = vlu.top();

vlu.pop();

vlu.push(v*num[i]);oprtcnt+=1;

}

else if(op[i]=='/')

{

v = vlu.top();

vlu.pop();

vlu.push(v/num[i]);oprtcnt+=1;

}

else if(op[i]=='%')

{

v = vlu.top();

vlu.pop();

vlu.push(v%num[i]);oprtcnt+=1;

}

v = 0;

while(!vlu.empty())

{

v+=vlu.top();

vlu.pop();

}

cout<<v<<"\n";

}

int main()

{

int t,num_cnt,op_cnt,cnt;

string ss,s;

cin>>t;

getchar();

while(t--)

{

getline(cin,ss);

s = "";

error = 0;

op_cnt = 0;

num_cnt = 0;

stack<char> parenth;

int ind = 0;

for(ind = 0;ind<ss.size();ind++)

{

if(isalpha(ss[ind]))

{

error = 1;

break;

}

else if(ss[ind]<='9' && ss[ind]>='0')

{

while(ss[ind]<='9' && ss[ind]>='0')

{

s.append(1u,ss[ind]);

ind+=1;

}

ind-=1;

num_cnt+=1;

}

else if(ss[ind]==' ')

{

while(ss[ind]==' ')

ind+=1;

ind-=1;

}

else if(ss[ind]=='(')

{

if(s.size())

{

if(s[s.size()-1]>='0' && s[s.size()-1]<='9')

{

error = 1;

break;

}

while(ss[ind]=='(')

{

s.append(1u,ss[ind]);

parenth.push('(');

ind+=1;

cnt+=1;

}

ind-=1;

}

else if(ss[ind]==')')

{

if(s.size())

{

if(isOprtr(s[s.size()-1]))

{

error = 1;

break;

}

s.append(1u,ss[ind]);

parenth.pop();

}

else if(isOprtr(ss[ind]))

{

if(s.size()==0)

{

error = 1;

break;

}

else

{

if(isOprtr(s[s.size()-1]))

{

error = 1;

break;

}

s.append(1u,ss[ind]);

op_cnt+=1;

}

if(parenth.size())

error = 1;

if(isOprtr(s[s.size()-1]))

error = 1;

if(num_cnt - op_cnt!=1)

error = 1;

if(error)

cout<<"ERROR\n";

else

{

parenthesis(s,cnt);

fincalc(res);

}

return 0;

}

624

Asif NaeemFebruary 8, 2015

#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <stack>
#include <cstdio>

#define INF 100000000

using namespace std;

int arr[25];
int res[25];
int SZ;
vector<int> vb;
bool visit[25];
int ind;
int MN;

void backtrack(int remaining,int index)
{

	if(remaining<MN)
	{
		MN = remaining;
		SZ = vb.size();
		for(int i=0;i<SZ;i++)
		{
			res[i] = vb[i];
		}
	}

	for(int i=index+1;i<ind;i++)
	{
		if(visit[i]==0)
		{
			if(remaining - arr[i]<0)
			{
				continue;
			}
			vb.push_back(arr[i]);
			visit[i] = true;
			remaining = remaining - arr[i];
			backtrack(remaining,i);
			visit[i] = false;
			vb.pop_back();
			remaining = remaining + arr[i];
		}

	}

}

int main()
{
	int n,remaining;
	stringstream ss;
	string s;
	for(int i=0;i<25;i++)
		visit[i] = false;

	while(scanf("%d",&arr[0])!=EOF)
	{
		cin>>arr[1];//
		ind=2;//
		for(int i=0;i<arr[1];i++)//
			cin>>arr[ind++];

		remaining = arr[0];
		MN = INF;
		for(int i=2;i<ind;i++)
		{
			if(visit[i]==0)
			{
				if(remaining - arr[i]<0)
				{
					continue;
				}
				visit[i] = true;
				vb.push_back(arr[i]);
				remaining = remaining - arr[i];
				backtrack(remaining,i);
				visit[i] = false;
				remaining = remaining + arr[i];
				vb.pop_back();
			}

		}

		for(int i=0;i<SZ;i++)
			cout<<res[i]<<" ";
		cout<<"sum:"<<arr[0] - MN<<"\n";
	}

	return 0;
}

#include <iostream>

#include <sstream>

#include <string>

#include <vector>

#include <stack>

#include <cstdio>

#define INF 100000000

using namespace std;

int arr[25];

int res[25];

int SZ;

vector<int> vb;

bool visit[25];

int ind;

int MN;

void backtrack(int remaining,int index)

{

if(remaining<MN)

{

MN = remaining;

SZ = vb.size();

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

{

res[i] = vb[i];

}

for(int i=index+1;i<ind;i++)

{

if(visit[i]==0)

{

if(remaining - arr[i]<0)

{

continue;

}

vb.push_back(arr[i]);

visit[i] = true;

remaining = remaining - arr[i];

backtrack(remaining,i);

visit[i] = false;

vb.pop_back();

remaining = remaining + arr[i];

}

int main()

{

int n,remaining;

stringstream ss;

string s;

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

visit[i] = false;

while(scanf("%d",&arr[0])!=EOF)

{

cin>>arr[1];//

ind=2;//

for(int i=0;i<arr[1];i++)//

cin>>arr[ind++];

remaining = arr[0];

MN = INF;

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

{

if(visit[i]==0)

{

if(remaining - arr[i]<0)

{

continue;

}

visit[i] = true;

vb.push_back(arr[i]);

remaining = remaining - arr[i];

backtrack(remaining,i);

visit[i] = false;

remaining = remaining + arr[i];

vb.pop_back();

}

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

cout<<res[i]<<" ";

cout<<"sum:"<<arr[0] - MN<<"\n";

}

return 0;

}

11057

Asif NaeemFebruary 7, 2015

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

#define SZ 10005
#define INF 100000000
#define ll  long long

using namespace std;

ll a[SZ];

int main()
{
	ll N,M,MN;
	bool f=0;
	ll price2,price1;

	price2 = 1000001;
	price1 = 1000001;

	int d = price1+price2;
	//cout<<d<<"\n";

	while(cin>>N)
	{
		MN = INF;
		for(int i=0;i<N;i++)
			cin>>a[i];
		cin>>M;
		for(int i=0;i<N;i++)
		{
			for(int j=0;j<N;j++)
			{
				if(a[i]+a[j]==M && i!=j)
				{
					if(abs(a[i]-a[j])<MN)
					{
						MN = abs(a[i]-a[j]);
						price1 = a[i];
						price2 = a[j];
					}
				}
			}
		}//for loop

		if(price1>price2)
		{
			price1 = price1 + price2;
			price2 = price1 - price2;
			price1 = price1 - price2;
		}
		cout<<"Peter should buy books whose prices are "<<price1<<" and "<<price2<<".\n\n";
	}//while
}

#include <iostream>

#include <cstdlib>

#include <cstdio>

#define SZ 10005

#define INF 100000000

#define ll long long

using namespace std;

ll a[SZ];

int main()

{

ll N,M,MN;

bool f=0;

ll price2,price1;

price2 = 1000001;

price1 = 1000001;

int d = price1+price2;

//cout<<d<<"\n";

while(cin>>N)

{

MN = INF;

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

cin>>a[i];

cin>>M;

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

{

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

{

if(a[i]+a[j]==M && i!=j)

{

if(abs(a[i]-a[j])<MN)

{

MN = abs(a[i]-a[j]);

price1 = a[i];

price2 = a[j];

}

}//for loop

if(price1>price2)

{

price1 = price1 + price2;

price2 = price1 - price2;

price1 = price1 - price2;

}

cout<<"Peter should buy books whose prices are "<<price1<<" and "<<price2<<".\n\n";

}//while

}

Another way:

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

#define INF 10000000

using namespace std;

bool val[1000005];
int arr[10005];

int main()
{
	int N,tmp,d;
	int total,diff;
	int I,J;
	while(scanf("%d",&N)!=EOF)
	{
		memset(arr,0,sizeof(arr));
		memset(val,0,sizeof(val));
		diff=INF;
		for(int i=0;i<N;i++)
		{
			cin>>arr[i];
			val[arr[i]]=1;
		}
		cin>>total;

		for(int i=0;i<N;i++)
		{
			tmp=total-arr[i];
			if(tmp<0)
			continue;
			if(tmp>1000001)
			continue;
			if(val[tmp])
			{
				d = abs(arr[i]-tmp);
				if(d<diff)
				{
					diff=d;
					I=arr[i];
					J=tmp;
				}
			}
		}
		if(I>J)
		{
			I=I+J;
			J=I-J;
			I=I-J;
		}
		cout<<"Peter should buy books whose prices are "<<I<<" and "<<J<<".\n\n";
	}
	return 0;
}

#include <iostream>

#include <cstdio>

#include <cstdlib>

#include <cstring>

#include <string>

#define INF 10000000

using namespace std;

bool val[1000005];

int arr[10005];

int main()

{

int N,tmp,d;

int total,diff;

int I,J;

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

{

memset(arr,0,sizeof(arr));

memset(val,0,sizeof(val));

diff=INF;

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

{

cin>>arr[i];

val[arr[i]]=1;

}

cin>>total;

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

{

tmp=total-arr[i];

if(tmp<0)

continue;

if(tmp>1000001)

continue;

if(val[tmp])

{

d = abs(arr[i]-tmp);

if(d<diff)

{

diff=d;

I=arr[i];

J=tmp;

}

if(I>J)

{

I=I+J;

J=I-J;

I=I-J;

}

cout<<"Peter should buy books whose prices are "<<I<<" and "<<J<<".\n\n";

}

return 0;

}

10667

Asif NaeemFebruary 7, 2015

#include <iostream>

using namespace std;

int arr[105][105];
int s;

int Matsum(int a,int b)
{
    int p;
    int Line[105];
    int max_end_here,max_so_far;
    for(int i=1;i<=s;i++)
    {
        p=0;
        for(int j=a;j<=b;j++)
        {
           p+=arr[j][i];
        }
        Line[i]=p;
    }

    max_end_here=0;
    max_so_far=0;
    for(int i=1;i<=s;i++)
    {
       max_end_here+=Line[i];

       if(max_end_here<0)
         max_end_here=0;

       if(max_end_here>max_so_far)
         max_so_far=max_end_here;
    }

    return max_so_far;
}

int main()
{
    int t,mx,m;
    int b,r1,r2,c1,c2;

    cin>>t;

    while(t--)
    {
       cin>>s;
       cin>>b;

       mx =0;
       for(int i=0;i<=101;i++)
        for(int j=0;j<=101;j++)
           arr[i][j]=1;
       while(b--)
       {
         cin>>r1>>c1>>r2>>c2;

         for(int i=r1;i<=r2;i++)
         {
             for(int j=c1;j<=c2;j++)
              arr[i][j]=-10000000;
         }
       }

       for(int i=1;i<=s;i++)
          for(int j=1;j<=s;j++)
          {
             m = Matsum(i,j);
             if(mx<m)
             mx=m;
          }
       cout<<mx<<"\n";
    }

    return 0;
}

#include <iostream>

using namespace std;

int arr[105][105];

int s;

int Matsum(int a,int b)

{

int p;

int Line[105];

int max_end_here,max_so_far;

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

{

p=0;

for(int j=a;j<=b;j++)

{

p+=arr[j][i];

}

Line[i]=p;

}

max_end_here=0;

max_so_far=0;

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

{

max_end_here+=Line[i];

if(max_end_here<0)

max_end_here=0;

if(max_end_here>max_so_far)

max_so_far=max_end_here;

}

return max_so_far;

}

int main()

{

int t,mx,m;

int b,r1,r2,c1,c2;

cin>>t;

while(t--)

{

cin>>s;

cin>>b;

mx =0;

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

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

arr[i][j]=1;

while(b--)

{

cin>>r1>>c1>>r2>>c2;

for(int i=r1;i<=r2;i++)

{

for(int j=c1;j<=c2;j++)

arr[i][j]=-10000000;

}

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

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

{

m = Matsum(i,j);

if(mx<m)

mx=m;

}

cout<<mx<<"\n";

}

return 0;

}

10074

Asif NaeemFebruary 7, 2015

#include <iostream>

using namespace std;

int arr[105][105];
int M,N;

int Matsum(int a,int b)
{
    int p,max_end_here=0,max_so_far=0;
    int Line[105];
    for(int i=1;i<=N;i++)
    {
       p = 0;
       for(int j=a;j<=b;j++)
       {
           p+=arr[j][i];
       }
       Line[i]=p;
    }

    max_end_here=0;
    max_so_far=0;
    for(int i=1;i<=N;i++)
    {
       max_end_here = max_end_here + Line[i];

       if(max_end_here<0)
          max_end_here = 0;
       if(max_so_far<max_end_here)
         max_so_far = max_end_here;

    }

    return max_so_far;
}

int main()
{
    int a;
    int mx=0,x;
    while(cin>>M>>N)
    {
       if(M==0 && N==0)
       break;
       for(int i=1;i<=M;i++)
       {
          for(int j=1;j<=N;j++)
          {
             cin>>a;
             if(a==0)
             arr[i][j]=1;
             //a = -1;
             if(a)
             arr[i][j]=-1000000;//a[i-1][j]+a;
          }
       }
       mx = 0;
       for(int i=1;i<=M;i++)
       {
           for(int j=i;j<=M;j++)
           {
              x = Matsum(i,j);
              if(x>mx)
              mx=x;
           }
       }

       cout<<mx<<"\n";
    }//end while

    return 0;
}

#include <iostream>

using namespace std;

int arr[105][105];

int M,N;

int Matsum(int a,int b)

{

int p,max_end_here=0,max_so_far=0;

int Line[105];

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

{

p = 0;

for(int j=a;j<=b;j++)

{

p+=arr[j][i];

}

Line[i]=p;

}

max_end_here=0;

max_so_far=0;

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

{

max_end_here = max_end_here + Line[i];

if(max_end_here<0)

max_end_here = 0;

if(max_so_far<max_end_here)

max_so_far = max_end_here;

}

return max_so_far;

}

int main()

{

int a;

int mx=0,x;

while(cin>>M>>N)

{

if(M==0 && N==0)

break;

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

{

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

{

cin>>a;

if(a==0)

arr[i][j]=1;

//a = -1;

if(a)

arr[i][j]=-1000000;//a[i-1][j]+a;

}

mx = 0;

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

{

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

{

x = Matsum(i,j);

if(x>mx)

mx=x;

}

cout<<mx<<"\n";

}//end while

return 0;

}

108

Asif NaeemFebruary 7, 2015

#include <stdio.h>

int a[100][100]={0};
int N;
int Line[100];

int KadaneAlg();
int MatSum(int a,int b);

int main()
{
	int p=-100;
	int Max=-100;
	while(scanf("%d",&N)==1)
	{
		Max=-100;
		p =-100;
		for(int i=0;i<N;i++)
		{
			for(int j=0;j<N;j++)
				scanf("%d",&a[i][j]);
		}

		for(int k=0;k<N;k++)
		{
			for(int l=k;l<N;l++)
			{
				p = MatSum(k,l);
				if(p>Max)
					Max = p;
			}
		}

		printf("%d\n",Max);
	}

	return 0;
}


int MatSum(int c,int b)
{
	int p;
	for(int i=0;i<N;i++)
	{
		p =0;
		for(int j=c;j<=b;j++)//row
		{
			p += a[j][i];
		}
		Line[i] = p;
	}

	return KadaneAlg();

}

int KadaneAlg()
{
   int max_so_far = 0, max_ending_here = 0;
   int i;
   for(i = 0; i < N; i++)
   {
     max_ending_here = max_ending_here + Line[i];
     if(max_ending_here < 0)
         max_ending_here = 0;
     else if (max_so_far < max_ending_here)
         max_so_far = max_ending_here;
   }
   return max_so_far;
}

#include <stdio.h>

int a[100][100]={0};

int N;

int Line[100];

int KadaneAlg();

int MatSum(int a,int b);

int main()

{

int p=-100;

int Max=-100;

while(scanf("%d",&N)==1)

{

Max=-100;

p =-100;

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

{

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

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

}

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

{

for(int l=k;l<N;l++)

{

p = MatSum(k,l);

if(p>Max)

Max = p;

}

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

}

return 0;

}

int MatSum(int c,int b)

{

int p;

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

{

p =0;

for(int j=c;j<=b;j++)//row

{

p += a[j][i];

}

Line[i] = p;

}

return KadaneAlg();

}

int KadaneAlg()

{

int max_so_far = 0, max_ending_here = 0;

int i;

for(i = 0; i < N; i++)

{

max_ending_here = max_ending_here + Line[i];

if(max_ending_here < 0)

max_ending_here = 0;

else if (max_so_far < max_ending_here)

max_so_far = max_ending_here;

}

return max_so_far;

}

836

Asif NaeemFebruary 7, 2015

This problem also can be solved using Dynamic Programming.

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

using namespace std;

string *str = new string [50];
int N;

int kaadanealgo(int a,int b)
{
	int line[50];
	int max_end_here=0;
	int max_so_far=0;

	for(int i=0;i<N;i++)
	{
		line[i] = 0;
		for(int j=a;j<=b;j++)
		{
			if(str[j][i]=='0')
				line[i]+=-1000000;
			else
				line[i]+=(str[j][i]-'0');
		}
	}


	for(int i=0;i<N;i++)
	{
		max_end_here+=line[i];

		if(max_end_here<0)
		max_end_here = 0;

		if(max_end_here>max_so_far)
			max_so_far = max_end_here;
	}

	return max_so_far;
}
int main()
{
	int t,m,mx;
	string s,a;
	bool c =false;
	cin>>t;
	getchar();

	while(t--)
	{
		getline(cin,s);

		getline(cin,s);
		N = s.size();

		int ind=0;
		str[0] = s;
		for(ind =1;ind<N;ind++)
		{
			getline(cin,s);
			str[ind]=s;
		}
		//N = str[0].size();
		mx = 0;
		for(int i=0;i<ind;i++)
		{
			for(int j=i;j<ind;j++)
			{
				m = kaadanealgo(i,j);
				if(m>mx)
				mx = m;
			}
		}

		cout<<mx<<"\n";
		if(t)
		cout<<"\n";
	}

	return 0;
}

#include <iostream>

#include <string>

#include <cstring>

#include <cstdio>

using namespace std;

string *str = new string [50];

int N;

int kaadanealgo(int a,int b)

{

int line[50];

int max_end_here=0;

int max_so_far=0;

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

{

line[i] = 0;

for(int j=a;j<=b;j++)

{

if(str[j][i]=='0')

line[i]+=-1000000;

else

line[i]+=(str[j][i]-'0');

}

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

{

max_end_here+=line[i];

if(max_end_here<0)

max_end_here = 0;

if(max_end_here>max_so_far)

max_so_far = max_end_here;

}

return max_so_far;

}

int main()

{

int t,m,mx;

string s,a;

bool c =false;

cin>>t;

getchar();

while(t--)

{

getline(cin,s);

N = s.size();

int ind=0;

str[0] = s;

for(ind =1;ind<N;ind++)

{

getline(cin,s);

str[ind]=s;

}

//N = str[0].size();

mx = 0;

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

{

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

{

m = kaadanealgo(i,j);

if(m>mx)

mx = m;

}

cout<<mx<<"\n";

if(t)

cout<<"\n";

}

return 0;

}

Similar problems are : uva 108, uva 10074,uva 10667; These can be solved using the same algorithm.

Month: February 2015

532

10364

307

622

624

11057

10667

10074

108

836

Archives

Categories