String – Live with passion

11734

Asif NaeemOctober 20, 2015

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

using namespace std;

int main()
{
	int t,kase=1;
	string org,ans,tmp1,tmp2;
	scanf("%d",&t);
	getchar();
	while(t--)
	{
		getline(cin,ans);
		getline(cin,org);
		if(org.size()==ans.size())
		{
			bool f=0;
			for(int i=0;i<org.size();i++)
			{
				if(org[i]!=ans[i])
				{
					f=1;break;
				}
			}
			if(f)
				printf("Case %d: Wrong Answer\n",kase++);
			else
				printf("Case %d: Yes\n",kase++);
		}
		else
		{
			tmp1="";tmp2="";
			for(int i=0;i<org.size();i++)
			{
				if(org[i]!=' ')
					tmp1.append(1u,org[i]);
			}
			for(int i=0;i<ans.size();i++)
			{
				if(ans[i]!=' ')
					tmp2.append(1u,ans[i]);
			}
			if(tmp1.size()!=tmp2.size())
			{
				printf("Case %d: Wrong Answer\n",kase++);
			}
			else
			{
				bool fl=0;
				for(int i=0;i<tmp1.size();i++)
				{
					if(tmp1[i]!=tmp2[i])
					{
						fl=1;break;
					}
				}
				if(fl)
					printf("Case %d: Wrong Answer\n",kase++);
				else
					printf("Case %d: Output Format Error\n",kase++);
			}
		}
	}
	return 0;
}

#include <cstdio>

#include <vector>

#include <cstring>

#include <algorithm>

#include <iostream>

using namespace std;

int main()

{

int t,kase=1;

string org,ans,tmp1,tmp2;

scanf("%d",&t);

getchar();

while(t--)

{

getline(cin,ans);

getline(cin,org);

if(org.size()==ans.size())

{

bool f=0;

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

{

if(org[i]!=ans[i])

{

f=1;break;

}

if(f)

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

else

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

}

else

{

tmp1="";tmp2="";

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

{

if(org[i]!=' ')

tmp1.append(1u,org[i]);

}

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

{

if(ans[i]!=' ')

tmp2.append(1u,ans[i]);

}

if(tmp1.size()!=tmp2.size())

{

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

}

else

{

bool fl=0;

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

{

if(tmp1[i]!=tmp2[i])

{

fl=1;break;

}

if(fl)

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

else

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

}

return 0;

}

11588

Asif NaeemJuly 20, 2015

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

using namespace std;
int arr[27];
int main()
{
	int t,ans;
	int kase=1;
	char ch;
	int R,C,M,N;
	cin>>t;

	while(t--)
	{
		cin>>R>>C>>M>>N;
		memset(arr,0,sizeof(arr));
		for(int i=0;i<R*C;i++)
		{
			cin>>ch;
			arr[ch-'A']+=1;
		}
		int mx=-1;
		for(int i=0;i<26;i++)
		{
			if(arr[i]>mx)
			mx=arr[i];
		}
		int cnt=0;
		for(int i=0;i<26;i++)
		{
			if(arr[i]==mx)
			cnt+=1;
		}
		ans=mx*cnt*M+(R*C-mx*cnt)*N;
		cout<<"Case "<<kase++<<": "<<ans<<"\n";
	}
	return 0;
}

#include <iostream>

#include <cstdio>

#include <sstream>

#include <string>

#include <cstring>

using namespace std;

int arr[27];

int main()

{

int t,ans;

int kase=1;

char ch;

int R,C,M,N;

cin>>t;

while(t--)

{

cin>>R>>C>>M>>N;

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

for(int i=0;i<R*C;i++)

{

cin>>ch;

arr[ch-'A']+=1;

}

int mx=-1;

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

{

if(arr[i]>mx)

mx=arr[i];

}

int cnt=0;

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

{

if(arr[i]==mx)

cnt+=1;

}

ans=mx*cnt*M+(R*C-mx*cnt)*N;

cout<<"Case "<<kase++<<": "<<ans<<"\n";

}

return 0;

}

11687

Asif NaeemJuly 20, 2015

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

using namespace std;

int main()
{
	int n,cnt;
	string s,t;
	stringstream ss;
	while(cin>>s)
	{
		if(s=="END")
		break;
		n=s.size();
		cnt=1;
		ss.clear();
		ss<<n;
		ss>>t;
		while(s!=t)
		{
			s=t;
			n=s.size();
			ss.clear();
			ss<<n;
			ss>>t;
			cnt+=1;
		}
		cout<<cnt<<"\n";
	}
	return 0;
}

#include <iostream>

#include <cstdio>

#include <sstream>

#include <string>

using namespace std;

int main()

{

int n,cnt;

string s,t;

stringstream ss;

while(cin>>s)

{

if(s=="END")

break;

n=s.size();

cnt=1;

ss.clear();

ss<<n;

ss>>t;

while(s!=t)

{

s=t;

n=s.size();

ss.clear();

ss<<n;

ss>>t;

cnt+=1;

}

cout<<cnt<<"\n";

}

return 0;

}

12243

Asif NaeemJuly 20, 2015

Need to know a little more about string.char an locale library.

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

using namespace std;

int main()
{
	string str;
	locale loc;
	while(getline(cin,str))
	{
		if(str=="*")
		break;

		char ch1;
		char ch=str[0];
		if(isupper(ch,loc))
		ch1=tolower(ch,loc);
		else
		ch1=toupper(ch,loc);
		//cout<<ch<<" "<<ch1<<"\n";
		bool tautogram=1;
		for(int i=1;i<str.size();i++)
		{
			if(str[i]==' ')
			{
				if(i+1<str.size() && str[i+1]!=ch && str[i+1]!=ch1)
				{
					//cout<<"error "<<str[i+1]<<"\n";
					tautogram=0;
					i=str.size();
				}
			}
		}
		if(tautogram)
		cout<<"Y\n";
		else
		cout<<"N\n";
	}
	return 0;
}

#include <iostream>

#include <cstdio>

#include <cstring>

#include <string>

#include <locale>

using namespace std;

int main()

{

string str;

locale loc;

while(getline(cin,str))

{

if(str=="*")

break;

char ch1;

char ch=str[0];

if(isupper(ch,loc))

ch1=tolower(ch,loc);

else

ch1=toupper(ch,loc);

//cout<<ch<<" "<<ch1<<"\n";

bool tautogram=1;

for(int i=1;i<str.size();i++)

{

if(str[i]==' ')

{

if(i+1<str.size() && str[i+1]!=ch && str[i+1]!=ch1)

{

//cout<<"error "<<str[i+1]<<"\n";

tautogram=0;

i=str.size();

}

if(tautogram)

cout<<"Y\n";

else

cout<<"N\n";

}

return 0;

}

196

Asif NaeemMarch 26, 2015

#include <iostream>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <cctype>
#include <string>
#include <cmath>
#include <sstream>

using namespace std;

string str[1000][18279];
int val[1000][18279];
bool isDone[1000][18279];
int C,R;

int solve(int a,int b)
{
	if(isDone[a][b])
	return val[a][b];
	string tmpstr;

	for(int i=0;i<str[a][b].size();i++)
	{
		if(str[a][b][i]=='=' || str[a][b][i]=='+')
		{
			str[a][b][i]=' ';
		}
	}
	stringstream ss;
	ss<<str[a][b];

	int sum = 0;
	tmpstr="";
	while(ss>>tmpstr)
	{
		int r = 0;
		int c = 0;
		for(int j=0;j<tmpstr.size();j++)
		{
			if(tmpstr[j]>='0' && tmpstr[j]<='9')
			{
				r=r*10+(tmpstr[j]-'0');
			}
			else
			{
				c = c*26+(tmpstr[j]-'A'+1);
			}
		}
		int tt = solve(r,c);
		sum+=tt;

	}
	isDone[a][b]=1;
	return (val[a][b]=sum);
}


int toint(string st)
{
	int sum = 0;
	for(int i=0;i<st.size();i++)
	{
		sum = sum*10+(st[i]-'0');
	}
	return sum;
}

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

	while(t--)
	{
		cin>>C>>R;

		for(int i=1;i<=R;i++)
		{
			for(int j=1;j<=C;j++)
			{
				cin>>str[i][j];
				isDone[i][j]=0;
				if(str[i][j][0]>='0' && str[i][j][0]<='9')
				{
					val[i][j]=toint(str[i][j]);
					isDone[i][j]=1;
				}
			}
		}
		for(int i=1;i<=R;i++)
			for(int j=1;j<=C;j++)
				cout<<solve(i,j)<<(j==C?"\n":" ");
	}
	return 0;
}

#include <iostream>

#include <cstring>

#include <cstdlib>

#include <cstdio>

#include <cctype>

#include <string>

#include <cmath>

#include <sstream>

using namespace std;

string str[1000][18279];

int val[1000][18279];

bool isDone[1000][18279];

int C,R;

int solve(int a,int b)

{

if(isDone[a][b])

return val[a][b];

string tmpstr;

for(int i=0;i<str[a][b].size();i++)

{

if(str[a][b][i]=='=' || str[a][b][i]=='+')

{

str[a][b][i]=' ';

}

stringstream ss;

ss<<str[a][b];

int sum = 0;

tmpstr="";

while(ss>>tmpstr)

{

int r = 0;

int c = 0;

for(int j=0;j<tmpstr.size();j++)

{

if(tmpstr[j]>='0' && tmpstr[j]<='9')

{

r=r*10+(tmpstr[j]-'0');

}

else

{

c = c*26+(tmpstr[j]-'A'+1);

}

int tt = solve(r,c);

sum+=tt;

}

isDone[a][b]=1;

return (val[a][b]=sum);

}

int toint(string st)

{

int sum = 0;

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

{

sum = sum*10+(st[i]-'0');

}

return sum;

}

int main()

{

int t;

cin>>t;

while(t--)

{

cin>>C>>R;

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

{

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

{

cin>>str[i][j];

isDone[i][j]=0;

if(str[i][j][0]>='0' && str[i][j][0]<='9')

{

val[i][j]=toint(str[i][j]);

isDone[i][j]=1;

}

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

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

cout<<solve(i,j)<<(j==C?"\n":" ");

}

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;

}

490

Asif NaeemNovember 30, 2014

#include <iostream>
#include <string.h>
#include <fstream>

using namespace std;

char s[105][105];

int main()
{
	int k=0;
	int len,mx=0;
	//ofstream out;
	//out.open("out.txt");

	for(int i=0;i<105;i++)
		for(int j=0;j<105;j++)
			s[i][j]=' ';

	while(gets(s[k]))
	{
		len = strlen(s[k]);
		s[k][len] =' ';
		if(len>mx)
		mx = len;
		k++;
	}

	for(int j=0;j<mx;j++)
	{
		for(int i=k-1;i>=0;i--)
		{
			cout<<s[i][j];
			//out<<s[i][j];
		}
		cout<<endl;
		//out<<endl;
	}
	//out.close();

	return 0;
}

#include <iostream>

#include <string.h>

#include <fstream>

using namespace std;

char s[105][105];

int main()

{

int k=0;

int len,mx=0;

//ofstream out;

//out.open("out.txt");

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

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

s[i][j]=' ';

while(gets(s[k]))

{

len = strlen(s[k]);

s[k][len] =' ';

if(len>mx)

mx = len;

k++;

}

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

{

for(int i=k-1;i>=0;i--)

{

cout<<s[i][j];

//out<<s[i][j];

}

cout<<endl;

//out<<endl;

}

//out.close();

return 0;

}

12403

Asif NaeemNovember 26, 2014

#include <iostream>
#include <stdio.h>
#include <string.h>



using namespace std;

int main()
{
    int t,n;
    char str[100],s[20];
    cin>>t;
    getchar();
    int sum=0;
    while(t--)
    {
       gets(str);

       if(strcmp(str,"report")==0)
       {
          sprintf(s,"%d",sum);
          puts(s);
       }
       else
       {
           sscanf(str,"%s %d",s,&n);
           sum+=n;
       }
    }

    return 0;
}

#include <iostream>

#include <stdio.h>

#include <string.h>

using namespace std;

int main()

{

int t,n;

char str[100],s[20];

cin>>t;

getchar();

int sum=0;

while(t--)

{

gets(str);

if(strcmp(str,"report")==0)

{

sprintf(s,"%d",sum);

puts(s);

}

else

{

sscanf(str,"%s %d",s,&n);

sum+=n;

}

return 0;

}

12541

Asif NaeemNovember 18, 2014

#include <iostream>
#include <sstream>
#include <stdio.h>
#include <string>
#include <math.h>


using namespace std;

int main()
{
    int n;
    double max_,min_;
    double day,month,yr;
    string s,name,young,old;
    stringstream ss;
    bool f=false;
    cin>>n;
    //getchar();
    while(n--)
    {
       cin>>name>>day>>month>>yr;
       yr+=((month/12)+(day/365));
       if(!f)
       {
          max_=yr;
          young = name;
          min_=yr;
          old = name;
          f=1;
       }
       else
       {
           if(yr>max_)
           {
              max_=yr;
              young = name;
           }
           if(yr<min_)
           {
              min_=yr;
              old = name;
           }
       }

    }

    cout<<young<<"\n"<<old<<"\n";
    //cin>>old;
    return 0;
}

#include <iostream>

#include <sstream>

#include <stdio.h>

#include <string>

#include <math.h>

using namespace std;

int main()

{

int n;

double max_,min_;

double day,month,yr;

string s,name,young,old;

stringstream ss;

bool f=false;

cin>>n;

//getchar();

while(n--)

{

cin>>name>>day>>month>>yr;

yr+=((month/12)+(day/365));

if(!f)

{

max_=yr;

young = name;

min_=yr;

old = name;

f=1;

}

else

{

if(yr>max_)

{

max_=yr;

young = name;

}

if(yr<min_)

{

min_=yr;

old = name;

}

cout<<young<<"\n"<<old<<"\n";

//cin>>old;

return 0;

}

12543

Asif NaeemNovember 17, 2014

#include <iostream>
#include <string>
#include <math.h>


using namespace std;

int main()
{
    string s,maxStr,a;
    int max_=0;
    int len=0;
    maxStr="";
    while(cin>>s)
    {
       if(s=="E-N-D")
       break;

       len=0;
       a="";
       for(int i=0;i<s.size();i++)
       {
         if((s[i]>='a' && s[i]<='z') || (s[i]>='A' && s[i]<='Z') || s[i]=='-')
         {
           len++;
           if(s[i]>='A' && s[i]<='Z')
           a.append(1u,s[i]+32);
           else
           a.append(1u,s[i]);
         }
       }

       if(len>max_)
       {
          max_=len;
          maxStr=a;
       }
    }
    cout<<maxStr<<"\n";
    return 0;
}

#include <iostream>

#include <string>

#include <math.h>

using namespace std;

int main()

{

string s,maxStr,a;

int max_=0;

int len=0;

maxStr="";

while(cin>>s)

{

if(s=="E-N-D")

break;

len=0;

a="";

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

{

if((s[i]>='a' && s[i]<='z') || (s[i]>='A' && s[i]<='Z') || s[i]=='-')

{

len++;

if(s[i]>='A' && s[i]<='Z')

a.append(1u,s[i]+32);

else

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

}

if(len>max_)

{

max_=len;

maxStr=a;

}

cout<<maxStr<<"\n";

return 0;

}

Category: String

11734

11588

11687

12243

196

622

490

12403

12541

12543

Archives

Categories