Advertisement
Guest User

Untitled

a guest
Nov 30th, 2015
76
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 3.62 KB | None | 0 0
  1. /*
  2. Ho ten: Thai Minh Khoa
  3. MSSV: DH51400548
  4. Lop: D14_TH02
  5. */
  6.  
  7. /*
  8. #include "iostream"
  9. #include "conio.h"
  10.  
  11. using namespace std;
  12.  
  13. const int MAX = 10;
  14.  
  15. struct MATRIX {
  16. int data[MAX][MAX];
  17. int m,n;
  18. };
  19.  
  20. int getRand(int min, int max); //Phat sinh so ngau nhien tu min den max
  21. void NhapMTAuto(MATRIX &mt); //Tu dong phat sinh ngau nhien cac phan tu trong ma tran cap m x n
  22. void XuatMT(MATRIX mt);
  23.  
  24. int MaxDong5(MATRIX mt, int k); //Tim phan tu lon nhat chia het cho 5 cua dong k
  25. int MinCot2(MATRIX mt, int x); //Tim phan tu nho nhat chia het cho 2 cua cot x
  26.  
  27. int TongMax5(MATRIX mt); // Tinh tong cac phan tu lon nhat chia het cho 5 cua tung dong
  28. int TongMin2(MATRIX mt); // Tinh tong cac phan tu nho nhat chia het cho 2 cua tung cot
  29.  
  30. int MaxDong(MATRIX mt); //Tim dong co tong lon nhat
  31. int MinCot(MATRIX mt); //Tim cot co tong nho nhat
  32.  
  33.  
  34. void main() {
  35. MATRIX mt;
  36. NhapMTAuto(mt);
  37. XuatMT(mt);
  38.  
  39. int k, x;
  40. cout<<"\nNhap dong k: ";
  41. cin>>k;
  42. cout<<"\nPhan tu chia het cho 5 lon nhat dong "<<k<<": "<<MaxDong5(mt,k);
  43. cout<<"\nNhap cot x: ";
  44. cin>>x;
  45. cout<<"\nPhan tu chia het cho 2 nho nhat cot "<<x<<": "<<MinCot2(mt,x);
  46. cout<<"\n\nTong cac phan tu lon nhat chia het cho 5: "<<TongMax5(mt);
  47. cout<<"\nTong cac phan tu nho nhat chia het cho 2: "<<TongMin2(mt);
  48.  
  49. cout<<"\n\nDong co tong lon nhat la: "<<MaxDong(mt);
  50. cout<<"\nCot co tong nho nhat la: "<<MinCot(mt);
  51.  
  52.  
  53. _getch();
  54. }
  55. //SINH VIEN DINH NGHIA CAC HAM O DAY
  56. int MaxDong5(MATRIX mt, int k)
  57. { //Tim phan tu lon nhat chia het cho 5 cua dong k
  58. int max=0;
  59. int flag=0;
  60. for(int i=0;i<mt.m;i++)
  61. {
  62. if(mt.data[k][i]%5==0)
  63. {
  64. if(flag==0)
  65. {
  66. max=mt.data[k][i];
  67. flag=1;
  68. }
  69. else if(mt.data[k][i]>max)
  70. {
  71. max=mt.data[k][i];
  72. }
  73. }
  74. }
  75. return max;
  76. }
  77. int MinCot2(MATRIX mt, int x)
  78. { //Tim phan tu nho nhat chia het cho 2 cua cot x
  79. int min=0;
  80. int flag=0;
  81. for(int i=0;i<mt.n;i++)
  82. {
  83. if(mt.data[i][x]%2==0)
  84. {
  85. if(flag==0)
  86. {
  87. min=mt.data[i][x];
  88. flag=1;
  89. }
  90. else if(mt.data[i][x]<min)
  91. {
  92. min=mt.data[i][x];
  93. }
  94. }
  95. }
  96. return min;
  97. }
  98.  
  99. int TongMax5(MATRIX mt)
  100. { // Tinh tong cac phan tu lon nhat chia het cho 5 cua tung dong
  101. int tong=0;
  102. for(int i=0;i<mt.n;i++)
  103. {
  104. tong=tong+MaxDong5(mt,i);
  105. }
  106. return tong;
  107. }
  108. int TongMin2(MATRIX mt)
  109. { // Tinh tong cac phan tu nho nhat chia het cho 2 cua tung cot
  110. int tong=0;
  111. for(int i=0;i<mt.m;i++)
  112. {
  113. tong=tong+MinCot2(mt,i);
  114. }
  115. return tong;
  116. }
  117.  
  118. int MaxDong(MATRIX mt)
  119. { //Tim dong co tong lon nhat
  120. int tong[MAX];
  121. for(int i=0;i<mt.n;i++)
  122. {
  123. tong[i]=0;
  124. for(int j=0;j<mt.n;j++)
  125. {
  126. tong[i]=tong[i]+mt.data[j][i];
  127. }
  128. }
  129. int max=tong[0];
  130. int vitri=-1;
  131. for(int a=0;a<mt.n;a++)
  132. {
  133. if(tong[a]>max)
  134. {
  135. max=tong[a];
  136. vitri=a;
  137. }
  138. }
  139. return vitri;
  140. }
  141. int MinCot(MATRIX mt)
  142. { //Tim cot co tong nho nhat
  143. int tong[MAX];
  144. for(int i=0;i<mt.m;i++)
  145. {
  146. tong[i]=0;
  147. for(int j=0;j<mt.n;j++)
  148. {
  149. tong[i]=tong[i]+mt.data[j][i];
  150. }
  151. }
  152. int min=tong[0];
  153. int vitri=-1;
  154. for(int a=0;a<mt.m;a++)
  155. {
  156. if(tong[a]<min)
  157. {
  158. min=tong[a];
  159. vitri=a;
  160. }
  161. }
  162. return vitri;
  163. }
  164.  
  165. //SINH VIEN KHONG CHINH SUA CAC HAM DUOI DAY
  166. void NhapMTAuto(MATRIX &mt){
  167. cout<<"\nNhap so dong: ";
  168. cin>>mt.n;
  169. cout<<"\nNhap so cot: ";
  170. cin>>mt.m;
  171. for(int i=0; i<mt.n; i++)
  172. for(int j=0; j<mt.m; j++)
  173. mt.data[i][j] = getRand(0, 20);
  174. }
  175.  
  176. void XuatMT(MATRIX matran) {
  177. cout<<endl;
  178. for(int i=0; i<matran.n; i++) {
  179. for(int j=0; j<matran.m; j++)
  180. cout<<"\t"<<matran.data[i][j];
  181. cout<<endl;
  182. }
  183. }
  184.  
  185. int getRand(int min, int max) {
  186. int num = (int) rand() % (max - min) + min;
  187. return num;
  188. }
  189. */
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement