当前位置：首页 > news >正文

3.12刷题

news 来源：原创 2025/4/30 4:15:30

P6206 [USACO06OCT] Another Cow Number Game G - 洛谷

#include<bits/stdc++.h>
using namespace std;
int main(){
    long long n,ans=0;
    cin>>n;
    while(n!=1){
        ans++;
        if(n%2==0)  n/=2;
        else    n=n*3+1;
    }
    cout<<ans;
	return 0;
}

P6263 [COCI 2014/2015 #3] STROJOPIS - 洛谷

#include<bits/stdc++.h>
using namespace std;
int main(){
    string s;
    int yi=0,er=0,san=0,si=0,liu=0,ba=0,jiu=0,ling=0;
    cin>>s;
    for(int i=0;i<s.size();i++){
        if(s[i]=='1'||s[i]=='Q'||s[i]=='A'||s[i]=='Z') yi++;
        else if(s[i]=='2'||s[i]=='W'||s[i]=='S'||s[i]=='X') er++;
        else if(s[i]=='3'||s[i]=='E'||s[i]=='D'||s[i]=='C') san++;
        else if(s[i]=='4'||s[i]=='R'||s[i]=='F'||s[i]=='V'||s[i]=='5'||s[i]=='T'||s[i]=='G'||s[i]=='B') si++;
        else if(s[i]=='6'||s[i]=='Y'||s[i]=='H'||s[i]=='N'||s[i]=='7'||s[i]=='U'||s[i]=='J'||s[i]=='M') liu++;
        else if(s[i]=='8'||s[i]=='I'||s[i]=='K'||s[i]==',') ba++;
        else if(s[i]=='9'||s[i]=='O'||s[i]=='L'||s[i]=='.') jiu++;
        else    ling++;
    }
    cout<<yi<<endl<<er<<endl<<san<<endl<<si<<endl;
    cout<<liu<<endl<<ba<<endl<<jiu<<endl<<ling<<endl;
	return 0;
}

P6284 [COCI 2016/2017 #1] Tarifa - 洛谷

#include<bits/stdc++.h>
using namespace std;
int main(){
    int x,n,p,sum=0;
    cin>>x>>n;
    for(int i=0;i<n;i++){
        cin>>p;
        sum+=x-p;
    }
    cout<<sum+x;
	return 0;
}

P6320 [COCI 2006/2007 #4] SIBICE - 洛谷

#include<bits/stdc++.h>
using namespace std;
int main(){
    int n,w,h,l;
    cin>>n>>w>>h;
    int max_l=int(sqrt(w*w+h*h));
    for(int i=0;i<n;i++){
        cin>>l;
        if(l<=max_l)  cout<<"DA"<<endl;
        else    cout<<"NE"<<endl;
    }
	return 0;
}

P6321 [COCI 2006/2007 #4] SKENER - 洛谷

#include<bits/stdc++.h>
using namespace std;
char x[60][60];
int main(){
    int r,c,zr,zc;
    cin>>r>>c>>zr>>zc;
    for(int i=0;i<r;i++)
        for(int j=0;j<c;j++)
            cin>>x[i][j];
    for(int i=0;i<r;i++){
        for(int zi=0;zi<zr;zi++){
            for(int j=0;j<c;j++){
                for(int zj=0;zj<zc;zj++)
                    cout<<x[i][j];
            }
            cout<<endl;
        }
    }

	return 0;
}

P6330 [COCI 2007/2008 #1] CETVRTA - 洛谷

#include<bits/stdc++.h>
using namespace std;
int main(){
    int a,b,aa,bb,aaa,bbb,cnt1=0,cnt2=0;
    cin>>a>>b>>aa>>bb>>aaa>>bbb;
    if(a==aa)   cnt1=aaa;
    else if(a==aaa)    cnt1=aa;
    else    cnt1=a;

    if(b==bb)   cnt2=bbb;
    else if(b==bbb ) cnt2=bb;
    else    cnt2=b;
    cout<<cnt1<<" "<<cnt2;
	return 0;
}

P6336 [COCI 2007/2008 #2] BIJELE - 洛谷

#include<bits/stdc++.h>
using namespace std;
int main(){
    int wang,hou,che,xiang,ma,bing;
    cin>>wang>>hou>>che>>xiang>>ma>>bing;
    cout<<1-wang<<" "<<1-hou<<" "<<2-che<<" "<<2-xiang<<" "<<2-ma<<" "<<8-bing;
	return 0;
}

B3687 [语言月赛202212] 数字口袋 - 洛谷

#include<bits/stdc++.h>
using namespace std;
int main(){
    long long n,sum=0;
    cin>>n;
    if(n==1){
        cout<<1<<endl;
    }else{
        for(int i=1;2*i<=n;i++){
            sum+=i;
            if(sum<=n)   cout<<i<<endl;
            else    break;
        }
    }
	return 0;
}

B3688 [语言月赛202212] 旋转排列 - 洛谷

#include<bits/stdc++.h>
using namespace std;
int a[2010];
void shift(int *a,int n){
    int tmp=a[0];
    for(int i=1;i<n;i++){
        swap(tmp,a[i]);
    }
    a[0]=tmp;
    for(int i=0;i<n;i++)    cout<<a[i]<<" ";
    cout<<endl;
}
int main(){
    int n;
    cin>>n;
    for(int i=0;i<n;i++)    cin>>a[i];
    shift(a,n);
    while(a[n-1]!=n){
        shift(a,n);
    }
	return 0;
}

B3697 [语言月赛202301] 铺地毯 - 洛谷

#include<bits/stdc++.h>
using namespace std;
int main(){
    long long a,b,c;
    cin>>a>>b>>c;
    if(a%c==0&&b%c==0){
        cout<<(a/c)*(b/c);
    }else   cout<<-1;
	return 0;
}

B3698 [语言月赛202301] 一次函数 - 洛谷

#include<bits/stdc++.h>
using namespace std;
int main(){
    long long n,k,b,x,y,ans=0;
    cin>>n>>k>>b;
    for(int i=0;i<n;i++){
        cin>>x>>y;
        if(y==k*x+b)    ans++;
    }
    cout<<ans;
	return 0;
}

B3700 [语言月赛202301] 九九乘方表 - 洛谷

#include<bits/stdc++.h>
using namespace std;
int main(){
    int n;
    long long sum=1;
    cin>>n;
    for(int i=1;i<=n;i++){
        sum=1;
        for(int j=1;j<=i;j++){
            sum*=i;
            printf("%d ^ %d = %lld ",i,j,sum);
        }
        cout<<endl;
    }
	return 0;
}

B3701 [语言月赛202301] 避雷针 - 洛谷

#include<bits/stdc++.h>
using namespace std;
int f[1000010];
int main(){
    int n,m,a,ans=0;
    cin>>n>>m;
    for(int i=0;i<m;i++){
        cin>>a;
        for(int j=max(1,a-2);j<=min(n,a+2);j++){
            if(f[j]==0) f[j]=1,ans++;
        }
    }
    cout<<ans;
	return 0;
}

错题重练

P2788 数学1（math1）- 加减算式 - 洛谷

#include<iostream>
#include<bits/stdc++.h>
using namespace std;
int main(){
    long long a,sum=0;
    while(cin>>a){
        sum+=a;
    }
    cout<<sum;
    return 0;
}

P2907 [USACO08OPEN] Roads Around The Farm S - 洛谷

#include<iostream>
#include<bits/stdc++.h>
using namespace std;
int f(int n,int k){
    if((n-k)/2>0&&(n-k)%2==0)   return f((n-k)/2,k)+f((n+k)/2,k);
    else    return 1;
}
int main(){
    int n,k,ans=0;
    cin>>n>>k;
    ans=f(n,k);
    cout<<ans;
    return 0;
}//2*i+k=n,i和i+k,i=(n-k)/2,和(n+k)/2

P2705 小球 - 洛谷

#include<iostream>
#include<bits/stdc++.h>
using namespace std;
int main(){
    int r,b,c,d,e;
    cin>>r>>b>>c>>d>>e;
    if(c+d>2*e) cout<<r*c+b*d;
    else{
        if(r>b) cout<<2*e*b+(r-b)*c;
        else    cout<<2*e*r+(b-r)*d;
    }
    return 0;
}

P2955 [USACO09OCT] Even? Odd? G - 洛谷

#include<iostream>
#include<bits/stdc++.h>
using namespace std;
int main(){
    int n;
    string s;
    cin>>n;
    for(int i=0;i<n;i++){
        cin>>s;
        if((int(s[s.size()-1]-'0')%2)==0)   cout<<"even"<<endl;
        else    cout<<"odd"<<endl;
    }
    return 0;
}

P3717 [AHOI2017初中组] cover - 洛谷

#include<iostream>
#include<bits/stdc++.h>
using namespace std;
int a[110][110];
int main(){
    int n,m,r,x,y,ans=0;
    double dis;
    cin>>n>>m>>r;
    for(int i=0;i<m;i++){
        cin>>x>>y;
        for(int j=1;j<=n;j++){
            for(int k=1;k<=n;k++){
                dis=sqrt((x-j)*(x-j)+(y-k)*(y-k));
                if(dis<=r&&a[j][k]==0)  a[j][k]=1,ans++;
            }
        }
    }
    cout<<ans;
    return 0;
}

P3741 小果的键盘 - 洛谷

#include<iostream>
#include<bits/stdc++.h>
using namespace std;
int a[110];
int main(){
    int n,ans=0;
    string s;
    cin>>n>>s;
    for(int i=1;i<s.size();i++){
        if(s[i-1]=='V'&&s[i]=='K')  a[i-1]=a[i]=1,ans++;
    }
    for(int i=1;i<s.size();i++){
        if(s[i-1]==s[i]&&!a[i-1]&&!a[i]){//VV或者KK
            ans++;
            break;
        }
    }
    cout<<ans;
    return 0;
}