October 2014 – Live with passion

1523

Asif NaeemOctober 30, 2014

#include <iostream>
#include <stdio.h>
#include <map>
#include <math.h>
#include <algorithm>

using namespace std;
//M = sqrt(sumof(Mv)^2+sumof(Mh)^2)
int per[8]={0,1,2,3,4,5,6,7};
int arr[322561];
int inp[8];

int main()
{
   double Mv,Mh;
   double _max;
   int cnt=1;
   for(int i=0;i<8;i++)
   {
      arr[cnt]=per[i];
      cnt++;
   }
   while(next_permutation(per,per+8))
   {
       for(int i=0;i<8;i++)
       {
          arr[cnt]=per[i];
          //cout<<arr[cnt]<<" ";
          cnt++;
       }
   }
   //cout<<cnt<<"\n";
   while(cin>>inp[0])
   {
      int sum=0;
      sum+=inp[0];
      cin>>inp[1];
      sum+=inp[1];
      cin>>inp[2];
      sum+=inp[2];
      cin>>inp[3];
      sum+=inp[3];
      cin>>inp[4];
      sum+=inp[4];
      cin>>inp[5];
      sum+=inp[5];
      cin>>inp[6];
      sum+=inp[6];
      cin>>inp[7];
      sum+=inp[7];

      if(sum==0)
      break;

      _max = 1<<20;
      //cout<<_max<<"\n";
      int inc=1;
      int pos;
      for(int k=1;k<=40320;k++)
      {
              Mv=0;
              Mh=0;
          Mv=(inp[arr[inc]]+inp[arr[inc+1]]+inp[arr[inc+2]]);
          Mv-=(inp[arr[inc+4]]+inp[arr[inc+5]]+inp[arr[inc+6]]);
          Mv = Mv*Mv;

          Mh=(inp[arr[inc]]+inp[arr[inc+6]]+inp[arr[inc+7]]);
          Mh-=(inp[arr[inc+2]]+inp[arr[inc+3]]+inp[arr[inc+4]]);
          Mh = Mh*Mh;

          double M = sqrt((Mv+Mh));
          //cout<<"M = "<<M<<" "<<k<<"\n";
          if(M<_max)
          {
           _max=M;
           pos = k;
          }
          inc+=8;
      }
      cout<<pos<<"\n";
      printf("%.3lf\n",_max);
   }

   return 0;
}

#include <iostream>

#include <stdio.h>

#include <map>

#include <math.h>

#include <algorithm>

using namespace std;

//M = sqrt(sumof(Mv)^2+sumof(Mh)^2)

int per[8]={0,1,2,3,4,5,6,7};

int arr[322561];

int inp[8];

int main()

{

double Mv,Mh;

double _max;

int cnt=1;

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

{

arr[cnt]=per[i];

cnt++;

}

while(next_permutation(per,per+8))

{

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

{

arr[cnt]=per[i];

//cout<<arr[cnt]<<" ";

cnt++;

}

//cout<<cnt<<"\n";

while(cin>>inp[0])

{

int sum=0;

sum+=inp[0];

cin>>inp[1];

sum+=inp[1];

cin>>inp[2];

sum+=inp[2];

cin>>inp[3];

sum+=inp[3];

cin>>inp[4];

sum+=inp[4];

cin>>inp[5];

sum+=inp[5];

cin>>inp[6];

sum+=inp[6];

cin>>inp[7];

sum+=inp[7];

if(sum==0)

break;

_max = 1<<20;

//cout<<_max<<"\n";

int inc=1;

int pos;

for(int k=1;k<=40320;k++)

{

Mv=0;

Mh=0;

Mv=(inp[arr[inc]]+inp[arr[inc+1]]+inp[arr[inc+2]]);

Mv-=(inp[arr[inc+4]]+inp[arr[inc+5]]+inp[arr[inc+6]]);

Mv = Mv*Mv;

Mh=(inp[arr[inc]]+inp[arr[inc+6]]+inp[arr[inc+7]]);

Mh-=(inp[arr[inc+2]]+inp[arr[inc+3]]+inp[arr[inc+4]]);

Mh = Mh*Mh;

double M = sqrt((Mv+Mh));

//cout<<"M = "<<M<<" "<<k<<"\n";

if(M<_max)

{

_max=M;

pos = k;

}

inc+=8;

}

cout<<pos<<"\n";

printf("%.3lf\n",_max);

}

return 0;

}

10310

Asif NaeemOctober 29, 2014

#include <iostream>
#include <stdio.h>
#include <vector>
#include <math.h>

using namespace std;

int main()
{
    int n;
    double Dg,Dd;
    double x1,y1,x2,y2;
    double a,b,Hx,Hy;
    bool caught = true;
    while(cin>>n)
    {
        cin>>x1>>y1>>x2>>y2;
        caught = true;
        for(int i=0;i<n;i++)
        {
            cin>>a>>b;

            if(!caught)
            continue;
            Dg = sqrt((a-x1)*(a-x1)+(b-y1)*(b-y1));
            Dd = sqrt((a-x2)*(a-x2)+(b-y2)*(b-y2));

            double t = (Dg*2)/Dd;
            if(t>1)
            {
               caught=1;
            }
            else
            {
               Hx= a;
               Hy= b;
               caught=0;
            }
        }

        if(!caught)
        printf("The gopher can escape through the hole at (%.3lf,%.3lf).\n",Hx,Hy);
        //cout<<"The gopher can escape through the hole at ("<<Hx<<","<<Hy<<").\n";
        else
        cout<<"The gopher cannot escape.\n";
    }

    return 0;
}

#include <iostream>

#include <stdio.h>

#include <vector>

#include <math.h>

using namespace std;

int main()

{

int n;

double Dg,Dd;

double x1,y1,x2,y2;

double a,b,Hx,Hy;

bool caught = true;

while(cin>>n)

{

cin>>x1>>y1>>x2>>y2;

caught = true;

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

{

cin>>a>>b;

if(!caught)

continue;

Dg = sqrt((a-x1)*(a-x1)+(b-y1)*(b-y1));

Dd = sqrt((a-x2)*(a-x2)+(b-y2)*(b-y2));

double t = (Dg*2)/Dd;

if(t>1)

{

caught=1;

}

else

{

Hx= a;

Hy= b;

caught=0;

}

if(!caught)

printf("The gopher can escape through the hole at (%.3lf,%.3lf).\n",Hx,Hy);

//cout<<"The gopher can escape through the hole at ("<<Hx<<","<<Hy<<").\n";

else

cout<<"The gopher cannot escape.\n";

}

return 0;

}

Theory: The key to figuring out this problem was to recognize that you needed to resolve cycles in the data – if you follow an item to the item that’s in its spot, and then the one that’s in the next one’s spot, until you reach the original item again, you’ll have a cycle of

Continue Reading “1016” →

763

Asif NaeemOctober 28, 2014

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


#define max(a,b) (a)>(b)?(a):(b)
#define size 350

using namespace std;

struct bignum{
	int s[size];
	int len;
	bignum()
	{
		len = 1;
		memset(s,0,sizeof(s));
	}

	bignum operator = (const char *str)
	{
		len = strlen(str);

		for(int i= 0;i<len;i++)
		{
			s[len-1-i] = str[i]-'0';
		}
		return *this;
	}

	bignum operator = (const int num)
	{
		char ch[300];
		sprintf(ch,"%d",num);

		*this = ch;
		return *this;
	}
	bignum(const char *str)
	{
		*this = str;
	}

	bignum(const int num)
	{
		*this = num;
	}

	bignum operator +(const bignum &big)
	{
		bignum sum;

		sum.len = max(this->len,big.len);//((this->len) >= (big.len) ? (this->len) : (big.len) );
		int tmp=0;
		for(int i=0;i<sum.len;i++)
		{
			if(i<this->len)
				tmp+=this->s[i];

			if(i<(big.len))
				tmp+=(big.s[i]);

			sum.s[i] = tmp%10;
			tmp/=10;
		}

		while(tmp)
		{
			sum.s[sum.len++] = tmp%10;
			tmp/=10;
		}

		return sum;
	}

	bignum operator -(const bignum &big)
	{
		bignum sub;

		sub.len = ((this->len) >= (big.len) ? (this->len) : (big.len) );
		int i=0;

		for(i=0;i<big.len;i++)
		{
			if((this->s[i])<big.s[i])
			{
				this->s[i]+=10;
				this->s[i+1]--;
			}
			sub.s[i] = (this->s[i])-big.s[i];
		}

		for(;i<(this->len);i++)
		{
			if(this->s[i]<0)
			{
				this->s[i]+=10;
				this->s[i+1]--;
			}
			sub.s[i]=this->s[i];
		}

		while(sub.s[sub.len-1]==0)
		{
			sub.len--;
		}

		if(sub.len==0)
		sub.len=1;

	return sub;
	}

	bool operator <(const bignum &b)const
	{
		if((this->len)!=b.len)
			return (this->len) < b.len;

		for(int i=len-1;i>=0;i--)
		{
			if(this->s[i]!=b.s[i])
			return this->s[i] < b.s[i];
		}
		return false;
	}

	bool operator >(const bignum &b)const{ return b < *this;}
	bool operator <=(const bignum &b)const{return !(b<(*this));}
	bool operator >=(const bignum &b)const{return !((*this)<b);}
	bool operator !=(const bignum &b)const{return (b<(*this)) || (((*this)<b));}
	bool operator ==(const bignum &b)const{return !(b!=*this);}

	void prnt()
	{
		if(len==1 && s[0]==0)
		printf("0");
		else
		{
			for(int i=len-1;i>=0;i--)
			printf("%d",s[i]);
		}
		cout<<"\n";
	}
};

bignum fib[120];
bignum res,zero;


void solve(int index)
{
	int flag=1;
	for(int i=index;i>=1;i--)
	{
		if(res>=fib[i] && flag)
		{
			printf("1");
			res = res - fib[i];
			flag=0;
		}
		else
		{
			printf("0");
			flag = 1;
		}
	}

}

int main()
{
	/*string number;
	int num=40;
	sprintf(number, "%d", num);
	printf("%s\n",number);
	*/
	int kase=0;
	fib[1]="1";
	fib[2]="2";

	for(int i=3;i<120;i++)
	fib[i]= fib[i-1]+fib[i-2];

	char s1[300],s2[300];
	bignum sum,sum1;

	while(~scanf("%s%s",s1,s2))
	{
		sum ="0";
		sum1 ="0";
		res="0";
		if (kase ++)
		{
			printf("\n");
		}
		for(int i=strlen(s1)-1;i>=0;i--)
		{
			if(s1[i]=='1')
			{
				sum= sum +fib[strlen(s1)-i];

			}
		}
		for(int i=strlen(s2)-1;i>=0;i--)
		{
			if(s2[i]=='1')
			sum1=sum1 + fib[strlen(s2)-i];
		}

		res =sum+sum1;
		if(res==zero)
		{
			cout<<"0\n";
			continue;
		}
		else
		{
			int ind,pos;
			for(ind=120-1;ind>=1;ind--)
			{
				if(res>=fib[ind])
				{
					break;
				}
			}

			solve(ind);
			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

212

213

214

215

216

217

218

219

220

221

222

223

224

225

226

227

228

229

230

231

232

233

234

#include <iostream>

#include <string>

#include <stdio.h>

#include <string.h>

#define max(a,b) (a)>(b)?(a):(b)

#define size 350

using namespace std;

struct bignum{

int s[size];

int len;

bignum()

{

len = 1;

memset(s,0,sizeof(s));

}

bignum operator = (const char *str)

{

len = strlen(str);

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

{

s[len-1-i] = str[i]-'0';

}

return *this;

}

bignum operator = (const int num)

{

char ch[300];

sprintf(ch,"%d",num);

*this = ch;

return *this;

}

bignum(const char *str)

{

*this = str;

}

bignum(const int num)

{

*this = num;

}

bignum operator +(const bignum &big)

{

bignum sum;

sum.len = max(this->len,big.len);//((this->len) >= (big.len) ? (this->len) : (big.len) );

int tmp=0;

for(int i=0;i<sum.len;i++)

{

if(i<this->len)

tmp+=this->s[i];

if(i<(big.len))

tmp+=(big.s[i]);

sum.s[i] = tmp%10;

tmp/=10;

}

while(tmp)

{

sum.s[sum.len++] = tmp%10;

tmp/=10;

}

return sum;

}

bignum operator -(const bignum &big)

{

bignum sub;

sub.len = ((this->len) >= (big.len) ? (this->len) : (big.len) );

int i=0;

for(i=0;i<big.len;i++)

{

if((this->s[i])<big.s[i])

{

this->s[i]+=10;

this->s[i+1]--;

}

sub.s[i] = (this->s[i])-big.s[i];

}

for(;i<(this->len);i++)

{

if(this->s[i]<0)

{

this->s[i]+=10;

this->s[i+1]--;

}

sub.s[i]=this->s[i];

}

while(sub.s[sub.len-1]==0)

{

sub.len--;

}

if(sub.len==0)

sub.len=1;

return sub;

}

bool operator <(const bignum &b)const

{

if((this->len)!=b.len)

return (this->len) < b.len;

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

{

if(this->s[i]!=b.s[i])

return this->s[i] < b.s[i];

}

return false;

}

bool operator >(const bignum &b)const{ return b < *this;}

bool operator <=(const bignum &b)const{return !(b<(*this));}

bool operator >=(const bignum &b)const{return !((*this)<b);}

bool operator !=(const bignum &b)const{return (b<(*this)) || (((*this)<b));}

bool operator ==(const bignum &b)const{return !(b!=*this);}

void prnt()

{

if(len==1 && s[0]==0)

printf("0");

else

{

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

printf("%d",s[i]);

}

cout<<"\n";

}

};

bignum fib[120];

bignum res,zero;

void solve(int index)

{

int flag=1;

for(int i=index;i>=1;i--)

{

if(res>=fib[i] && flag)

{

printf("1");

res = res - fib[i];

flag=0;

}

else

{

printf("0");

flag = 1;

}

int main()

{

/*string number;

int num=40;

sprintf(number, "%d", num);

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

int kase=0;

fib[1]="1";

fib[2]="2";

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

fib[i]= fib[i-1]+fib[i-2];

char s1[300],s2[300];

bignum sum,sum1;

while(~scanf("%s%s",s1,s2))

{

sum ="0";

sum1 ="0";

res="0";

if (kase ++)

{

printf("\n");

}

for(int i=strlen(s1)-1;i>=0;i--)

{

if(s1[i]=='1')

{

sum= sum +fib[strlen(s1)-i];

}

for(int i=strlen(s2)-1;i>=0;i--)

{

if(s2[i]=='1')

sum1=sum1 + fib[strlen(s2)-i];

}

res =sum+sum1;

if(res==zero)

{

cout<<"0\n";

continue;

}

else

{

int ind,pos;

for(ind=120-1;ind>=1;ind--)

{

if(res>=fib[ind])

{

break;

}

solve(ind);

printf("\n");

}

return 0;

}

1584

Asif NaeemOctober 23, 2014

#include <iostream>
#include <string>


using namespace std;

int main()
{
	string s,s1,p;
	int t;
	cin>>t;
	/*if("CCTC" > "CCCT")
	cout<<"CCTC"<<"\n";
	else
	cout<<"CCCT"<<"\n";
	*/
	while(t--)
	{
		cin>>s;
		p=s;
		for(int i=1;i<p.size();i++)
		{
			s1="";
			s1.append(1u,p[i]);

			if((i+1)<p.size())
			for(int j=i+1;j<p.size();j++)
				s1.append(1u,p[j]);

			if(s1.size()!=p.size())
			{
				for(int k=0;k<i;k++)
					s1.append(1u,p[k]);
			}

			//cout<<s1<<" = s1\n";
			if(s1<s)
			s = s1;
		}

		cout<<s<<"\n";

	}

	return 0;
}

#include <iostream>

#include <string>

using namespace std;

int main()

{

string s,s1,p;

int t;

cin>>t;

/*if("CCTC" > "CCCT")

cout<<"CCTC"<<"\n";

else

cout<<"CCCT"<<"\n";

while(t--)

{

cin>>s;

p=s;

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

{

s1="";

s1.append(1u,p[i]);

if((i+1)<p.size())

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

s1.append(1u,p[j]);

if(s1.size()!=p.size())

{

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

s1.append(1u,p[k]);

}

//cout<<s1<<" = s1\n";

if(s1<s)

s = s1;

}

cout<<s<<"\n";

}

return 0;

}

12820

Asif NaeemOctober 20, 2014

#include <iostream>
#include <map>
#include <string>

using namespace std;
map<int,int> np;
map<char,int> mp;


int main()
{
	int n,kase=1;
	string s;

	while(cin>>n)
	{
		int cool=0;
		for(int i=0;i<n;i++)
		{
			cin>>s;

			if(s.size()==1)
			continue;

			mp.clear();
			np.clear();

			for(int i=0;i<s.size();i++)
			{
				mp[s[i]]++;

			}

			for(map<char,int>::iterator ii=mp.begin();ii!=mp.end();++ii)
			{
				np[ii->second]=1;
			}

			if(np.size()==mp.size())
			cool++;
		}

		cout<<"Case "<<kase++<<": "<<cool<<"\n";
	}
}

#include <iostream>

#include <map>

#include <string>

using namespace std;

map<int,int> np;

map<char,int> mp;

int main()

{

int n,kase=1;

string s;

while(cin>>n)

{

int cool=0;

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

{

cin>>s;

if(s.size()==1)

continue;

mp.clear();

np.clear();

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

{

mp[s[i]]++;

}

for(map<char,int>::iterator ii=mp.begin();ii!=mp.end();++ii)

{

np[ii->second]=1;

}

if(np.size()==mp.size())

cool++;

}

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

}

12816

Asif NaeemOctober 20, 2014

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

using namespace std;


struct point{
	double x;
	double y;
}p[101];

int isIsosceles(int a,int b,int c)
{
	//dist of p[a],p[b]

	double  d1 = sqrt((p[a].x-p[b].x)*(p[a].x-p[b].x) + (p[a].y-p[b].y)*(p[a].y-p[b].y));
	double  d2 = sqrt((p[c].x-p[b].x)*(p[c].x-p[b].x) + (p[c].y-p[b].y)*(p[c].y-p[b].y));
	double  d3 = sqrt((p[a].x-p[c].x)*(p[a].x-p[c].x) + (p[a].y-p[c].y)*(p[a].y-p[c].y));

	//cout<<d1<<" "<<d2<<" "<<d3<<"\n";
	if((d1+d2)<=d3 || (d3+d1)<=d2 || (d3+d2)<=d1)
	return 0;
	else if(d1==d2 && d2==d3 && d1==d3)
	return 0;
	else if(d1!=d2 && d2!=d3 && d1!=d3)
	return 0;

	return 1;
}


int main()
{
	int n;
	double a,b;
	int Isosceles;

	while(cin>>n)
	{
		for(int i=0;i<n;i++)
		{
			cin>>a>>b;
			p[i].x=a;
			p[i].y=b;
		}

		Isosceles = 0;
		for(int i=0;(i-2)<n;i++)
		{
			for(int j=i+1;(j-1)<n;j++)
			{
				for(int k=j+1;k<n;k++)
				{
					//cout<<i<<","<<j<<","<<k<<"\n";
					if(isIsosceles(i,j,k))
					Isosceles++;
				}
			}
		}

		cout<<Isosceles<<"\n";
	}

	return 0;
}

#include <iostream>

#include <math.h>

//#include <string>

using namespace std;

struct point{

double x;

double y;

}p[101];

int isIsosceles(int a,int b,int c)

{

//dist of p[a],p[b]

double d1 = sqrt((p[a].x-p[b].x)*(p[a].x-p[b].x) + (p[a].y-p[b].y)*(p[a].y-p[b].y));

double d2 = sqrt((p[c].x-p[b].x)*(p[c].x-p[b].x) + (p[c].y-p[b].y)*(p[c].y-p[b].y));

double d3 = sqrt((p[a].x-p[c].x)*(p[a].x-p[c].x) + (p[a].y-p[c].y)*(p[a].y-p[c].y));

//cout<<d1<<" "<<d2<<" "<<d3<<"\n";

if((d1+d2)<=d3 || (d3+d1)<=d2 || (d3+d2)<=d1)

return 0;

else if(d1==d2 && d2==d3 && d1==d3)

return 0;

else if(d1!=d2 && d2!=d3 && d1!=d3)

return 0;

return 1;

}

int main()

{

int n;

double a,b;

int Isosceles;

while(cin>>n)

{

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

{

cin>>a>>b;

p[i].x=a;

p[i].y=b;

}

Isosceles = 0;

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

{

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

{

for(int k=j+1;k<n;k++)

{

//cout<<i<<","<<j<<","<<k<<"\n";

if(isIsosceles(i,j,k))

Isosceles++;

}

cout<<Isosceles<<"\n";

}

return 0;

}

1583

Asif NaeemOctober 19, 2014

#include <iostream>
#include <algorithm>
#include <vector>
#include <map>

#define lld long long

using namespace std;
int n;

int digit_generator(int num)
{
	int r=num;

	while(num)
	{
		r+=(num%10);
		num/=10;
	}

	if(r==n)
	return r;
	else
	return 0;
}

int main()
{
	int t;

	cin>>t;

	while(t--)
	{
		cin>>n;

		if(n==11)
		{
			cout<<10<<"\n";
			continue;
		}
		if(n<10)
		{
			if(n%2==0)
			cout<<n/2<<"\n";
			else
			cout<<0<<"\n";

			continue;
		}
		if(n<100)
		{
			if(n-18<0)
			{
				int f=0;
				for(int i=1;i<(n-1);i++)
				{
					if(digit_generator(i))
					{
						f=i;
						break;
					}
				}

				if(f)
				cout<<f<<"\n";
				else
				cout<<0<<"\n";


			}
			else
			{
				int f=0;
				for(int i=n-18;i<=n;i++)
					if(digit_generator(i))
					{
						f=i;
						break;
					}

				if(f)
				cout<<f<<"\n";
				else
				cout<<0<<"\n";
			}
			continue;
		}

		if(n<1000)
		{
			int f=0;
			for(int i=n-27;i<=n;i++)
				if(digit_generator(i))
				{
					f=i;
					break;
				}

			if(f)
				cout<<f<<"\n";
			else
				cout<<0<<"\n";
			continue;
		}

		if(n<10000)
		{
			int f=0;
			for(int i=n-36;i<=n;i++)
				if(digit_generator(i))
				{
					f=i;
					break;
				}

			if(f)
				cout<<f<<"\n";
			else
				cout<<0<<"\n";
			continue;
		}

		if(n<100000)
		{
			int f=0;
			for(int i=n-45;i<=n;i++)
				if(digit_generator(i))
				{
					f=i;
					break;
				}

			if(f)
				cout<<f<<"\n";
			else
				cout<<0<<"\n";
			continue;
		}


		if(n<1000000)
		{
			int f=0;
			for(int i=n-54;i<=n;i++)
				if(digit_generator(i))
				{
					f=i;
					break;
				}

			if(f)
				cout<<f<<"\n";
			else
				cout<<0<<"\n";
			continue;
		}
	}

	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

#include <iostream>

#include <algorithm>

#include <vector>

#include <map>

#define lld long long

using namespace std;

int n;

int digit_generator(int num)

{

int r=num;

while(num)

{

r+=(num%10);

num/=10;

}

if(r==n)

return r;

else

return 0;

}

int main()

{

int t;

cin>>t;

while(t--)

{

cin>>n;

if(n==11)

{

cout<<10<<"\n";

continue;

}

if(n<10)

{

if(n%2==0)

cout<<n/2<<"\n";

else

cout<<0<<"\n";

continue;

}

if(n<100)

{

if(n-18<0)

{

int f=0;

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

{

if(digit_generator(i))

{

f=i;

break;

}

if(f)

cout<<f<<"\n";

else

cout<<0<<"\n";

}

else

{

int f=0;

for(int i=n-18;i<=n;i++)

if(digit_generator(i))

{

f=i;

break;

}

if(f)

cout<<f<<"\n";

else

cout<<0<<"\n";

}

continue;

}

if(n<1000)

{

int f=0;

for(int i=n-27;i<=n;i++)

if(digit_generator(i))

{

f=i;

break;

}

if(f)

cout<<f<<"\n";

else

cout<<0<<"\n";

continue;

}

if(n<10000)

{

int f=0;

for(int i=n-36;i<=n;i++)

if(digit_generator(i))

{

f=i;

break;

}

if(f)

cout<<f<<"\n";

else

cout<<0<<"\n";

continue;

}

if(n<100000)

{

int f=0;

for(int i=n-45;i<=n;i++)

if(digit_generator(i))

{

f=i;

break;

}

if(f)

cout<<f<<"\n";

else

cout<<0<<"\n";

continue;

}

if(n<1000000)

{

int f=0;

for(int i=n-54;i<=n;i++)

if(digit_generator(i))

{

f=i;

break;

}

if(f)

cout<<f<<"\n";

else

cout<<0<<"\n";

continue;

}

return 0;

}

1585

Asif NaeemOctober 18, 2014

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

using namespace std;

int main()
{
    int t,toAdd,sum;
    string s;

    cin>>t;

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

       sum = 0;
       toAdd = 0;

       for(int i=0;i<s.size();i++)
       {
          if(s[i]=='X')
            toAdd=0;
          else if(s[i]=='O')
            toAdd++;

          sum+=toAdd;
       }

       cout<<sum<<"\n";
    }

    return 0;
}
//OOXXOXXOOO

#include <iostream>

#include <stdio.h>

#include <vector>

#include <math.h>

#include <string.h>

using namespace std;

int main()

{

int t,toAdd,sum;

string s;

cin>>t;

while(t--)

{

cin>>s;

sum = 0;

toAdd = 0;

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

{

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

toAdd=0;

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

toAdd++;

sum+=toAdd;

}

cout<<sum<<"\n";

}

return 0;

}

//OOXXOXXOOO

1062

Asif NaeemOctober 9, 2014

WA Code:

#include <iostream>
#include <map>
#include <string>


using namespace std;

map<char,int> m,np;
//vector<char> v;

int main()
{
	string str;
	int cnt;
	int kase=1;

	while(cin>>str)
	{
		if(str=="end")
		break;

		cnt=1;
		np.clear();
		m.clear();

		for(int i=0;i<str.size();i++)
		{
			if(m[str[i]]<(i+1))
				m[str[i]]=i+1;
		}

		for(map<char,int>::iterator ii=m.begin();ii!=m.end();++ii)
		{
			cout<<ii->first<<" "<<ii->second<<"\n";
			int pos=ii->second;
			char c=ii->first;
			int f=0;
			for(int i=0;i<pos;i++)
			{
				if(str[i]<c && np[str[i]]==0)
				{
					np[str[i]]=1;
					if(f==0)
					cnt++;
					f=1;
				}
			}
		}
		cout<<"\n\n";
			cout<<"Case "<<kase++<<": ";
			cout<<cnt<<"\n";
		}

	return 0;
}

#include <iostream>

#include <map>

#include <string>

using namespace std;

map<char,int> m,np;

//vector<char> v;

int main()

{

string str;

int cnt;

int kase=1;

while(cin>>str)

{

if(str=="end")

break;

cnt=1;

np.clear();

m.clear();

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

{

if(m[str[i]]<(i+1))

m[str[i]]=i+1;

}

for(map<char,int>::iterator ii=m.begin();ii!=m.end();++ii)

{

cout<<ii->first<<" "<<ii->second<<"\n";

int pos=ii->second;

char c=ii->first;

int f=0;

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

{

if(str[i]<c && np[str[i]]==0)

{

np[str[i]]=1;

if(f==0)

cnt++;

f=1;

}

cout<<"\n\n";

cout<<"Case "<<kase++<<": ";

cout<<cnt<<"\n";

}

return 0;

}

Idea The ships load in alphabetical order, so we can stack with respect to the alphabet. Start with one stack and add the first letter. From then on, check each stack to see if the current letter can be added. If the current letter is less than or equal to the one

Continue Reading “1062” →

Month: October 2014

1523

10310

1016

763

1584

12820

12816

1583

1585

1062

Archives

Categories