Advertisement
Guest User

Untitled

a guest
May 16th, 2018
133
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 5.01 KB | None | 0 0
  1. ///Minimele pe linii
  2. ///intr-o matrice dreptunghiulara.
  3. #include <iostream>
  4. using namespace std;
  5.  
  6. double a[100][50],mini;
  7. int n,m;
  8.  
  9. int main()
  10. {
  11. cout<<"n=";
  12. cin>>n;
  13. cout<<"m=";
  14. cin>>m;
  15. for(int i=0;i<n;i++)
  16. for(int j=0;j<m;j++)
  17. {
  18. cout<<"a["<<i<<"]["<<j<<"]=";
  19. cin>>a[i][j];
  20. }
  21. for(int i=0;i<n;i++)
  22. {
  23. mini=a[i][0];
  24. for(int j=0;j<m;j++)
  25. if(a[i][j]<mini)
  26. mini=a[i][j];
  27. cout<<mini<<" pe linia "<<i<<endl;
  28. }
  29. return 0;
  30. }
  31.  
  32. ///Maximele pe coloanele
  33. ///unei matrice dreptunghiulare.
  34. #include <iostream>
  35. using namespace std;
  36.  
  37. double a[100][50],maxi;
  38. int n,m;
  39.  
  40. int main()
  41. {
  42. cout<<"n=";
  43. cin>>n;
  44. cout<<"m=";
  45. cin>>m;
  46. for(int i=0;i<n;i++)
  47. for(int j=0;j<m;j++)
  48. cin>>a[i][j];
  49. for(int j=0;j<m;j++)
  50. {
  51. maxi=a[0][j];
  52. for(int i=0;i<n;i++)
  53. if(a[i][j]>maxi)
  54. maxi=a[i][j];
  55. cout<<maxi<<" pe coloana "<<j<<endl;
  56. }
  57. return 0;
  58. }
  59.  
  60. ///Suma elementelor de pe
  61. ///diagonala principala
  62. ///a unei matrice patratice.
  63. #include <iostream>
  64. using namespace std;
  65.  
  66. int a[100][100],n;
  67. long s;
  68.  
  69. int main()
  70. {
  71. s=0;
  72. cout<<"n=";
  73. cin>>n;
  74. for(int i=0;i<n;i++)
  75. for(int j=0;j<n;j++)
  76. cin>>a[i][j];
  77. for(int i=0;i<n;i++)
  78. s=s+a[i][i];
  79. cout<<s;
  80. return 0;
  81. }
  82.  
  83. ///Suma elem. pare
  84. ///de sub diag. princ.
  85. #include <iostream>
  86. using namespace std;
  87.  
  88. int a[100][100],n,ok;
  89.  
  90. int main()
  91. {
  92. ok=0;
  93. cout<<"n=";
  94. cin>>n;
  95. for(int i=0;i<n;i++)
  96. for(int j=0;j<n;j++)
  97. cin>>a[i][j];
  98. for(int i=0;i<n;i++)
  99. for(int j=0;j<n;j++)
  100. if(i>j && a[i][j]%2==0)
  101. {
  102. cout<<a[i][j]<<" ";
  103. ok=1;
  104. }
  105. if(ok==0)
  106. cout<<"Nu exista";
  107. return 0;
  108. }
  109.  
  110. ///Daca exista sau nu
  111. ///elem. impare deasupra
  112. ///diag. princ.
  113. #include <iostream>
  114. using namespace std;
  115.  
  116. int a[100][100],n,ok;
  117.  
  118. int main()
  119. {
  120. ok=0;
  121. cout<<"n=";
  122. cin>>n;
  123. for(int i=0;i<n;i++)
  124. for(int j=0;j<n;j++)
  125. cin>>a[i][j];
  126. for(int i=0;i<n;i++)
  127. for(int j=0;j<n;j++)
  128. if(i<j && a[i][j]%2!=0)
  129. {
  130. cout<<a[i][j]<<" ";
  131. ok=1;
  132. }
  133. if(ok==0)
  134. cout<<"Nu exista";
  135. return 0;
  136. }
  137.  
  138. ///Afisarea elementelor
  139. ///de pe "coaja" matricei
  140. ///dreptunghiulare.
  141. #include <iostream>
  142. using namespace std;
  143.  
  144. int a[100][50],n,m;
  145.  
  146. int main()
  147. {
  148.  
  149. cin>>n>>m;
  150. for(int i=0;i<n;i++)
  151. for(int j=0;j<m;j++)
  152. cin>>a[i][j];
  153. for(int j=0;j<m;j++)
  154. cout<<a[0][j]<<" ";
  155. for(int i=1;i<n;i++)
  156. cout<<a[i][m-1]<<" ";
  157. for(int j=m-2;j>=0;j--)
  158. cout<<a[n-1][j]<<" ";
  159. for(int i=n-2;i>=1;i--)
  160. cout<<a[i][0]<<" ";
  161. return 0;
  162. }
  163. ///Maximele pe coloanele
  164. ///unei matrice dreptunghiulare.
  165. #include <iostream>
  166. using namespace std;
  167.  
  168. double a[100][50],maxi;
  169. int n,m;
  170.  
  171. int main()
  172. {
  173. cout<<"n=";
  174. cin>>n;
  175. cout<<"m=";
  176. cin>>m;
  177. for(int i=0;i<n;i++)
  178. for(int j=0;j<m;j++)
  179. cin>>a[i][j];
  180. for(int j=0;j<m;j++)
  181. {
  182. maxi=a[0][j];
  183. for(int i=0;i<n;i++)
  184. if(a[i][j]>maxi)
  185. maxi=a[i][j];
  186. cout<<maxi<<" pe coloana "<<j<<endl;
  187. }
  188. return 0;
  189. }
  190. ///Cititi o matrice patratica.
  191. ///Afisati elementele situate
  192. ///deasupra diagonalei secundare
  193. ///care au suma cifrelor impara
  194. ///sau mesajul nu exista daca
  195. ///nu se gasesc asemenea elem.
  196. #include <iostream>
  197. using namespace std;
  198.  
  199. int a[100][100],n,ok,x;
  200. long s;
  201.  
  202. int main()
  203. {
  204. ok=0;
  205. cout<<"n=";
  206. cin>>n;
  207. for(int i=0;i<n;i++)
  208. for(int j=0;j<n;j++)
  209. cin>>a[i][j];
  210. cout<<endl;
  211. for(int i=0;i<n;i++)
  212. for(int j=0;j<n;j++)
  213. if(i+j<n-1)
  214. {
  215. s=0;
  216. x=a[i][j];
  217. while(x>0)
  218. {
  219. s+=x%10;
  220. x=x/10;
  221. }
  222. if(s%2!=0)
  223. {
  224. cout<<a[i][j]<<" ";
  225. ok=1;
  226. }
  227. }
  228. if(ok==0)
  229. cout<<"Nu exista";
  230. return 0;
  231. }
  232. ///Cititi o matrice patratica.
  233. ///Afisati elementele de sub
  234. ///diagonala secundara care
  235. ///au ultimele 2 cifre egale
  236. ///sau mesajul "Nu exista" daca
  237. ///nu se gasesc asemenea elem.
  238. #include <iostream>
  239. using namespace std;
  240.  
  241. int a[100][100],n,ok;
  242.  
  243. int main()
  244. {
  245. ok=0;
  246. cout<<"n=";
  247. cin>>n;
  248. for(int i=0;i<n;i++)
  249. for(int j=0;j<n;j++)
  250. cin>>a[i][j];
  251. cout<<endl;
  252. for(int i=0;i<n;i++)
  253. for(int j=0;j<n;j++)
  254. if(i+j>n-1)
  255. {
  256. if(a[i][j]%10==a[i][j]/10%10 && a[i][j]!=0)
  257. {
  258. cout<<a[i][j]<<" ";
  259. ok=1;
  260. }
  261. }
  262. if(ok==0)
  263. cout<<"Nu exista";
  264. return 0;
  265. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement