July 2014 – Live with passion

846

Asif NaeemJuly 31, 2014

#include <iostream>

#include <math.h>

using namespace std;

//long long diff[10001];
long long int m,n,d;

int main()
{
int t;

cin>>t;
while(t--)
{
cin>>m>>n;
d= m-n;
if(d<0)
d=d*(-1);

if(d==0)
{
cout<<0<<"\n";
continue;
}
if(d==1)
{
cout<<1<<"\n";
continue;
}
if(d==2)
{
cout<<2<<"\n";
continue;
}
if(d==3)
{
cout<<3<<"\n";
continue;
}

long long int r= sqrt(d);
if(r<0)
r*=-1;

if(d==r*r)
{
cout<<2*r-1<<"\n";
continue;
}

long long int x=(r+1)*(r+1)-r*r;

if(d<=(r*r)+x/2)
cout<<2*r<<"\n";
else
cout<<2*r+1<<"\n";
}

return 0;
}

#include <iostream>

#include <math.h>

using namespace std;

//long long diff[10001];

long long int m,n,d;

int main()

{

int t;

cin>>t;

while(t--)

{

cin>>m>>n;

d= m-n;

if(d<0)

d=d*(-1);

if(d==0)

{

cout<<0<<"\n";

continue;

}

if(d==1)

{

cout<<1<<"\n";

continue;

}

if(d==2)

{

cout<<2<<"\n";

continue;

}

if(d==3)

{

cout<<3<<"\n";

continue;

}

long long int r= sqrt(d);

if(r<0)

r*=-1;

if(d==r*r)

{

cout<<2*r-1<<"\n";

continue;

}

long long int x=(r+1)*(r+1)-r*r;

if(d<=(r*r)+x/2)

cout<<2*r<<"\n";

else

cout<<2*r+1<<"\n";

}

return 0;

}

10023

Asif NaeemJuly 24, 2014

[highlight]Solution[/highlight]

/*
import java.math.BigInteger;
import java.util.Scanner;
public class Main {public static void main(String[] args) {
Scanner scanf = new Scanner(System.in);
int time;
time = scanf.nextInt();
System.out.println("");

for(int i = 0; i<time; i++){
BigInteger input = scanf.nextBigInteger();
if(i > 0)
System.out.println("");
BigInteger previous = input;
BigInteger distance, post, Two = BigInteger.valueOf(2), Negative = BigInteger.valueOf(-1);
if(input.equals(BigInteger.ZERO)){
System.out.println("0");
continue;
}
while(true){
post = input.divide(previous);
post = post.add(previous);
post = post.divide(Two);
distance = post.subtract(previous);
if(distance.equals(BigInteger.ONE)){

System.out.println(previous);
break;
}
int d = distance.compareTo(BigInteger.ZERO);
if(d < 0)
distance = distance.multiply(Negative);
else if(distance.equals(BigInteger.ZERO)){

System.out.println(post);
break;
}
previous = post;
}
}

}

}

*/

import java.util.*;
import java.math.*;
import java.math.BigInteger;
import java.util.Scanner;

public class Main{

static boolean didWork ;
public static BigInteger sqrt(BigInteger A)
{
BigInteger temp = A.shiftRight(BigInteger.valueOf(A.bitLength()).shiftRight(1).intValue()), result = null;
while (true)
{
result = temp.add(A.divide(temp)).shiftRight(1);
if (!temp.equals(result))
temp = result;
else
break ;
}
didWork = false ;
if (result.multiply(result).equals(A))
didWork = true ;

return result;
}

public static void main(String []args)
{
Scanner scanf = new Scanner(System.in);
int t= scanf.nextInt();
for(int i=0;i<t;i++)
{
BigInteger input = scanf.nextBigInteger();
if(i!=0)
{
System.out.println("");
}
System.out.println(sqrt(input));
}
}
};

import java.math.BigInteger;

import java.util.Scanner;

public class Main {public static void main(String[] args) {

Scanner scanf = new Scanner(System.in);

int time;

time = scanf.nextInt();

System.out.println("");

for(int i = 0; i<time; i++){

BigInteger input = scanf.nextBigInteger();

if(i > 0)

System.out.println("");

BigInteger previous = input;

BigInteger distance, post, Two = BigInteger.valueOf(2), Negative = BigInteger.valueOf(-1);

if(input.equals(BigInteger.ZERO)){

System.out.println("0");

continue;

}

while(true){

post = input.divide(previous);

post = post.add(previous);

post = post.divide(Two);

distance = post.subtract(previous);

if(distance.equals(BigInteger.ONE)){

System.out.println(previous);

break;

}

int d = distance.compareTo(BigInteger.ZERO);

if(d < 0)

distance = distance.multiply(Negative);

else if(distance.equals(BigInteger.ZERO)){

System.out.println(post);

break;

}

previous = post;

}

import java.util.*;

import java.math.*;

import java.math.BigInteger;

import java.util.Scanner;

public class Main{

static boolean didWork ;

public static BigInteger sqrt(BigInteger A)

{

BigInteger temp = A.shiftRight(BigInteger.valueOf(A.bitLength()).shiftRight(1).intValue()), result = null;

while (true)

{

result = temp.add(A.divide(temp)).shiftRight(1);

if (!temp.equals(result))

temp = result;

else

break ;

}

didWork = false ;

if (result.multiply(result).equals(A))

didWork = true ;

return result;

}

public static void main(String []args)

{

Scanner scanf = new Scanner(System.in);

int t= scanf.nextInt();

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

{

BigInteger input = scanf.nextBigInteger();

if(i!=0)

{

System.out.println("");

}

System.out.println(sqrt(input));

}

};

Modular Problem: Mod of a negative number ..llike -16%3 = 2 It is DP problem. such input of data is in p[]; divident is k; let , s=a[0]%k; and s=-a[0]%k; if any of s <0 then s =s+k [see mod of a negative number] keep track in 2D array in a[0][s]=1. s=s+p[1]%k, for each s check

Continue Reading “10036” →

10002

Asif NaeemJuly 21, 2014

[highlight]Solution:[/highlight] Centroid of polygon The centroid of a non-self-intersecting closed polygon defined by n vertices (x0,y0), (x1,y1), …, (xnâˆ’1,ynâˆ’1) is the point (Cx, Cy), where Cx= 1/6A *sumof((X_i+X_i+1)*(X_i*Y_i+1 – X_i+1 * Y_i)); fori=0 to n-1 Cy= 1/6A *sumof((Y_i+Y_i+1)*(X_i*Y_i+1 – X_i+1 * Y_i));for i=0 to n-1 and where A is the polygon’s signed area, A =

Continue Reading “10002” →

10078

Asif NaeemJuly 20, 2014

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

using namespace std;

struct Point{
int x;
int y;
}P;
vector<Point> vb,vb1;
int used[100];

bool cmp(Point a,Point b)
{
if(a.x!=b.x)
return a.x<b.x;
else
return a.y<b.y;
}

int ccw(Point a,Point b,Point c)
{
int p = a.x*b.y - a.x*c.y - a.y*b.x + a.y*c.x + b.x*c.y - c.x * b.y;
if(p>0)
return 1;
else
return 0;
}

int main()
{
int N,a,b;

while(cin>>N)
{
if(N==0)
break;
vb.clear();
for(int i=0;i<N;i++)
{
cin>>a>>b;
P.x=a;
P.y=b;
used[i]=0;
vb.push_back(P);
}

fill(used,used+N,0);
if(N<=3)
{
cout<<"No\n";
continue;
}
sort(vb.begin(),vb.end(),cmp);

vb1.clear();

vb1.push_back(vb[0]);
used[0]=1;

for(int i=0;i<(N-1);i++)
{
int next;
for(int j=1;j<N;j++)
{
if(used[j]==0)
{
next=j;
break;
}
}

for(int j=1;j<N;j++)
{
if(used[j]==0 && ccw(vb1[i],vb[next],vb[j])==0)
next = j;
}
vb1.push_back(vb[next]);
used[next]=1;
}

vb1.push_back(vb1[0]);
vb1.push_back(vb1[1]);

int f=0;
for(int i=0;i+2<vb1.size();i++)
{
if(ccw(vb1[i],vb1[i+1],vb1[i+2])==0)
{
cout<<"Yes\n";
f=1;
break;
}
}
if(f==0)cout<<"No\n";
}

return 0;
}

100

#include <iostream>

#include <vector>

#include <algorithm>

using namespace std;

struct Point{

int x;

int y;

}P;

vector<Point> vb,vb1;

int used[100];

bool cmp(Point a,Point b)

{

if(a.x!=b.x)

return a.x<b.x;

else

return a.y<b.y;

}

int ccw(Point a,Point b,Point c)

{

int p = a.x*b.y - a.x*c.y - a.y*b.x + a.y*c.x + b.x*c.y - c.x * b.y;

if(p>0)

return 1;

else

return 0;

}

int main()

{

int N,a,b;

while(cin>>N)

{

if(N==0)

break;

vb.clear();

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

{

cin>>a>>b;

P.x=a;

P.y=b;

used[i]=0;

vb.push_back(P);

}

fill(used,used+N,0);

if(N<=3)

{

cout<<"No\n";

continue;

}

sort(vb.begin(),vb.end(),cmp);

vb1.clear();

vb1.push_back(vb[0]);

used[0]=1;

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

{

int next;

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

{

if(used[j]==0)

{

next=j;

break;

}

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

{

if(used[j]==0 && ccw(vb1[i],vb[next],vb[j])==0)

next = j;

}

vb1.push_back(vb[next]);

used[next]=1;

}

vb1.push_back(vb1[0]);

vb1.push_back(vb1[1]);

int f=0;

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

{

if(ccw(vb1[i],vb1[i+1],vb1[i+2])==0)

{

cout<<"Yes\n";

f=1;

break;

}

if(f==0)cout<<"No\n";

}

return 0;

}

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;

}

10061

Asif NaeemJuly 14, 2014

[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;

}

Month: July 2014

846

10023

10036

10002

10078

10025

10061

10015

11762

11119

Archives

Categories