[ZOJ] 1003 Crashing Balloon
来源:互联网 发布:recv函数接收数据不全 编辑:程序博客网 时间:2024/05/16 10:39
/*-----------------------------------------
zoj1003 Crashing Balloon
road 2007/08/31
dfs
--------------------------------------------*/
#include <stdlib.h>
#include <stdio.h>
#define SWAP(x,y) do { x = x^y; y = x^y; x = x^y;} while(0)
typedef enum { FALSE, TRUE } boolean;
boolean flag;
boolean ans;
void search(int m, int n, int p)
{
#ifndef ONLINE_JUDGE
printf("search %d %d %d/n", m, n, p);
#endif
if (m==1 && n==1)
{
ans = TRUE;
return;
}
if (n==1)
flag = TRUE;
if (p>100) return;
if (m%p == 0)
search (m/p, n, p+1);
if (ans)
return;
if (n%p == 0)
search (m, n/p, p+1);
if (ans)
return;
search (m, n, p+1);
}
int main()
{
int m, n;
while(scanf("%d%d", &m, &n)!=EOF)
{
if (m<n)
SWAP(m,n);
ans = flag = FALSE;
search (m, n, 2);
if (!ans && flag)
printf("%d/n", n);
else
printf("%d/n", m);
}
}
zoj1003 Crashing Balloon
road 2007/08/31
dfs
--------------------------------------------*/
#include <stdlib.h>
#include <stdio.h>
#define SWAP(x,y) do { x = x^y; y = x^y; x = x^y;} while(0)
typedef enum { FALSE, TRUE } boolean;
boolean flag;
boolean ans;
void search(int m, int n, int p)
{
#ifndef ONLINE_JUDGE
printf("search %d %d %d/n", m, n, p);
#endif
if (m==1 && n==1)
{
ans = TRUE;
return;
}
if (n==1)
flag = TRUE;
if (p>100) return;
if (m%p == 0)
search (m/p, n, p+1);
if (ans)
return;
if (n%p == 0)
search (m, n/p, p+1);
if (ans)
return;
search (m, n, p+1);
}
int main()
{
int m, n;
while(scanf("%d%d", &m, &n)!=EOF)
{
if (m<n)
SWAP(m,n);
ans = flag = FALSE;
search (m, n, 2);
if (!ans && flag)
printf("%d/n", n);
else
printf("%d/n", m);
}
}
- [ZOJ] 1003 Crashing Balloon
- zoj 1003 Crashing Balloon
- ZOJ 1003 Crashing Balloon
- zoj 1003 Crashing Balloon
- ZOJ 1003 Crashing Balloon
- zoj 1003 Crashing Balloon
- zoj 1003 Crashing Balloon
- zoj 1003 Crashing Balloon
- ZOJ 1003:Crashing Balloon
- ZOJ 1003 Crashing Balloon
- zoj 1003 Crashing Balloon
- ZOJ 1003 Crashing Balloon
- zoj 1003 Crashing Balloon
- ZOJ 1003 Crashing Balloon
- ZOJ 1003 Crashing Balloon
- ZOJ 1003 Crashing Balloon
- zoj 1003 Crashing Balloon
- 【ZOJ 1003】 Crashing Balloon
- 什么是遗传算法(转)
- Dropdown Box Using AJAX
- javascript 滚动定位
- JAVA内存泄漏——内存泄漏原因和内存泄漏检测工具(zt)
- TOMCAT入门经典(转)
- [ZOJ] 1003 Crashing Balloon
- 第一部分:Linux安装和登陆命令
- The Second One
- Java初级工程的知识结构
- 关于提取文件名和路径
- SQL Server设计用于 CSV 输出
- 在C# 用dllimport 调用VC ++ winapi 型的dll example
- MFC程序的消息处理顺序
- 激活码