暴力
关注
分享
扫一扫
少点多些
这个作者很懒，什么都没留下…
展开
-
uva146
#include#include#includeusing namespace std;templatebool next_permutation1(T first, T last){if(first==last)return false;T it2 = last;T it = last;it--;if(it == first){return fal原创 2014-04-19 00:11:08 · 531 阅读 · 0 评论 -
poj1256(全排列)
http://poj.org/problem?id=1256#include#include#include#includeusing namespace std;bool comp(char a, char b){ if(tolower(a)==tolower(b)){ return a < b; }else return tolower(a)<tolower(b);原创 2014-04-24 23:28:39 · 926 阅读 · 0 评论 -
uva 11205
#include#include#includeusing namespace std;int p, n;int a[100];bool visit[(1<<15)];int ans;int count(int n){ int sum = 0; while(n){ if(n&1){ sum++; } n=(n>>1); } return sum;}转载 2014-04-15 21:16:34 · 629 阅读 · 0 评论 -
hdu1172(暴力)
猜数字Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2495 Accepted Submission(s): 1451Problem Description猜数字游戏是gameboy最喜欢的游戏之原创 2014-06-08 16:21:33 · 567 阅读 · 0 评论