miomiomiomio-CSDN博客

原创杭电ACM第1009题——FatMouse' Trade

#include #include#includeusing namespace std;typedef struct thing{ int value; int weight; double vw;};bool cmp(thing a,thing b){ return a.vw>b.vw;}int main() { int m,n,i; double sum;

2017-03-24 13:19:15 484

原创杭电ACM第1008题——Elevator

#include #include int main() { int n,i,flag; while(scanf("%d",&n)&&n) { int *a=(int *)malloc(n*sizeof(int)); int sum=n*5; for(i=0;i<n;i++) scanf("%d",&a[i]); flag=0; for(i=0;i<n;i++)

2017-03-24 11:54:34 411

原创杭电ACM第1007题——Quoit Design

WA#include #include #include using namespace std;const int SIZE = 100005;typedef struct { double x; double y; }point;point p[SIZE], c[SIZE]/*用作辅助数组*/;double getDistance(point &a, point

2017-03-23 14:30:27 697

原创杭电ACM第1006题——Tick and Tick

#include #include /***每秒钟秒针、分针、时针的角度 s=6°/s,m=1/10°/s,h=1/120°/s*每秒钟各针之间的相对速度 s_m=59/10°/s,s_h=719/120°/s,m_h=11/120°/s*各指针差一度所需的时间 sm=10/59 s，sh=120/719 s ,mh=120/11 s*各指针差一周所需的时间 sm

2017-03-22 12:10:13 747

原创杭电ACM第1005题——Number Sequence

#include #include int main(){ int a,b,n,i; while(scanf("%d %d %d",&a,&b,&n)&&(a||b||n)){ int *f=(int *)malloc(50*sizeof(int)); f[0]=f[1]=1; for(i=2;i<n&&i<50;i++) f[i]=(a*f[i-1]+b*f[i-

2017-03-17 19:14:02 361

原创杭电ACM第1004题——Let the Balloon Rise

#include #include#include int main(){ int n,i,j,k,max,flag; while(scanf("%d",&n)&&n!=0){ char **p=(char **)malloc(n*sizeof(char *)); for(i=0;i<n;i++) p[i]=(char *)malloc(15*sizeof(char

2017-03-17 18:04:34 424

原创杭电ACM第1003题——Max Sum

#include #include int main() { int T,sum,start,end,i,j,k,r,num,s; scanf("%d",&T); for(r=1;r<=T;r++){ start=end=sum=-1001; //initialize scanf("%d",&num); //input int *a=(int *)malloc(n

2017-03-16 17:19:27 231

原创杭电ACM第1002题——A + B Problem II

#include#include#include#define MAX 1000int main(){ int t,len1,len2,len3,i,j,k,n,c; char *a=(char *)malloc(MAX*sizeof(char)); char *b=(char *)malloc(MAX*sizeof(char)); scanf("%d",&t); for(k=

2017-03-15 16:43:49 399

原创杭电ACM第1001题——Sum Problem

#includeint main(){ int i,n,sum; while(scanf("%d",&n)==1){ sum=0; for(i=1;i<=n;i++) sum+=i; printf("%d\n\n",sum); } return 0;}

2017-03-15 15:02:16 373

原创杭电ACM第1000题——A + B Problem

#include int main() { int a,b; while(scanf("%d %d",&a,&b)==2) printf("%d\n",a+b); return 0;}

2017-03-15 14:54:40 329

原创背包问题（递归算法）

#include#include#define N 100int n;int limitw,totv,maxv;int cop[N],option[N];struct bag{ int weight; int value;}a[N];void find(int k,int w,int v){ int i; if(w+a[k].weight<limitw){ cop

2016-09-24 11:22:43 5302 1

miomiomiomio的博客