d*i
发帖数: 9453 | 1 ☆─────────────────────────────────────☆
anyfun (anyfun?) 于 (Fri Mar 21 02:36:16 2008) 提到:
腹部脂肪增多，坐下的时候像小丘，最近每天跑椭圆机一个小时，摸着腹部变硬了，但
是效果还是不大。
乘着放春假，打算去除腹部脂肪。plan如下：
周六， 10点爬山，11点半到家，中午只吃苹果和酸奶
休息一小时，1点半去体育馆椭圆机跑步一小时，
休息一小时后，再跑一小时（待定，此项看体力）。
周日重复。
大家觉得这个可行吗？谢谢。
☆─────────────────────────────────────☆
dai (凄凉宝剑篇！·人生不外悲欢离合爱恨情仇) 于 (Fri Mar 21 07:43:18 2008) 提到:
要减腹部脂肪，怎么也得几个月吧？你这个“最近”是多近？
放假出去锻炼是不错的，不过要靠这两天减小肚子没戏，
要改变生活习惯，少坐多动，否则每天gym其实也还是不能长久解决问题。
☆─────────────────────────────────────☆
mar |
|
a****n
发帖数: 20 | 2 【 以下文字转载自 JobHunting 讨论区 】
发信人: anyfun (anyfun?), 信区: JobHunting
标 题: A question about computer networking
发信站: BBS 未名空间站 (Tue Sep 23 00:26:37 2008)
You normally can not access University library databases if you are outside
using a non-school ip. However, you can use vpn and then access the
databases.
Explain the details of how it works? What is the ip address school library
sees? Use any diagram if needed. |
|
a****n
发帖数: 20 | 3 【 以下文字转载自 JobHunting 讨论区 】
发信人: anyfun (anyfun?), 信区: JobHunting
标 题: A question about computer networking
发信站: BBS 未名空间站 (Tue Sep 23 00:26:37 2008)
You normally can not access University library databases if you are outside
using a non-school ip. However, you can use vpn and then access the
databases.
Explain the details of how it works? What is the ip address school library
sees? Use any diagram if needed. |
|
a****n
发帖数: 20 | 4 【 以下文字转载自 JobHunting 讨论区 】
发信人: anyfun (anyfun?), 信区: JobHunting
标 题: A question about computer networking
发信站: BBS 未名空间站 (Tue Sep 23 00:26:37 2008)
You normally can not access University library databases if you are outside
using a non-school ip. However, you can use vpn and then access the
databases.
Explain the details of how it works? What is the ip address school library
sees? Use any diagram if needed. |
|
B*********h
发帖数: 800 | 5 ☆─────────────────────────────────────☆
anyfun (anyfun?) 于 (Sat Jan 20 21:46:28 2007) 提到:
find an algorithm for finding the min and max of n numbers by using fewer
than 3n/2 comparisions. ^_^
☆─────────────────────────────────────☆
newnewlife (newlife) 于 (Sat Jan 20 22:04:47 2007) 提到:
Let's try this way:
int max,min;
min=max=a[0];
int minIndex=0,maxIndex=0;
for(int i=1; i < n;i+=2)
{
int bigger=a[i-1],smaller=a[i];
int biggerIndex=i-1, smallerIndex=i;
if(a[i-1] < a[i])
bi |
|
