![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
poj
文章平均质量分 61
wlwlxgg
goal:ACM
展开
-
poj 3253
#include #include int a[20010];long long sum=0;int main(){ int n,t,i,s; scanf("%d",&n); for(i=0; i<n; i++) scanf("%d",&a[i]); while(n>1) { int firmin=0,secmin原创 2014-03-29 14:49:35 · 367 阅读 · 0 评论 -
poj 2976(01分数规划最基础)
Dropping testsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6151 Accepted: 2131DescriptionIn a certain course, you take n tests. If you get ai out o原创 2014-08-25 00:26:46 · 324 阅读 · 0 评论 -
poj 2975 Nim
win position就是每次从某一堆哪任意石子后,之后的是一个必败局面。原创 2014-07-17 19:05:25 · 389 阅读 · 0 评论 -
poj 1704(转化成nim)
和hdu1730是一样的类型,这个需要zhu'yi'yi原创 2014-07-17 19:02:54 · 376 阅读 · 0 评论 -
poj 3069
#include #include int a[1010];int cmp(int *a,int *b){ return *a-*b;}int main(){ int R,n,i,j,k,count;; while(scanf("%d%d",&R,&n)){ if(R==-1&&n==-1)break; count=0;原创 2014-03-26 18:12:41 · 408 阅读 · 0 评论 -
poj 3617
#include #include char a[2001];int main(){ int n; int i,j,k,ok,count; while(~scanf("%d",&n)){ count=0; for(i=0;i<n;i++) scanf("\n%c",&a[i]); j=0;k=n原创 2014-03-26 16:49:35 · 318 阅读 · 0 评论 -
poj 1852
#include #include #includeint a[1000010];int main(){ int cases, lenth, n; int i, j; int max1, min1, max2, min2, min; scanf("%d",&cases); for(i=0;i<cases;i++) { max原创 2014-03-24 23:09:18 · 436 阅读 · 0 评论 -
poj 2386
#include #include char a[101][101];int N,M;void dfs(int x,int y){ int i,j,dx,dy; a[x][y]='.'; for(i=-1;i<2;i++){ for(j=-1;j<2;j++) { dx=x+i; d原创 2014-03-25 17:28:29 · 410 阅读 · 0 评论 -
poj 1979
#include #include int W, H, res;char a[21][21];int dfs(int i, int j){ if(i>=0&&i=0&&j<W&&(a[i][j]=='.'||a[i][j]=='@')) { a[i][j]='1'; res++; dfs(i+1,j); df原创 2014-03-31 21:23:46 · 367 阅读 · 0 评论 -
POJ2728 最小比率生成树
Desert KingTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 20720 Accepted: 5814DescriptionDavid the Great has just become the king of a desert country. To win the respect of his people, he原创 2014-08-25 18:20:54 · 321 阅读 · 0 评论