- 博客(41)
- 收藏
- 关注
RSS订阅原创 2003 求绝对值
#includemain(){ double a; while(scanf("%lf",&a)==1) { if(a>=0) printf("%.2f/n",a); else printf("%.2f/n",-a); } return 0;}/*#include#includeusing namespace std;int main(){ for(double a;cin>>a;)
2008-11-13 07:58:00
347
原创 2001 计算两点间的距离
#include#includemain(){ double x1,y1,x2,y2,l; while(scanf("%lf %lf %lf %lf",&x1,&y1,&x2,&y2)==4) { l=sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1)); printf("%.2f/n",l); } return 0;}
2008-11-13 07:57:00
310
原创 2002 计算球体积
#include#define PI 3.1415927double r,s;int main(){ while(scanf("%lf",&r)==1) { printf("%.3lf/n",r*r*r*PI*4/3); } return 0;}
2008-11-13 07:57:00
323
原创 2000 ASCII码排序
#include#include#include#includeusing namespace std;int main(){ for(string s;cin>>s;) { vectorv(3); for(int i=0;i { v[i]=s[i]; } sort(v.begin(),v.end()); cout } return 0;}
2008-11-13 07:56:00
366
原创 1425 sort
#include#include#includevoid sort(int *p,int n,int a){ int max,min,*q,i,temp,length,j; max=min=p[0]; for(i=1;i { if(p[i]>max) max=p[i]; else if(p[i] min=p[i]; } length=max-min+2;temp=min-1; q=(
2008-11-12 19:30:00
348
原创 1466 计算直线的交点数
#includeint main(){ int i,j,n,f[21][191]; for(i=0;i for(j=0;j f[i][j]=(j==0); for(n=2;n for(i=n-1;i>=1;i--) for(j=0;j if(f[n-i][j]==1) f[n][j+(n-i)*i]=1; while(scanf("%d",&n)!=
2008-11-12 19:30:00
385
原创 1392 Surround the Trees
#include#include#includetypedef struct{ double x; double y;}POINT;POINT result[102]; POINT a[102]; int n,top;double Distance(POINT p1,POINT p2) { return sqrt((p1.x-p2.x)*(p1.x-p2.x)+(p1.
2008-11-12 19:29:00
422
原创 1398 Square Coins
#includeusing namespace std;const int lmax=300;int c1[lmax+1],c2[lmax+1];int main(){ int n,i,j,k; while(cin>>n&&n!=0) { for(i=0;i { c1[i]=1; c2[i]=0; } for(i=2;i { for(j=0;j for(k=0;k+j
2008-11-12 19:29:00
334
2
原创 1244 Max Sum Plus Plus Plus
#include#includeint am[21]={0},ansum[1001]={0},lenam[21]={0},an[1001]={0},sum[21][1001]={0};int main( ){ int max,i,j,max_res,n,m; while(scanf("%d",&n)!=EOF&&n) { scanf("%d",&m); for(i=0;i memset(
2008-11-12 19:28:00
417
原创 1297 Children’s Queue
#include"iostream"short a[1002][500];void find(){ int i=5; int j=0; int d=0; while(i { j=1; while(j { if(a[i-1][j]+a[i-2][j]+a[i-4][j]+d>=10)
2008-11-12 19:28:00
318
原创 1170 Balloon Comes!
#includeusing namespace std;main(){ int n,a,b; char m; cin>>n; for(int i=0;i { cin>>m>>a>>b; if(m==+) cout if(m==-) cout if(m==*) cout if(m==/) { double c,d; c=a; d=b; if(a%b==0
2008-11-12 19:27:00
338
原创 1235 统计同成绩学生人数
#includeusing namespace std;main(){ int n,m,a,b; while(cin>>n&&n!=0) { m=0; int num[1000]; for(int i=1;i { cin>>a; num[i]=a; } cin>>b; for(i=1;i { if(b==num[i]) m++; } cout }}
2008-11-12 19:27:00
259
原创 1108 最小公倍数
#includeint gcd(int a,int b){ if(a { int tmp=a; a=b; b=tmp; } if(b==0) return a; else return gcd(b,a%b);}int gbs(int a,int b){ return a*b/gcd(a,b);}int main(){ int a,b; while(scanf("%d %d",&a,&b
2008-11-12 19:26:00
317
原创 1115 Lifting the Stone
#include using namespace std;struct point{ double x; double y;}p[1000001];double cross(point a,point b){ return (a.x*b.y-a.y*b.x)/2.0;}void main(){ int m,n,i; for(cin>>m;m>0;m--) { cin>>n; double s
2008-11-12 19:26:00
291
原创 1086 You can Solve a Geometry Problem too
#include#includeusing namespace std;struct point { double x; double y;};struct point p[100];struct point q[100];double cross(point w1,point w2,point w3){ return (w2.x-w1.x)*(w3.y-w1.y)-(w2.y-
2008-11-12 19:25:00
360
原创 1061 Rightmost Digit
#include#include#includeusing namespace std;void main(){ int i,j,t,x,a,n; __int64 m,k,cache[10]; for(cin>>a;a!=0;a--) { cin>>n; for(m=n%10,k=1,t=0,i=0;;i++) { x=1; k=(k*m)%10; for(j=0;
2008-11-12 19:24:00
331
原创 1071 The area
#includeusing namespace std;void main(){ int n,i; double x1,x2,x3,y1,y2,y3,size,m,a; while(cin>>n) { for(i=0;i { cin>>x1>>y1>>x2>>y2>>x3>>y3; m=(x3-x2)*(x3-x2)*(x3-x2); a=(y2-y1)/((x2-x1)*(x
2008-11-12 19:24:00
290
原创 1085 Holding Bin-Laden Captive!
#include#includeusing namespace std;const int numMax=1000;const int lmax=10000;int main(){ int num[3],kinds[3]={1,2,5}; int ca,cb,cc,total,temp,max; unsigned short c1[lmax+1]={0},c2[lmax+1]={0}; bool
2008-11-12 19:24:00
324
原创 1049 Climbing Worm
#includeusing namespace std;void main(){ float n,u,d; int t; while(cin>>n>>u>>d&&!((n==0)&&(u==0)&&(d==0))) { t=(int)((2.0*n-u-d)/(u-d)+0.5); t%2==0?cout }}
2008-11-12 19:23:00
416
原创 1050 Moving Tables
#includeusing namespace std;main(){ int t,i,j,N,P[200]; int s,d,temp,k,min; cin>>t; for(i=0;i { for(j=0;j P[j]=0; cin>>N; for(j=0;j { cin>>s>>d; s=(s-1)/2; d=(d-1)/2; if(s>d) { tem
2008-11-12 19:23:00
264
原创 1022 Train Problem I
#include#define MAXN 1000int main(){ long n,i,j,top,num2,x[MAXN],num,flag; char s1[MAXN],s2[MAXN],a[MAXN]; while(scanf("%ld",&n)==1) { scanf("%s%s",s1,s2); num2=num=0;
2008-11-12 19:22:00
216
原创 1028 Ignatius and the Princess III
#includeusing namespace std;const int lmax=120;int c1[lmax+1],c2[lmax+1];int main(){ int n,i,j,k; while(cin>>n) { for(i=0;i { c1[i]=1; c2[i]=0; } for(i=2;i { for(j=0;j for(k=0;k+j {
2008-11-12 19:22:00
361
1
原创 1040 As Easy As A+B
#include#includeusing namespace std;void sort(vector&v);void sort(vector&v){ int n=v.size(); for(int next=1;next { int temp=v[next]; for(int j=next-1;j>=0&&temp {
2008-11-12 19:22:00
210
原创 1021 Fibonacci Again
#includeusing namespace std;void doProcess(int n){ if (n%4==2)cout else cout}void main(){ long a; while (cin>>a)doProcess(a);}
2008-11-12 19:21:00
247
原创 1229 还是A+B
#includeusing namespace std;main(){ int a,b,k,n; while(cin>>a>>b>>k&&a!=0&&b!=0) { n=1; for(int i=0;i { n*=10; } if(a%n==b%n) cout else cout }}
2008-11-12 19:20:00
256
原创 1008 Elevator
#includeusing namespace std;int go(int c, int n){ if(c else return (c-n)*4+5;}void main(){ int n,cur,next,time; while(cin>>n) { if(n==0) break; time=0; cur=0; while(
2008-11-12 19:20:00
407
原创 1096 A+B for Input-Output Practice (VIII)
#includeusing namespace std;int main(){ int n; cin>>n; for(n;n--;) { int m; cin>>m; int sum=0; for(int j;m--&&cin>>j;) { sum+=j; } if(n!=0) cout if(n==0) cout } return 0;}
2008-11-12 19:19:00
279
原创 1228 A + B
#include#includeusing namespace std;char engnum[10][6]={"zero","one","two","three","four","five","six","seven","eight","nine"};main(){ char num[10]; int op1,op2; int i; while(1) { op1=0; while(1)
2008-11-12 19:19:00
415
原创 1095 A+B for Input-Output Practice (VII)
#includeusing namespace std;int main(){ for(int a,b;cin>>a>>b;) { cout cout } return 0;}
2008-11-12 19:18:00
248
原创 1092 A+B for Input-Output Practice (IV)
#includeusing namespace std;int main(){ for(int n;cin>>n&&n;) { int sum=0; for(int i;n--&&cin>>i;) { sum+=i; } cout } return 0;}
2008-11-12 19:17:00
226
原创 1093 A+B for Input-Output Practice (V)
#includeusing namespace std;int main(){ for(int N;cin>>N;) { for(int M;N--&&cin>>M;) { int sum=0; for (int i;M--&&cin>>i;) { sum+=i
2008-11-12 19:17:00
292
原创 1094 A+B for Input-Output Practice (VI)
#includeusing namespace std;int main(){ for(int N;cin>>N;) { int sum=0; for(int i;N--&&cin>>i;) { sum+=i; } cout } return 0;}
2008-11-12 19:17:00
244
原创 1090 A+B for Input-Output Practice (II)
#includeusing namespace std;int main(){ for(int n;cin>>n;) { for(int a,b;n--&&cin>>a>>b;) { cout } } return 0;}
2008-11-12 19:16:00
258
原创 1091 A+B for Input-Output Practice (III)
#includeusing namespace std;int main(){ for(int a,b;cin>>a>>b&&(a||b);) { cout } return 0;}
2008-11-12 19:16:00
317
原创 1089 A+B for Input-Output Practice (I)
#includeusing namespace std;int main(){ for(int a,b;cin>>a>>b;) { cout } return 0;}
2008-11-12 19:15:00
248
原创 1004 Let the Balloon Rise
#include#includeusing namespace std;int main(){ int n,i,j,k; string a[1000],b[100]; int s[100]; while(cin>>n&&n>0) { memset(s,0,400); i=0,k=n; while(k--) cin>>a[i++]; b[0]=a[0]; j=0; for(i=1;i
2008-11-12 19:14:00
240
原创 1005 Number Sequence
#includeusing namespace std;void main(){ int a,b,n; while((cin>>a>>b>>n)&&!((a==0)&&(b==0)&&(n==0))) { int f1=1,f2=1,f3=1,t,r[8][8]={0},i,flag=0,x; for(i=3;i { f3=(a*f2+b*f1)%7; r[f1][f2]=
2008-11-12 19:14:00
186
原创 1003 Max Sum
#includeusing namespace std;int main(){ int T,N,num,startP,endP; cin>>T; for(int k=0;k { cin>>N; int max=-1001,sum=0,temp=1; for(int i=0;i { cin>>num; sum+=num; if(sum>max) { max=sum;
2008-11-12 19:13:00
242
原创 1002 A + B Problem II
#include#include#includeusing namespace std;void add(string &,string &);int main(){ for(int n;cin>>n;) { int m=0,k=1; for(string s1,s2;n--&&cin>>s1>>s2;) { cout cout string a(1000,0); ad
2008-11-12 19:12:00
273
原创 1001 Sum Problem.
#includeusing namespace std;int main(){ for(int n;cin>>n;) { int sum=0.5*n*(1+n); cout cout } return 0;}
2008-11-12 19:11:00
274
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人