View difference between Paste ID: sRsrZvKB and uzKM7vgH

 #include "stdafx.h"
 #include <stdlib.h>
 #include <cstdlib>
 #include <iostream>
 #include <time.h>
 #include <Windows.h>
 #include <string>
 #define threadCount 4
 
 #define random() (float)rand()/(float)RAND_MAX
 #define nmax 20
 CRITICAL_SECTION sekcja;
-CRITICAL_SECTION sekcja;
+using namespace std;
-using namespace std;
+    typedef int t2[nmax][nmax];
-    typedef int t2[nmax][nmax];
+    typedef int t1[nmax];
-    typedef int t1[nmax];
+
 void permInit(int n, t1 p)
-    void gnp(int n, float p, t2 A)
+
     int i;
-int i,j;
+    for (i=0;i<n;i++)
-for (i=0;i<n;i++) A[i][i] = 0;
+        p[i]=i;
-                                  for (i=0;i<n1;i++)
+
-                                      for (j=i+1;j<n;j++)
+
 int permNext(int n, t1 p)
-            A[i][j]=A[j][i]= (random() <= p);
+
     int i,j,x,b;
     b=0;
       i=n1;
         while (i>0)
     {
-    int i;
+
-    for (i=0;i<n;i++)
+
-        p[i]=i;
+            j=n1;
               while (p[j] < p[i1])
                   j;
                   x=p[j];
                     p[j]=p[i1]
-    int i;
+                         ;
-    printf("%d: ",L);
+
-    for (i=0;i<n;i++)
+                             x;
-        printf("%d ",p[i]);
+
-        printf("\n");
+
                     x=p[i]; p[i]=p[n1]
                                   ; p[n1]=
                                       x;
                                       i++; n;
-    int i,j,x,b;
+                };
-    b=0;
+            b=1;
-      i=n1;
+              break;
         }
         i;
     }
     return b;
-            j=n1;
+
 void druk(int n, int L, t1 p)
-                  j;
+
-                  x=p[j];
+    int i;
     printf("%d: ",L);
-                         ;
+    for (i=0;i<n;i++)
         printf("%d ",p[i]);
-                             x;
+        printf("\n");
     }
 
-                    x=p[i]; p[i]=p[n1]
+void gnp(int n, float p, t2 A)
-                                  ; p[n1]=
+
-                                      x;
+int i,j;
-                                      i++; n;
+for (i=0;i<n;i++) A[i][i] = 0;
-                };
+                                  for (i=0;i<n1;i++)
-            b=1;
+                                      for (j=i+1;j<n;j++)
-              break;
+
             A[i][j]=A[j][i]= (random() <= p);
-        i;
+
 }
-    return b;
+
 int maxDiffrence(int n, t2 A, t1 perm)
 {
     int dist, best = 1;
                      int i,j;
-    int dist, best = 1;
+                     for (i=0;i<n1;i++)
-                     int i,j;
+                         for (j=i+1;j<n;j++) if (A[i][j])
-                     for (i=0;i<n1;i++)
+
-                         for (j=i+1;j<n;j++) if (A[i][j])
+
                                j]);
                        if (dist>best) best = dist;
-                               j]);
+
-                       if (dist>best) best = dist;
+    return best;
 }
-    return best;
+float p = 0.5f;
           t2 A;
-float p = 0.5f;
+          t1 perm;
-          t2 A;
+          int n = 5;
-          t1 perm;
+                  int naj_r,szerokosc;
-          int n = 5;
+                  int L = 1;
-                  int naj_r,szerokosc;
+                          int* wyniki;
-                  int L = 1;
+
-                          int* wyniki;
+
     t1 permtemp;
     int x = (int)i;
-    t1 permtemp;
+            for (int j =1;j<n;j++)
-    int x = (int)i;
+
-            for (int j =1;j<n;j++)
+        permtemp[j] = perm[j];
     }
-        permtemp[j] = perm[j];
+    permtemp[0] = x;
                   permtemp[x] = 0;
-    permtemp[0] = x;
+                                int temp = 0;
-                  permtemp[x] = 0;
+                                           for (int k = 1;k<n;k++)
-                                int temp = 0;
+
-                                           for (int k = 1;k<n;k++)
+        for (int l = 1;l<n1;l++)
         {
-        for (int l = 1;l<n1;l++)
+
             {
                 temp = permtemp[l];
                        permtemp[l] = permtemp[l+1];
-                temp = permtemp[l];
+                                     permtemp[l+1] = temp;
-                       permtemp[l] = permtemp[l+1];
+
-                                     permtemp[l+1] = temp;
+
     }
     int max;
     do
-    int max;
+
         if (permtemp[0]!=x) break;
             max = maxDiffrence(n,A,permtemp);
-        if (permtemp[0]!=x) break;
+                  if (max<szerokosc) szerokosc = max;
-            max = maxDiffrence(n,A,permtemp);
+                                                     printf("Watek %d: ",x);
-                  if (max<szerokosc) szerokosc = max;
+                                                     druk(n,L,permtemp);
-                                                     printf("Watek %d: ",x);
+                                                     L++;
-                                                     druk(n,L,permtemp);
+
-                                                     L++;
+    while (permNext(n,permtemp));
         wyniki[x] = szerokosc;
-    while (permNext(n,permtemp));
+                    return 0;
-        wyniki[x] = szerokosc;
+
-                    return 0;
+
 void count ()
 {
     wyniki = new int[n];
     HANDLE *threads = new HANDLE [n];
-    wyniki = new int[n];
+    for (int i = 0; i<n ;i++)
-    HANDLE *threads = new HANDLE [n];
+
-    for (int i = 0; i<n ;i++)
+        threads[i] = CreateThread( NULL, 0, countPartially, (LPVOID) i,0,NULL);
     }
-        threads[i] = CreateThread( NULL, 0, countPartially, (LPVOID) i,0,NULL);
+    WaitForMultipleObjects((DWORD)n,threads,true,INFINITE);
     delete threads;
-    WaitForMultipleObjects((DWORD)n,threads,true,INFINITE);
+
-    delete threads;
+
 int _tmain(int argc, _TCHAR* argv[])
 {
     gnp(n,p,A);
     szerokosc = n1;
-    gnp(n,p,A);
+                permInit(n,perm);
-    szerokosc = n1;
+                count();
-                permInit(n,perm);
+                int min = n;
-                count();
+                          for (int i = 0;i<n;i++)
-                int min = n;
+
-                          for (int i = 0;i<n;i++)
+        if (wyniki[i]< min) min = wyniki[i];
         }
-        if (wyniki[i]< min) min = wyniki[i];
+    printf("\nSzerokosc grafu %d\n\n\n",min);
     system("pause");
-    printf("\nSzerokosc grafu %d\n\n\n",min);
+    return 0;
-    system("pause");
+