Hello,I've create a game using msn search.

TheMSsForum.com: The Microsoft Software Forum

This is a multi-part message in MIME format.
--------------040506060404000908040904
Content-Type: text/plain; charset=GB2312
Content-Transfer-Encoding: 7bit

The game is called "Msn friends":

the site is now here: http://tactoth.512j.com

hope you'll enjoy!!

1.What's the rule?

The rule for the game is quite easy,we know close friends share most
of their time.You need to find two words who "shares most of their time".

For word A and B:
If B is always present when A present,and A is always present when B
present,they are the best friends in the world,so the relation should be
100%!!

If B is always absent when A present,and A is always absent when A
present,they don't know each other at all,so the relation between them
should be 0!!

What you should do is to find the best friends in whe world!!

2. How do you know the relationship between two friends?

We do it with google!! For word A and B,first we search "A AND B" to
find the times A and B share,then we search "A OR B" to find the overall
times they appear. Then we use division to get the relation.

3.That's funny.I know the best friends in the world!!

Really? Prove you are right.



--------------040506060404000908040904
Content-Type: text/html; charset=GB2312
Content-Transfer-Encoding: 7bit

<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html>
<head>
<meta content="text/html;charset=GB2312" http-equiv="Content-Type">
</head>
<body bgcolor="#ffffff" text="#000000">
<div class="moz-text-plain" wrap="true" graphical-quote="true"
style="font-family: -moz-fixed; font-size: 16px;" lang="zh-CN">
<pre wrap="">The game is called "Msn friends":

the site is now here: <a class="moz-txt-link-freetext"
href="http://tactoth.512j.com">http://tactoth.512j.com</a>

hope you'll enjoy!!

1.What's the rule?

The rule for the game is quite easy,we know close friends share most
of their time.You need to find two words who "shares most of their time".

For word A and B:
If B is always present when A present,and A is always present when B
present,they are the best friends in the world,so the relation should be
100%!!

If B is always absent when A present,and A is always absent when A
present,they don't know each other at all,so the relation between them
should be 0!!

What you should do is to find the best friends in whe world!!

2. How do you know the relationship between two friends?

We do it with google!! For word A and B,first we search "A AND B" to
find the times A and B share,then we search "A OR B" to find the overall
times they appear. Then we use division to get the relation.

3.That's funny.I know the best friends in the world!!

Really? Prove you are right.

</pre>
</div>
</body>
</html>

--------------040506060404000908040904--
Top

Re: Hello,I've create a game using msn search. by Jonathan

Jonathan
Sun Feb 25 18:20:42 CST 2007

This is a multi-part message in MIME format.

------=_NextPart_000_0078_01C758F8.E51375E0
Content-Type: text/plain;
charset="GB2312"
Content-Transfer-Encoding: quoted-printable

Um, ok.=20

--=20

Have a nice day,

Jonathan Yaniv
Microsoft Windows Live? Butterfly Expert

Visit the ButterflySays Blog at
http://spaces.msn.com/ButterflySays/
"tactoth" <gansutongweiliu@163.com> wrote in message =
news:u8n6BLkTHHA.1200@TK2MSFTNGP04.phx.gbl...
The game is called "Msn friends":

the site is now here: http://tactoth.512j.com

hope you'll enjoy!!

1.What's the rule?

The rule for the game is quite easy,we know close friends share most
of their time.You need to find two words who "shares most of their =
time".

For word A and B:
If B is always present when A present,and A is always present when B
present,they are the best friends in the world,so the relation should be
100%!!

If B is always absent when A present,and A is always absent when A
present,they don't know each other at all,so the relation between them
should be 0!!

What you should do is to find the best friends in whe world!!

2. How do you know the relationship between two friends?

We do it with google!! For word A and B,first we search "A AND B" to
find the times A and B share,then we search "A OR B" to find the overall
times they appear. Then we use division to get the relation.

3.That's funny.I know the best friends in the world!!

Really? Prove you are right.


------=_NextPart_000_0078_01C758F8.E51375E0
Content-Type: text/html;
charset="GB2312"
Content-Transfer-Encoding: quoted-printable

<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<HTML><HEAD>
<META http-equiv=3DContent-Type content=3Dtext/html;charset=3Dgb2312>
<STYLE></STYLE>

<META content=3D"MSHTML 6.00.6000.16397" name=3DGENERATOR></HEAD>
<BODY id=3DMailContainerBody=20
style=3D"PADDING-RIGHT: 10px; PADDING-LEFT: 10px; FONT-SIZE: 10pt; =
COLOR: #000000; PADDING-TOP: 15px; FONT-FAMILY: Arial"=20
text=3D#000000 bgColor=3D#ffffff leftMargin=3D0 topMargin=3D0 =
CanvasTabStop=3D"true"=20
acc_role=3D"text" name=3D"Compose message area">
<DIV>Um, ok. </DIV>
<DIV><BR>-- <BR><BR>Have a nice day,</DIV>
<DIV>&nbsp;</DIV>
<DIV>Jonathan Yaniv<BR>Microsoft Windows Live&#8482; Butterfly =
Expert</DIV>
<DIV>&nbsp;</DIV>
<DIV>Visit the ButterflySays Blog at<BR><A=20
title=3Dhttp://spaces.msn.com/ButterflySays/=20
href=3D"http://spaces.msn.com/ButterflySays/">http://spaces.msn.com/Butte=
rflySays/</A></DIV>
<BLOCKQUOTE dir=3Dltr=20
style=3D"PADDING-RIGHT: 0px; PADDING-LEFT: 5px; MARGIN-LEFT: 5px; =
BORDER-LEFT: #000000 2px solid; MARGIN-RIGHT: 0px">
<DIV>"tactoth" &lt;<A title=3Dmailto:gansutongweiliu@163.com=20
=
href=3D"mailto:gansutongweiliu@163.com">gansutongweiliu@163.com</A>&gt; =
wrote in=20
message <A title=3Dnews:u8n6BLkTHHA.1200@TK2MSFTNGP04.phx.gbl=20
=
href=3D"news:u8n6BLkTHHA.1200@TK2MSFTNGP04.phx.gbl">news:u8n6BLkTHHA.1200=
@TK2MSFTNGP04.phx.gbl</A>...</DIV>
<DIV class=3Dmoz-text-plain lang=3Dzh-CN=20
style=3D"FONT-SIZE: 16px; FONT-FAMILY: -moz-fixed" wrap=3D"true"=20
graphical-quote=3D"true"><PRE wrap=3D"">The game is called "Msn =
friends":

the site is now here: <A class=3Dmoz-txt-link-freetext =
title=3Dhttp://tactoth.512j.com/ =
href=3D"http://tactoth.512j.com">http://tactoth.512j.com</A>

hope you'll enjoy!!

1.What's the rule?

The rule for the game is quite easy,we know close friends share most
of their time.You need to find two words who "shares most of their =
time".

For word A and B:
If B is always present when A present,and A is always present when B
present,they are the best friends in the world,so the relation should be
100%!!

If B is always absent when A present,and A is always absent when A
present,they don't know each other at all,so the relation between them
should be 0!!

What you should do is to find the best friends in whe world!!

2. How do you know the relationship between two friends?

We do it with google!! For word A and B,first we search "A AND B" to
find the times A and B share,then we search "A OR B" to find the overall
times they appear. Then we use division to get the relation.

3.That's funny.I know the best friends in the world!!

Really? Prove you are right.

</PRE></DIV></BLOCKQUOTE></BODY></HTML>

------=_NextPart_000_0078_01C758F8.E51375E0--

Top