判断线段是否相交
摘要:#include #include #define N 4 typedef struct { int x; int y; }node; int max(int x,int y) { return x>y?x:y; } int min(int x,int y) { return x10) m=m/10; } if((n%1000)!=0) n=n%1000; els...
阅读全文
posted @
2010-12-04 10:14
清玩儿
阅读(832)
推荐(0)
杨辉三角
摘要:#include #include int main() { int n,a[35][35],i,j,k,t,m,l; while(scanf("%d",&n)&&(n!=-1)) { if(n=35) continue; else { memset(a,0,sizeof(a)); for(i=1;i<=n;i++) { for(j=1;j<...
阅读全文
posted @
2010-11-29 19:26
清玩儿
阅读(1008)
推荐(0)