
YMS
文章平均质量分 70
CM_yali
其实我什么都不知道
展开
-
YMS Round #1 Div. 2 A Promotion Counting
#include #include int main(){ int x1,y1,x2,y2,x3,y3,x4,y4,s1,s2,s3; scanf("%d%d%d%d%d%d%d%d",&x1,&y1,&x2,&y2,&x3,&y3,&x4,&y4); s3=y4-x4; s2=y3-x3+y4-x4; s1=y2-x2+y4-x4+y3-x3;原创 2016-03-20 10:46:24 · 310 阅读 · 0 评论 -
YMS Round #1 Div. 2 C Mowing the Field
#include #include int a[4010][4010],n,d2[110],time[4010][4010],ans=2147483647;char d1[110];int main(){ int i,j,k,m,p=1000,q=1000,t=0; scanf("%d",&n); getchar(); for(i=1;i<=n;i++){原创 2016-03-20 10:53:17 · 356 阅读 · 0 评论 -
YMS Round #1 Div. 2 B Angry Cows
转自:http://218.77.114.14:8085/JudgeOnline/showsource.php?id=6013#include #include #include #include #include using namespace std; int a[10010],b[10010]; int main(){ int i,j,k,m,n; sc转载 2016-03-20 10:49:26 · 2152 阅读 · 0 评论 -
YMS Round #1 Div. 2 D Subsequences Summing to Sevens
转自:http://218.77.114.14:8085/JudgeOnline/showsource.php?id=6087#include #include #include #include #include using namespace std; int a[50010],b[50010]; int main(){ int i,j,k,m,n; in转载 2016-03-20 10:55:45 · 303 阅读 · 0 评论