A:因为t只有2到10的范围,所以直接在最前面写上一个t,然后后面补齐0就可以了。当然,t=10的时候要注意一下。
#include<stdio.h>
#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<time.h>
#include<queue>
#include<stack>
#include<iterator>
#include<math.h>
#include<stdlib.h>
#include<limits.h>
#include<map>
#include<set>
#include<bitset>
//#define ONLINE_JUDGE
#define eps 1e-5
#define INF 0x7fffffff
#define FOR(i,a) for((i)=0;i<(a);(i)++)
#define MEM(a) (memset((a),0,sizeof(a)))
#define sfs(a) scanf("%s",a)
#define sf(a) scanf("%d",&a)
#define sfI(a) scanf("%I64d",&a)
#define pf(a) printf("%d\n",a)
#define pfI(a) printf("%I64d\n",a)
#define pfs(a) printf("%s\n",a)
#define sfd(a,b) scanf("%d%d",&a,&b)
#define sft(a,b,num) scanf("%d%d%d",&a,&b,&num)
#define for1(i,a,b) for(int i=(a);i<b;i++)
#define for2(i,a,b) for(int i=(a);i<=b;i++)
#define for3(i,a,b)for(int i=(b);i>=a;i--)
#define MEM1(a) memset(a,0,sizeof(a))
#define MEM2(a) memset(a,-1,sizeof(a))
#define ll long long
const double PI=acos(-1.0);
template<class T> T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<class T> T lcm(T a,T b){return a/gcd(a,b)*b;}
template<class T> inline T Min(T a,T b){return a<b?a:b;}
template<class T> inline T Max(T a,T b){return a>b?a:b;}
using namespace std;
//#pragma comment(linker,"/STACK:1024000000,1024000000")
int n,m,L;
#define N 210
#define M 1000100
#define Mod 1000000000
#define p(x,y) make_pair(x,y)
int main(){
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
#endif
int t;
while(sfd(n,t)!=EOF){
if(n == 1 && t == 10){
printf("-1\n");
continue;
}
printf("%d",t);
if(t == 10) n--;
for(int i=1;i<n;i++)
printf("0");
printf("\n");
}
return 0;
}
B:由题意可知,对于n,我们一共有3^3^n种排列,而其中结果为6的,每组一共有7种(123的全排列+222),共n组,则有7^n种排列,那么不为6的就是27^n-7^n然后快速幂取余即可。
#include<stdio.h>
#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<time.h>
#include<queue>
#include<stack>
#include<iterator>
#include<math.h>
#include<stdlib.h>
#include<limits.h>
#include<map>
#include<set>
#include<bitset>
//#define ONLINE_JUDGE
#define eps 1e-5
#define INF 0x7fffffff
#define FOR(i,a) for((i)=0;i<(a);(i)++)
#define MEM(a) (memset((a),0,sizeof(a)))
#define sfs(a) scanf("%s",a)
#define sf(a) scanf("%d",&a)
#define sfI(a) scanf("%I64d",&a)
#define pf(a) printf("%d\n",a)
#define pfI(a) printf("%I64d\n",a)
#define pfs(a) printf("%s\n",a)
#define sfd(a,b) scanf("%d%d",&a,&b)
#define sft(a,b,num) scanf("%d%d%d",&a,&b,&num)
#define for1(i,a,b) for(int i=(a);i<b;i++)
#define for2(i,a,b) for(int i=(a);i<=b;i++)
#define for3(i,a,b)for(int i=(b);i>=a;i--)
#define MEM1(a) memset(a,0,sizeof(a))
#define MEM2(a) memset(a,-1,sizeof(a))
#define ll long long
const double PI=acos(-1.0);
template<class T> T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<class T> T lcm(T a,T b){return a/gcd(a,b)*b;}
template<class T> inline T Min(T a,T b){return a<b?a:b;}
template<class T> inline T Max(T a,T b){return a>b?a:b;}
using namespace std;
//#pragma comment(linker,"/STACK:1024000000,1024000000")
int n,m,L;
#define N 210
#define M 1000100
#define Mod 1000000007
#define p(x,y) make_pair(x,y)
ll quick_pow(ll a,ll b){
ll bs=1;
while(b){
if(b&1)
bs = bs*a%Mod;
a = a*a%Mod;
b>>=1;
}
return bs;
}
int main(){
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
#endif
while(sf(n)!=EOF){
printf("%I64d\n",(quick_pow(27,(ll)n)-quick_pow(7,(ll)n)+Mod)%Mod);
}
return 0;
}
C:题目中所给的是s3与s1,s2不同之处t,我转换为相同的之处n-t.那么我们应该怎么处理这个n-t那?我们可以看出,当ch1[i] != ch2[i]时我们只要任取一个就行,但是当ch1[i]==ch2[i]时我们就要小心,因为如果要与它们都相同,要么都不同。所以对于相同的地方,我们先处理,处理完以后,我们再处理不相同的地方。
#include<stdio.h>
#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<time.h>
#include<queue>
#include<stack>
#include<iterator>
#include<math.h>
#include<stdlib.h>
#include<limits.h>
#include<map>
#include<set>
#include<bitset>
//#define ONLINE_JUDGE
#define eps 1e-5
#define INF 0x7fffffff
#define FOR(i,a) for((i)=0;i<(a);(i)++)
#define MEM(a) (memset((a),0,sizeof(a)))
#define sfs(a) scanf("%s",a)
#define sf(a) scanf("%d",&a)
#define sfI(a) scanf("%I64d",&a)
#define pf(a) printf("%d\n",a)
#define pfI(a) printf("%I64d\n",a)
#define pfs(a) printf("%s\n",a)
#define sfd(a,b) scanf("%d%d",&a,&b)
#define sft(a,b,num) scanf("%d%d%d",&a,&b,&num)
#define for1(i,a,b) for(int i=(a);i<b;i++)
#define for2(i,a,b) for(int i=(a);i<=b;i++)
#define for3(i,a,b)for(int i=(b);i>=a;i--)
#define MEM1(a) memset(a,0,sizeof(a))
#define MEM2(a) memset(a,-1,sizeof(a))
#define ll long long
const double PI=acos(-1.0);
template<class T> T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<class T> T lcm(T a,T b){return a/gcd(a,b)*b;}
template<class T> inline T Min(T a,T b){return a<b?a:b;}
template<class T> inline T Max(T a,T b){return a>b?a:b;}
using namespace std;
//#pragma comment(linker,"/STACK:1024000000,1024000000")
int n,m,L;
#define N 210
#define M 1000100
#define Mod 1000000007
#define p(x,y) make_pair(x,y)
char ch1[100010];
char ch2[100010];
char ch[100010];
int vis[100010];
int main(){
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
#endif
int t;
while(sfd(n,t)!=EOF){
sfs(ch1);
sfs(ch2);
int sum=0;
vector<int> pos;//记录相同的位置
memset(vis,0,sizeof vis);
for(int i=0;i<n;i++){
if(ch1[i]!=ch2[i]) sum++;
else
pos.push_back(i);
}
int sm = n-t; //每个串要相同的位置数量
sm *= 2;//因为有两个串,所以*2
int size = (int) pos.size();
for (int i = 0; i < size && sm; i++) {
int ps = pos[i];
ch[ps] = ch1[ps]; //取ch1[ps]
sm -= 2;//相同的地方-2,因为与两个串都相同了
vis[ps] = 1;
}
int flag=0;
for(int i=0;i<n;i++){
if(vis[i]) continue;
if(sm){ //如果还有要相同的地方,那就任选一个
if(!flag)
ch[i] = ch1[i];
else
ch[i] = ch2[i];
sm--;
flag = 1-flag;
}else{ //否则的话就赋值一个与ch1和ch2该位置都不一样的字母
for(char c='a';c<='z';c++){
if(ch1[i]!=c && ch2[i]!=c){
ch[i]=c;
break;
}
}
}
}
ch[n]='\0';
if(sm == 0) //相同点分配完了
printf("%s\n",ch);
else
printf("-1\n");
}
return 0;
}
D:D题是看了下别人的思路,了解到了一个定理,叫做“李维猜想 ”,就是说大于5的奇数,都可以表示为2*n+1=p1+2*p2,即它可以等于一个素数和另外一个素数的2倍。那么我们可以这样算,假设题目给定的奇数n本来就是素数,那么输出本身;假如n-2是素数,那么输出2和n-2;在接下去,就是应用我们所说的那个猜想了,我们i的范围从n-4开始(因为n是奇数,n-3是偶数,肯定不为素数),每次取到n-=2,然后得出另外两个是
(n-i)/2,这三个都是素数的话我们就可以直接输出了。
#include<stdio.h>
#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<time.h>
#include<queue>
#include<stack>
#include<iterator>
#include<math.h>
#include<stdlib.h>
#include<limits.h>
#include<map>
#include<set>
#include<bitset>
//#define ONLINE_JUDGE
#define eps 1e-5
#define INF 0x7fffffff
#define FOR(i,a) for((i)=0;i<(a);(i)++)
#define MEM(a) (memset((a),0,sizeof(a)))
#define sfs(a) scanf("%s",a)
#define sf(a) scanf("%d",&a)
#define sfI(a) scanf("%I64d",&a)
#define pf(a) printf("%d\n",a)
#define pfI(a) printf("%I64d\n",a)
#define pfs(a) printf("%s\n",a)
#define sfd(a,b) scanf("%d%d",&a,&b)
#define sft(a,b,num) scanf("%d%d%d",&a,&b,&num)
#define for1(i,a,b) for(int i=(a);i<b;i++)
#define for2(i,a,b) for(int i=(a);i<=b;i++)
#define for3(i,a,b)for(int i=(b);i>=a;i--)
#define MEM1(a) memset(a,0,sizeof(a))
#define MEM2(a) memset(a,-1,sizeof(a))
#define ll long long
const double PI=acos(-1.0);
template<class T> T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<class T> T lcm(T a,T b){return a/gcd(a,b)*b;}
template<class T> inline T Min(T a,T b){return a<b?a:b;}
template<class T> inline T Max(T a,T b){return a>b?a:b;}
using namespace std;
//#pragma comment(linker,"/STACK:1024000000,1024000000")
int n,m,L;
#define N 210
#define M 1000100
#define Mod 1000000007
#define p(x,y) make_pair(x,y)
bool prime(ll n) {
for (int i = 2; i*i <= n; i++)
if (n%i == 0) return false;
return true;
}
int main() {
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
#endif
while(sf(n)!=EOF){
if(prime(n)){
printf("1\n%d\n",n);
}else if(prime(n-2)){
printf("2\n2 %d\n",n-2);
}else{
for(int i=n-4;;i-=2){
if(prime(i)){
int res = (n-i)/2;
if(prime(res)){
printf("3\n");
printf("%d %d %d\n",i,res,res);
break;
}
}
}
}
}
return 0;
}