Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <cmath>
- using namespace std;
- int main ()
- {
- int n, m, l=0, r, sum=0, h=0, k;
- cin >> n >> m;
- int arr[n][n];
- int count[n][n];
- int f[n];
- for (int i=0; i<n; i++)
- {
- for (int j=0; j<n; j++)
- arr[i][j]=0;
- }
- for (int i=0; i<m; i++)
- {
- cin >> l >> r;
- arr[l-1][r-1]=1;
- }
- while(1)
- {
- for (int i=0; i<n; i++)
- {
- sum = 0;
- for (int j=0; j<n; j++)
- {
- sum += arr[j][i];
- }
- if (sum==0)
- {
- k=i;
- f[h]=k;
- h++;
- break;
- }
- }
- if(sum>0)
- break;
- for (int j=0; j<n; j++)
- arr[k][j]=0;
- arr[k][k]=1;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement