2014 – Page 11 – Live with passion

10025

Asif NaeemJuly 15, 2014

#include <iostream>

using namespace std;

unsigned long long int T[60001];

int main()
{
int t,n,c=0;
int r,pos;
T[1]=1;
for(int i=2;i<60001;i++)
T[i]=T[i-1]+i;

//cout<<T[60000]<<"\n";
cin>>t;
c=t;
int k=0;
while(t--)
{
cin>>n;

if(k!=c &&k!=0)
cout<<"\n";
k++;
if(n==0)
{
cout<<3<<"\n";
continue;
}
if(n==1)
{
cout<<2<<"\n";
continue;
}
if(n<0)
n*=-1;
for(int i=1;i<60001;i++)
{
if(T[i]>=n)
{
r= T[i];
pos=i;
break;
}
}

int d=r-n;

if(d==0 || d%2==0)
{
cout<<pos<<"\n";
continue;
}
while((T[pos]-n)%2==1)
{
pos++;
}

cout<<pos<<"\n";

}

return 0;
}

#include <iostream>

using namespace std;

unsigned long long int T[60001];

int main()

{

int t,n,c=0;

int r,pos;

T[1]=1;

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

T[i]=T[i-1]+i;

//cout<<T[60000]<<"\n";

cin>>t;

c=t;

int k=0;

while(t--)

{

cin>>n;

if(k!=c &&k!=0)

cout<<"\n";

k++;

if(n==0)

{

cout<<3<<"\n";

continue;

}

if(n==1)

{

cout<<2<<"\n";

continue;

}

if(n<0)

n*=-1;

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

{

if(T[i]>=n)

{

r= T[i];

pos=i;

break;

}

int d=r-n;

if(d==0 || d%2==0)

{

cout<<pos<<"\n";

continue;

}

while((T[pos]-n)%2==1)

{

pos++;

}

cout<<pos<<"\n";

}

return 0;

}

[highlight]Solution[/highlight] /* Now we can break the Base B as a product of primes : B = a^p1 * b^p2 * c^p3 * … Then the number of trailing zeroes in N factorial in Base B is given by the formulae min{1/p1(n/a + n/(a*a) + ….), 1/p2(n/b + n/(b*b) + ..), ….}. And the number

Continue Reading “10061” →

10015

Asif NaeemJuly 10, 2014

#include <iostream>

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

using namespace std;

int prime[40001];
vector<int> vb,v;

int _p(int n)
{
int pos=0;
v.clear();
for(int i=1;i<=n;i++)
v.push_back(i);
for(int i=0;i<n-1;i++)
{
int k=vb[i];
int l = k%v.size()-1;
if(l+pos>(v.size()-1))
{
pos=l+pos-v.size();
}
else
pos = l+pos;
v.erase(v.begin()+pos);
}
cout<<v[0]<<"\n";
v.clear();
return 0;
}

int main()
{
int n;
for(int i=2;i*i<40000;i++)
{
if(prime[i]==0)
{
for(int j=i*i;j<40000;j+=i)
prime[j]=1;
}
}
for(int i=2;i<40000;i++)
{
if(prime[i]==0)
vb.push_back(i);
}

while(cin>>n)
{
if(n==0)
break;
if(n>=1 && n<=3)
{
cout<<1<<"\n";
continue;
}
_p(n);

}

return 0;
}

 

/*
int _p(int n)
{
int lastpos=0;
int cnt=n;
int f=0;
for(int i=0;i<n;i++)
{
int k=vb[i];
if(cnt==1)
{
f=1;
break;
}
while(k)
{
if(lastpos>=n)
lastpos=0;
for(int l=lastpos+1;l<=n;l++)
{
if(arr[l]==0)
{
k-=1;
if(k==0)
{
cnt-=1;
arr[l]=1;
lastpos=l;
if(l==n)
lastpos=0;
break;
}
}
if(l==n)
{
lastpos=0;
break;
}
}
}
if(f)
break;
}

for(int i=1;i<=n;i++)
{
if(arr[i]==0)
{
cout<<i<<"\n";
save[n]=i;
break;
}
}

return 0;
}
*/

11762

Asif NaeemJuly 9, 2014

#include <iostream>

#include <vector>
#include <map>
#include <stdio.h>

using namespace std;

int prime[1000001];
int primes[1000001];
double dp[1000001];
vector<int> vb;
map<int,int> mp;

int main()
{
int n,t;

primes[0]=primes[1]=0;

for(int i=2;i*i<1000001;i++)
{
if(prime[i]==0)
{
for(int j=i*i;j<1000001;j+=i)
{
prime[j]=1;
primes[j]=i;
}
//primes[i]=i;
}
}

prime[0]=prime[1]=0;
for(int i=2;i<1000001;i++)
{
if(primes[i]==0)
primes[i]=i;
if(prime[i])
prime[i]=0;
else
prime[i]=1;
prime[i]+=prime[i-1];
}

dp[1]=0;

for(int i=2;i<1000001;i++)
{
int k=i;
mp.clear();
vb.clear();
while(primes[k]!=0)
{
if(mp[primes[k]]==0)
{
mp[primes[k]]=1;
vb.push_back(primes[k]);
}
k/=primes[k];
}

double g=0;
for(int j=0;j<vb.size();j++)
g+=dp[i/vb[j]];

dp[i]=(g+prime[i])/vb.size();
}
cin>>t;
int c=0;
while(t--)
{
cin>>n;
//cout<<prime[n]<<"\n";
c++;
cout<<"Case "<<c<<": ";
printf("%.10lf\n",dp[n]);
}

return 0;
}

#include <iostream>

#include <vector>

#include <map>

#include <stdio.h>

using namespace std;

int prime[1000001];

int primes[1000001];

double dp[1000001];

vector<int> vb;

map<int,int> mp;

int main()

{

int n,t;

primes[0]=primes[1]=0;

for(int i=2;i*i<1000001;i++)

{

if(prime[i]==0)

{

for(int j=i*i;j<1000001;j+=i)

{

prime[j]=1;

primes[j]=i;

}

//primes[i]=i;

}

prime[0]=prime[1]=0;

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

{

if(primes[i]==0)

primes[i]=i;

if(prime[i])

prime[i]=0;

else

prime[i]=1;

prime[i]+=prime[i-1];

}

dp[1]=0;

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

{

int k=i;

mp.clear();

vb.clear();

while(primes[k]!=0)

{

if(mp[primes[k]]==0)

{

mp[primes[k]]=1;

vb.push_back(primes[k]);

}

k/=primes[k];

}

double g=0;

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

g+=dp[i/vb[j]];

dp[i]=(g+prime[i])/vb.size();

}

cin>>t;

int c=0;

while(t--)

{

cin>>n;

//cout<<prime[n]<<"\n";

c++;

cout<<"Case "<<c<<": ";

printf("%.10lf\n",dp[n]);

}

return 0;

}

11119

Asif NaeemJuly 5, 2014

#include <iostream>

#include <map>
#include <stdio.h>
#include <string>
#include <string.h>
#include <vector>
#include <algorithm>

using namespace std;

map<string,int> cat;
map<string,int> an;

map<int,string> _cat;
map<int,string> _an;

vector<string> vb[110];
vector<int> vcat,ancat;

int pri_cat[110][110];
int pri_an[110][110];

string s[110];
string S1[110],S2[110];

int Nc,Na,mix;

struct msr{
int weight;
int pos;
}pwr[110];

bool cmp(msr a,msr b)
{
return a.weight>b.weight;
}

int StableMarriage()
{
bool mCat[110];
int fAn[110];
int p;
map<int,string> couple;
int freeCount=vcat.size();

for(int i=0;i<vcat.size();i++)
{
mCat[i]=true;
fAn[i]=-1;
}

while(freeCount>0)
{
int m;
if(freeCount==0)
break;
for(int i=0;i<vcat.size();i++)
{
if(mCat[i]==true)
{
m=vcat[i];
p=i;
break;
}
}

for(int i=0;i<ancat.size();i++)
{
pwr[i].weight=pri_cat[m][ancat[i]];
pwr[i].pos=i;
}
sort(pwr,pwr+ancat.size(),cmp);

while(mCat[p])
{
int w=0;
int select_an;

//cout<<pwr[0].weight<<" "<<pwr[0].pos<<"\n";
//getchar();
for(int z=0;z<ancat.size();z++)
{
select_an=pwr[z].pos;
if(fAn[select_an]==-1)
{
fAn[select_an]=p;
mCat[p]=false;
freeCount--;
string st=_cat[vcat[p]];
st.append(_an[ancat[select_an]]);
couple[p+1]="";
//cout<<st<<" "<<p+1<<"\n";
//if(freeCount!=0)
couple[p+1]=st;
break;
}
else
{
int m1=fAn[select_an];
if(pri_an[ancat[select_an]][m]>pri_an[ancat[select_an]][vcat[m1]])
{
mCat[p]=false;
mCat[m1]=true;
fAn[select_an]=p;
string st=_cat[vcat[p]];
st.append(_an[ancat[select_an]]);
//if(freeCount!=0)
couple[p+1]=st;
//cout<<st<<" = "<<p+1<<"\n";
break;
}
}
}
if(mCat[p]==false)
break;
}
}

int cntr=0;

for(map<int,string>::iterator it=couple.begin();it!=couple.end();++it)
{
if(cntr<=mix-2)
cout<<it->second<<" ";
else
cout<<it->second;
cntr+=1;

}
cout<<"\n\n";
return 0;
}
int main()
{
int a,c=0,m;
string str;

while(cin>>Nc)
{
if(Nc==0)
break;
c+=1;
cat.clear();
an.clear();
int k=1;
for(int i=0;i<Nc;i++)
{
cin>>str;
if(cat[str]==0)
{
cat[str]=k;
_cat[k-1]=str;
k++;
}
}
cin>>Na;
k=1;
for(int i=0;i<Na;i++)
{
cin>>str;
if(an[str]==0)
{
an[str]=k;
_an[k-1]=str;
k++;
}
}

for(int i=0;i<Nc;i++)
{
for(int j=0;j<Na;j++)
{
cin>>a;
pri_cat[i][j]=a;
}
}

for(int i=0;i<Na;i++)
{
for(int j=0;j<Nc;j++)
{
cin>>a;
pri_an[i][j]=a;
}
}
m=0;
while(cin>>mix)
{
if(mix==0)
break;
m+=1;
_an.clear();
_cat.clear();
vcat.clear();
ancat.clear();
for(int i=0;i<mix;i++)
{
cin>>s[i];
S1[i]="";
S2[i]="";
S1[i].append(1u,s[i][0]);
S1[i].append(1u,s[i][1]);
int y=cat[S1[i]];
_cat[y-1]=S1[i];
vcat.push_back(y-1);

S2[i].append(1u,s[i][2]);
S2[i].append(1u,s[i][3]);
y=an[S2[i]];
_an[y-1]=S2[i];
ancat.push_back(y-1);
}

cout<<"Scenario "<<c<<", Mixture "<<m<<":\n";
StableMarriage();
}
}//end while

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

#include <iostream>

#include <map>

#include <stdio.h>

#include <string>

#include <string.h>

#include <vector>

#include <algorithm>

using namespace std;

map<string,int> cat;

map<string,int> an;

map<int,string> _cat;

map<int,string> _an;

vector<string> vb[110];

vector<int> vcat,ancat;

int pri_cat[110][110];

int pri_an[110][110];

string s[110];

string S1[110],S2[110];

int Nc,Na,mix;

struct msr{

int weight;

int pos;

}pwr[110];

bool cmp(msr a,msr b)

{

return a.weight>b.weight;

}

int StableMarriage()

{

bool mCat[110];

int fAn[110];

int p;

map<int,string> couple;

int freeCount=vcat.size();

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

{

mCat[i]=true;

fAn[i]=-1;

}

while(freeCount>0)

{

int m;

if(freeCount==0)

break;

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

{

if(mCat[i]==true)

{

m=vcat[i];

p=i;

break;

}

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

{

pwr[i].weight=pri_cat[m][ancat[i]];

pwr[i].pos=i;

}

sort(pwr,pwr+ancat.size(),cmp);

while(mCat[p])

{

int w=0;

int select_an;

//cout<<pwr[0].weight<<" "<<pwr[0].pos<<"\n";

//getchar();

for(int z=0;z<ancat.size();z++)

{

select_an=pwr[z].pos;

if(fAn[select_an]==-1)

{

fAn[select_an]=p;

mCat[p]=false;

freeCount--;

string st=_cat[vcat[p]];

st.append(_an[ancat[select_an]]);

couple[p+1]="";

//cout<<st<<" "<<p+1<<"\n";

//if(freeCount!=0)

couple[p+1]=st;

break;

}

else

{

int m1=fAn[select_an];

if(pri_an[ancat[select_an]][m]>pri_an[ancat[select_an]][vcat[m1]])

{

mCat[p]=false;

mCat[m1]=true;

fAn[select_an]=p;

string st=_cat[vcat[p]];

st.append(_an[ancat[select_an]]);

//if(freeCount!=0)

couple[p+1]=st;

//cout<<st<<" = "<<p+1<<"\n";

break;

}

if(mCat[p]==false)

break;

}

int cntr=0;

for(map<int,string>::iterator it=couple.begin();it!=couple.end();++it)

{

if(cntr<=mix-2)

cout<<it->second<<" ";

else

cout<<it->second;

cntr+=1;

}

cout<<"\n\n";

return 0;

}

int main()

{

int a,c=0,m;

string str;

while(cin>>Nc)

{

if(Nc==0)

break;

c+=1;

cat.clear();

an.clear();

int k=1;

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

{

cin>>str;

if(cat[str]==0)

{

cat[str]=k;

_cat[k-1]=str;

k++;

}

cin>>Na;

k=1;

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

{

cin>>str;

if(an[str]==0)

{

an[str]=k;

_an[k-1]=str;

k++;

}

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

{

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

{

cin>>a;

pri_cat[i][j]=a;

}

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

{

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

{

cin>>a;

pri_an[i][j]=a;

}

m=0;

while(cin>>mix)

{

if(mix==0)

break;

m+=1;

_an.clear();

_cat.clear();

vcat.clear();

ancat.clear();

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

{

cin>>s[i];

S1[i]="";

S2[i]="";

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

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

int y=cat[S1[i]];

_cat[y-1]=S1[i];

vcat.push_back(y-1);

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

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

y=an[S2[i]];

_an[y-1]=S2[i];

ancat.push_back(y-1);

}

cout<<"Scenario "<<c<<", Mixture "<<m<<":\n";

StableMarriage();

}

}//end while

return 0;

}

11780

Asif NaeemJune 25, 2014

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

using namespace std;

map<int,int> mp;
int fib[50];
double dp[1010];

int main()
{
fib[0]=0;
fib[1]=1;
fib[2]=2;

mp[1]=1;
mp[2]=2;

for(int i=3;i<=20;i++)
{
fib[i]=fib[i-1]+fib[i-2];
mp[fib[i]]=i;
}
dp[1]=.4;
for(int i=1;i<=1000;i++)
{
double p=i*1.6;
double d=1000000;
for(int j=1;j<=18;j++)
{
if(i-fib[j]>=0)
{
int a=mp[fib[j]];
double x;
if((fib[a+1]+dp[i-fib[j]]-p)<0)
{
x=-1*(fib[a+1]+dp[i-fib[j]]-p);
}
else
x=(fib[a+1]+dp[i-fib[j]]-p);
if(x<d)
{
d=x;
dp[i]=fib[a+1]+dp[i-fib[j]];
}
}
}
}
int n;
while(cin>>n)
{
if(n==0)
break;

printf("%.2lf\n",fabs(dp[n]-n*1.6));//"\n";
}

return 0;
}

#include <iostream>

#include <math.h>

#include <map>

#include <stdio.h>

#include <string>

#include <vector>

using namespace std;

map<int,int> mp;

int fib[50];

double dp[1010];

int main()

{

fib[0]=0;

fib[1]=1;

fib[2]=2;

mp[1]=1;

mp[2]=2;

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

{

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

mp[fib[i]]=i;

}

dp[1]=.4;

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

{

double p=i*1.6;

double d=1000000;

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

{

if(i-fib[j]>=0)

{

int a=mp[fib[j]];

double x;

if((fib[a+1]+dp[i-fib[j]]-p)<0)

{

x=-1*(fib[a+1]+dp[i-fib[j]]-p);

}

else

x=(fib[a+1]+dp[i-fib[j]]-p);

if(x<d)

{

d=x;

dp[i]=fib[a+1]+dp[i-fib[j]];

}

int n;

while(cin>>n)

{

if(n==0)

break;

printf("%.2lf\n",fabs(dp[n]-n*1.6));//"\n";

}

return 0;

}

903

Asif NaeemJune 19, 2014

#include <iostream>

using namespace std;

int main()
{
int n;
int Break=0;
long long int res,res1,res2,res3,res4,rank,diff;
long long int b_left,b_ryt,t_left,t_ryt;
while(cin>>n)
{
res=1;
res1=1;
res2=1;
res3=1;
res4=1;
Break=0;
if(n==1)
{
cout<<7<<";"<<8<<";"<<9<<";\n";
cout<<6<<";"<<1<<";"<<2<<";\n";
cout<<5<<";"<<4<<";"<<3<<";\n";
continue;
}
for(long long int i=0;i<1500000000;i++)
{
if(Break)
break;
res1+=i*2;
if(res1>=n)
{
rank=i;
res=res1;
Break=1;
//continue;
}

res2+=i*4;
if(res2>=n)
{
rank=i;
res=res2;
Break=1;
//continue;
}

res3+=i*6;
if(res3>=n)
{
rank=i;
res=res3;
Break=1;
//continue;
}
res4+=i*8;
if(res4>=n)
{
rank=i;
res=res4;
Break=1;
}

}

if(rank==0)
{
cout<<7<<";"<<8<<";"<<9<<";\n";
cout<<6<<";"<<1<<";"<<2<<";\n";
cout<<5<<";"<<4<<";"<<3<<";\n";
continue;
}

diff=rank*2;
t_ryt=res;
t_left=t_ryt-diff;
b_left=t_left-diff;
b_ryt=b_left-diff;

if(n==t_ryt)
{
cout<<res+(rank+1)*8-2<<";"<<res+(rank+1)*8-1<<";"<<res+(rank+1)*8<<";\n";
cout<<res-1<<";"<<res<<";"<<res+1<<";\n";
cout<<res-(rank)*8<<";"<<(res+1)-(rank)*8<<";"<<res+2<<";\n";
continue;
}
if(n==t_left)
{
cout<<res+(rank+1)*6<<";"<<res+(rank+1)*6+1<<";"<<res+2+(rank+1)*6<<";\n";
cout<<res-1+(rank+1)*6<<";"<<n<<";"<<n+1<<";\n";
cout<<res-2+(rank+1)*6<<";"<<n-1<<";"<<n-rank*6-(rank-1)*2<<";\n";
continue;
}
if(n==b_left)
{
//cout<<rank<<"\n";
cout<<res+2+(rank+1)*4<<";"<<n+1<<";"<<n-(2*rank-1)*4<<";\n";
cout<<res+1+(rank+1)*4<<";"<<n<<";"<<n-1<<";\n";
cout<<res+(rank+1)*4<<";"<<res+(rank+1)*4-1<<";"<<res+(rank+1)*4-2<<";\n";
continue;
}
if(n==b_ryt)
{
cout<<res-rank*8-(rank-1)*6<<";"<<n-1<<";"<<(res+(rank+1)*2)-2<<";\n";
cout<<n+1<<";"<<n<<";"<<(res+(rank+1)*2)-1<<";\n";
cout<<(res+(rank+1)*2)+2<<";"<<(res+(rank+1)*2)+1<<";"<<res+(rank+1)*2<<";\n";
continue;
}
if(n>b_ryt && n<b_left)
{
if(n==4)
{
cout<<6<<";"<<1<<";"<<2<<";\n";
cout<<5<<";"<<4<<";"<<3<<";\n";
cout<<16<<";"<<15<<";"<<14<<";\n";
continue;
}
int prev_b_ryt=res-rank*8-(rank-1)*6;
int prev_b_left=b_left-(2*rank-1)*4;
int next_b_ryt=res+(rank+1)*2;
int next_b_left=res+(rank+1)*4;
int pos= n- b_ryt;
if(pos==1)
{
cout<<prev_b_ryt+(pos)<<";"<<prev_b_ryt+(pos-1)<<";"<<n-2<<";\n";
cout<<n+1<<";"<<n<<";"<<n-1<<";\n";
cout<<next_b_ryt+pos+2<<";"<<next_b_ryt+pos+1<<";"<<next_b_ryt+pos<<";\n";
continue;
}
if(b_left-n==1)
{
cout<<n+2<<";"<<prev_b_ryt+(pos-1)<<";"<<prev_b_ryt+(pos-2)<<";\n";
cout<<n+1<<";"<<n<<";"<<n-1<<";\n";
cout<<next_b_ryt+pos+2<<";"<<next_b_ryt+pos+1<<";"<<next_b_ryt+pos<<";\n";
continue;
}
cout<<prev_b_ryt+(pos)<<";"<<prev_b_ryt+(pos-1)<<";"<<prev_b_ryt+(pos-2)<<";\n";
cout<<n+1<<";"<<n<<";"<<n-1<<";\n";
cout<<next_b_ryt+pos+2<<";"<<next_b_ryt+pos+1<<";"<<next_b_ryt+pos<<";\n";
continue;
}
if(n<t_ryt && n>t_left)
{
if(n==8)
{
cout<<22<<";"<<23<<";"<<24<<";\n";
cout<<7<<";"<<8<<";"<<9<<";\n";
cout<<6<<";"<<1<<";"<<2<<";\n";
continue;
}

int prev_t_left=t_left-rank*6-(rank-1)*2;
int prev_t_ryt=res-(rank)*8;
int next_t_ryt=res+(rank+1)*8;
int next_t_left=res+(rank+1)*6;
int pos= n- t_left;

if(pos==1)
{
cout<<next_t_left+pos<<";"<<next_t_left+pos+1<<";"<<next_t_left+pos+2<<";\n";
cout<<n-1<<";"<<n<<";"<<n+1<<";\n";
cout<<n-2<<";"<<prev_t_left<<";"<<prev_t_left+1<<";\n";
continue;
}

{
cout<<next_t_left+pos<<";"<<next_t_left+pos+1<<";"<<next_t_left+pos+2<<";\n";
cout<<n-1<<";"<<n<<";"<<n+1<<";\n";
cout<<prev_t_left+(pos-2)<<";"<<prev_t_left+(pos-1)<<";"<<prev_t_left+pos<<";\n";
continue;
}
}

if(n>b_left && n<t_left)
{

if(n==6)
{
cout<<20<<";"<<7<<";"<<8<<";\n";
cout<<19<<";"<<6<<";"<<1<<";\n";
cout<<18<<";"<<5<<";"<<4<<";\n";
continue;
}

int prev_t_left=t_left-rank*6-(rank-1)*2;
int prev_b_left=b_left-(2*rank-1)*4;
int next_b_left=res+(rank+1)*4;
int next_t_left=res+(rank+1)*6;
int pos= n- b_left;

if(pos==1)
{
cout<<next_b_left+pos+2<<";"<<n+1<<";"<<prev_b_left+(pos)<<";\n";
cout<<next_b_left+pos+1<<";"<<n<<";"<<prev_b_left+(pos-1)<<";\n";
cout<<next_b_left+pos<<";"<<n-1<<";"<<n-2<<";\n";
continue;
}

if(n==t_left-1)
{
cout<<next_b_left+pos+2<<";"<<n+1<<";"<<n+2<<";\n";
cout<<next_b_left+pos+1<<";"<<n<<";"<<prev_b_left+(pos-1)<<";\n";
cout<<next_b_left+pos<<";"<<n-1<<";"<<prev_b_left+(pos-2)<<";\n";
continue;
}
cout<<next_b_left+pos+2<<";"<<n+1<<";"<<prev_b_left+(pos)<<";\n";
cout<<next_b_left+pos+1<<";"<<n<<";"<<prev_b_left+(pos-1)<<";\n";
cout<<next_b_left+pos<<";"<<n-1<<";"<<prev_b_left+(pos-2)<<";\n";
continue;
}

if(n<b_ryt)
{
if(n==2)
{
cout<<8<<";"<<9<<";"<<10<<";\n";
cout<<1<<";"<<2<<";"<<11<<";\n";
cout<<4<<";"<<3<<";"<<12<<";\n";
continue;
}

int prev_t_ryt=res-(rank)*8;
int prev_b_ryt=res-rank*8-(rank-1)*6;
int next_b_ryt=res+(rank+1)*2;
int next_t_ryt=res+(rank+1)*8;
int pos= b_ryt - n;

if(pos==1)
{
cout<<prev_b_ryt-pos<<";"<<n-1<<";"<<next_b_ryt-(pos+2)<<";\n";
cout<<prev_b_ryt<<";"<<n<<";"<<next_b_ryt-(pos+1)<<";\n";
cout<<n+2<<";"<<n+1<<";"<<next_b_ryt-(pos)<<";\n";
continue;
}
if(prev_t_ryt+1==n)
{
cout<<res-1<<";"<<res<<";"<<res+1<<";\n";
cout<<n-1<<";"<<n<<";"<<res+2<<";\n";
cout<<prev_b_ryt-(pos-2)<<";"<<n+1<<";"<<res+3<<";\n";
continue;
}
if(prev_t_ryt+2==n)
{
cout<<n-2<<";"<<n-1<<";"<<res+2<<";\n";
cout<<prev_b_ryt-(pos-1)<<";"<<n<<";"<<res+3<<";\n";
cout<<prev_b_ryt-(pos-1)+1<<";"<<n+1<<";"<<res+4<<";\n";
continue;
}
cout<<prev_b_ryt-pos<<";"<<n-1<<";"<<next_b_ryt-(pos+2)<<";\n";
cout<<prev_b_ryt-pos+1<<";"<<n<<";"<<next_b_ryt-(pos+1)<<";\n";
cout<<prev_b_ryt-pos+2<<";"<<n+1<<";"<<next_b_ryt-(pos)<<";\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

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

#include <iostream>

using namespace std;

int main()

{

int n;

int Break=0;

long long int res,res1,res2,res3,res4,rank,diff;

long long int b_left,b_ryt,t_left,t_ryt;

while(cin>>n)

{

res=1;

res1=1;

res2=1;

res3=1;

res4=1;

Break=0;

if(n==1)

{

cout<<7<<";"<<8<<";"<<9<<";\n";

cout<<6<<";"<<1<<";"<<2<<";\n";

cout<<5<<";"<<4<<";"<<3<<";\n";

continue;

}

for(long long int i=0;i<1500000000;i++)

{

if(Break)

break;

res1+=i*2;

if(res1>=n)

{

rank=i;

res=res1;

Break=1;

//continue;

}

res2+=i*4;

if(res2>=n)

{

rank=i;

res=res2;

Break=1;

//continue;

}

res3+=i*6;

if(res3>=n)

{

rank=i;

res=res3;

Break=1;

//continue;

}

res4+=i*8;

if(res4>=n)

{

rank=i;

res=res4;

Break=1;

}

if(rank==0)

{

cout<<7<<";"<<8<<";"<<9<<";\n";

cout<<6<<";"<<1<<";"<<2<<";\n";

cout<<5<<";"<<4<<";"<<3<<";\n";

continue;

}

diff=rank*2;

t_ryt=res;

t_left=t_ryt-diff;

b_left=t_left-diff;

b_ryt=b_left-diff;

if(n==t_ryt)

{

cout<<res+(rank+1)*8-2<<";"<<res+(rank+1)*8-1<<";"<<res+(rank+1)*8<<";\n";

cout<<res-1<<";"<<res<<";"<<res+1<<";\n";

cout<<res-(rank)*8<<";"<<(res+1)-(rank)*8<<";"<<res+2<<";\n";

continue;

}

if(n==t_left)

{

cout<<res+(rank+1)*6<<";"<<res+(rank+1)*6+1<<";"<<res+2+(rank+1)*6<<";\n";

cout<<res-1+(rank+1)*6<<";"<<n<<";"<<n+1<<";\n";

cout<<res-2+(rank+1)*6<<";"<<n-1<<";"<<n-rank*6-(rank-1)*2<<";\n";

continue;

}

if(n==b_left)

{

//cout<<rank<<"\n";

cout<<res+2+(rank+1)*4<<";"<<n+1<<";"<<n-(2*rank-1)*4<<";\n";

cout<<res+1+(rank+1)*4<<";"<<n<<";"<<n-1<<";\n";

cout<<res+(rank+1)*4<<";"<<res+(rank+1)*4-1<<";"<<res+(rank+1)*4-2<<";\n";

continue;

}

if(n==b_ryt)

{

cout<<res-rank*8-(rank-1)*6<<";"<<n-1<<";"<<(res+(rank+1)*2)-2<<";\n";

cout<<n+1<<";"<<n<<";"<<(res+(rank+1)*2)-1<<";\n";

cout<<(res+(rank+1)*2)+2<<";"<<(res+(rank+1)*2)+1<<";"<<res+(rank+1)*2<<";\n";

continue;

}

if(n>b_ryt && n<b_left)

{

if(n==4)

{

cout<<6<<";"<<1<<";"<<2<<";\n";

cout<<5<<";"<<4<<";"<<3<<";\n";

cout<<16<<";"<<15<<";"<<14<<";\n";

continue;

}

int prev_b_ryt=res-rank*8-(rank-1)*6;

int prev_b_left=b_left-(2*rank-1)*4;

int next_b_ryt=res+(rank+1)*2;

int next_b_left=res+(rank+1)*4;

int pos= n- b_ryt;

if(pos==1)

{

cout<<prev_b_ryt+(pos)<<";"<<prev_b_ryt+(pos-1)<<";"<<n-2<<";\n";

cout<<n+1<<";"<<n<<";"<<n-1<<";\n";

cout<<next_b_ryt+pos+2<<";"<<next_b_ryt+pos+1<<";"<<next_b_ryt+pos<<";\n";

continue;

}

if(b_left-n==1)

{

cout<<n+2<<";"<<prev_b_ryt+(pos-1)<<";"<<prev_b_ryt+(pos-2)<<";\n";

cout<<n+1<<";"<<n<<";"<<n-1<<";\n";

cout<<next_b_ryt+pos+2<<";"<<next_b_ryt+pos+1<<";"<<next_b_ryt+pos<<";\n";

continue;

}

cout<<prev_b_ryt+(pos)<<";"<<prev_b_ryt+(pos-1)<<";"<<prev_b_ryt+(pos-2)<<";\n";

cout<<n+1<<";"<<n<<";"<<n-1<<";\n";

cout<<next_b_ryt+pos+2<<";"<<next_b_ryt+pos+1<<";"<<next_b_ryt+pos<<";\n";

continue;

}

if(n<t_ryt && n>t_left)

{

if(n==8)

{

cout<<22<<";"<<23<<";"<<24<<";\n";

cout<<7<<";"<<8<<";"<<9<<";\n";

cout<<6<<";"<<1<<";"<<2<<";\n";

continue;

}

int prev_t_left=t_left-rank*6-(rank-1)*2;

int prev_t_ryt=res-(rank)*8;

int next_t_ryt=res+(rank+1)*8;

int next_t_left=res+(rank+1)*6;

int pos= n- t_left;

if(pos==1)

{

cout<<next_t_left+pos<<";"<<next_t_left+pos+1<<";"<<next_t_left+pos+2<<";\n";

cout<<n-1<<";"<<n<<";"<<n+1<<";\n";

cout<<n-2<<";"<<prev_t_left<<";"<<prev_t_left+1<<";\n";

continue;

}

{

cout<<next_t_left+pos<<";"<<next_t_left+pos+1<<";"<<next_t_left+pos+2<<";\n";

cout<<n-1<<";"<<n<<";"<<n+1<<";\n";

cout<<prev_t_left+(pos-2)<<";"<<prev_t_left+(pos-1)<<";"<<prev_t_left+pos<<";\n";

continue;

}

if(n>b_left && n<t_left)

{

if(n==6)

{

cout<<20<<";"<<7<<";"<<8<<";\n";

cout<<19<<";"<<6<<";"<<1<<";\n";

cout<<18<<";"<<5<<";"<<4<<";\n";

continue;

}

int prev_t_left=t_left-rank*6-(rank-1)*2;

int prev_b_left=b_left-(2*rank-1)*4;

int next_b_left=res+(rank+1)*4;

int next_t_left=res+(rank+1)*6;

int pos= n- b_left;

if(pos==1)

{

cout<<next_b_left+pos+2<<";"<<n+1<<";"<<prev_b_left+(pos)<<";\n";

cout<<next_b_left+pos+1<<";"<<n<<";"<<prev_b_left+(pos-1)<<";\n";

cout<<next_b_left+pos<<";"<<n-1<<";"<<n-2<<";\n";

continue;

}

if(n==t_left-1)

{

cout<<next_b_left+pos+2<<";"<<n+1<<";"<<n+2<<";\n";

cout<<next_b_left+pos+1<<";"<<n<<";"<<prev_b_left+(pos-1)<<";\n";

cout<<next_b_left+pos<<";"<<n-1<<";"<<prev_b_left+(pos-2)<<";\n";

continue;

}

cout<<next_b_left+pos+2<<";"<<n+1<<";"<<prev_b_left+(pos)<<";\n";

cout<<next_b_left+pos+1<<";"<<n<<";"<<prev_b_left+(pos-1)<<";\n";

cout<<next_b_left+pos<<";"<<n-1<<";"<<prev_b_left+(pos-2)<<";\n";

continue;

}

if(n<b_ryt)

{

if(n==2)

{

cout<<8<<";"<<9<<";"<<10<<";\n";

cout<<1<<";"<<2<<";"<<11<<";\n";

cout<<4<<";"<<3<<";"<<12<<";\n";

continue;

}

int prev_t_ryt=res-(rank)*8;

int prev_b_ryt=res-rank*8-(rank-1)*6;

int next_b_ryt=res+(rank+1)*2;

int next_t_ryt=res+(rank+1)*8;

int pos= b_ryt - n;

if(pos==1)

{

cout<<prev_b_ryt-pos<<";"<<n-1<<";"<<next_b_ryt-(pos+2)<<";\n";

cout<<prev_b_ryt<<";"<<n<<";"<<next_b_ryt-(pos+1)<<";\n";

cout<<n+2<<";"<<n+1<<";"<<next_b_ryt-(pos)<<";\n";

continue;

}

if(prev_t_ryt+1==n)

{

cout<<res-1<<";"<<res<<";"<<res+1<<";\n";

cout<<n-1<<";"<<n<<";"<<res+2<<";\n";

cout<<prev_b_ryt-(pos-2)<<";"<<n+1<<";"<<res+3<<";\n";

continue;

}

if(prev_t_ryt+2==n)

{

cout<<n-2<<";"<<n-1<<";"<<res+2<<";\n";

cout<<prev_b_ryt-(pos-1)<<";"<<n<<";"<<res+3<<";\n";

cout<<prev_b_ryt-(pos-1)+1<<";"<<n+1<<";"<<res+4<<";\n";

continue;

}

cout<<prev_b_ryt-pos<<";"<<n-1<<";"<<next_b_ryt-(pos+2)<<";\n";

cout<<prev_b_ryt-pos+1<<";"<<n<<";"<<next_b_ryt-(pos+1)<<";\n";

cout<<prev_b_ryt-pos+2<<";"<<n+1<<";"<<next_b_ryt-(pos)<<";\n";

continue;

}

return 0;

}

993

Asif NaeemJune 1, 2014

Solution:

#include <iostream>
#include <vector>

using namespace std;

int main()
{
int t,c;
long long int n;
vector<long long int> v;

cin>>t;
while(t--)
{
cin>>n;
if(n<=9)
{
cout<<n<<"\n";
continue;
}
while(n>=10)
{
v.clear();
c=0;
for(long long int i=9;i>=2;i--)
{
if(n%i==0)
{
c=1;
n/=i;
v.push_back(i);
break;
}
}
if(n<10)
{
v.push_back(n);
break;
}
if(c==0)
{
v.clear();
cout<<"-1\n";
break;
}
}
if(v.size()==0)
continue;
for(int i=v.size()-1;i>=0;i--)
cout<<v[i];
cout<<"\n";
}

return 0;
}

#include <iostream>

#include <vector>

using namespace std;

int main()

{

int t,c;

long long int n;

vector<long long int> v;

cin>>t;

while(t--)

{

cin>>n;

if(n<=9)

{

cout<<n<<"\n";

continue;

}

while(n>=10)

{

v.clear();

c=0;

for(long long int i=9;i>=2;i--)

{

if(n%i==0)

{

c=1;

n/=i;

v.push_back(i);

break;

}

if(n<10)

{

v.push_back(n);

break;

}

if(c==0)

{

v.clear();

cout<<"-1\n";

break;

}

if(v.size()==0)

continue;

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

cout<<v[i];

cout<<"\n";

}

return 0;

}

991

Asif NaeemJune 1, 2014

Theory: For larger n, imagine choosing an arbitrary pair of people to shake hands. You’ve now divided the circle into two smaller circles (one of which may have 0 people in it). The number of ways you can arrange the rest of the people is the product of the answers for the two smaller circles.

Continue Reading “991” →

960

Asif NaeemJune 1, 2014

Gaussian Prime Integer Problem Theory: First we should know that the multiple of two lengths is the length of the original one. For example, (4,3) has a length of 5, so if we can break (4,3) down into A & B, length(A) * length(B) is also 5. Next we’ll iterate through all possible combinations (lengths.)

Continue Reading “960” →

Year: 2014

10025

10061

10015

11762

11119

11780

903

993

991

960

Archives

Categories