6 条题解

  • 1
    @ 2025-3-10 16:36:15

    #include

    using namespace std

    int main()

    int a,b,c;
    cin>>a>>b;
    for(int i=2;i<=a and i<=b;i++)
    {if(a%i==o and b%i==o){
    c=i;
    }
    
     cout<<c;
    
    return o;
    
  • 1
    @ 2025-2-28 12:29:12
    n,m=map(int,input().split()) 
    r=n%m 
    while r!=0: 
        r=n%m 
        n=m 
        m=r 
    print(n)
    
    • 1
      @ 2025-2-19 10:35:52
      n,m=map(int,input().split())
      r=n%m
      while r!=0:
          r=n%m
          n=m
          m=r
      print(n)
      
      • 0
        @ 2025-2-25 14:29:04

        #include

        using namespace std;

        int main()

        {

        int m,n;
        
        cin>>m>>n;
        
        int r=m%n;
        
        while(r!=0){
        
            m=n;n=r;r=m%n;
        
        }
        
        cout<<n;
        
        return 0;
        

        }

        • -2
          @ 2025-3-4 15:10:39

          给邵或的题解

          #include <bits/stdc++.h>

          using namespace std;

          int main() {

          int n, m, mx = -99;
          cin >> n >> m;
          int xx = max(m, n);
          
          for(long i = 1; i <= xx; i++) {
              if (m % i == 0 && n % i == 0) {
                  mx = i;
              }
          }
          
          cout << mx;
          
          
          
          return 0;
          

          }

          • -2
            @ 2025-2-19 14:07:58

            m,n=map(int,input().split()) while m>0: m,n=n%m,m print(n)

            • 1

            信息

            ID
            37
            时间
            1000ms
            内存
            128MiB
            难度
            4
            标签
            递交数
            1622
            已通过
            742
            上传者