codeforces 664A Complicated GCD

水题。。[a,b]区间数的最大公约数。

a==b输出a 否则输出1

 1 #include<cstdio>
 2 #include<cstring>
 3 #include<iostream>
 4 #include<queue>
 5 #include<stack>
 6 #include<cmath>
 7 #include<algorithm>
 8 using namespace std;
 9 #define clc(a,b) memset(a,b,sizeof(a))
10 #define inf 0x3f3f3f3f
11 const int N=10010;
12 #define LL long long
13 const double eps = 1e-5;
14 const double pi = acos(-1);
15 // inline int r(){
16 //     int x=0,f=1;char ch=getchar();
17 //     while(ch>'9'||ch<'0'){if(ch=='-') f=-1;ch=getchar();}
18 //     while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
19 //     return x*f;
20 // }
21 int main(){
22     char a[110],b[110];
23     cin>>a>>b;
24     if(strcmp(a,b)==0)
25         cout<<a<<endl;
26     else
27         cout<<"1"<<endl;
28     return 0;
29 }

View Code

 

转载于:https://www.cnblogs.com/ITUPC/p/5406186.html