最新 最热

hdu1089

#include<iostream> using namespace std; int main() { int n,m,s; while(cin>>n>>m) { s=n+m; cout<<s<<endl; } return 0; }

2018-06-04
1

hdu1090

#include<iostream>using namespace std;int main(){ int n; cin>>n; while(n--){ int a,b; cin>>a>>b; cout<<a+b<<endl; } ...

2018-06-04
1

hdu1091

#include<stdio.h>int main(){ int a,b; while(scanf("%d%d",&a,&b)==2) { if(a==0&&b==0) break; else printf("%dn",a+b); ...

2018-06-04
1

hdu1092

#include <iostream> using namespace std; int main() { int n,a,sum=0; while(cin>>n&&n!=0) { while (n--) { ci...

2018-06-04
1

hdu1093

#include <iostream> using namespace std; int main() { int n,m,a,sum=0; while(cin>>n) { while (n--) { ci...

2018-06-04
1

hdu1077

#include<iostream> #include<cmath> using namespace std; struct Point { double x,y; }; double dis_sq(const Point& a,const Point& b) //距离平方 ...

2018-06-04
1

hdu1081

#include<iostream> using namespace std; int GetMaxNum(int a[],int n) //求最大字段和 { int i,sum=0,maxsum=0; maxsum|=1<<31; for(i=1;i<=n;i+...

2018-06-04
1

hdu1059

#include <stdio.h> #include <string.h> #define MAXN 120005 int main() { int num[7]; int T = 0; while (scanf("%d %d %d %d %d %d", &num...

2018-06-04
1

hdu1049

#include<stdio.h>int main(){ int n,u,d; while(scanf("%d%d%d",&n,&u,&d),n) { int t=(n-u)/(u-d); if(t*(u-d)<(n-u)) t++; t*=2...

2018-06-04
1

hdu1051

#include<iostream>  #include<algorithm>  using namespace std;  struct SIZE  {      int l;      int w;  }sticks[5005];  int flag[5005];  bool cmp(const ...

2018-06-04
1