A题:水题。。
#include<stdio.h>
#include<string.h>
const int maxn = 1005;
char s[ maxn ];
int main(){
//freopen("in.txt","r",stdin);
while( scanf("%s",s)!=EOF ){
int len = strlen(s);
int c1 = 0,c2 = 0,c3 = 0;
for( int i=0;i<len;i++ ){
if( s[i]=='1' ) c1++;
if( s[i]=='2' ) c2++;
if( s[i]=='3' ) c3++;
}
int sum = c1+c2+c3;
if( sum==1 ){
printf("%s\n",s);
continue;
}
for( int i=0;i<sum;i++ ){
if( i==0 ){
if( c1 ) printf("1"),c1--;
else if( c2 ) printf("2"),c2--;
else if( c3 ) printf("3"),c3--;
}
else{
if( c1 ) printf("+1"),c1--;
else if( c2 ) printf("+2"),c2--;
else if( c3 ) printf("+3"),c3--;
}
}
printf("\n");
}
return 0;
}
B题:还是水题。。模拟。。
#include<stdio.h>
const int maxn = 100005;
typedef long long LL;
LL a[ maxn ];
int main(){
int n,m;
//freopen("in.txt","r",stdin);
while( scanf("%d%d",&n,&m)==2 ){
for( int i=1;i<=m;i++ ){
scanf("%I64d",&a[i]);
}
LL sum = 0;
for( int i=1;i<=m;i++ ){
if( i==1 ){
sum += a[i]-1;
}
else {
if( a[i]>=a[i-1] ) sum += (a[i]-a[i-1]);
else sum += (n+a[i]-a[i-1]);
}
}
printf("%I64d\n",sum);
}
return 0;
}
C题:简单的DFS,满足两个条件即可。。。
题意别理解错!!!!!!!!!!!!!!!!!
#include<stdio.h>
#include<string.h>
const int maxn = 1005;
int ans[ maxn ];
//int cnt ;
char str[ maxn ];
int m;
bool ok;
void dfs( int L,int R,int sL,int sR,int cnt ){
if( cnt==m&&ok==false ){
ok = true;
return ;
}
if( ok==true ) return ;
for( int i=0;str[i]!='\0';i++ ){
if( str[i]=='1' ){
if( cnt%2==0&&((i+1)!=R)&&(sL+i+1>sR) ){
ans[ cnt ] = i+1;
dfs( i+1,R,sL+i+1,sR,cnt+1 );
}
if( ok==true ) return ;
if( cnt%2==1&&((i+1)!=L)&&(sR+i+1>sL) ){
ans[ cnt ] = i+1;
dfs( L,i+1,sL,sR+i+1,cnt+1 );
}
if( ok==true ) return ;
}
}
return;
}
int main(){
//freopen("in.txt","r",stdin);
scanf("%s%d",str,&m);
ok = false;
if( m==1 ){
for( int i=0;str[i]!='\0';i++ ){
if( str[i]=='1' ){
ok = true;
printf("YES\n%d\n",i+1);
break;
}
}
if( ok==false ) printf("NO\n");
return 0;
}
ok = false;
dfs( 0,0,0,0,0 );
if( ok==true ){
puts("YES");
for( int i=0;i<m;i++ ){
if( i==0 ) printf("%d",ans[i]);
else printf(" %d",ans[i]);
}
printf("\n");
}
else puts("NO");
return 0;
}