Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- /*
- P-Like:
- function duerig_duecol(A,M,N): logical
- var M,N: integer
- var A: array(1..M,1..N) of integer
- var ok_righe,ok2,c: logical
- begin
- while i<M .AND. .NOT. ok_righe do
- j:=0
- c:=0
- while j<N .AND. .NOT. ok_righe do
- if A[i][j]=A[i+1][j] then
- c:=c+1
- endif
- if c==N then
- ok_righe=-true.
- endif
- j:=j+1
- endwhile
- i:=i+1
- endwhile
- j:=0
- while ok_righe .AND. j<N .AND. .NOT. ok_colonne do
- i=0;
- int c=0;
- while i<M .AND. .NOT. ok_colonne do
- if A[i][j]=A[i][j+1] then
- c++;
- endif
- if c=M then
- ok_colonne=.true.
- endif
- i:=i+1
- endwhile
- j:=j+1
- endwhile
- duerig_duecol:= (ok_righe .AND. ok_colonne)
- end
- */
- #include <iostream>
- using namespace std;
- int M=4,N=5;
- int A[4][5]; // V(r)(c)
- void popola();
- int main(int argc, const char * argv[]) {
- popola();
- bool ok_righe=false,ok_colonne=false;
- int i=0,j=0;
- while(i<M && !ok_righe){
- j=0;
- ok_righe=true;
- while(j<N && ok_righe){
- if(A[i][j]!=A[i+1][j]){
- ok_righe=false;
- }
- j++;
- }
- i++;
- }
- j=0;
- while(ok_righe && j<N && !ok_colonne){
- i=0;
- ok_colonne=true;
- while(i<M && ok_colonne){
- if(A[i][j]!=A[i][j+1]){
- ok_colonne=false;
- }
- i++;
- }
- j++;
- }
- cout<<boolalpha<<(ok_righe)<<" "<<(ok_colonne)<<endl;
- }
- void popola(){
- A[0][0]=6; A[0][1]=-5; A[0][2]=-5; A[0][3]=10; A[0][4]=10;
- A[1][0]=10; A[1][1]=-39; A[1][2]=60; A[1][3]=-16; A[1][4]=-16;
- A[2][0]=10; A[2][1]=-39; A[2][2]=60; A[2][3]=-16; A[2][4]=-16;
- A[3][0]=-20; A[3][1]=-4; A[3][2]=-9; A[3][3]=40; A[3][4]=40;
- }
- // cout<<ok<<endl;
- /* visual: https://pastebin.com/raw/22z2aC0G
- int duering =0;
- int col,rig;
- while((i<N-1)&&(duering ==0)){
- col =0; rig =1; j=0;
- while ((j<M)&&(rig==1)){
- if (i<M-1){
- if (A[i][j]==A[i][j+1]){
- col=1;
- }
- }
- if (A[i][j]!=A[i+1][j]){
- rig=0;
- }
- j++;
- }
- if ((rig==1) && (col ==1)){
- duering=1;
- }
- i++;
- }
- if (duering==1){
- printf("TRUE\n");
- }else{
- printf("FALSE\n");
- }
- */
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement