数据结构-起步能力自测题

自测-1 打印沙漏 (20分)

https://pintia.cn/problem-sets/17/problems/260

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
using namespace std;
int n;
int choice(int n){
for(int i=1;i<=23;i++){
if((2*i*i-1<=n)&&(2*(i+1)*(i+1)-1>n))
return i;
    }
}
int main(){
char chr;
cin>>n>>chr;
int i=choice(n);
int empty=0,c=2*i-1;
for(int j=1;j<=2*i-1;j++){
for(int k=0;k<empty;k++) cout<<" ";
for(int k=0;k<c;k++) cout<<chr;
cout<<endl;
if(j<i){
empty+=1;
c-=2;
}
else if(j>=i){
empty-=1;
c+=2;
   }
}
cout<<n-2*i*i+1<<endl;
return 0;
}

自测-2 素数对猜想 (20分)

https://pintia.cn/problem-sets/17/problems/261

#include <cstdio>
#include <cmath>
#include <algorithm>
#include <iostream>
using namespace std;
bool is_prime(int n){
    int i;
    for(i=2;i<=(int)(sqrt(n)+0.5);i++){
        if(n%i==0) break;
    }
    if(i>(int)(sqrt(n)+0.5)) return true;
    else return false;
}
int main(){
    int n;cin>>n;
    int count=0,value1=2,value2=3;
    while(value2<=n){
       if(is_prime(value2)){
            if(value2-value1==2) count++;
            value1=value2;
       }
       value2++; 
    }
    cout<<count<<endl;
    return 0;
}

自测-3 数组元素循环右移问题 (20分)

https://pintia.cn/problem-sets/17/problems/262

#include <iostream>
#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;
int main(){
    int n,m,a[102],value;
    cin>>n>>m;
    for(int i=0;i<n;i++) cin>>a[i];
    m=m%n;
    for(int i=n-m;i<n;i++) cout<<a[i]<<" ";
    for(int i=0;i<n-m;i++) {
        if(i!=n-m-1) cout<<a[i]<<" ";
        else cout<<a[i];
    }
    return 0;
}

自测-4 Have Fun with Numbers (20分)

https://pintia.cn/problem-sets/17/problems/263

#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <algorithm>
#include <iostream>
using namespace std;
char chr1[22];
int num1[25]={0},num2[25]={0},a[10]={0},b[10]={0};
int main(){
    int i=0,j=0,k=0;
    cin>>chr1;
    int len1=strlen(chr1);
    for(int i=0;i<len1;i++) a[chr1[i]-'0']++;
    for(i=len1-1;i>=0;i--) num1[j++]=chr1[i]-'0';
    int m=0;
    for(i=0;i<len1;i++){
        num2[i]+=num1[i]*2%10;
        m=num1[i]*2/10;
        num2[i+1]+=m;
    }
    bool flag=true,flag1=true;
    for(i=24;i>=0;i--){
        if(num2[i]!=0) flag=false;
        if(!flag){
            //if(a[num2[i]]==0) {flag1=false;break;}
            //else if(a[num2[i]]!=0) a[num2[i]]--;
            b[num2[i]]++;
        } 
    }
    
    for(int i=0;i<10;i++)
       if(a[i]!=b[i]) {flag1=false;break;}
    
    flag=true;
    if(flag1==false) cout<<"No
";
    else if(flag1) cout<<"Yes
";
    for(i=24;i>=0;i--){
        if(num2[i]!=0) flag=false;
        if(!flag) cout<<num2[i];
    }
    cout<<endl;
    return 0;
}

自测-5 Shuffling Machine (20分)

https://pintia.cn/problem-sets/17/problems/264

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <algorithm>
using namespace std;
char *str[22][54]={"S1","S2","S3","S4","S5","S6","S7","S8","S9","S10","S11","S12","S13","H1","H2","H3","H4","H5","H6","H7","H8","H9","H10","H11","H12","H13","C1","C2","C3","C4","C5","C6","C7","C8","C9","C10","C11","C12","C13","D1","D2","D3","D4","D5","D6","D7","D8","D9","D10","D11","D12","D13","J1","J2"};

int a[54];
int main(){
    int k;cin>>k;
    for(int i=0;i<54;i++) cin>>a[i];
    for(int i=1;i<=k;i++){
       for(int j=0;j<54;j++){
            str[i][a[j]-1]=str[i-1][j];
       }
    }
    for(int i=0;i<54;i++){
        if(i!=53) cout<<str[k][i]<<" ";
        else cout<<str[k][i];
    } 
    return 0;
}