ACM题解源代码(ZOJ)
WuchangI
An optimistic Nobita fond of coding~~
展开
-
ZOJ 1108(FatMouse's Speed)
//经典dp//难点在于序列路径的输出(使用“前驱法”)#include#includeusing namespace std;int dp[1001], pre[1001];struct mice{ int order; //记住初始时各只老鼠的顺序,避免后面操作时打乱 int weight; int speed;}m[1001];bool cmp(mice &m1原创 2017-06-23 19:37:54 · 658 阅读 · 1 评论 -
ZOJ 1001
#includeint main(void){ int a, b; while (scanf("%d%d", &a, &b) != EOF) printf("%d\n", a + b); return 0;}原创 2017-06-15 10:41:06 · 514 阅读 · 0 评论 -
ZOJ 2812
#includeint main(){ char c; int i=1,quicksum=0; while(scanf("%c",&c)!=EOF) { if(c>='A'&&c { quicksum=quicksum+(c-64)*i; } else原创 2017-06-14 21:13:51 · 590 阅读 · 0 评论 -
ZOJ 1383
#includeusing namespace std;int main(){ int n,i,j,num; cin>>n; int **binary=new int*[n]; for(j=0;j { binary[j]=new int[10]; } for(i=0;i {原创 2017-06-14 21:12:07 · 827 阅读 · 0 评论 -
ZOJ 1078
#includeusing namespace std;bool Is_P(int *a,int n){ int i; bool Is=true; for(i=0;i { if(a[i]!=a[n-1-i]) Is=false; } return Is;}bool trans(int num,int原创 2017-06-14 21:08:58 · 345 阅读 · 0 评论 -
ZOJ 1067
#includestruct color{ int R; int G; int B;};int f(int a, int b, int c){ int sum; sum = a*a + b*b + c*c; return sum;}int main(){ color c[16]; int原创 2017-06-14 21:08:04 · 316 阅读 · 0 评论 -
ZOJ 1048
//实质是求平均数#includeint main(){ int i=12; double sum=0.0,money,ave; while(i--) { scanf("%lf",&money); sum+=money; } ave=sum/12.0; printf("$%.2原创 2017-06-14 21:02:12 · 325 阅读 · 0 评论 -
ZOJ 2136(Longest Ordered Subsequence)
#include#includeusing namespace std;int a[1001], dp[1001];int main(void){ int n, N, ans; cin >> N; while (N--) { cin >> n; ans = 0; for (int i原创 2017-06-24 16:56:09 · 503 阅读 · 0 评论 -
ZOJ 1049 (I Think I Need a Houseboat)
#include #includeconst double PI=3.14159;int main(){ using namespace std; double x,y,r_2; int N,i=1,year; cin>>N; while(N--) { cin>>x>>y; r_2=x*原创 2017-06-14 21:05:24 · 345 阅读 · 0 评论 -
ZOJ 1204(Additive equations)
//经典深搜DFS,其中参考了别人的代码#include#include#includeusing namespace std;int n, a[30], visit[30];bool flag; //判断是否有解(即满足题意的等式)void DFS(int start, int depth, int sum) //深搜{ if (de原创 2017-06-17 23:58:48 · 972 阅读 · 0 评论 -
ZOJ 2734(Exchange Cards)
//经典DFS#include#includeusing namespace std;int card[1001], n, m, sum_value, ways;void DFS(int start) //start 为开始节点{ if (sum_value == n) ways++; //等于目标价值了,计数+1,回溯 else原创 2017-06-19 12:40:37 · 469 阅读 · 0 评论 -
ZOJ 1733(Common Subsequence)
//经典dp//最长公共子序列问题#include#include#includeusing namespace std;//dp[i][j]表示的是 s1[0],s1[1],s1[2]....s1[i-1](共i个)和s2[0],s2[1],s2[2]....s2[j-1](共j个)的最长公共子序列的长度int dp[1001][1001]; //数组记得开大点原创 2017-06-22 23:09:59 · 726 阅读 · 0 评论 -
ZOJ 1259(Rails)
//使用两个栈和一个队列#include#include#includeusing namespace std;int main(void){ int n, temp; while (cin>>n&&n) { while (cin >> temp&&temp) { stackorder, save; //s原创 2017-06-22 23:11:51 · 595 阅读 · 0 评论 -
ZOJ 1045
#includeusing namespace std;int main(void){ double sum , length; while (cin >> length&&length) { sum = 0; for (int n = 1; n { sum += 1.0 /原创 2017-06-15 10:49:25 · 402 阅读 · 0 评论