摘要： http://poj.org/problem?id=1166#include<iostream>#include<cstdio>#include<algorithm>#include<cstring>#include<map>#include<cmath>#define LL long longusing namespace std;const int N=11;char pre[N][10]={"" ,"ABDE","ABC" ,"BCEF" 阅读全文

摘要： http://poj.org/problem?id=2947基础高斯消元 注意时刻模7#include<iostream>#include<cstdio>#include<algorithm>#include<cstring>#include<map>#include<cmath>#define LL long longusing namespace std;const int N=350;int a[N][N];int ans[N];int n,m;char s[9][5]={"","MON 阅读全文

摘要： http://poj.org/problem?id=1026找到每个循环 并记录循环里有多少个数对每个循环的字符进行移动 移动一次是一个循环 移动的次数 为循环里数的个数的余数代码：#include<iostream>#include<cstdio>#include<algorithm>#include<cstring>#include<map>#include<cmath>#define LL long longusing namespace std;const int N=205;int a[N];int num[N] 阅读全文

摘要： http://poj.org/problem?id=3270给n头牛 让你把他们升序排序 每次交换两个牛 交换花费是两个牛值之和求最小花费黑书上有 P248 求循环每个循环进行判断 一个循环的花费有两种情况可能为最优1 用循环内最小的花费牛 和其他牛 进行交换2 或是用全局最小花费牛 先和本环内最小花费牛交换 然后一样 最后再交换回来就可以了代码及其注释：#include<iostream>#include<cstdio>#include<algorithm>#include<cstring>#include<map>#include 阅读全文

摘要： http://poj.org/problem?id=2409#include<iostream>#include<cstdio>#include<algorithm>#include<cstring>#include<map>#include<cmath>#define LL long longusing namespace std;int gcd(int a,int b){ if(a%b==0) return b; return gcd(b,a%b);}LL ploya(int n,int m){ if(n==0) re 阅读全文

摘要： http://poj.org/problem?id=1286polya burnside难了不会 会了不难#include<iostream>#include<cstdio>#include<algorithm>#include<cstring>#include<map>#include<cmath>#define LL long longusing namespace std;int gcd(int a,int b){ if(a%b==0) return b; return gcd(b,a%b);}LL ploya(in 阅读全文