ZOJ1003(1)
来源:互联网 发布:淘宝网店在哪里看 编辑:程序博客网 时间:2024/06/16 05:38
首先试了试比较直接的搜索方法
import sysfrom copy import deepcopydef find(m,n,ts): global flag global flag2 if flag: return() if n==1: flag2=True if m==1: flag=True return() else: for i in range(1,100): if m%(101-i)==0 and ts[101-i]: t=deepcopy(ts) t[101-i]=False find(int(m/(101-i)),n,t) if flag: break else: for i in range(1,100): if n%(101-i)==0 and ts[101-i]: t=deepcopy(ts) t[101-i]=False find(m,int(n/(101-i)),t) if flag: breakss=[]for i in range(101): ss.append(True)while True: flag=False flag2=False a=sys.stdin.readline() if a=='': break a=a.split() x=int(a[0]) y=int(a[1]) if x<y: x=x+y y=x-y x=x-y x1=x y1=y tt=deepcopy(ss) find(x,y,tt) if flag2: if flag: print(x1) else: print(y1) else: print(x1)
结果Accepted Time 760Memory 140通过 不过运行时间较长
0 0
- ZOJ1003(1)
- ZOJ1003
- zoj1003
- ZOJ1003
- zoj1003
- ZOJ1003
- zoj1003:DFS
- zoj1003 Crashing Balloon
- ZOJ1003 Crashing Balloon
- ZOJ1003 Crashing Balloon
- zoj1003-Crashing Balloon
- zoj1003 Crashing Balloon
- zoj1003 crashing balloon
- ZOJ1003-Crashing Balloon
- 踩气球ZOJ1003
- ZOJ1003 Crashing Balloon
- ZOJ1003 Crashing Balloon
- 17-1-(1)
- LeetCode OJ Reorder List
- CodeForces - 44B Cola
- C++中数字与字符串之间的转换
- LeetCode OJ Partition List
- java.io中的字符流简单介绍
- ZOJ1003(1)
- LeetCode OJ Reverse Linked List II
- LeetCode OJ Linked List Cycle II
- 每个Java程序员必须知道的5个JVM命令行标志
- LeetCode OJ Linked List Cycle
- leetcode 之Rotate Array
- LeetCode OJ Insertion Sort List
- LeetCode OJ Sort List
- LeetCode OJ Max Points on a Line