Advertisement
Guest User

Untitled

a guest
Jan 16th, 2017
98
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.78 KB | None | 0 0
  1. #include <stdlib.h>
  2. #include <string.h>
  3. #include <stdio.h>
  4. # define MAX 100
  5.  
  6. int samoglaska(char c){
  7. return c=='a' || c=='e' || c=='i' || c=='o' || c=='u';
  8. }
  9.  
  10. int proveri(char *niza){
  11. char *nov;
  12.  
  13. while(*niza){
  14. int brojac=1;
  15. nov = niza + 1;
  16. while(*nov != '\0'){
  17. if(tolower(*niza) == tolower(*nov)){
  18. brojac++;
  19. }
  20. nov++;
  21. }
  22. if(brojac > 2){
  23. return 1;
  24. }
  25. niza++;
  26. }
  27. return 0;
  28. }
  29.  
  30. int main()
  31. {
  32. int i,j,m,n;
  33. scanf("%d %d",&n,&m);
  34. int a[n][m];
  35. for(i=0; i<n; i++){
  36. for(j=0; j<m; j++){
  37. scanf("%d", &a[i][j]);
  38. }
  39. }
  40. int zbirReper = 0, zbirRed=0;;
  41. // for(i=0; i<1; i++){
  42. for(i=0, j=0; j<m; j++){
  43. zbirReper += a[i][j];
  44. }
  45. // }
  46. // printf("%d",zbirReper);
  47. for(i=0; i<n; i++){
  48. zbirRed=0;
  49. for(j=0; j<m; j++){
  50. zbirRed += a[i][j];
  51. }
  52. if(zbirRed!=zbirReper){
  53. printf("Matricata ne e magichna");
  54. return 0;
  55. }
  56. }
  57. int zbirKolona=0;
  58. for(j=0; j<m; j++){
  59. zbirKolona = 0;
  60. for(i=0; i<n; i++){
  61. zbirKolona += a[i][j];
  62. }
  63. if(zbirKolona!=zbirReper){
  64. printf("Matricata ne e magichna");
  65. return 0;
  66. }
  67. }
  68. int sumaD=0,sumaS=0;
  69. printf("Matricata e magichna");
  70. for(i=0; i<m; i++){
  71. for(j=0; j<n; j++){
  72. if(i==j)
  73. sumaD += a[i][j];
  74. if(i+j == n-1)
  75. sumaS += a[i][j];
  76. }
  77. }
  78.  
  79. if(sumaD==zbirReper && sumaS==zbirReper){
  80. printf("\nMatricata e i specijalno magicna");
  81. }
  82. return 0;
  83. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement