算法练习16
来源:互联网 发布:marc元数据知乎 编辑:程序博客网 时间:2024/05/28 16:26
最大公约数
#include <stdio.h>
#define MAX_SIZE 1024
#define MAX_SIZE 1024
int main()
{
int flag = 0;
int a;
int b;
int i;
int j = 0;
int counta;
int countb;
int num_a[MAX_SIZE];
int num_b[MAX_SIZE];
{
int flag = 0;
int a;
int b;
int i;
int j = 0;
int counta;
int countb;
int num_a[MAX_SIZE];
int num_b[MAX_SIZE];
printf("please input a,b\n");
printf("a=");
scanf("%d",&a);
printf("b=");
scanf("%d",&b);
printf("a=");
scanf("%d",&a);
printf("b=");
scanf("%d",&b);
for(i = a; i > 0;i--)
{
if((a % i) == 0)
{
num_a[j] = i;
j++;
}
}
counta = j - 1;
j = 0;
for(i = b; i > 0; i--)
{
if((b % i) == 0)
{
num_b[j] = i;
j++;
}
}
{
if((a % i) == 0)
{
num_a[j] = i;
j++;
}
}
counta = j - 1;
j = 0;
for(i = b; i > 0; i--)
{
if((b % i) == 0)
{
num_b[j] = i;
j++;
}
}
countb = j - 1;
i = 0;
j = 0;
j = 0;
if(a > b)
{
while(i != counta)
{
while(j != countb)
{
if(num_a[i] == num_b[j])
{
flag = 1;
break;
}
j++;
}
j = 0;
i++;
{
while(i != counta)
{
while(j != countb)
{
if(num_a[i] == num_b[j])
{
flag = 1;
break;
}
j++;
}
j = 0;
i++;
if(flag)
{
break;
}
}
i--;
j--;
}
else if(a < b)
{
while(i != countb)
{
while(j != counta)
{
if(num_a[i] == num_b[j])
{
flag = 1;
break;
}
j++;
}
j = 0;
i++;
{
break;
}
}
i--;
j--;
}
else if(a < b)
{
while(i != countb)
{
while(j != counta)
{
if(num_a[i] == num_b[j])
{
flag = 1;
break;
}
j++;
}
j = 0;
i++;
if(flag)
{
break;
}
}
i--;
j--;
}
else
{
num_a[i] = a;
}
{
break;
}
}
i--;
j--;
}
else
{
num_a[i] = a;
}
if(flag)
{
printf("gcd is %d\n",num_a[i]);
}
else if((a%b == 0)||( b % a ==0))
{
if(a>b)
{
printf("gcd is %d\n",b);
}
else
{
printf("gcd is %d\n",a);
}
}
else
{
printf("no gcd\n");
}
return 0;
}
{
printf("gcd is %d\n",num_a[i]);
}
else if((a%b == 0)||( b % a ==0))
{
if(a>b)
{
printf("gcd is %d\n",b);
}
else
{
printf("gcd is %d\n",a);
}
}
else
{
printf("no gcd\n");
}
return 0;
}
0 0
- 算法练习16
- 【练习】经典算法练习
- 算法练习
- 算法练习
- 算法练习
- 算法练习
- 【算法练习】
- 算法练习
- 算法练习
- 算法练习
- 算法练习
- 算法练习
- 算法练习
- 算法练习
- 算法练习
- 算法练习
- 算法练习
- 算法练习
- Codeforces Round #376 (Div. 2) F. Video Cards (二分)(lower bound)
- 位运算符
- [leetcode]19. Remove Nth Node From End of List
- ubuntu14安装tensorflow
- leetcode submission/20161018(move zeroes)
- 算法练习16
- 一个关于概率的问题的思考
- linux不带缓存的文件操作
- unity shader (6)--实现高光反射光照模型
- 算法Week08.03 - LeetCode 112. Path Sum
- MFC----------创建用户登录界面笔记
- Java Calculator
- 当黑客遇见画家
- Android中怎么做屏幕适配