A:ans=45;
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
int main(){
for(int i=10;i<100;i++){
int a=i%10;
int b=i/10;
int j=a*10+b;
int x=i+j;
int y=abs(i-j);
if(x-y==32){
cout<<y<<endl;
break;
}
}
}
B:ans=181;
思路:由于a,b,c为正整数,因此a,b,c中最大值应该为2739/11-13-17=219;
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
int main(){
for(int i=1;i<220;i++)
for(int j=1;j<220;j++)
for(int k=1;k<220;k++)
if(11*i+13*j+17*k==2471&&13*i+17*j+11*k==2739)
cout<<i+j+k<<endl;
}
程序运行的结果:
181
195
209
--------------------------------
Process exited after 2.663 seconds with return value 0
请按任意键继续. . .
C:
思路:全排列next_permutation(a,a+n);可以实现;
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
int main(){
int a[]={1,2,3,4,5,6,7,8,9};
//每一行,每一列和相等
//全排列
int ans=0;
do{
int r1=0,r2=0,r3=0;
int c1=0,c2=0,c3=0;
r1=a[0]+a[1]+a[2];
r2=a[3]+a[4]+a[5];
r3=a[6]+a[7]+a[8];
c1=a[0]+a[3]+a[6];
c2=a[1]+a[4]+a[7];
c3=a[2]+a[5]+a[8];
if(r1==r2&&r2==r3&&c1==c2&&c2==c3)
ans++;
}while(next_permutation(a,a+9));
cout<<"---"<<ans<<endl;
}
D:ans:j==n-i-1;
E:ans:f(a,k+1);
F:
思路:特殊情况的枚举可以实现,13的全排列程序出不了答案,13个12的全排列可以在三分钟之内出现结果;
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
int main(){
long long ans=0;
int a[12]={2,3,4,5,6,7,8,9,10,11,12,13};
do{
if(a[0]*a[1]+a[2]*a[3]==a[4]*a[5]&&a[6]*a[7]-a[8]*a[9]==a[10]*a[11])
ans++;
}while(next_permutation(a,a+12));
cout<<"-->>"<<ans<<endl;
a[0]=1;
do{
if(a[0]*a[1]+a[2]*a[3]==a[4]*a[5]&&a[6]*a[7]-a[8]*a[9]==a[10]*a[11])
ans++;
}while(next_permutation(a,a+12));
cout<<"-->>"<<ans<<endl;
a[1]=2;
do{
if(a[0]*a[1]+a[2]*a[3]==a[4]*a[5]&&a[6]*a[7]-a[8]*a[9]==a[10]*a[11])
ans++;
}while(next_permutation(a,a+12));
cout<<"-->>"<<ans<<endl;
a[2]=3;
do{
if(a[0]*a[1]+a[2]*a[3]==a[4]*a[5]&&a[6]*a[7]-a[8]*a[9]==a[10]*a[11])
ans++;
}while(next_permutation(a,a+12));
cout<<"-->>"<<ans<<endl;
a[3]=4;
do{
if(a[0]*a[1]+a[2]*a[3]==a[4]*a[5]&&a[6]*a[7]-a[8]*a[9]==a[10]*a[11])
ans++;
}while(next_permutation(a,a+12));
cout<<"-->>"<<ans<<endl;
a[4]=5;
do{
if(a[0]*a[1]+a[2]*a[3]==a[4]*a[5]&&a[6]*a[7]-a[8]*a[9]==a[10]*a[11])
ans++;
}while(next_permutation(a,a+12));
cout<<"-->>"<<ans<<endl;
a[5]=6;
do{
if(a[0]*a[1]+a[2]*a[3]==a[4]*a[5]&&a[6]*a[7]-a[8]*a[9]==a[10]*a[11])
ans++;
}while(next_permutation(a,a+12));
cout<<"-->>"<<ans<<endl;
a[6]=7;
do{
if(a[0]*a[1]+a[2]*a[3]==a[4]*a[5]&&a[6]*a[7]-a[8]*a[9]==a[10]*a[11])
ans++;
}while(next_permutation(a,a+12));
cout<<"-->>"<<ans<<endl;
a[7]=8;
do{
if(a[0]*a[1]+a[2]*a[3]==a[4]*a[5]&&a[6]*a[7]-a[8]*a[9]==a[10]*a[11])
ans++;
}while(next_permutation(a,a+12));
cout<<"-->>"<<ans<<endl;
a[8]=9;
do{
if(a[0]*a[1]+a[2]*a[3]==a[4]*a[5]&&a[6]*a[7]-a[8]*a[9]==a[10]*a[11])
ans++;
}while(next_permutation(a,a+12));
cout<<"-->>"<<ans<<endl;
a[9]=10;
do{
if(a[0]*a[1]+a[2]*a[3]==a[4]*a[5]&&a[6]*a[7]-a[8]*a[9]==a[10]*a[11])
ans++;
}while(next_permutation(a,a+12));
cout<<"-->>"<<ans<<endl;
a[10]=11;
do{
if(a[0]*a[1]+a[2]*a[3]==a[4]*a[5]&&a[6]*a[7]-a[8]*a[9]==a[10]*a[11])
ans++;
}while(next_permutation(a,a+12));
cout<<"-->>"<<ans<<endl;
a[11]=12;
do{
if(a[0]*a[1]+a[2]*a[3]==a[4]*a[5]&&a[6]*a[7]-a[8]*a[9]==a[10]*a[11])
ans++;
}while(next_permutation(a,a+12));
cout<<"ans-->>"<<ans<<endl;
}
程序运行的结果:最后一行才为答案;
-->>4096
-->>23040
-->>26624
-->>37888
-->>47616
-->>57856
-->>60928
-->>74240
-->>77312
-->>89600
-->>95232
-->>107520
ans-->>122368
--------------------------------
Process exited after 206.2 seconds with return value 0
请按任意键继续. . .
G:ans=18;
思路:任然可以采用全排列枚举的思想+排序;
H:程序设计:
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
int cnt=0;
struct web{
char name[30];
int score;
}a[1000+10];
int main(){
while(true){
char ch[10];
cin>>ch;
if(!strcmp(ch,"insert")){
cin>>a[cnt].name;
cin>>a[cnt++].score;
}else if(!strcmp(ch,"find")){
char cchh[30];
int ans=-1;
cin>>cchh;
for(int i=0;i<cnt;i++)
if(!strcmp(cchh,a[i].name))
ans=max(ans,a[i].score);
if(ans!=-1) cout<<ans<<endl;
else cout<<-1<<endl;
}else break;
}
return 0;
}
I:程序设计:bfs;
#include<iostream>
char a[1010][1010];
int row[1010],col[1010];//如果炸弹爆炸,row和col所在的行与列为一
int n,m;
using namespace std;
void dfs(int x,int y){
a[x][y]='0';
if(!row[x]){
row[x]='1';
for(int i=0;i<m;i++)
if(a[x][i]=='1')
dfs(x,i);
}
if(!col[y]){
col[y]='1';
for(int i=0;i<n;i++)
if(a[i][y]=='1')
dfs(i,y);
}
}
int main(){
int cnt=0;
scanf("%d%d",&n,&m);
for(int i=0;i<n;i++)
scanf("%s",a[i]);
for(int i=0;i<n;i++)
for(int j=0;j<m;j++)
if(a[i][j]=='1'){
dfs(i,j);
cnt++;
}
cout<<cnt<<endl;
}