6 solutions

  • 1
    @ 2024-11-13 20:24:56
    #include<bits/stdc++.h>
    using namespace std;
    int q(int a,int b)
    {
        return b?q(b,a%b):a;
    }
    int main()
    {
        int n;
        cin>>n;
        int a,b;
        while(cin>>a>>b)
        {
            cout<<q(a,b)<<endl;
        }
        return 0;
    }
    //n表示:“为啥不用我?”
    
    • 0
      @ 2025-10-13 18:16:44
      #include<bits/stdc++.h>
      using namespace std;
      //gcd(a,b)=gcd(b,a%b)
      /*
      18 32
      32 18
      18 14
      14 4
      4 2
      2 0
      */
      int gcd(int a,int b)
      {
      	if(b==0) return a;
      	return gcd(b,a%b);
      }
      int main()
      {
      	int t;
      	cin>>t;
      	while(t--)
      	{
      		int a,b;
      		cin>>a>>b;
      		cout<<gcd(a,b)<<endl;
      	}
      	return 0;
      }
      
      
      • -1
        @ 2025-1-4 15:45:10
        #include<bits/stdc++.h>
        using namespace std;
        void gcd(int a,int b)
        {
        	if(b!=0) return gcd(a,b%a);
        	return gcd(a,b);
        }
        int main()
        {
        	int x;
        	cin>>x;
        	for(int x;x>=0;x--)
        	{
        		int a,b;
        		cin>>a>>b;
        		cout<<gcd(a,b);
        	}
        	return 0;
        }
        
        • @ 2025-1-8 18:51:52

          季总说的,你是

          错的!!!

      • -3
        @ 2024-7-8 13:32:15
        #include<bits/stdc++.h>
        using namespace std;
        int gcd(int a,int b)
        {
            if(b!=0)
            {
                return gcd(b,a%b);
            }
            return a;
        }
        int main()
        {
            int x;
            cin>>x;
            while(x--)
            {
                int a,b;
                cin>>a>>b;
                cout<<gcd(a,b)<<endl;
            }
            return 0;
        }
        
        • -4
          @ 2024-10-19 13:31:28
          #include<bits/stdc++.h>
          using namespace std;
          int gcd(int a,int b)
          {
              if(b!=0)
              {
                  return gcd(b,a%b);
              }
              return a;
          }
          int main()
          {
              int x;
              cin>>x;
              while(x--)
              {
                  int a,b;
                  cin>>a>>b;
                  cout<<gcd(a,b)<<endl;
              }
              return 0;
          }
          
          
          
          • -4
            @ 2024-7-3 13:41:05
            #include<bits/stdc++.h>
            using namespace std;
            int gcd(int a,int b)
            {
                return b?gcd(b,a%b):a;
            }
            int main()
            {
                int x;
                cin>>x;
                while(x--)
                {
                    int a,b;
                    cin>>a>>b;
                    cout<<gcd(a,b)<<endl;
                }
                return 0;
            }
            
            
            • 1

            Information

            ID
            176
            Time
            1000ms
            Memory
            256MiB
            Difficulty
            1
            Tags
            # Submissions
            72
            Accepted
            24
            Uploaded By