ZZULIacm春季选拔
7-1 h0100. 字符串连接
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t; cin >> t;
for(int k = 1; k <= t; k++){
int m, n; cin >> m >> n;
queue<string> a, b;//定义队列
string x, y;
for(int i = 0; i < m; i++){//依次输入
cin >> x;
a.push(x);
}
for(int i = 0; i < n; i++){
cin >> y;
b.push(y);
}
printf("Case %d: %d\n", k, n * m);
}
return 0;
}
备注:这道题我开始看错了,导致使用队列来解决,最后发现就是最简单的乘法问题!!!泪目!!!
7-2 回文素数
#include<bits/stdc++.h>
using namespace std;
bool hui(int x){
int a = x, sum = 0;
while(a){
sum = sum * 10 + a % 10;
a /= 10;
}
if(x == sum) return true;
else return false;
}
bool su(int x){
if(x == 1) return false ;
for(int i = 2; i <= sqrt(x); i++){
if(x % i == 0) return false;
}
return true;
}
int main()
{
int a, b, num = 0; cin >> a >> b;
queue<int> Q;
for(int i = a; i <= b; i++){
if(hui(i) && su(i)){
num++;
Q.push(i);
}
}
cout << num << endl;
while(!Q.empty()){
cout << Q.front() << endl;
Q.pop();
}
return 0;
}