![](https://img-blog.csdnimg.cn/20201014180756780.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
HDUOJ
Rukawa_Kaede
这个作者很懒,什么都没留下…
展开
-
1006 tick and tick
1006 tick and tick #include #include using namespace std; const double w_h=1.0/120,w_m=1.0/10,w_s=6.0; const double hm=11.0/120,hs=719.0/120,sm=59.0/10; const double T_hm=43200.0/11,T_hs=43200.原创 2015-08-11 16:55:22 · 260 阅读 · 1 评论 -
1003 max sum
1003 max sum #include #include #define MAXN 100005 int a[MAXN]; int sum; int ans[MAXN]; int loc[MAXN][2]; int main() { int T,t,n,i,p,q,tp,sum,max1; scanf("%d",&T); // printf("%d= ",T)原创 2015-08-11 16:47:15 · 267 阅读 · 0 评论 -
1001 sum problem
1001 sum problem #include #include int main() { int a,i; int sum; while(~scanf("%d",&a)) { sum=0; for(i=1;i<=a;i++) { sum+=i; }原创 2015-08-11 16:44:36 · 261 阅读 · 0 评论 -
1005 Number Sequence
1005 Number Sequence #include #include using namespace std; int A,B; vector vec; bool flag[7][7]; void init(){ int i,j; for(i=0;i<7;i++) { for(j=0;j<7;j++) {原创 2015-08-11 16:53:32 · 262 阅读 · 0 评论 -
1002 A+B II
1002 A+B II #include #include #include #define MAXN 1005 char a[25][MAXN]; char b[25][MAXN]; int da[MAXN]; int db[MAXN]; int dc[MAXN]; int dest[25][MAXN]; int main() { int T,t; int i,j,k,n原创 2015-08-11 16:46:06 · 234 阅读 · 0 评论 -
1000 A+BI
1000 A+BI #include #include int main() { int a,b; while(~scanf("%d %d",&a,&b)) { printf("%d\n",a+b); } return 0; }原创 2015-08-11 16:42:06 · 446 阅读 · 0 评论 -
1004 let the balloon rise
1004 let the balloon rise #include #include #include #define MAXN 1005 int main() { char color[26]; int N,i,j,k; char colors[1005][26]; int index[1005]; int maxind,maxtemp;原创 2015-08-11 16:48:25 · 237 阅读 · 0 评论