![](https://img-blog.csdnimg.cn/20201014180756724.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
sjtu oj
文章平均质量分 62
cumtzzk6965
这个作者很懒,什么都没留下…
展开
-
sjtu oj 1002.二哥种花生
#include #include using namespace std; int a[1000][1000],b[1000]; int main() { int L,W,i,j,k,l,w,s,t,sum=0,res=0,diff; scanf("%d%d",&L,&W); for(i=0;i<L;i++) for(j=0;j<W;j++) scanf("%d",&a[i]原创 2014-02-21 22:18:06 · 847 阅读 · 0 评论 -
sjtu oj 1008.二哥买期货
#include #include using namespace std; int dayOfMonth[][13]={{0,31,28,31,30,31,30,31,31,30,31,30,31},{0,31,29,31,30,31,30,31,31,30,31,30,31}}; struct Date { int y,m,d; int leap() { return (y%4=原创 2014-02-21 22:23:11 · 1676 阅读 · 0 评论 -
sjtu oj 1022. Fib数列
#include #include using namespace std; int fi(int n) { int i,x=1,y=1,t; if(n==1||n==2) return 1; else { for(i=1;i<=n-2;i++) { t=y; y=(x+y)%2010; x=t; } return y;原创 2014-02-21 22:29:37 · 1091 阅读 · 1 评论 -
sjtu oj 1003.二哥养细菌
#include #include #include using namespace std; struct point { int x,y; point(int a,int b){x=a;y=b;} point(){}; }; int L,res=0,n0=0,n1=0,temp,c[100][100]; queue q; bool check(int x,int y) { i原创 2014-02-21 22:21:13 · 1346 阅读 · 0 评论 -
sjtu oj 1036. 二哥去取钱
#include #include using namespace std; int a[100000]; long long s[3]={0},sum[3]={0}; int minIndex() { int t=(sum[1]<=sum[2]?1:2); t=(sum[0]<=sum[t]?0:t); return t; } long long max(long long a,lo原创 2014-02-21 22:45:30 · 1462 阅读 · 0 评论