‫ﺑﻪ ﻧﺎﻡ ﺧﺪﺍ‬
‫ﺗﻤﺮﻳﻦ ﺳﺮﻱ ﭼﻬﺎﺭﻡ ﺩﺭﺱ ﻣﺒﺎﻧﻲ ﺑﺮﻧﺎﻣﻪ ﻧﻮﻳﺴﻲ ﻛﺎﻣﭙﻴﻮﺗﺮ‬
‫ﻣﻬﻠﺖ ﺗﺤﻮﻳﻞ‪ :‬ﭼﻬﺎﺭﺷﻨﺒﻪ‪ 23 ،‬ﺁﺫﺭ‪ ،‬ﺳﺎﻋﺖ ‪23:59‬‬
‫ﻟﻄﻔﺎ ﻗﺒﻞ ﺍﺯ ﺍﻧﺠﺎﻡ ﺗﻤﺮﻳﻨﺎﺕ ﺑﻪ ﻧﻜﺎﺕ ﺯﻳﺮ ﺗﻮﺟﻪ ﻓﺮﻣﺎﻳﻴﺪ‪:‬‬
‫ﺍﮔﺮ ﺳﻮﺍﻟﻲ ﺩﺍﺷﺘﻴﺪ ﻣﻲ ﺗﻮﺍﻧﻴﺪ ﺍﺯ ﻃﺮﻳﻖ ﭘﺴﺖ ﺍﻟﻜﺘﺮﻭﻧﻴﻚ ﺩﺭ ﮔﺮﻭﻩ ﺩﺭﺱ ﻣﻄﺮﺡ ﻛﻨﻴﺪ‪) .‬ﺩﺭ ﺻﻔﺤﻪ ﺩﺭﺱ‬
‫ﻧﺸﺎﻧﻲ ﮔﺮﻭپ ﻗﺮﺍﺭ ﮔﺮﻓﺘﻪ ﺍﺳﺖ‪(.‬‬
‫ﺩﺭ ﺍﻳﻦ ﺗﻤﺮﻳﻦ ﺑﺎﻳﺪ ﻓﺎﻳﻞ ﻫﺎﻱ ‪ .c‬ﺧﻮﺩ ﺭﺍ ﺩﺭ ﻳﻚ ﭘﻮﺷﻪ ﻛﻪ ﻧﺎﻡ ﺁﻥ ‪ HW3_stdID‬ﺍﺳﺖ )‪ stdID‬ﻫﻤﺎﻥ‬
‫ﺷﻤﺎﺭﻩ ﺩﺍﻧﺸﺠﻮﻳﻲ ﺷﻤﺎﺳﺖ‪ Zip (.‬ﻛﻨﻴﺪ ﻭ ﺑﻪ ‪ [email protected]‬ﺍﺭﺳﺎﻝ ﻧﻤﺎﻳﻴﺪ‪.‬‬
‫ﺩﻗﺖ ﻛﻨﻴﺪ ﻛﻪ ﻣﻬﻠﺖ ﺍﺭﺳﺎﻝ ﺗﻤﺮﻳﻦ ﺗﻤﺪﻳﺪ ﻧﺨﻮﺍﻫﺪ ﺷﺪ ﻭ ﺑﻪ ﺍﺯﺍﻱ ﻫﺮ ﺭﻭﺯ ﺗﺎﺧﻴﺮ ‪ %25‬ﺍﺯ ﻧﻤﺮﻩ ﻱ ﺗﻤﺮﻳﻦ ﻛﺴﺮ‬
‫ﻣﻲ ﺷﻮﺩ‪ .‬ﺑﻪ ﺗﻤﺮﻳﻨﺎﺗﻲ ﻛﻪ ﺑﺎ ﺑﻴﺶ ﺍﺯ ‪ 3‬ﺭﻭﺯ ﺗﺎﺧﻴﺮ ﻓﺮﺳﺘﺎﺩﻩ ﺷﻮﻧﺪ‪ ،‬ﻧﻤﺮﻩ ﺍﻱ ﺗﻌﻠﻖ ﻧﻤﻲ ﮔﻴﺮﺩ‪.‬‬
‫ﺍﻭﻟﻴﻦ ﻣﻮﺭﺩ ﺗﻘﻠﺐ ‪ :‬ﻧﻤﺮﻩ ﻱ ‪0‬‬
‫ﺩﻭﻣﻴﻦ ﻣﻮﺭﺩ ‪ :‬ﻧﻤﺮﻩ ﻱ ‪100-‬‬
‫ﻭ ﺳﻮﻣﻴﻦ ﻣﻮﺭﺩ‪ ،‬ﻣﻨﺠﺮ ﺑﻪ ﺍﻓﺘﺎﺩﻥ ﺷﻤﺎ ﺩﺭ ﺁﻥ ﺩﺭﺱ ﺧﻮﺍﻫﺪ ﺷﺪ ‪.‬‬
‫ﺳﻮﺍﻝ ﺍﻭﻝ ‪Max and Count :‬‬
‫ﺍﺑﺘﺪﺍ ﻋﺪﺩ ﻃﺒﻴﻌﻲ ‪ n‬ﺭﺍ ﺍﺯ ﻭﺭﻭﺩﻱ ﺑﺨﻮﺍﻧﻴﺪ‪ .‬ﺳﭙﺲ ﺩﺭ ﺳﻄﺮ ﺑﻌﺪﻱ ‪ n‬ﺧﺎﻧﻪ ﻱ ﺍﻳﻦ ﺁﺭﺍﻳﻪ ﺭﺍ ﺩﺭﻳﺎﻓﺖ ﻛﻨﻴﺪ‪ .‬ﺳﭙﺲ ‪:‬‬
‫ﺍﻟﻒ( ﻳﻚ ﺗﺎﺑﻊ ﺑﺎﺯﮔﺸﺘﻲ ﺑﻨﻮﻳﺴﻴﺪ ﻛﻪ ﻣﻘﺪﺍﺭ ﻣﺎﻛﺰﻳﻤﻢ ﺍﻳﻦ ﺁﺭﺍﻳﻪ ﺭﺍ ﺩﺭ ﺧﺮﻭﺟﻲ ﭼﺎپ ﻛﻨﺪ‪.‬‬
‫)‪int max(int A[], int size‬‬
‫‪Sample Input‬‬
‫‪Sample Output‬‬
‫‪5‬‬
‫‪83156‬‬
‫‪8‬‬
‫ﺏ( ﻳﻚ ﺗﺎﺑﻊ ﺑﺎﺯﮔﺸﺘﻲ ﺑﻨﻮﻳﺴﻴﺪ ﻛﻪ ﺗﻌﺪﺍﺩ ﺗﻜﺮﺍﺭ ﻋﻀﻮﻱ ﺭﺍ ﺩﺭ ﺁﺭﺍﻳﻪ ﺑﻴﺎﺑﺪ‪ .‬ﺩﺭ ﺍﻳﻦ ﻗﺴﻤﺖ ﭘﺲ ﺍﺯ ﺧﻮﺍﻧﺪﻥ ﺁﺭﺍﻳﻪ ﺑﺎﻳﺪ‬
‫ﻋﺪﺩ ‪ element‬ﺭﺍ ﺍﺯ ﻭﺭﻭﺩﻱ ﺩﺭﻳﺎﻓﺖ ﻛﻨﺪ ﻭ ﺗﻌﺪﺍﺩ ﺗﻜﺮﺍﺭﻫﺎﻱ ﺁﻧﺮﺍ ﺩﺭ ﺧﺮﻭﺟﻲ ﭼﺎپ ﻛﻨﺪ‪.‬‬
‫)‪int count(int A[], int size, int element‬‬
‫‪Sample Input‬‬
‫‪Sample Output‬‬
‫‪0‬‬
‫‪2‬‬
‫‪4‬‬
‫‪2142‬‬
‫‪3‬‬
‫‪5‬‬
‫‪81231‬‬
‫‪1‬‬
‫ﺳﻮﺍﻝ ﺩﻭﻡ ‪Sort :‬‬
‫ﻳﻚ ﺭﻭﺵ ﺑﺎﺯﮔﺸﺘﻲ ﺑﺮﺍﻱ ﻣﺮﺗﺐ ﻛﺮﺩﻥ ﺁﺭﺍﻳﻪ‪ ،‬ﺑﻪ ﺍﻳﻦ ﺗﺮﺗﻴﺐ ﺍﺳﺖ ﻛﻪ ﻫﺮ ﺑﺎﺭ ﻋﻨﺼﺮ ‪i‬ﺍﻡ ﺍﺯ ﺁﺭﺍﻳﻪ ﺭﺍ ﺍﺑﺘﺪﺍ ﺑﺎ ﻋﻨﺼﺮ ‪i-1‬ﺍﻡ‬
‫ﻣﻘﺎﻳﺴﻪ ﻣﻲﻛﻨﻴﻢ‪ .‬ﺍﮔﺮ ﺍﺯ ﺁﻥ ﺑﺰﺭگﺗﺮ ﺑﺎﺷﺪ‪ ،‬ﻣﺮﺣﻠﻪﻱ ‪i‬ﺍﻡ ﺗﻤﺎﻡ ﺷﺪﻩ ﺍﺳﺖ ﻭ ﺑﻪ ﺳﺮﺍﻍ ﻣﺮﺣﻠﻪﻱ ‪i+1‬ﺍﻡ ﻣﻲﺭﻭﻳﻢ‪ .‬ﺩﺭ‬
‫ﻏﻴﺮ ﺍﻳﻦ ﺻﻮﺭﺕ ﺁﻥﻫﺎ ﺭﺍ ﺟﺎﺑﻪﺟﺎ ﻣﻲﻛﻨﻴﻢ ﻭ ﻋﻤﻞ ﻣﻘﺎﻳﺴﻪ ﺭﺍ ﺑﺮﺍﻱ ﻋﻨﺎﺻﺮ ‪i-1‬ﺍﻡ ﻭ ‪i-2‬ﺍﻡ ﺍﻧﺠﺎﻡ ﻣﻲﺩﻫﻴﻢ‪ .‬ﻫﺮ ﺑﺎﺭ ﺩﺭ‬
‫ﻣﻘﺎﻳﺴﻪﻫﺎ ﺍﮔﺮ ﺑﻪ ﺍﻭﻝ ﺁﺭﺍﻳﻪ ﺑﺮﺳﻴﻢ ﻣﺮﺣﻠﻪﻱ ‪i‬ﺍﻡ ﺗﻤﺎﻡ ﻣﻲﺷﻮﺩ‪ .‬ﻳﻌﻨﻲ ﺩﺭ ﻛﻞ ﺗﺎ ‪ n‬ﻣﺮﺣﻠﻪ ﺑﺎﻳﺪ ﺍﻳﻦ ﻛﺎﺭ ﺭﺍ ﺍﺩﺍﻣﻪ ﺩﻫﻴﻢ‪.‬‬
‫ﺑﺮﺍﻱ ﻭﺭﻭﺩﻱ ﺩﺭ ﺳﻄﺮ ﺍﻭﻝ ﺍﻧﺪﺍﺯﻩ ﺁﺭﺍﻳﻪ)‪ (n‬ﻭ ﺩﺭ ﺳﻄﺮ ﺑﻌﺪ‪ ،‬ﻋﻨﺎﺻﺮ ﺁﺭﺍﻳﻪ ﺭﺍ ﺑﺨﻮﺍﻧﻴﺪ‪.‬‬
‫ﺁﺭﺍﻳﻪﻱ ﻧﻬﺎﻳﻲ ﺭﺍ ﺩﺭ ﺧﺮﻭﺟﻲ ﺩﺭ ﻳﻚ ﺳﻄﺮ ﺑﺎ ﻳﻚ ﻓﺎﺻﻠﻪ ﺑﻴﻦ ﻋﻨﺎﺻﺮ ﺁﻥ ﺑﻨﻮﻳﺴﻴﺪ‪.‬‬
‫‪Sample Input‬‬
‫‪Sample Output‬‬
‫‪5‬‬
‫‪43275‬‬
‫‪23457‬‬
‫ﺳﻮﺍﻝ ﺳﻮﻡ ‪Reverse :‬‬
‫ﺑﺮﻧﺎﻣﻪ ﺍﻱ ﺑﻨﻮﻳﺴﻴﺪ ﻛﻪ ﻳﻚ ﺭﺷﺘﻪ )ﺣﺎﻭﻱ ﻛﻠﻤﺎﺗﻲ ﻛﻪ ﺑﺎ ﻓﺎﺻﻠﻪ ﺍﺯ ﻫﻢ ﺟﺪﺍ ﺷﺪﻩﺍﻧﺪ( ﺭﺍ ﺍﺯ ﻛﺎﺭﺑﺮ ﮔﺮﻓﺘﻪ ﻭ ﺗﻤﺎﻡ ﻛﻠﻤﺎﺕ‬
‫ﺁﻥ ﺭﺷﺘﻪ ﺭﺍﻣﻌﻜﻮﺱ ﻛﺮﺩﻩ ﻭ ﺭﺷﺘﻪ ﺣﺎﺻﻞ ﺭﺍ ﺩﺭ ﺧﺮﻭﺟﻲ ﻧﻤﺎﻳﺶ ﺩﻫﺪ‪) .‬ﺗﺮﺗﻴﺐ ﻛﻠﻤﺎﺕ ﺗﻐﻴﻴﺮ ﻧﻤﻲﻛﻨﺪ(‬
‫‪Sample Output‬‬
‫‪sihT si a tseT‬‬
‫‪Sample Input‬‬
‫‪This is a Test‬‬
‫ﺳﻮﺍﻝ ﭼﻬﺎﺭﻡ ‪Merge :‬‬
‫ﺩﺭ ﺍﻳﻦ ﺳﻮﺍﻝ ﺷﻤﺎ ﺑﺎﻳﺴﺘﻲ ﻳﻚ ‪ n‬ﺍﺯ ﻭﺭﻭﺩﻱ ﺑﻪ ﻋﻨﻮﺍﻥ ﺳﺎﻳﺰ ﺩﻭ ﺁﺭﺍﻳﻪ ﺑﺨﻮﺍﻧﻴﺪ‪ .‬ﺳﭙﺲ ﺩﺭ ‪ 2‬ﺧﻂ ﺑﻌﺪ ‪ n‬ﻋﻨﺼﺮ ﻫﺮ‬
‫ﺁﺭﺍﻳﻪ ﺭﺍ ﺑﻪ ﺻﻮﺭﺕ ﻣﺮﺗﺐ ﺷﺪﻩ ﺩﺭﻳﺎﻓﺖ ﻛﻨﻴﺪ‪ .‬ﺣﺎﻝ ﺑﻪ ﻋﻨﻮﺍﻥ ﺧﺮﻭﺟﻲ ﺍﻳﻦ ‪ 2n‬ﻋﻨﺼﺮ ﺭﺍ ﺑﻪ ﺻﻮﺭﺕ ﻣﺮﺗﺐ ﺷﺪﻩ ﺩﺭ ﻳﻚ‬
‫ﺧﻂ ﭼﺎپ ﻧﻤﺎﻳﻴﺪ‪.‬‬
‫‪Sample Output‬‬
‫‪1233456789‬‬
‫‪Sample Input‬‬
‫‪5‬‬
‫‪13456‬‬
‫‪23789‬‬
‫ﺳﻮﺍﻝ ﭘﻨﺠﻢ ‪Ternary Search :‬‬
‫ﺁﺭﺍﻳﻪ ﺍﻱ ﺭﺍ ﺩﺭ ﻧﻈﺮ ﺑﮕﻴﺮﻳﺪ ﻛﻪ ﺑﻪ ﺻﻮﺭﺕ ﺍﻛﻴﺪﺍ ﺻﻌﻮﺩﻱ ﻭ ﺳﭙﺲ ﺍﻛﻴﺪﺍ ﻧﺰﻭﻟﻲ ﺑﺎﺷﺪ ) ﻣﺜﻼ ‪ ( 1 2 3 4 7 6‬ﻛﻪ ﺍﺯ ‪1‬‬
‫ﺗﺎ ‪ 4‬ﺍﻛﻴﺪﺍ ﺻﻌﻮﺩﻱ ﻭ ﺍﺯ ﺁﻥ ﺑﻪ ﺑﻌﺪ ﺍﻛﻴﺪﺍ ﻧﺰﻭﻟﻲ ﺍﺳﺖ‪ .‬ﺷﻤﺎ ﺑﺎﻳﺪ ﺩﺭ ﺍﻳﻦ ﺑﺮﻧﺎﻣﻪ ﺍﺑﺘﺪﺍ ‪ ،n‬ﻃﻮﻝ ﺍﻳﻦ ﺁﺭﺍﻳﻪ ﻭ ﺳﭙﺲ‬
‫ﭼﻨﻴﻦ ﺁﺭﺍﻳﻪ ﺍﻱ ﺭﺍ ﺩﺭﻳﺎﻓﺖ ﻛﻨﻴﺪ ﻭ ﺑﺎ ﺍﺳﺘﻔﺎﺩﻩ ﺍﺯ ﺍﻟﮕﻮﺭﻳﺘﻢ ﺟﺴﺘﺠﻮﻱ ﺳﻪﺗﺎﻳﻲ ﻣﻘﺪﺍﺭ ﻣﺎﻛﺴﻴﻤﻢ ﺍﻳﻦ ﺁﺭﺍﻳﻪ ﺭﺍ ﺑﻪ ﻋﻨﻮﺍﻥ‬
‫ﺧﺮﻭﺟﻲ ﭼﺎپ ﻛﻨﻴﺪ‪.‬‬
‫ﺍﻟﮕﻮﺭﻳﺘﻢ ﺟﺴﺘﺠﻮﻱ ﺳﻪﺗﺎﻳﻲ ‪:‬‬
‫ﺍﻳﻦ ﺭﻭﺵ ﻣﺸﺎﺑﻪ ﺍﻟﮕﻮﺭﻳﺘﻢ ﺟﺴﺘﺠﻮﻱ ﺩﻭﺩﻭﻳﻲ ﺍﺯ ﻃﺮﻳﻖ ﺗﻘﺴﻴﻢ ﻭ ﺣﻞ ﺑﻪ ﺟﻮﺍﺏ ﻣﻲﺭﺳﺪ‪ .‬ﺑﺪﻳﻦ ﺻﻮﺭﺕ ﻛﻪ ﻓﺮﺽ‬
‫ﻛﻨﻴﺪ ﺑﺨﻮﺍﻫﻴﺪ ﺍﺯ ﺑﺎﺯﻩ ﻱ ]‪ [l,r‬ﻣﻘﺪﺍﺭ ﻣﺎﻛﺴﻴﻤﻢ ﺍﺵ ﺭﺍ ﭘﻴﺪﺍ ﻛﻨﻴﺪ‪.‬‬
‫ﻧﻘﺎﻁ ‪ m1 = l + (r-l)/3‬ﻭ ‪ m2 = r - (r-l)/3‬ﺭﺍ ﺩﺭ ﻧﻈﺮ ﺑﮕﻴﺮﻳﺪ‪.‬‬
‫ﺑﺎ ﻣﻘﺎﻳﺴﻪ ﻛﺮﺩﻥ ﻣﻘﺪﺍﺭﻫﺎﻱ ﺍﻳﻦ ﺩﻭ ﺧﺎﻧﻪ ﺍﺯ ﺁﺭﺍﻳﻪ ﺑﺎ ﻳﻜﻲ ﺍﺯ ‪ 3‬ﺣﺎﻟﺖ ﺯﻳﺮ ﺭﻭﺑﺮﻭ ﺧﻮﺍﻫﻴﺪ ﺷﺪ ‪:‬‬
‫• ﺍﮔﺮ )‪ f(m1) < f(m2‬ﺑﺎﺷﺪ‪ ،‬ﻳﻌﻨﻲ ﻣﺎﻛﺴﻴﻤﻢ ﺩﺭ ﺑﺎﺯﻩ ﻱ ]‪ [l,m1‬ﻧﺨﻮﺍﻫﺪ ﺑﻮﺩ ﭘﺲ ﺑﻪ ﺩﻧﺒﺎﻝ ﺟﻮﺍﺏ ﺩﺭ‬
‫ﺑﺎﺯﻩﻱ ]‪ [m1,r‬ﺧﻮﺍﻫﻴﻢ ﺑﻮﺩ ﻭ ﻫﻤﻴﻦ ﺍﻟﮕﻮﺭﻳﺘﻢ ﺭﺍ ﺑﺮﺍﻱ ﺍﻳﻦ ﺑﺎﺯﻩ ﺍﺟﺮﺍ ﻣﻴﻜﻨﻴﻢ‪.‬‬
‫• ﺍﮔﺮ )‪ f(m1) > f(m2‬ﺑﺎﺷﺪ‪ ،‬ﻳﻌﻨﻲ ﻣﺎﻛﺴﻴﻤﻢ ﺩﺭ ﺑﺎﺯﻩ ﻱ ]‪ [m2,r‬ﻧﺨﻮﺍﻫﺪ ﺑﻮﺩ ﭘﺲ ﺑﻪ ﺩﻧﺒﺎﻝ ﺟﻮﺍﺏ ﺩﺭ‬
‫ﺑﺎﺯﻩﻱ ]‪ [l,m2‬ﺧﻮﺍﻫﻴﻢ ﺑﻮﺩ ﻭ ﻫﻤﻴﻦ ﺍﻟﮕﻮﺭﻳﺘﻢ ﺭﺍ ﺑﺮﺍﻱ ﺍﻳﻦ ﺑﺎﺯﻩ ﺍﺟﺮﺍ ﻣﻴﻜﻨﻴﻢ‪.‬‬
‫• ﺍﮔﺮ )‪ f(m1) == f(m2‬ﺑﺎﺷﺪ‪ ،‬ﭘﺲ ﺑﻪ ﺩﻧﺒﺎﻝ ﺟﻮﺍﺏ ﺩﺭ ﺑﺎﺯﻩﻱ ]‪ [m1,m2‬ﺧﻮﺍﻫﻴﻢ ﺑﻮﺩ‪.‬‬
‫ﭘﺲ ﺑﺎ ﻫﻤﻴﻦ ﺭﻭﺵ ﺗﻘﺴﻴﻢ ﻭ ﺣﻞ ﺩﺭ ﻫﺮ ﻣﺮﺣﻠﻪ ﺑﺎﺯﻩﻱ ﺷﻤﺎ ﻛﻮﭼﻜﺘﺮ ﺷﺪﻩ ﻭ ﺩﺭ ﻧﻬﺎﻳﺖ ﺑﻪ ﺟﻮﺍﺏ )ﻣﻘﺪﺍﺭ ﻣﺎﻛﺴﻴﻤﻢ(‬
‫ﺧﻮﺍﻫﻴﺪ ﺭﺳﻴﺪ‪.‬‬
‫‪Sample Input‬‬
‫‪Sample Output‬‬
‫‪7‬‬
‫‪3‬‬
‫‪6‬‬
‫‪123476‬‬
‫‪5‬‬
‫‪12321‬‬
‫‪U‬‬
‫ﺗﻮﺟﻪ ‪:‬‬
‫‪U‬‬
‫ﺩﺭ ﺍﻳﻦ ﺳﻮﺍﻻﺕ ﺷﻤﺎ ﺑﺎﻳﺴﺘﻲ ﻧﺤﻮﻩ ﻱ ﻭﺭﻭﺩﻱ ﮔﺮﻓﺘﻦ ﻭ ﺧﺮﻭﺟﻲ ﺩﺍﺩﻥ ﻛﺪﺗﺎﻥ ﺩﻗﻴﻘﺎ ﻣﺸﺎﺑﻪ ﺑﺎ ﺗﺴﺖ ﻫﺎﻱ ﻧﻤﻮﻧﻪ ﺍﻱ‬
‫ﻛﻪ ﺑﺮﺍﻱ ﻫﺮ ﺳﻮﺍﻝ ﺩﺍﺩﻩ ﺷﺪﻩ ﺍﺳﺖ ﺑﺎﺷﺪ‪ .‬ﺍﺯ ﻧﻮﺷﺘﻦ ﻋﺒﺎﺭﺍﺗﻲ ﻫﻤﭽﻮﻥ ) ‪ ( Enter a number‬ﻭ ﺧﺮﻭﺟﻲ ﻫﺎﻱ‬
‫ﺍﺿﺎﻓﻲ ﺟﺪﺍ ﺧﻮﺩﺩﺍﺭﻱ ﻧﻤﺎﻳﻴﺪ ﺯﻳﺮﺍ ﻛﻪ ﻛﺪﻫﺎﻱ ﺷﻤﺎ ﺗﻮﺳﻂ ﺗﺴﺘﺮﻫﺎ ﺍﺟﺮﺍ ﺷﺪﻩ ﻭ ﺧﺮﻭﺟﻲ ﺁﻧﻬﺎ ﺗﻮﺳﻂ ﺑﺮﻧﺎﻣﻪ ﭼﻚ‬
‫ﻣﻴﺸﻮﺩ‪ .‬ﭘﺲ ﺍﮔﺮ ﺧﺮﻭﺟﻴﺘﺎﻥ ﻣﺘﻔﺎﻭﺕ ﺍﺯ ﺧﺮﻭﺟﻲ ﮔﻔﺘﻪ ﺑﺎﺷﺪ ﺑﻪ ﺷﻤﺎ ﻧﻤﺮﻩ ﺍﻱ ﺗﻌﻠﻖ ﻧﺨﻮﺍﻫﺪ ﮔﺮﻓﺖ‪.‬‬
‫ﻫﻤﭽﻨﻴﻦ ﻛﺪﻫﺎﻱ ﺧﻮﺩ ﺭﺍ ﻓﻘﻂ ﺑﺮ ﺍﺳﺎﺱ ﺍﻟﮕﻮﺭﻳﺘﻢﺍﻱ ﻛﻪ ﺻﻮﺭﺕ ﺳﻮﺍﻝ ﺍﺯ ﺷﻤﺎ ﺧﻮﺍﺳﺘﻪ ﺍﺳﺖ ﺑﺰﻧﻴﺪ‪.‬‬
‫ﺣﺘﻤﺎ ﻗﺒﻞ ﺍﺯ ﺍﺭﺳﺎﻝ ﻛﺪﻫﺎﻳﺘﺎﻥ ﻧﻤﻮﻧﻪ ﻫﺎﻱ ﺩﺍﺩﻩ ﺷﺪﻩ ﺑﺮﺍﻱ ﻫﺮ ﺳﻮﺍﻝ ﺭﺍ ﺑﻪ ﻫﻤﺮﺍﻩ ﭼﻨﺪ ﻧﻤﻮﻧﻪ ﺩﻟﺨﻮﺍﻩ ﺧﻮﺩﺗﺎﻥ ﺑﻪ‬
‫ﺑﺮﻧﺎﻣﻪﻫﺎﻱ ﺧﻮﺩ ﺩﺍﺩﻩ ﻭ ﺧﺮﻭﺟﻲ ﻫﺎﻱ ﺁﻧﻬﺎ ﺭﺍ ﺗﺴﺖ ﻛﻨﻴﺪ ﺗﺎ ﺍﺯ ﺻﺤﺖ ﺑﺮﻧﺎﻣﻪ ﻱ ﺧﻮﺩ ﻣﻄﻠﻊ ﺷﻮﻳﺪ‪.‬‬
‫ﭘﺲ‪ ،‬ﺍﺯ ﻧﻮﺷﺘﻦ ﻛﺪ ﺑﺮ ﺭﻭﻱ ﻛﺎﻏﺬ ﺧﻮﺩﺩﺍﺭﻱ ﻛﺮﺩﻩ ﻭ ﺗﻨﻬﺎ ﻓﺎﻳﻞﻫﺎﻱ ‪ .c‬ﺧﻮﺩ ﺭﺍ ﻫﻤﺎﻧﻄﻮﺭ ﻛﻪ ﮔﻔﺘﻪ ﺷﺪﻩ ﺍﺳﺖ ﺍﺭﺳﺎﻝ‬
‫ﻧﻤﺎﻳﻴﺪ‪.‬‬
‫ﻣﻮﻓﻖ ﺑﺎﺷﻴﺪ‪.‬‬