2011国信蓝点杯C语言组初赛最后两道题代码

}
cout<<endl;
}
}
int main()
{
string pairs;
string str;
cin>>pairs>>str;
MakeSquare(pairs);
MakePassword(str);
}
}
int main()
{
int m;
int temprice;
cin>>m;
price.assign(m,0);
for(int temp=0;temp<m;temp++)
{
cin>>temprice;
//国信蓝点最后一道
//City of DLUT
//VinerL
#include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
#include <string>
#include <sstream>
vector<int> temp;
for(int t=0;t<bo.size();t++)
{
temp.push_back(bo[t]);
}
final.push_back(temp);
}
if(i+2<str.length())
i=i+2;
else if(i+2>str.length())
{
password+=str[i+1];
i=i+2;
//国信蓝点杯倒数第2题.
//City of Dlut
//VinerL
#include <iostream>
#include <vector>
#include <algorithm>
#include <stack>
using namespace std;
int current;
{
if(ch==keysquare[i][j])
{
return make_pair(i,j);
}
}
}
return make_pair(100,100);
for(int temp=0;temp<bo.size();temp++)
{
sum+=bo[temp]*price[temp];
}
if(sum==1000)
{
totalcount++;
int totalcount=0;
vector<int> price;
vector<vector<int> >final;
void Search(int i,int m,vector<int> bo,int now)
{
if(i>=m)
{
int sum=0;
{
keysquare[i/5][i-(i/5)*5]=pairs[i];
i++;
}
while(i<25)
{
bool con=0;
for(int temp=0;temp<pairs.length() ;temp++)
{
if(ch==pairs[temp])
{
ch++;
con=1;
}
}
if(con==1)
continue;
}
while(i<str.length())
{
temp=Search(str[i]);
x1=temp.first;
y1=temp.second;
temp=Search(str[i+1]);
x2=temp.first;
}
else
i=i+2;
}
}
void Show()
{
for(int i=0;i<5;i++)
{
for(int j=0;j<5;j++)
{
cout<<keysquare[i][j]<<" ";
y2=temp.second;
if(x1==100||x2==100)
{
password+=str[i];
password+=str[i+1];
}
else if(x1==x2||y1==y2)
{
password+=str[i+1];
password+=str[i];
}
else
{
password+=keysquare[x1][y2];
password+=keysquare[x2][y1];
price[temp]=temprice;
}
vector<int> bo(m,0);
Search(0,m,bo,0);
cout<<totalcount<<endl;
for(int i=0;i<totalcount;iassword(string str)
{
pair<int,int> temp;
int x1,x2,y1,y2;
int i=0;
if(str.length()==1)
{
password=str;
return;
for(int j=0;j<final[i].size();j++)
{
cout<<final[i][j]<<" ";
}
cout<<endl;
}
}
Show();
cout<<password;
}
keysquare[i/5][i-(i/5)*5]=ch;
i++;
ch++;
}
}
pair<int,int> Search(char ch)
{
for(int i=0;i<5;i++)
{
for(int j=0;j<5;j++)
using namespace std;
vector<string> keysquare(5,"abcde");
string password;
void MakeSquare(string pairs)
{
char ch='a';
int i=0;
while(i<pairs.size())
}
}
else
{
while(now<=1000)
{
Search(i+1,m,bo,now);
bo[i]++;
now+=price[i];
}