acm
关注
分享
扫一扫
铁兵
这个作者很懒，什么都没留下…
展开
-
ZOJ 1205 Martian Addition
#include#include#include#include#includeusing namespace std;int main(){ //ifstream cin("acmilan.txt"); string sa,sb,t; vectorv; int i; int a,b,sum; int flag; while(cin>>sa>>sb) { flag原创 2012-07-14 13:28:17 · 678 阅读 · 0 评论 -
ZOJ 2727List the Books
#include#include#include#include#includeusing namespace std;struct Book{ string Name; int Year; int Price;};bool CompName(const Book &b1,const Book &b2){ if(b1.Name!=b2.Name) return b原创 2012-07-14 14:13:21 · 638 阅读 · 0 评论 -
ZOJ 2109 FatMouse' Trade
#include#include#include#includeusing namespace std;struct Mouse{ double J; double F; double a;};bool Comp(const Mouse &d1,const Mouse &d2){ if(d1.a!=d2.a) return d1.a>d2.a; else ret原创 2012-07-14 13:55:48 · 700 阅读 · 0 评论 -
ZOJ 2724Windows Message Queue
#include#include#include#includeusing namespace std;struct Message{ char Name[100]; int Date; int Priority; bool operator <(const Message &a)const { return a.Priority<Priority; }};prio原创 2012-07-15 13:31:05 · 1089 阅读 · 0 评论 -
Hdoj 1379 DNA Sorting
#include#include#include#include#includeusing namespace std;bool comp(const string &s1,const string &s2){ int i,j,k,m,n; int c1=0,c2=0; for(i=0;i<s1.size();i++) { for(j原创 2012-07-13 15:08:36 · 576 阅读 · 0 评论 -
hdoj1710Binary Tree Traversals
Binary Tree TraversalsTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1406 Accepted Submission(s): 655Problem DescriptionA bina原创 2012-05-19 20:58:07 · 1972 阅读 · 0 评论 -
hdoj2540
遮挡判断Time Limit: 10000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 556 Accepted Submission(s): 160Problem Description在一个广场上有一排沿着东西方向排列的石柱子，阳光原创 2012-05-19 13:40:57 · 777 阅读 · 0 评论 -
ZOJ Problem Set - 1949 Error Correction
#include#includeusing namespace std;int matrix[100][100];int SL[100];int SC[100];int main(){ //ifstream cin("acmilan.txt"); int i,j,PL,PC,CountL,CountC; int n; while(cin>>n) { if(n==0)原创 2012-07-13 15:06:48 · 477 阅读 · 0 评论