2006年03月_codestart

原创 Stripies(ZJU_1543)

#include #include #include using namespace std;void Qsort(double *a,int l,int r){ if (l >= r) return; int i = l; int j=r+1; double temp=a[l]; while(true){

2006-03-26 16:21:00 1150

原创 LC-Display(ZJU_1146)

#include using namespace std;void p(int *a,int n,int t){ int i; //----------------1-------------- for(i=0;i { cout for(int j=0;j { if(a[i]==1||a[i]==4) cout else cout } cout for(int n=0

2006-03-26 15:05:00 1387 2

原创 Ones(ZJU_1889)

#include #include using namespace std;int main(){ int a,b,i,n; while(cin>>n) { i=0; a=0; while(1) { i++; a=(a*10+1)%n; if(a==0)break; } cout }}

2006-03-26 12:36:00 941

原创 Perfect Pth Powers（ZJU_2124）

#include int main(){ double x,y,b,r; int p; while(scanf("%lf",&x)!=-1&&x) { p=0; y=x; if(x y=-x; for(b=2;b*b { r=b*b; p=2; while(r { r=r*b; p++; } if(r==y) { if(x>0||p%2)

2006-03-26 11:30:00 1329

原创 Computer Transformation(ZJU_2584)

#include char b[1000][1000];int main(){ int i,j,ttt; for(i=0;i for(j=0;j b[i][j]=#; int u=0,t=1,s=0,tt,mt,bt,nn; char ct; b[0][0]=1; for(i=1;i { u=0; mt=t; for(j=0;j { if(b[i-1][j]==#

2006-03-21 22:25:00 1602 2

原创 Function Run Fun(ZJU_1168)

#include long f[21][21][21];int w(long a,long b,long c){ if(a<=0||b<=0||c<=0) return 1; if(a>20||b>20||c>20) return w(20,20,20); if (f[a][b][c]>0) return f[a][b][c]; if(a<b&&b<c

2006-03-14 18:58:00 1204

原创 Nonoptimal Assignments(ZJU_2670)

#include #include int main(){ int ma[100][100]; ma[0][0]=0; for(int i=1;i ma[0][i]=1; ma[1][0]=1; for(int i=1;i ma[1][i]=4; for(int i=2;i for(int j=0;j ma[i][j]=1; int n; while(scanf("%d",&n)!=-

2006-03-12 20:19:00 1080

原创 Flip and Shift(ZJU_1028)

//纯粹看规律#include #include int main(){ int n,m,count,temp,jone,oone; scanf("%d",&n); while(n--) { scanf("%d",&m); count=m; jone=0; oone=0; for(int i=0;i { scanf("%d",&temp); if(temp==1) {

2006-03-10 16:57:00 1122

原创 Expanding Rods(ZJU_2370二分法)

//使用二分法解方程,测试数据过了,但提交WA.(已改正确)地址:http://acm.zju.edu.cn/show_problem.php?pid=2370#include #include int main(){ double l,c,n,ll,t,min,max,mid,y,r,h; while(scanf("%lf%lf%lf",&l,&n,&c)) { if(l==-1&&n

2006-03-10 15:46:00 1239

codestart的专栏