博文
有点失落!(2006-05-04 16:50:00)
摘要：灰灰的天,有点闷热.
斟酌已久的观点,被别人想都不想一口否决了,你又能怎样?
昔日辛勤培育的"花儿",不经意间被自己践踏!
以往努力奋斗,终于小成,如今却感觉空空如也....
明明很"爱",如今却是有点不以为意,甚至"厌恶!"
很喜欢听音乐........猛然间却觉得 无聊之极!
很象保守的人为何有着张扬的个性!
..................................
是我做的不够吗?
也许这就是生活吧....
......
原来是系统保留字啊!(2006-05-01 10:17:00)
摘要：执行搜索操作,当?area(文本) 时达到预期
但表单中包含. year,month,day等变量时,一提交,便很郁闷.
服务器貌似死机. cpu 占用90% iwam 过载 很象个死循环.
过了两天 ,闲了 再拿来看 仍然这样,不爽, 便找了个 "高手", 问问,开始怀疑是语法错误,
但没结果显示(已死机).只能结束并让我不要急!
后来无奈之下,换了所有的变量名. 切!!!!! 过了.
彻悟. 原来 year,month,day. 是系统保留字.
"高手"的 --"对头!" 让我甚感心慰! 真佩服"某人"的智慧!
......
站内短信终于搞定了!(2006-05-01 10:06:00)
摘要：求人不如求自己.还在 csdn上傻等了半天,希望哪位老大能赏点源码. 愣是没人回应,
最终还是花了一个晚上才搞定.
其实很简单 只用了一个文件 : message.asp
包含 5个action(write,send,del,default,trace)
数据表: msg (id ,from ,to , fromdel ,todel,time,read,tittle,context...............)
核心代码如下:
A. write
<table align="center" width="60%"><tr></tr><tr></tr>
<form action="message.asp?action=send" method="post" > <tr> <td>发送给:</td> <td valign="left"> <input name="to" type="text" value=<% response.write(user)%> /> </td> </tr> <tr> <td>内容:</td> <td valign="left" colspan="10"> <textarea name="context" cols="80" rows="10"></textarea> </td> </tr> <tr>&......
求树(森林)的高度(2006-04-29 11:07:00)
摘要：
简明算法:
int heigth(tree t)
{
if(t==NULL) return 0;
else return max(heigth(t->fistson)+1,heigth(t->nextbrother));
}......
classical programme(2006-04-29 10:32:00)
摘要：Dear all: result love(boy, girl) {- if ( boy.有房() and boy.有车() ) {- boy.set(nothing); return girl.嫁给(boy); } if ( girl.愿意等() ) {- while( ! (boy.赚钱 ＞ 100,000 and girl.感情 ＞ 8 ) {- for ( day=1; day ＜=365; day++) {- if ( day == 情人节 ) if ( boy.givegirl(玫瑰) ) girl.感情++; else girl.感情--; if( day == girl.生日) if ( boy.givegirl(玫瑰) ) girl.感情++; else girl.感情--; boy.拼命赚钱(); } } if ( boy.有房() and boy.有车() ) {- boy.set(nothing); return girl.嫁给(boy); } 年龄++; girl.感情--; } return girl.goto( another_boy); <----> ......
计算几何算法实现-任意多边形的面积(2006-04-27 21:21:00)
摘要：//time: 4.27 night
description:
AREA
Jerry, a middle school student, addicts himself to mathematical research. Maybe the problems he has thought are really too easy to an expert. But as an amateur, especially as a 15-year-old boy, he had done very well. He is so rolling in thinking the mathematical problem that he is easily to try to solve every problem he met in a mathematical way. One day, he found a piece of paper on the desk. His younger sister, Mary, a four-year-old girl, had drawn some lines. But those lines formed a special kind of concave polygon by accident as Fig. 1 shows.
Fig. 1 The lines his sister had drawn
"Great!" he thought, "The polygon seems so regular. I had just learned how to calculate the area of triangle, rectangle and circle. I'm sure I can find out how to calculate the area of this figure." And so he did. First of all, he marked the vertexes in the polygon with their coordinates as Fig. 2 shows. And then he found the result--0.75 effortless.
......
常微分方程数值解法 之 改进欧拉方法(2006-04-23 10:40:00)
摘要：// 改进欧拉方法 比常规欧拉方法 和梯形公式具有更高精度,也称为预测-校正算法
//时间 4.23 上午
// f(x,y)=x-2*x/y
// y(0)=1
#include"stdio.h"#include"iostream"#include"conio.h"
using namespace std;
double x0,x1,y0,y1;
class mend_euler{ public: mend_euler(double h,int n); double f(double x,double y); private: double h; int n; };
mend_euler::mend_euler(double a,int b){ int i=1; h=a; n=b; ......
别以为我很笨!(2006-04-20 11:09:00)
摘要：昨天 做了智商测试,第一个 测了 120 花了20分钟了,
第二个10 分钟 118
第三个 10秒 100分 三个不同的题目.
日了!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!......
guass-seidel算法程序实例(2006-04-20 10:31:00)
摘要：//完成 时间:4.17 晚 7点
#include"stdio.h"#include"iostream"#include"conio.h"#include"math.h"
using namespace std;
int n; // GUASSµü´úµÄ¹æÄ£ double e; double a[4][4]={{0,0,0,0},{0,10,-1,-2},{0,-1,10,-2},{0,-1,-1,5}}; double b[4]={0,7.2,8.3,4.2}; double x[4]; double y[4];
double max(){ double s=0.0000000000; for(int i=1;i<=3;i++) if(fabs(x[i]-y[i])>s)s=fabs(x[i]-y[i]); return s;}
void display(){ cout<<endl; for(......
guass消去求线性方程的根(2006-04-19 10:34:00)
摘要：//目标 用高斯消去法求线性方程的根
//C++实现
#include"stdio.h"#include"iostream"#include"conio.h"
using namespace std;
class guass{ public: guass(int n,double t); void begin(); void display(); int n; // GUASS迭代的规模 double e; double a[4][4]; double b[4];};
guass::guass(int m,double t){ n=m; e=t;&......