| 導購 | 订阅 | 在线投稿
分享
 
 
當前位置: 王朝網路 >> c/c++ >> 讀取英文單詞,按順序排列(C++學習題目)
 

讀取英文單詞,按順序排列(C++學習題目)

2006-01-09 11:13:17  編輯來源:互聯網  简体版  手機版  評論  字體: ||
 
 
  讀取英文單詞,按順序排列(C++學習題目)

  題目:

  1. Implement a function that counting word frequency. It reads an English article from an user-specified txt file(article.txt) and counts their number. Those exclusive words should not be counted. Output the words and counts to 2 files. One(3_1_1out.txt) is in lexicographic order, and the other (3_1_2out.txt) is in descending frequency order.

  – Exclusive words:

  – Using map

  代碼:

  #pragma warning(disable:4786)

  #include <string>

  #include <iostream>

  #include <fstream>

  #include <functional>

  #include <algorithm>

  #include <vector>

  #include <map>

  #include <set>

  using namespace std;

  typedef map<string, int>::value_type sival_type;

  vector<string> *retrieve_text(string file_name)

  {

   ifstream artcile_file( file_name.c_str(), ios::in );

   if (!artcile_file) {

   cout << "Conn't open " << file_name.c_str() << " !" << endl;

   exit (1);

   }

   vector<string> *lines_of_text = new vector<string>;

   string textline;

   while ( getline(artcile_file, textline, '\n'))

   {

   //cout << " " << textline << '\n';

   lines_of_text->push_back(textline);

   }

   return lines_of_text;

  }

  void strip_caps( vector<string> *text_file )

  {

   string caps( "ABCDEFGHIJKLMNOPQRSTUVWXYZ" );

  

   vector<string>::iterator iter = text_file->begin();

   for ( ; iter != text_file->end(); ++iter )

   {

   string::size_type pos = 0;

   while ( (pos = (*iter).find_first_of( caps, pos ))

   != string::npos )

   {

   (*iter)[ pos ] = tolower( (*iter)[pos] );

   }

   } //end of for

  }

  vector<string> *separate_words( const vector<string> *text_file )

  {

   string filter("abcdefghijklmnopqrstuvwxy");

  

   //包含獨立的單詞集合

   vector<string> *words = new vector<string>;

  

   short line_pos = 0;

   for ( ; line_pos <text_file->size(); ++line_pos )

   {

   string textline = (*text_file)[line_pos];

  

   // 用來遍曆所有的字母

   string::size_type pos = 0;

   // 單詞的開始位置

   string::size_type prev_pos = textline.find_first_of(filter);

   // 單詞末尾的下一空格位置

   string::size_type temp_pos = textline.find_first_of(filter);

  

   // 一個小開關,其值爲TURE時,prev_pos指向單詞開始的位置

   bool onoff = false;

  

   while ( (pos = textline.find_first_of(filter, pos))

   != string::npos )

   {

   if ( onoff )

   {

   prev_pos = temp_pos - 1;

   // 將onoff值改爲false,使單詞開始的位置不會改變

   onoff = false;

   }

  

   ++pos;

  

   if ( (pos - temp_pos) != 1 )

   {

   // 爲下一次的賦值做准備

   onoff = true;

   // 將分離出的單詞輸入words

   words->push_back(

   textline.substr( prev_pos, temp_pos - prev_pos ));

   }

  

   temp_pos = pos;

   } // end of while

  

   // 輸入最後一個單詞,除非這一段沒有找到任何字母

   if ( prev_pos != string::npos )

   {

   words->push_back(

   textline.substr( prev_pos, temp_pos - prev_pos ));

   }

   } // end of for

  

   return words;

  }

  map< string, int > *appear_total( const vector<string> *words )

  {

   // 創建單詞排除集合

   set<string> exclusion_set;

   ifstream exclusion_file( "pkg95.txt", ios::in );

   if (!exclusion_file) {

   cout << "Conn't open pkg95.txt !" << endl;

   exit (1);

   }

   string textline;

   while ( getline(exclusion_file, textline, '\n'))

   {

   //cout << " " << textline << '\n';

   exclusion_set.insert(textline);

   }

   map<string, int> *word_map = new map<string, int>;

  

   // 開始向word_map中記錄數據

   vector<string>::const_iterator iter = words->begin();

   for ( ; iter != words->end(); ++iter )

   {

   // 如果少于3個字符或在排除集合中存在,則不輸入到map中

   if ( (*iter).size() < 3 || exclusion_set.count( *iter ) )

   {

   continue;

   }

  

   // 如果count()返回0,則單詞不存在,加入它

   if ( !word_map->count(*iter) )

   {

   word_map->insert( sival_type( (*iter), 1 ) );

   }

   else

   {

   //將單詞的出現次數加1

   (*word_map)[ (*iter) ] += 1;

   }

   } //end of for

  

   return word_map;

  }

  multimap< int, string, greater<int> > * multimap_total( map<string, int> *text_map )

  {

   multimap<int, string, greater<int> > *word_map =

   new multimap< int, string, greater<int> >;

   map< string, int >::iterator map_siter = text_map->begin();

   for ( ; map_siter != text_map->end(); ++map_siter )

   {

   word_map->insert(make_pair((*map_siter).second, (*map_siter).first));

   }

   {

   string ofile("3_1_2out.txt");

  

   ofstream outfile( ofile.c_str() );

   if (!outfile)

   {

   cerr << "error: unable to open output file: "

   << ofile << endl;

   }

  

   multimap< int, string, greater<int> >::iterator map_siter = word_map->begin();

  

   for ( ; map_siter != word_map->end(); ++map_siter )

   {

   outfile << (*map_siter).second;

  

   for ( int n = 0; n < 15 - (*map_siter).second.size(); ++n )

   {

   outfile << ' ';

   }

  

   outfile << "出現 " << (*map_siter).first << "\t次" << endl;

   } // end of for

  

   cout << "程序已將處理結果寫入3_1_2out.txt,該文件保存在當前目錄"

   << endl;

   }

   return word_map;

  }

  void map_output( map<string, int> *text_map )

  {

   string ofile("3_1_1out.txt");

  

   ofstream outfile( ofile.c_str() );

   if (!outfile)

   {

   cerr << "error: unable to open output file: "

   << ofile << endl;

   }

  

   map< string, int >::iterator map_siter = text_map->begin();

   for ( ; map_siter != text_map->end(); ++map_siter )

   {

   outfile << (*map_siter).first;

  

   for ( int n = 0; n < 15 - (*map_siter).first.size(); ++n )

   {

   outfile << ' ';

   }

  

   outfile << "出現 " << (*map_siter).second << "\t次" << endl;

   } // end of for

  

   cout << "程序已將處理結果寫入3_1_1out.txt,該文件保存在當前目錄"

   << endl;

  }

  int main()

  {

  

   vector<string> *text_file = retrieve_text("article.txt");

   strip_caps(text_file);

   vector<string> *words = separate_words(text_file);

   map< string, int > *text_map = appear_total(words);

   map_output( text_map );

   multimap_total(text_map);

  

   return 0;

  }

  程序執行結果

  3_1_1out.txt

  article 出現 2 次

  counted 出現 1 次

  counting 出現 1 次

  counts 出現 2 次

  descending 出現 1 次

  english 出現 1 次

  exclusive 出現 1 次

  file 出現 1 次

  files 出現 1 次

  frequency 出現 2 次

  function 出現 1 次

  implement 出現 1 次

  lexicographic 出現 1 次

  output 出現 1 次

  reads 出現 1 次

  specified 出現 1 次

  txt 出現 4 次

  user 出現 1 次

  word 出現 1 次

  words 出現 2 次

  3_1_2out.txt

  txt 出現 4 次

  article 出現 2 次

  counts 出現 2 次

  frequency 出現 2 次

  words 出現 2 次

  counted 出現 1 次

  counting 出現 1 次

  descending 出現 1 次

  english 出現 1 次

  exclusive 出現 1 次

  file 出現 1 次

  files 出現 1 次

  function 出現 1 次

  implement 出現 1 次

  lexicographic 出現 1 次

  output 出現 1 次

  reads 出現 1 次

  specified 出現 1 次

  user 出現 1 次

  word 出現 1 次

  附PKG95.TXT 文件內容:

  different

  necessary

  need

  needed

  needing

  newest

  next

  no

  nobody

  non

  none

  not

  nothing

  now

  nowhere

  of

  off

  often

  new

  old

  older

  oldest

  on

  once

  one

  only

  open

  again

  among

  already

  about

  above

  against

  alone

  after

  also

  although

  along

  always

  an

  across

  and

  another

  ask

  asking

  asks

  backed

  away

  should

  show

  came

  all

  almost

  before

  began

  back

  backing

  be

  became

  because

  becomes

  been

  at

  behind

  being

  best

  better

  between

  big

  showed

  ended

  ending

  both

  but

  by

  asked

  backs

  can

  cannot

  number

  numbers

  case

  few

  find

  finds

  cases

  clearly

  her

  herself

  come

  could

  did

  here

  beings

  fact

  far

  felt

  become

  first

  for

  four

  from

  full

  fully

  furthers

  gave

  general

  generally

  get

  gets

  gives

  facts

  go

  going

  good

  goods

  certain

  certainly

  clear

  great

  greater

  greatest

  group

  grouped

  grouping

  groups

  got

  has

  have

  having

  he

  further

  furthered

  had

  furthering

  itself

  faces

  highest

  him

  himself

  his

  how

  however

  if

  important

  interests

  into

  is

  it

  its

  anyone

  anything

  anywhere

  are

  area

  areas

  around

  as

  seconds

  see

  seem

  seemed

  seeming

  seems

  sees

  right

  several

  shall

  she

  enough

  even

  evenly

  over

  part

  parted

  parting

  parts

  per

  down

  place

  places

  point

  pointed

  pointing

  points

  possible

  present

  presented

  presenting

  ends

  high

  mrs

  much

  must

  my

  myself

  presents

  down

  problem

  problems

  put

  puts

  quite

  will

  with

  within

  rather

  really

  room

  rooms

  said

  same

  right

  showing

  shows

  side

  sides

  since

  small

  smaller

  smallest

  so

  some

  somebody

  someone

  something

  somewhere

  state

  states

  such

  sure

  take

  taken

  than

  that

  the

  their

  then

  there

  therefore

  these

  thought

  thoughts

  three

  through

  thus

  to

  today

  together

  too

  took

  toward

  turn

  turned

  turning

  turns

  two

  still

  under

  until

  up

  others

  upon

  us

  use

  used

  uses

  very

  want

  wanted

  wanting

  wants

  was

  way

  we

  well

  wells

  went

  were

  what

  when

  where

  whether

  which

  while

  who

  whole

  year

  years

  yet

  you

  everyone

  everything

  everywhere

  young

  younger

  youngest

  your

  yours

  ever

  works

  every

  everybody

  face

  other

  our

  out

  just

  interesting

  high

  might

  keep

  keeps

  give

  given

  higher

  kind

  knew

  know

  known

  knows

  large

  largely

  last

  later

  latest

  least

  less

  needs

  never

  newer

  let

  lets

  like

  likely

  long

  high

  longer

  longest

  made

  make

  making

  man

  many

  may

  me

  member

  members

  men

  more

  in

  interest

  interested

  most

  mostly

  mr

  opened

  opening

  new

  opens

  or

  perhaps

  order

  ordered

  ordering

  orders

  differ

  differently

  do

  does

  done

  downed

  downing

  downs

  they

  thing

  things

  think

  thinks

  this

  those

  ways

  why

  without

  work

  worked

  working

  would

  during

  each

  early

  either

  end

  though

  still

  whose

  saw

  say

  says

  them

  second

  any

  anybody
 
 
 
上一篇《讀書筆記之 C++ Primer(1)》
下一篇《淺談C語言的可變參數》
 
 
 
 
 
 
日版寵物情人插曲《Winding Road》歌詞

日版寵物情人2017的插曲,很帶節奏感,日語的,女生唱的。 最後聽見是在第8集的時候女主手割傷了,然後男主用嘴幫她吸了一下,插曲就出來了。 歌手:Def...

兄弟共妻,我成了他們夜裏的美食

老鍾家的兩個兒子很特別,就是跟其他的人不太一樣,魔一般的執著。兄弟倆都到了要結婚的年齡了,不管自家老爹怎麽磨破嘴皮子,兄弟倆說不娶就不娶,老父母爲兄弟兩操碎了心...

如何磨出破洞牛仔褲?牛仔褲怎麽剪破洞?

把牛仔褲磨出有線的破洞 1、具體工具就是磨腳石,下面墊一個硬物,然後用磨腳石一直磨一直磨,到把那塊磨薄了,用手撕開就好了。出來的洞啊很自然的。需要貓須的話調幾...

我就是掃描下圖得到了敬業福和愛國福

先來看下敬業福和愛國福 今年春節,支付寶再次推出了“五福紅包”活動,表示要“把欠大家的敬業福都還給大家”。 今天該活動正式啓動,和去年一樣,需要收集“五福”...

冰箱異味産生的原因和臭味去除的方法

有時候我們打開冰箱就會聞到一股異味,冰箱裏的這種異味是因爲一些物質發出的氣味的混合體,聞起來讓人惡心。 産生這些異味的主要原因有以下幾點。 1、很多人有這種習...

《極品家丁》1-31集大結局分集劇情介紹

簡介 《極品家丁》講述了現代白領林晚榮無意回到古代金陵,並追隨蕭二小姐化名“林三”進入蕭府,不料卻陰差陽錯上演了一出低級家丁拼搏上位的“林三升職記”。...

李溪芮《極品家丁》片尾曲《你就是我最愛的寶寶》歌詞

你就是我最愛的寶寶 - 李溪芮 (電視劇《極品家丁》片尾曲) 作詞:常馨內 作曲:常馨內 你的眉 又鬼馬的挑 你的嘴 又壞壞的笑 上一秒吵鬧 下...

烏梅的功效與作用以及烏梅的食用禁忌有哪些?

烏梅,又稱春梅,中醫認爲,烏梅味酸,性溫,無毒,具有安心、除熱、下氣、祛痰、止渴調中、殺蟲的功效,治肢體痛、肺痨病。烏梅泡水喝能治傷寒煩熱、止吐瀉,與幹姜一起制...

什麽是脂肪粒?如何消除臉部脂肪粒?

什麽是脂肪粒 在我們的臉上總會長一個個像脂肪的小顆粒,弄也弄不掉,而且顔色還是白白的。它既不是粉刺也不是其他的任何痘痘,它就是脂肪粒。 脂肪粒雖然也是由油脂...

網絡安全治理:國家安全保障的主要方向是打擊犯罪,而不是處置和懲罰受害者

來源:中國青年報 新的攻擊方法不斷湧現,黑客幾乎永遠占據網絡攻擊的上風,我們不可能通過技術手段杜絕網絡攻擊。國家安全保障的主要方向是打擊犯罪,而不是處置和懲罰...

河南夫妻在溫嶺網絡直播“造人”內容涉黃被刑事拘留

夫妻網絡直播“造人”爆紅   1月9日,溫嶺城北派出所接到南京警方的協查通告,他們近期打掉了一個涉黃直播APP平台。而根據掌握的線索,其中有一對涉案的夫妻主播...

如何防止牆紙老化?牆紙變舊變黃怎麽辦?

如何防止牆紙老化? (1)選擇透氣性好的牆紙 市場上牆紙的材質分無紡布的、木纖維的、PVC的、玻璃纖維基材的、布面的等,相對而言,PVC材質的牆紙最不透氣...

鮮肌之謎非日本生産VS鮮肌之謎假日貨是謠言

觀點一:破日本銷售量的“鮮肌之謎” 非日本生産 近一段時間,淘寶上架了一款名爲“鮮肌之謎的” 鲑魚卵巢美容液,號稱是最近日本的一款推出的全新護膚品,産品本身所...

中國最美古詩詞精選摘抄

系腰裙(北宋詞人 張先) 惜霜蟾照夜雲天,朦胧影、畫勾闌。人情縱似長情月,算一年年。又能得、幾番圓。 欲寄西江題葉字,流不到、五亭前。東池始有荷新綠,尚小如...

關于女人的經典語句

關于女人的經典語句1、【做一個獨立的女人】 思想獨立:有主見、有自己的人生觀、價值觀。有上進心,永遠不放棄自己的理想,做一份自己喜愛的事業,擁有快樂和成就...

未來我們可以和性愛機器人結婚嗎?

你想體驗機器人性愛嗎?你想和性愛機器人結婚嗎?如果你想,機器人有拒絕你的權利嗎? 近日,第二屆“國際人類-機器人性愛研討會”大會在倫敦金史密斯大學落下帷幕。而...

全球最變態的十個地方

10.土耳其地下洞穴城市 變態指數:★★☆☆☆ 這是土耳其卡帕多西亞的一個著名景點,傳說是當年基督教徒們爲了躲避戰爭而在此修建。裏面曾住著20000人,...

科學家稱,人類死亡後意識將在另外一個宇宙中繼續存活

據英國《每日快報》報道,一位科學家兼理論家Robert Lanza博士宣稱,世界上並不存在人類死亡,死亡的只是身體。他認爲我們的意識借助我們體內的能量生存,而且...

《屏裏狐》片頭曲《我愛狐狸精》歌詞是什麽?

《我愛狐狸精》 - 劉馨棋   (電視劇《屏裏狐》主題曲)   作詞:金十三&李旦   作曲:劉嘉   狐狸精 狐狸仙   千年修...

 
 
 
讀取英文單詞,按順序排列(C++學習題目) 題目: 1. Implement a function that counting word frequency. It reads an English article from an user-specified txt file(article.txt) and counts their number. Those exclusive words should not be counted. Output the words and counts to 2 files. One(3_1_1out.txt) is in lexicographic order, and the other (3_1_2out.txt) is in descending frequency order. – Exclusive words: – Using map 代碼: #pragma warning(disable:4786) #include <string> #include <iostream> #include <fstream> #include <functional> #include <algorithm> #include <vector> #include <map> #include <set> using namespace std; typedef map<string, int>::value_type sival_type; vector<string> *retrieve_text(string file_name) { ifstream artcile_file( file_name.c_str(), ios::in ); if (!artcile_file) { cout << "Conn't open " << file_name.c_str() << " !" << endl; exit (1); } vector<string> *lines_of_text = new vector<string>; string textline; while ( getline(artcile_file, textline, '\n')) { //cout << " " << textline << '\n'; lines_of_text->push_back(textline); } return lines_of_text; } void strip_caps( vector<string> *text_file ) { string caps( "ABCDEFGHIJKLMNOPQRSTUVWXYZ" ); vector<string>::iterator iter = text_file->begin(); for ( ; iter != text_file->end(); ++iter ) { string::size_type pos = 0; while ( (pos = (*iter).find_first_of( caps, pos )) != string::npos ) { (*iter)[ pos ] = tolower( (*iter)[pos] ); } } // end of for } vector<string> *separate_words( const vector<string> *text_file ) { string filter("abcdefghijklmnopqrstuvwxy"); // 包含獨立的單詞集合 vector<string> *words = new vector<string>; short line_pos = 0; for ( ; line_pos <text_file->size(); ++line_pos ) { string textline = (*text_file)[line_pos]; // 用來遍曆所有的字母 string::size_type pos = 0; // 單詞的開始位置 string::size_type prev_pos = textline.find_first_of(filter); // 單詞末尾的下一空格位置 string::size_type temp_pos = textline.find_first_of(filter); // 一個小開關,其值爲TURE時,prev_pos指向單詞開始的位置 bool onoff = false; while ( (pos = textline.find_first_of(filter, pos)) != string::npos ) { if ( onoff ) { prev_pos = temp_pos - 1; // 將onoff值改爲false,使單詞開始的位置不會改變 onoff = false; } ++pos; if ( (pos - temp_pos) != 1 ) { // 爲下一次的賦值做准備 onoff = true; // 將分離出的單詞輸入words words->push_back( textline.substr( prev_pos, temp_pos - prev_pos )); } temp_pos = pos; } // end of while // 輸入最後一個單詞,除非這一段沒有找到任何字母 if ( prev_pos != string::npos ) { words->push_back( textline.substr( prev_pos, temp_pos - prev_pos )); } } // end of for return words; } map< string, int > *appear_total( const vector<string> *words ) { // 創建單詞排除集合 set<string> exclusion_set; ifstream exclusion_file( "pkg95.txt", ios::in ); if (!exclusion_file) { cout << "Conn't open pkg95.txt !" << endl; exit (1); } string textline; while ( getline(exclusion_file, textline, '\n')) { //cout << " " << textline << '\n'; exclusion_set.insert(textline); } map<string, int> *word_map = new map<string, int>; // 開始向word_map中記錄數據 vector<string>::const_iterator iter = words->begin(); for ( ; iter != words->end(); ++iter ) { // 如果少于3個字符或在排除集合中存在,則不輸入到map中 if ( (*iter).size() < 3 || exclusion_set.count( *iter ) ) { continue; } // 如果count()返回0,則單詞不存在,加入它 if ( !word_map->count(*iter) ) { word_map->insert( sival_type( (*iter), 1 ) ); } else { // 將單詞的出現次數加1 (*word_map)[ (*iter) ] += 1; } } // end of for return word_map; } multimap< int, string, greater<int> > * multimap_total( map<string, int> *text_map ) { multimap<int, string, greater<int> > *word_map = new multimap< int, string, greater<int> >; map< string, int >::iterator map_siter = text_map->begin(); for ( ; map_siter != text_map->end(); ++map_siter ) { word_map->insert(make_pair((*map_siter).second, (*map_siter).first)); } { string ofile("3_1_2out.txt"); ofstream outfile( ofile.c_str() ); if (!outfile) { cerr << "error: unable to open output file: " << ofile << endl; } multimap< int, string, greater<int> >::iterator map_siter = word_map->begin(); for ( ; map_siter != word_map->end(); ++map_siter ) { outfile << (*map_siter).second; for ( int n = 0; n < 15 - (*map_siter).second.size(); ++n ) { outfile << ' '; } outfile << "出現 " << (*map_siter).first << "\t次" << endl; } // end of for cout << "程序已將處理結果寫入3_1_2out.txt,該文件保存在當前目錄" << endl; } return word_map; } void map_output( map<string, int> *text_map ) { string ofile("3_1_1out.txt"); ofstream outfile( ofile.c_str() ); if (!outfile) { cerr << "error: unable to open output file: " << ofile << endl; } map< string, int >::iterator map_siter = text_map->begin(); for ( ; map_siter != text_map->end(); ++map_siter ) { outfile << (*map_siter).first; for ( int n = 0; n < 15 - (*map_siter).first.size(); ++n ) { outfile << ' '; } outfile << "出現 " << (*map_siter).second << "\t次" << endl; } // end of for cout << "程序已將處理結果寫入3_1_1out.txt,該文件保存在當前目錄" << endl; } int main() { vector<string> *text_file = retrieve_text("article.txt"); strip_caps(text_file); vector<string> *words = separate_words(text_file); map< string, int > *text_map = appear_total(words); map_output( text_map ); multimap_total(text_map); return 0; } 程序執行結果 3_1_1out.txt article 出現 2 次 counted 出現 1 次 counting 出現 1 次 counts 出現 2 次 descending 出現 1 次 english 出現 1 次 exclusive 出現 1 次 file 出現 1 次 files 出現 1 次 frequency 出現 2 次 function 出現 1 次 implement 出現 1 次 lexicographic 出現 1 次 output 出現 1 次 reads 出現 1 次 specified 出現 1 次 txt 出現 4 次 user 出現 1 次 word 出現 1 次 words 出現 2 次 3_1_2out.txt txt 出現 4 次 article 出現 2 次 counts 出現 2 次 frequency 出現 2 次 words 出現 2 次 counted 出現 1 次 counting 出現 1 次 descending 出現 1 次 english 出現 1 次 exclusive 出現 1 次 file 出現 1 次 files 出現 1 次 function 出現 1 次 implement 出現 1 次 lexicographic 出現 1 次 output 出現 1 次 reads 出現 1 次 specified 出現 1 次 user 出現 1 次 word 出現 1 次 附PKG95.TXT 文件內容: different necessary need needed needing newest next no nobody non none not nothing now nowhere of off often new old older oldest on once one only open again among already about above against alone after also although along always an across and another ask asking asks backed away should show came all almost before began back backing be became because becomes been at behind being best better between big showed ended ending both but by asked backs can cannot number numbers case few find finds cases clearly her herself come could did here beings fact far felt become first for four from full fully furthers gave general generally get gets gives facts go going good goods certain certainly clear great greater greatest group grouped grouping groups got has have having he further furthered had furthering itself faces highest him himself his how however if important interests into is it its anyone anything anywhere are area areas around as seconds see seem seemed seeming seems sees right several shall she enough even evenly over part parted parting parts per down place places point pointed pointing points possible present presented presenting ends high mrs much must my myself presents down problem problems put puts quite will with within rather really room rooms said same right showing shows side sides since small smaller smallest so some somebody someone something somewhere state states such sure take taken than that the their then there therefore these thought thoughts three through thus to today together too took toward turn turned turning turns two still under until up others upon us use used uses very want wanted wanting wants was way we well wells went were what when where whether which while who whole year years yet you everyone everything everywhere young younger youngest your yours ever works every everybody face other our out just interesting high might keep keeps give given higher kind knew know known knows large largely last later latest least less needs never newer let lets like likely long high longer longest made make making man many may me member members men more in interest interested most mostly mr opened opening new opens or perhaps order ordered ordering orders differ differently do does done downed downing downs they thing things think thinks this those ways why without work worked working would during each early either end though still whose saw say says them second any anybody
󰈣󰈤
 
 
 
  免責聲明:本文僅代表作者個人觀點,與王朝網路無關。王朝網路登載此文出於傳遞更多信息之目的,並不意味著贊同其觀點或證實其描述,其原創性以及文中陳述文字和內容未經本站證實,對本文以及其中全部或者部分內容、文字的真實性、完整性、及時性本站不作任何保證或承諾,請讀者僅作參考,並請自行核實相關內容。
 
 
紅酒館的午後(3)
紅酒館的午後(2)
美麗的戴安娜
俏皮可愛的車模
天下奇險-華山
去年。寬度不一
冬日九寨
美麗園
 
>>返回首頁<<
 
 
 
 熱帖排行
 
 
 
 
© 2005- 王朝網路 版權所有