HDU1016 Prime Ring Problem
2008-01-04 17:14
288 查看
题目地址:http://acm.hdu.edu.cn/showproblem.php?pid=1016
递归法:(简单但会超时。。。)
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
void swap(int& a,int& b)
bool isPrime(int num)
bool isOK(const vector<int>& v)
void Rerange(vector<int>& v,int m,int n)
int main(int argc,char* argv[])
回溯法:
#include<iostream>
#include<cmath>
using namespace std;
int a[20],curCase=0,n;
bool isNotIn(int num,int end)
bool isPrime(int num)
bool isPrimeCircl(int num,int end)
void output()
void back(int i)
int main()
递归法:(简单但会超时。。。)
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
void swap(int& a,int& b)
bool isPrime(int num)
bool isOK(const vector<int>& v)
void Rerange(vector<int>& v,int m,int n)
int main(int argc,char* argv[])
回溯法:
#include<iostream>
#include<cmath>
using namespace std;
int a[20],curCase=0,n;
bool isNotIn(int num,int end)
bool isPrime(int num)
bool isPrimeCircl(int num,int end)
void output()
void back(int i)
int main()
相关文章推荐
- HDU1016 Prime Ring Problem
- HDU1016:Prime Ring Problem(DFS)
- hdu1016 Prime Ring Problem(dfs)
- HDU1016 - Prime Ring Problem - dfs
- HDU1016-Prime Ring Problem
- HDU1016 Prime Ring Problem(深度优先搜索)
- hdu1016 Prime Ring Problem(回溯dfs)
- hdu1016-Prime Ring Problem(回溯法)
- HDU1016:Prime Ring Problem(DFS)
- hdu1016-Prime Ring Problem
- HDU1016 Prime Ring Problem
- HDU1016 Prime Ring Problem 解题报告--dfs
- HDU1016 Prime Ring Problem DFS 简单题
- HDU1016 Prime Ring Problem(素数环,深搜DFS)
- HDU1016:Prime Ring Problem(dfs)
- hdu1016:Prime Ring Problem
- hdu1016 Prime Ring Problem
- ACM 搜索 hdu1016 Prime Ring Problem
- hdu1016 Prime Ring Problem 素数环
- HDU1016 Prime Ring Problem 【回溯】