Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- int n4[1000000];
- int ci[111][111],n2[1000000],n3[1000000];
- bool bo[1400][1400],bo1[100000],bo2[100000],used[100000];
- char ch[150000],ch1[1000][1000],tz[1000000];
- vector< int > v;
- void dfs(int x)
- {
- used[x] = true;
- for(int y = 1; y <= n; y++){
- if(c[x][y] == 0){ // agar ki rebro nabowa
- continue;
- }
- if(used[x] == 1){ // agar ki i verwina uje raftagi bowem
- continue;
- }
- dfs(y);
- }
- }
- int main()
- {
- freopen("input.txt", "r", stdin);
- freopen("output.txt", "w", stdout);
- int n,s;
- cin>>n>>s;
- for( int i=0; i<n; i++ ){
- for( int i=0; i<n; i++ ){
- cin>>c[i][j];
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement