代码

14 条评论

  • @ 2022-07-16 10:58:28

    神马程序

  • @ 2022-07-16 10:58:19

    水电费第三方发生的人为

  • @ 2022-07-16 10:57:40

    神马

  • @ 2022-07-14 15:00:03

    thankyou!

  • @ 2022-07-14 11:04:31
    #include <iostream>
    #include <iomanip>
    #include <cstring>
    #include <cstdio>
    #include <ctime>
    #include <cstdlib>
    //include <bits/stdc++.h>
    using namespace std;
    int f(int n)
    {
        if(n==1)
        {
            return 1;
        }
        if(n==2)
        {
            return 2;
        }
        return f(n-1)+f(n-2);
    }
    int main()
    {
        for(int n=1;n<=10;n++)
        {
            cout<<f(n)<<endl;
        }//10
        return 0;
    }
    
  • @ 2022-07-14 11:04:18
    #include <iostream>
    #include <iomanip>
    #include <cstring>
    #include <cstdio>
    #include <ctime>
    #include <cstdlib>
    //include <bits/stdc++.h>
    using namespace std;
    void f(int x)
    {
        if(x==0)
        return;
        cout<<x%10;
        f(x/10);
    }
    int main()
    {
        int x=1234;
        f(x);
        cout<<endl;
        return 0;//9
    }
    
    
  • @ 2022-07-14 11:03:46
    #include <iostream>
    #include <iomanip>
    #include <cstring>
    #include <cstdio>
    #include <ctime>
    #include <cstdlib>
    //include <bits/stdc++.h>
    using namespace std;
    int gcd(int a,int b)
    {
        while(1)
        {
            int r=a%b;
            if(r==0)
            {
                break;
            }
            a=b;
            b=r;
        }
        return b;
    }
    int main()
    {
        int n;
        cin>>n;
        int a;
        cin>>a;
        for(int i=2;i<=n;i++)
        {
            int b;
            cin>>b;
            a=gcd(a,b);
        }
        cout<<a<<endl;
        return 0;//8
         
    }
    
  • @ 2022-07-14 11:03:26
    #include <iostream>
    #include <iomanip>
    #include <cstring>
    #include <cstdio>
    #include <ctime>
    #include <cstdlib>
    //include <bits/stdc++.h>
    using namespace std;
    int f(int m,int n)
    {
        if(m==1||n==1)
        {
            return 1;
        }
        int left=f(m,n-1);
        int up=f(m-1,n);
        return left+up;
    }//7
    int main()
    {
        cout<<f(7,8)<<endl;
        return 0;
    }
    
  • @ 2022-07-14 11:02:56
    #include <iostream>
    #include <iomanip>
    #include <cstring>
    #include <cstdio>
    #include <ctime>
    #include <cstdlib>
    //include <bits/stdc++.h>
    using namespace std;
    int main()
    {
        int n;
        for(n=3;n<=1500;n+=7)
        {
            if(n%3!=2)
            {
                continue;
            }
            if(n%5==4)
            {
                break;
            }
            cout<<n<<endl;
            int m=105;
            while(n<1500)
            {
                n=n+m;
                cout<<n<<endl;
            }//6
        }
        return 0;
    }
    
  • @ 2022-07-14 11:02:22
    #include <iostream>
    #include <iomanip>
    #include <cstring>
    #include <cstdio>
    #include <ctime>
    #include <cstdlib>
    //include <bits/stdc++.h>
    using namespace std;
    int main()
    {
        int m=100;
        int i,j,k;
        int cnt=0;
        for(i=0;i<=m;i++)
        {
            for(j=0;j<=m;j++)
            {
                k=m-i-j;
                if(i*0.5+j*1+k*2==m)
                {
                    cout<<i<<","<<j<<","<<k<<endl;
                    cnt++;
                }
            }
        }
        cout<<cnt<<endl;//5
        return 0;
    }
    
  • @ 2022-07-14 11:02:07
    #include <iostream>
    #include <iomanip>
    using namespace std;
    int gcd;
    int lcm(int a,int b);//4
    int lcm(int a,int b)
    {
        return a/gcd(a,b)*b;
    }
    int main()
    {
        int n;
        cin>>n;
        int b,a;
        cin>>b>>a;
        for(int i=2;i<=n;i++)
        {
            int b1,a1;
            cin>>b1>>a1;
            int m=lcm(a,a1);
            b=m/a*b+m/a1*b1;
            cout<<b<<"/"<<a<<endl;
        }
        cout<<b<<"/"<<a<<endl;
        int g=gcd(a,b);
        a=a/g;
        b=b/g;
        cout<<b<<"/"<<a<<endl;
        return 0;
    }
    
  • @ 2022-07-14 11:01:45
    #include <iostream>//3
    using namespace std;
    int xfs(int x);
    int isHW(int x);
    int xfs(int x)
    {
        int y=0;
        for(;x>0;x/=10)
            y=y*10+x%10;
        return y;
    }
    int isHW(int x)
    {
        return x==xfs(x);
    }
    int main()
    {
        int a,cnt=0;
        cin>>a;
        for(int x=1;x<=10000;x++)
        {
            if(isHW(x)==1)
            {
                cnt++;
            }
        }
        cout<<cnt<<endl;
        return 0;
    }
    
  • @ 2022-07-14 11:01:24
    #include <iostream>//2
    #include <cstdio>
    #include <iomanip>
    
    using namespace std;
    
    int main()
    {
        int n,i,j,k,m;
        cin>>m;
        
        for(k=1;k<=m;k++)
        {
            n=2*k+1;
            for(i=1;i<=n;i++)
            {
                for(j=1;j<=2*m+1-i;j++)
                {
                    cout<<" ";
                }
                for(j=1;j<=2*i-1;j++)
                {
                    cout<<"*";
                }
                cout<<endl;
            }
        }
        
        return 0;
    }
    
  • @ 2022-07-14 11:00:56
    #include <iostream>//1
    #include <iomanip>
    using namespace std;
    void Tri(int n,int k)
    {
        for(int i=0;i<n;i++)
        {
            for(int j=0;i<k+n-i-1;j++)
            {
                cout<<" ";
            }
            for(int j=0;j<2*i+1;j++)
            {
                cout<<"*";
            }
            cout<<endl;
        }
    }
    int main()
    {
        int a,j;
        cin>>a;
        cout<<j;
        return 0;
    }
    
  • 1

信息

ID
1026
难度
9
分类
其他 点击显示
标签
递交数
2
已通过
2
通过率
100%
上传者