第十四届蓝桥杯集训——练习解题阶段(无序阶段)-ALGO-937 抗击虫群

#include <stdio.h>
#include <ctype.h>
#include <math.h>
#include <limits.h>
#include <stdlib.h>
#include <stdbool.h>
#include <string.h>
#define M 100007
#define ll long long
int gcd(int a,int b){
  if(b==0)
  return a;
  return gcd(b,a%b);
} 
int main() {
  int n,m;
  while(~scanf("%d%d",&n,&m)){
    printf("%d\n",gcd(n,m));
  }  
  return 0;
}

#include<iostream>
#include<algorithm>
#define endl '\n'
#define TLE ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
using namespace std;
int main()
{
  TLE; 
  int i = 0,mid,a,b;
  int c[100000] = {0};
  while (cin>> a)
  {
    cin>> b;
    c[i++] = __gcd(a,b);
  }
  for (int j=0;j<i;j++)
  {
    cout<< c[j] <<endl;;
  }
  
  return 0;
}

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;
public class Main {
    public static void main(String[] args) throws IOException {
        BufferedReader scanner = new BufferedReader(new InputStreamReader(System.in));
        ArrayList<Integer> arrayList = new ArrayList<>();
        String s;
        StringTokenizer t;
        while ((s = scanner.readLine()) != null) {
            t = new StringTokenizer(s);
            int x = Integer.parseInt(t.nextToken());
            int y = Integer.parseInt(t.nextToken());
            if (x>y){
                int temp=x;
                x=y;
                y=temp;
            }
           while (x%y!=0){
               int temp=x%y;
               x=y;
               y=temp;
           }
            System.out.println(y);
        }
    }
}

import math
try:
    while True:
        n,m = map(int,input().split())
        print(math.gcd(n,m))
except EOFError:
    pass