742
社区成员
发帖
与我相关
我的任务
分享大家有什么好的建议？
最近VB各版人气大降，提问者越来越少，哪出了问题？大斑竹们午夜都还在帮大家解决问题，许多热心的朋友翘首等待各种挑战。僧多粥少，大家有什么好的建议？
...全文
请发表友善的回复…
发表回复
xyjdn 2006-05-26
- 打赏
- 举报
大厦将倾，独木难支！
如果楼主真的想知道其中的原因，可以看看其他论坛的vb版的状况，如果大家都在下降，就是vb无可挽回的在走下坡路了，如果只是csdn的vb版下降，那想想办法还是能挽回的。
gddd 2006-05-05
- 打赏
- 举报
CSDN的问题解决应该改版.改成免费区和收费区.
运作方式:
免费区即现在状态,不用变.
收费区由提问者提出要求和相应的人民币金额.由各位想赚钱的程序员去解答.
在提问者得到最满意的答案时,向CSDN版主付费.CSDN版主作为中介,收取约5到30%的提成.
各位想赚钱的程序员提交解决方案给CSDN版主,由CSDN版主选择和补充.根据补充的多少得到相应的5到30%之间的数字.其它的提成,则由CSDN版主引用的解答者中按比例分成.
CSDN的公司和CSDN版主的版主,按20和80的分成计算,公司得20.
提问者和回答者还有相关的CSDN,要签一份网上的保密协议.
运作方式:
免费区即现在状态,不用变.
收费区由提问者提出要求和相应的人民币金额.由各位想赚钱的程序员去解答.
在提问者得到最满意的答案时,向CSDN版主付费.CSDN版主作为中介,收取约5到30%的提成.
各位想赚钱的程序员提交解决方案给CSDN版主,由CSDN版主选择和补充.根据补充的多少得到相应的5到30%之间的数字.其它的提成,则由CSDN版主引用的解答者中按比例分成.
CSDN的公司和CSDN版主的版主,按20和80的分成计算,公司得20.
提问者和回答者还有相关的CSDN,要签一份网上的保密协议.
acev 2006-03-29
- 打赏
- 举报
关于这个问题,我们还是任其自然吧.
如果,能在VB开设一个帮助大家转型,转到vb.net的版块,如何?
Behard 2006-01-21
- 打赏
- 举报
我要在水园中加星！
ljk02079 2006-01-04
- 打赏
- 举报
只是一门工具而已 学什么都一样 什么学好了都一样 什么学不好也都一样
高手 一草一木皆可伤人 庸人玩弄宝刀宝剑会自伤
高手 一草一木皆可伤人 庸人玩弄宝刀宝剑会自伤
wxrwan 2006-01-04
- 打赏
- 举报
我准备从C++学起
Summer006 2006-01-04
- 打赏
- 举报
还好没去那个啥google赛。去了也丢脸。。。
天下无不散之筵席，vb6坚持了这么久，算是不错了。
我要陪vb6走完最后一程，不过要是我先走了vb6还没走怎么办？
天下无不散之筵席，vb6坚持了这么久，算是不错了。
我要陪vb6走完最后一程，不过要是我先走了vb6还没走怎么办？
panl82 2006-01-04
- 打赏
- 举报
坚持vb6
weiweiplay 2005-12-21
- 打赏
- 举报
唉，是啊，VB越来越没人用了，我在准备转JAVA了
fengfan2008 2005-12-21
- 打赏
- 举报
现在使用VB的人越来越少了，可能这也是一个原因吧！
aiur2000 2005-12-20
- 打赏
- 举报
以前看狼好象数学就很好，真可惜啊
zq102605 2005-12-20
- 打赏
- 举报
我要抓紧时间学C#了
province_ 2005-12-19
- 打赏
- 举报
VB的地位在大众心目里确实不怎么样，也不是我们能改变的，桑塔纳就是出到10000型也还是远不如BMW，思维定势决定的。
至于算法那其实是无关语言什么事的，有不少程序员连这也理解不了，更何况对此毫无了解的普通大众了。
至于算法那其实是无关语言什么事的，有不少程序员连这也理解不了，更何况对此毫无了解的普通大众了。
daisy8675 2005-12-19
- 打赏
- 举报
vbnet是面象对象了，有它的优势，哈哈，原来google把你也淘汰了，呵呵
YP不要去招聘会，没必要去。
YP不要去招聘会，没必要去。
bbhere 2005-12-19
- 打赏
- 举报
现在用vb的少了，有人上来问问题，回答得人好，得不到很好的解答，以后就不来了，人就更少了，恶性循环。
而且很多原来的人也转到别的板块了
而且很多原来的人也转到别的板块了
zyg0 2005-12-18
- 打赏
- 举报
呵呵,人气是很差,昨天去招聘会,大家看到我用vb都用异样的眼神看我,呵呵
数据结构我是不行,你那道方程我现在用算术都不会了 帮顶吧
数据结构我是不行,你那道方程我现在用算术都不会了 帮顶吧
northwolves 2005-12-18
- 打赏
- 举报
前些天报名参加GOOGLE，第一题很简单，虽然5分钟就做出来了，但现学VB.NET ，半小时也没调试过去，确实有些恼火。最后被无情地淘汰。是否大家学VB的信心跟我一样，受到打击了？
----------------------------------------
http://blog.csdn.net/northwolves/archive/2005/12/12/550613.aspx
关于不定方程整数解的个数的求法
题目：
整数数列 {xn} ∈[0,max] , 且 ∑xi=sum, 则这样的序列共有多少个？
方法：递归
Function resultcount(ByVal n As Integer, ByVal max As Integer, ByVal sum As Integer) As Integer
If n * max < sum Then resultcount = 0: Exit Function
If n = 1 Then resultcount = 1
If sum = 1 Then resultcount = n
If n > 1 Then
Dim i As Integer, temp As Integer
temp = 0
For i = 0 To max
temp = temp + resultcount(n - 1, max, sum - i)
Next
resultcount = temp
End If
End Function
----------------------------------------
http://blog.csdn.net/northwolves/archive/2005/12/12/550613.aspx
关于不定方程整数解的个数的求法
题目：
整数数列 {xn} ∈[0,max] , 且 ∑xi=sum, 则这样的序列共有多少个？
方法：递归
Function resultcount(ByVal n As Integer, ByVal max As Integer, ByVal sum As Integer) As Integer
If n * max < sum Then resultcount = 0: Exit Function
If n = 1 Then resultcount = 1
If sum = 1 Then resultcount = n
If n > 1 Then
Dim i As Integer, temp As Integer
temp = 0
For i = 0 To max
temp = temp + resultcount(n - 1, max, sum - i)
Next
resultcount = temp
End If
End Function
RUKYO 2005-12-18
- 打赏
- 举报
一门语言也有它的生命周期 ：)
Mr_Yang 2005-12-18
- 打赏
- 举报
up
northwolves 2005-12-18
- 打赏
- 举报
To province_(雍昊)
这题和那个猴子吃桃问题（每天吃0到Y个，X天吃完N个桃,Y<=N）是同样道理。
-----------------------------------
不错,并不是很难.我在这里也不是为了讨论这个问题,只是慨叹VB的地位.
至于竞赛题,感兴趣的朋友可以看看,原题如下:
Question:
Problem Statement
You have several identical balls that you wish to place in several baskets. Each basket has the same maximum capacity. You are given an int baskets, the number of baskets you have. You are given an int capacity, the maximum capacity of each basket. Finally you are given an int balls, the number of balls to sort into baskets. Return the number of ways you can divide the balls into baskets. If this cannot be done without exceeding the capacity of the baskets, return 0.
Each basket is distinct, but all balls are identical. Thus, if you have two balls to place into two baskets, you could have (0, 2), (1, 1), or (2, 0), so there would be three ways to do this.
Definition
Class:
FillBaskets
Method:
countWays
Parameters:
int, int, int
Returns:
int
Method signature:
int countWays(int baskets, int capacity, int balls)
(be sure your method is public)
Constraints
-
baskets will be between 1 and 5, inclusive.
-
capacity will be between 1 and 20, inclusive.
-
balls will be between 1 and 100, inclusive.
Examples：
0)
2
20
2
Returns: 3
The example from the problem statement.
1)
3
20
1
Returns: 3
We have only 1 ball, so we must choose which of the three baskets to place it in.
2)
3
20
2
Returns: 6
We can place both balls in the same basket (3 ways to do this), or one ball in each of two baskets (3 ways to do this).
3)
1
5
10
Returns: 0
We have more balls than our basket can hold.
4)
4
5
10
Returns: 146
This problem statement is the exclusive and proprietary property of TopCoder, Inc. Any unauthorized use or reproduction of this information without the prior written consent of TopCoder, Inc. is strictly prohibited. (c)2003, TopCoder, Inc. All rights reserved.
这题和那个猴子吃桃问题（每天吃0到Y个，X天吃完N个桃,Y<=N）是同样道理。
-----------------------------------
不错,并不是很难.我在这里也不是为了讨论这个问题,只是慨叹VB的地位.
至于竞赛题,感兴趣的朋友可以看看,原题如下:
Question:
Problem Statement
You have several identical balls that you wish to place in several baskets. Each basket has the same maximum capacity. You are given an int baskets, the number of baskets you have. You are given an int capacity, the maximum capacity of each basket. Finally you are given an int balls, the number of balls to sort into baskets. Return the number of ways you can divide the balls into baskets. If this cannot be done without exceeding the capacity of the baskets, return 0.
Each basket is distinct, but all balls are identical. Thus, if you have two balls to place into two baskets, you could have (0, 2), (1, 1), or (2, 0), so there would be three ways to do this.
Definition
Class:
FillBaskets
Method:
countWays
Parameters:
int, int, int
Returns:
int
Method signature:
int countWays(int baskets, int capacity, int balls)
(be sure your method is public)
Constraints
-
baskets will be between 1 and 5, inclusive.
-
capacity will be between 1 and 20, inclusive.
-
balls will be between 1 and 100, inclusive.
Examples：
0)
2
20
2
Returns: 3
The example from the problem statement.
1)
3
20
1
Returns: 3
We have only 1 ball, so we must choose which of the three baskets to place it in.
2)
3
20
2
Returns: 6
We can place both balls in the same basket (3 ways to do this), or one ball in each of two baskets (3 ways to do this).
3)
1
5
10
Returns: 0
We have more balls than our basket can hold.
4)
4
5
10
Returns: 146
This problem statement is the exclusive and proprietary property of TopCoder, Inc. Any unauthorized use or reproduction of this information without the prior written consent of TopCoder, Inc. is strictly prohibited. (c)2003, TopCoder, Inc. All rights reserved.
加载更多回复（4）
