OJ基础题库（1）

收录内容

P1005 最大公约数

p1008 质数还是合数

p1019 修改字符串

p1021 日历问题

#include<iostream>
using namespace std;

int max_yueshu(int x,int y){
    int temp;
    while(y!=0){
        temp=x%y;
        x=y;
        y=temp;
    }
    return x;
}


int main(){
    int n,i;
    cin>>n;   //输入对数
    int x,y,res;
    int a[n];
    for(i=0;i<n;i++){
        cin>>x>>y;
        res=max_yueshu(x,y);
        a[i]=res;
    }
    for(i=0;i<n;i++)
        cout<<a[i]<<endl;
}

---

#include<iostream>
using namespace std;
int judge(int n){
    if(n==1)
        return 0;
    if(n==2)
        return 1;
    int i;
    for(i=2;i<n;i++){
        if(n%i==0)
            return 0;
    }
    if(i==n)
        return 1;
    return 0;
}
int main(){
    int a,temp;
    while(cin>>temp){
        a=judge(temp);
        if(a==0)
            cout<<"No"<<endl;
        if(a==1)
            cout<<"Yes"<<endl;
    }
}

---

#include<iostream>
#include<string>
using namespace std;
int main(){
    string sentence;
    cin>>sentence;
    int i;
    for(i=0;i<sentence.length();i++){
        if(int(sentence[i])>=65 && int(sentence[i])<=90)
            sentence[i]=int(sentence[i])+32;
            sentence[i]=char(sentence[i]);
    }
    cout<<sentence<<endl;
    return 0;    
    
}

---

#include<iostream>
using namespace std;
int main(){
    int n;
    while(cin>>n){
        if(n%7==0){
            cout<<7<<endl;
        }else{
            cout<<n%7<<endl;
        }
    }
}

---

#include<iostream>
using namespace std;
void range(int n,int *a){
    int i,j,temp;
    for(i=0;i<n;i++)
        for(j=i;j<n;j++){
            if(a[i]>a[j]){
                temp=a[i];
                a[i]=a[j];
                a[j]=temp;
            }
        }
}
/*
void quicksort(int a[],int begin,int end){
    if(begin<end){
        int temp=a[begin];
        int i=begin;
        int j=end;
        while(i<j){
            while(i<j && a[j]>temp)
                j--;
            a[i]=a[j];
            while(i<j && a[i]<=temp)
                i++;
            a[j]=a[i];
        }
        a[i]=temp;
        quicksort(a,begin,i-1);
        quicksort(a,i+1,end);
    }
    else
        return;
}*/
int main(){
    int n,i;
    cin>>n;
    int a[n];    //这句话要放在输入n之后 否则是非法内存访问
    for(i=0;i<n;i++){
        cin>>a[i];
    }
    range(n,a);
    //quicksort(a,0,n-1);
    for(i=0;i<n-1;i++){
        cout<<a[i]<<" ";
    }
    cout<<a[n-1];
    return 0;
}

---

#include<iostream>
#include<string>
using namespace std;
void move(int n,string &b){
    int i,j,temp;
    temp=b[0];
    for(i=0;i<n;i++){
        b[i]=b[i+1];
    }    
    b[n-1]=temp;
}
int main(){
    int k,n,t;
    cin>>k;
    string s1;
    cin>>s1;
    n=s1.length();
    for(t=0;t<k;t++){
        move(n,s1);
    }
    cout<<s1;
    return 0;
}

---

#include<iostream>
using namespace std;
void count(int x,int y){
    int i,j,temp=1;
    for(i=0;i<=x;i++)
        for(j=0;j<=y;j++){
            if(i+j==x && 2*i+4*j==y){
                cout<<i<<" "<<j<<endl;
                temp=0;
            }
        }
    if(temp){
        cout<<-1<<" "<<-1<<endl;
    }
}
int main(){
    int m,n;
    while(cin>>m>>n){
        count(m,n);
    }
    return 0;
}

---

#include<iostream>
#include<string>
using namespace std;
int main(){
    string sentence;
    cin>>sentence;
    int i,j;
    cout<<6;
    for(i=6;i<=10;i++){
        cout<<sentence[i];
    }
    return 0;
}

---

#include<iostream>
using namespace std;
int main(){
    int n;
    cin>>n;
    int i,a[n];
    for(i=0;i<n;i++){
        cin>>a[i];
    }
    cout<<a[(n)/2];
    return 0;
}

---

#include<iostream>
using namespace std;
int main(){
    int m,n,i,j,t=0;
    cin>>m;
    cin>>n;
    int a[m],b[n];
    for(i=0;i<m;i++){
        cin>>a[i];
    }
    for(j=0;j<n;j++){
        cin>>b[j];
    }
    i=0;j=0;
    int c[m+n];
    while(i<m&&j<n){
        if(a[i]<b[j]){
            c[t++]=a[i++];
        }
        else if(a[i]>=b[j]){
            c[t++]=b[j++];
        }
    }
    while(i<m){
        c[t++]=a[i++];
    }
    while(j<n){
        c[t++]=b[j++];
    }
    for(t=0;t<m+n;t++){
        cout<<c[t]<<" ";
    }
    return 0;
}

---

#include<iostream>
using namespace std;
//哥德巴赫猜想
int get_sushu(int n,int *a){
    int i=2,j,t;
    a[0]=2;
    a[1]=3;
    for(j=4;j<=n-1;j++){
        for(t=2;t<j;t++){
            if(j%t==0){
                break;
            }
        }    
        if(t==j){
            a[i++]=j;
        }
    }
    return i-1;
}
int main(){
    int n,temp;
    while(cin>>n){
        int a[n];
        temp=get_sushu(n,a);
        int i,j,control=0;
        for(i=0;i<=temp;i++){
            for(j=0;j<=temp;j++){
                if(int(a[i])+int(a[j])==n){
                    cout<<int(a[i])<<"+"<<int(a[j])<<endl;
                    control=1;
                }
            }
        if(control==1)
            break;            
        }


                
    }
    return 0;
}

---

#include<string.h>
#include<iostream>
#include<string>
using namespace std;
int main(){
    string s;
    while(cin>>s){
        int n=0,i=0;
        while(s[i]!='\0'){
            n=n*8+int(s[i])-'0';
            i++;
        }
        if(n==0)
            break;
        cout<<n<<endl;
    }
    return 0;
}

---

样例2  100 100  输出10个

注意：多组输入！

#include<iostream>
using namespace std;
int change(int m){
    if(m==1){
        return 0;
    }
    else if(m==0){
        return 1;
    }
}
void address(int *a,int id,int n){
    int i=1;
    for(i=id;i<=n;i++){
        if(i%id==0){
            a[i]=change(a[i]);
        }
    }
}
int main(){
    int n,k;
    while(cin>>n>>k){
        int i,j;
        int a[n+1]={0};
        a[0]=2;
        for(i=1;i<=k;i++){
            address(a,i,n);
        }
        for(j=1;j<n+1;j++){
            if(a[j]==1)
                cout<<j<<endl;
        }
    }
    return 0;
}

---

牛逼 一把过！！

#include<iostream>
using namespace std;
int main(){
    int n;
    while(cin>>n){
        int a[n][n];
        int i=0,j=0,num=0,c=0,t;
        if(n%2==0)
            t=n/2-1;
        else
            t=n/2;
        for(i=0;i<n;i++)
            for(j=0;j<n;j++)
                a[i][j]=-1;
        while(c<=t){
            if(c==0 || c==1){
                for(i=0;i<n-c;i++){
                    if(a[i][n-1-c]==-1)
                        a[i][n-1-c]=++num;        
                    else if(i==0)
                        continue;
                    else
                        break;
                }
            }
            if(c>=2){
                for(i=c-1;i<n-c;i++){
                    if(a[i][n-1-c]==-1)
                        a[i][n-1-c]=++num;
                    else if(i==c-1)
                        continue;
                    else
                        break;
                }
            }


            for(j=n-1-c;j>=c;j--){
                if(a[n-1-c][j]==-1)
                    a[n-1-c][j]=++num;
                else if(n-1-c==j)
                    continue;
                else
                    break;
            }
            for(i=n-1-c;i>=c;i--){
                if(a[i][c]==-1)
                    a[i][c]=++num;
                else if(i==n-1-c)
                    continue;
                else
                    break;
            }
            for(j=c;j<n-c-1;j++){
                if(a[c][j]==-1)
                    a[c][j]=++num;
                else if(j==c)
                    continue;
                else
                    break;
            }
            c++;
        }
        for(i=0;i<n;i++){
            for(j=0;j<n;j++){
                if(j==n-1)
                    cout<<a[i][j]<<endl;
                else if(j<n-1)
                    cout<<a[i][j]<<" ";
            }
        }            
    }
    return 0;
}

---