Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- ifstream f("bipartitcomplet.in");
- ofstream g("bipartitcomplet.out");
- int n,m,ma[101][101],i,cnt,j,v[101];
- int ver(int um)
- {
- for(int q=1; q<=m; q++)if(um==v[q])return 0;
- return 1;
- }
- int main()
- {
- f>>n>>m;
- for(i=1; i<=m; i++)f>>v[i];
- for(i=1; i<=n; i++)
- {
- for(j=1; j<=n; j++)
- {
- if(ver(j)!=ver(i)) ma[i][j]=1;
- else ma[i][j]=0;
- }
- }
- for(i=1; i<=n; i++)
- {
- for(j=1; j<=n; j++)
- g<<ma[i][j]<<' ';
- g<<endl;
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement