Advertisement
Denny707

Untitled

May 12th, 2017
146
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 2.20 KB | None | 0 0
  1. /*
  2. P-Like:
  3. function duerig_duecol(A,M,N): logical
  4. var M,N: integer
  5. var A: array(1..M,1..N) of integer
  6. var ok_righe,ok2,c: logical
  7. begin
  8. while i<M .AND. .NOT. ok_righe do
  9. j:=0
  10. c:=0
  11. while j<N .AND. .NOT. ok_righe do
  12. if A[i][j]=A[i+1][j] then
  13. c:=c+1
  14. endif
  15. if c==N then
  16. ok_righe=-true.
  17. endif
  18. j:=j+1
  19. endwhile
  20. i:=i+1
  21. endwhile
  22. j:=0
  23.  
  24. while ok_righe .AND. j<N .AND. .NOT. ok_colonne do
  25. i=0;
  26. int c=0;
  27. while i<M .AND. .NOT. ok_colonne do
  28. if A[i][j]=A[i][j+1] then
  29. c++;
  30. endif
  31. if c=M then
  32. ok_colonne=.true.
  33. endif
  34. i:=i+1
  35. endwhile
  36. j:=j+1
  37. endwhile
  38.  
  39. duerig_duecol:= (ok_righe .AND. ok_colonne)
  40. end
  41. */
  42. #include <iostream>
  43. using namespace std;
  44. int M=4,N=5;
  45. int A[4][5]; // V(r)(c)
  46.  
  47. void popola();
  48. int main(int argc, const char * argv[]) {
  49. popola();
  50. bool ok_righe=false,ok_colonne=false;
  51. int i=0,j=0;
  52. while(i<M && !ok_righe){
  53. j=0;
  54. ok_righe=true;
  55. while(j<N && ok_righe){
  56. if(A[i][j]!=A[i+1][j]){
  57. ok_righe=false;
  58. }
  59. j++;
  60. }
  61. i++;
  62. }
  63.  
  64. j=0;
  65. while(ok_righe && j<N && !ok_colonne){
  66. i=0;
  67. ok_colonne=true;
  68. while(i<M && ok_colonne){
  69. if(A[i][j]!=A[i][j+1]){
  70. ok_colonne=false;
  71. }
  72. i++;
  73. }
  74. j++;
  75. }
  76. cout<<boolalpha<<(ok_righe)<<" "<<(ok_colonne)<<endl;
  77. }
  78.  
  79. void popola(){
  80. A[0][0]=6; A[0][1]=-5; A[0][2]=-5; A[0][3]=10; A[0][4]=10;
  81. A[1][0]=10; A[1][1]=-39; A[1][2]=60; A[1][3]=-16; A[1][4]=-16;
  82. A[2][0]=10; A[2][1]=-39; A[2][2]=60; A[2][3]=-16; A[2][4]=-16;
  83. A[3][0]=-20; A[3][1]=-4; A[3][2]=-9; A[3][3]=40; A[3][4]=40;
  84. }
  85.  
  86.  
  87. // cout<<ok<<endl;
  88. /* visual: https://pastebin.com/raw/22z2aC0G
  89. int duering =0;
  90. int col,rig;
  91. while((i<N-1)&&(duering ==0)){
  92. col =0; rig =1; j=0;
  93. while ((j<M)&&(rig==1)){
  94. if (i<M-1){
  95. if (A[i][j]==A[i][j+1]){
  96. col=1;
  97. }
  98. }
  99. if (A[i][j]!=A[i+1][j]){
  100. rig=0;
  101. }
  102. j++;
  103. }
  104. if ((rig==1) && (col ==1)){
  105. duering=1;
  106. }
  107. i++;
  108. }
  109.  
  110. if (duering==1){
  111. printf("TRUE\n");
  112. }else{
  113. printf("FALSE\n");
  114. }
  115. */
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement