ﺗﻤﺮﻳﻦ ﺳﺮﻱ ﭼﻬﺎﺭﻡ ﻣﺒﺎﻧﻲ ﺑﺮﻧﺎﻣﻪ ﻧﻮﻳﺴﻲ C++ - ﻣﻬﻠﺖ ﺗﺤﻮﻳﻞ ﺩﻭﺷﻨﺒﻪ 19ﺁﺫﺭ 1386 ﺗﻤﺮﻳﻦ ﻫﺎﻱ ﺧﻮﺩ ﺭﺍ ﺑﻪ ﻓﺮﻣﺖ zipﻭ ﺑﺎ ﻧﺎﻡ HW4_StudentIDﮐﻪ ﺩﺭ ﺁﻥ StudentIDﺷﻤﺎﺭﻩ ﺩﺍﻧﺸﺠﻮﻳﻲ ﺷﻤﺎﺳﺖ ،ﺑﻪ ﺁﺩﺭﺱ [email protected]ﺑﻔﺮﺳﺘﻴﺪ. - ﺑﻪ ﺑﺮﻧﺎﻣﻪﻫﺎﻱ ﻣﺸﺎﺑﻪ ﻧﻤﺮﻩ ﻣﻨﻔﻲ ﺗﻌﻠﻖ ﺧﻮﺍﻫﺪ ﮔﺮﻓﺖ. ﻣﺴﺎﻟﻪ ﺍﻭﻝ . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ﻣﺮﺗﺐﺳﺎﺯﻱ ﺩﺭﺟﻲ ﺩﺭ ﺍﻳﻦ ﺑﺮﻧﺎﻣﻪ ﻣﻲﺧﻮﺍﻫﻴﻢ ﺍﻟﮕﻮﺭﻳﺘﻢ ﻣﺮﺗﺐ ﺳﺎﺯﻱ ﺩﺭﺟﻲ 1ﺭﺍ ﮐﻪ ﻓﻠﻮﭼﺎﺭﺕ ﺁﻥ ﺭﺍ ﺩﺭ ﺗﻤﺮﻳﻦ ﺳﺮﻱ ﺍﻭﻝ ﺩﻳﺪﻳﺪ ،ﺑﻪ ﺯﺑﺎﻥ cﭘﻴﺎﺩﻩﺳﺎﺯﻱ ﮐﻨﻴﻢ .ﺩﺍﺩﻩﻫﺎﻱ ﻧﺎﻣﺮﺗﺐ ﺑﻪ ﺻﻮﺭﺕ ) (integerﺑﻮﺩﻩ ﻭ ﺩﺭ ﻳﮏ ﻓﺎﻳﻞ ﺑﻪ ﺁﺩﺭﺱ c:\input.txtﺫﺧﻴﺮﻩ ﺷﺪﻩﺍﻧﺪ )ﺩﺭ ﻫﺮ ﺧﻂ ﻳﮏ ﻋﺪﺩ(. ﺗﻌﺪﺍﺩ ﺍﻳﻦ ﺩﺍﺩﻩ ﻫﺎ ﺩﺭ ﺧﻂ ﺍﻭﻝ ﺍﻳﻦ ﻓﺎﻳﻞ ﺫﺧﻴﺮﻩ ﺷﺪﻩ ﺍﺳﺖ )ﻳﻌﻨﻲ ﻓﺎﻳﻠﻲ ﺑﺎ nﺩﺍﺩﻩ ﺻﺤﻴﺢ ،ﺩﺍﺭﺍﻱ n+1ﺧﻂ ﻣﻲﺑﺎﺷﺪ ﮐﻪ ﺩﺭ ﺧﻂ ﺍﻭﻝ ﻋﺪﺩ nﺫﺧﻴﺮﻩ ﺷﺪﻩ ﺍﺳﺖ(. ﺑﺮﻧﺎﻣﻪﺍﻱ ﺑﻨﻮﻳﺴﻴﺪ ﮐﻪ ﺩﺍﺩﻩﻫﺎﻱ ﻧﺎﻣﺮﺗﺐ ﺭﺍ ﺍﺯ ﺍﻳﻦ ﻓﺎﻳﻞ ﺧﻮﺍﻧﺪﻩ ﻭ ﺩﺍﺩﻩﻫﺎﻱ ﻣﺮﺗﺐ ﺷﺪﻩ ﺭﺍ ﺩﺭ ﻓﺎﻳﻞ ﺧﺮﻭﺟﻲ ﻭ ﺩﺭ ﺁﺩﺭﺱ c:\output.txt ﺫﺧﻴﺮﻩ ﮐﻨﺪ )ﻫﺮ ﺧﻂ ﻳﮏ ﻣﻘﺪﺍﺭ ﻭ ﻣﺠﻤﻮﻋﺎ nﺧﻂ( .ﻫﻤﭽﻨﻴﻦ ﻣﻲﺩﺍﻧﻴﻢ< 1000 : ﻣﺴﺎﻟﻪ ﺩﻭﻡ . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ﮐﻠﻤﺎﺕ ﻣﻌﮑﻮﺱ ﺑﺮﻧﺎﻣﻪ ﺍﻱ ﺑﻨﻮﻳﺴﻴﺪ ﮐﻪ ﻳﮏ ﺭﺷﺘﻪ )ﺣﺎﻭﻱ ﮐﻠﻤﺎﺗﻲ ﮐﻪ ﺑﺎ ﻓﺎﺻﻠﻪ ﺍﺯ ﻫﻢ ﺟﺪﺍ ﺷﺪﻩﺍﻧﺪ( ﺭﺍ ﺍﺯ ﮐﺎﺭﺑﺮ ﮔﺮﻓﺘﻪ ﻭ ﺗﻤﺎﻡ ﮐﻠﻤﺎﺕ ﺁﻥ ﺭﺷﺘﻪ ﺭﺍ ﻣﻌﮑﻮﺱ ﮐﺮﺩﻩ ﻭ ﺭﺷﺘﻪ ﺣﺎﺻﻞ ﺭﺍ ﺩﺭ ﺧﺮﻭﺟﻲ ﻧﻤﺎﻳﺶ ﺩﻫﺪ) .ﺗﺮﺗﻴﺐ ﮐﻠﻤﺎﺕ ﺗﻐﻴﻴﺮ ﻧﻤﻲﮐﻨﺪ( ﻣﺜﺎﻟﻲ ﺍﺯ ﺍﺟﺮﺍﻱ ﺍﻳﻦ ﺑﺮﻧﺎﻣﻪ: Enter your string: This is a Test The reverse is: sihT si a tseT Insertion Sort 1 ﻣﺴﺎﻟﻪ ﺳﻮﻡ . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ﺿﺮﺏ ﻣﺎﺗﺮﻳﺴﻲ ﺑﺮﻧﺎﻣﻪﺍﻱ ﺑﻨﻮﻳﺴﻴﺪ ﮐﻪ ﺩﻭ ﻣﺎﺗﺮﻳﺲ ﻣﺤﺎﺳﺒﻪ ﺣﺎﺻﻠﻀﺮﺏ × = × ﻭ × ﺭﺍ ﺍﺯ ﺩﻭ ﻓﺎﻳﻞ ﺑﺎ ﺁﺩﺭﺱ ﻫﺎﻱ c:\MatrixB.txt , c:\MatrixA.txtﺧﻮﺍﻧﺪﻩ ﻭ ﭘﺲ ﺍﺯ ،ﻧﺘﻴﺠﻪ ﺭﺍ ﺩﺭ ﻓﺎﻳﻞ c:\MatrixC.txtﺫﺧﻴﺮﻩ ﮐﻨﺪ .ﺩﺭ ﺻﻮﺭﺗﻲ ﮐﻪ ﻣﺎﺗﺮﻳﺲﻫﺎ ﻗﺎﺑﻞ ﺿﺮﺏ ﻧﺒﺎﺷﻨﺪ ،ﺑﺮﻧﺎﻣﻪ ﺷﻤﺎ ﺑﺎﻳﺪ ﻳﮏ ﭘﻴﻐﺎﻡ ﺧﻄﺎ ﺩﺭ ﺧﺮﻭﺟﻲ ﭼﺎﭖ ﮐﻨﺪ. ﺩﺭ ﺳﻄﺮ ﺍﻭﻝ ﻓﺎﻳﻠﻬﺎﻱ ﻣﺮﺑﻮﻁ ﺑﻪ ﻣﺎﺗﺮﻳﺲ ﻫﺎﻱ A, B, Cﺍﺑﻌﺎﺩ ﻣﺎﺗﺮﻳﺲ )ﺑﺘﺮﺗﻴﺐ ﺗﻌﺪﺍﺩ ﺳﻄﺮﻫﺎ ﻭ ﺳﺘﻮﻥﻫﺎ( ﻭ ﺩﺭ ﺧﻄﻬﺎﻱ ﺑﻌﺪ ،ﺩﺭ ﻫﺮ ﺧﻂ ﻳﮏ ﺳﻄﺮ ﺍﺯ ﻣﺎﺗﺮﻳﺲ ﺫﺧﻴﺮﻩ ﻣﻲﺷﻮﺩ .ﺍﻋﺪﺍﺩ ﻫﺮ ﺳﻄﺮ ﺑﺎ ﻳﮏ spaceﺍﺯ ﻫﻢ ﺟﺪﺍ ﺷﺪﻩﺍﻧﺪ. −1 ﻣﺜﻼ ﻓﺎﻳﻞ ﻣﺮﺑﻮﻁ ﺑﻪ ﻣﺎﺗﺮﻳﺲ 10 0 1 2 0ﭼﻨﻴﻦ ﺫﺧﻴﺮﻩ ﻣﻲﺷﻮﺩ: 9 4 −13 ﺗﻤﺎﻡ ﺩﺭﺍﻳﻪﻫﺎﻱ ﻣﺎﺗﺮﻳﺲﻫﺎ ﺭﺍ ﺍﻋﺪﺍﺩ integerﺩﺭ ﻧﻈﺮ ﺑﮕﻴﺮﻳﺪ .ﻫﻤﭽﻨﻴﻦ ﻣﻲﺩﺍﻧﻴﻢ ≤ 100 : 3 , , , −1 10 0 3 1 2 0 9 4 −13 ﻣﺴﺎﻟﻪ ﭼﻬﺎﺭﻡ . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ﺯﻳﺮ ﺭﺷﺘﻪ ﺑﺮﻧﺎﻣﻪ ﺍﻱ ﺑﻨﻮﻳﺴﻴﺪ ﮐﻪ 2ﺭﺷﺘﻪ ﺍﺯ ﮐﺎﺭﺑﺮ ﮔﺮﻓﺘﻪ ﻭ ﺍﮔﺮ ﺭﺷﺘﻪ ﺍﻭﻝ ﺩﺭ ﺩﺍﺧﻞ ﺭﺷﺘﻪ ﺩﻭﻡ ﺗﮑﺮﺍﺭ ﺷﺪﻩ ﺑﻮﺩ ،ﻣﺤﻞ ﺍﻭﻟﻴﻦ ﺗﮑﺮﺍﺭ ﺁﻥ ﻭ ﺩﺭ ﻏﻴﺮ ﺍﻳﻦ ﺻﻮﺭﺕ ﻋﺪﺩ 0ﺭﺍ ﭼﺎﭖ ﮐﻨﺪ .ﺣﺮﻭﻑ ﺑﺰﺭﮒ ﻭ ﮐﻮﭼﮏ ﺍﻧﮕﻠﻴﺴﻲ ﺩﺭ ﺍﻳﻦ ﺭﺷﺘﻪﻫﺎ ﻣﺘﻤﺎﻳﺰ ﻧﻴﺴﺘﻨﺪ. ﻣﺜﺎﻝﻫﺎﻳﻲ ﺍﺯ ﺍﻳﻦ ﺑﺮﻧﺎﻣﻪ: Enter String1: bcf Enter String2: abcd abce abcf 12 Enter String1: is Enter String2: This is a test. It is TEST1 3 Enter String1: TEST Enter String2: This is a test. It is TEST2 11 Enter String1: test2 Enter String2: This is a test. It is TEST3 0
© Copyright 2025 Paperzz