Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- #define N 1000
- using namespace std;
- ifstream fin("criptare.in");
- ofstream fout("criptare.out");
- int a[N+5][N+5], n;
- int L[N+5], C[N+5], l, c;
- void citire()
- {
- int i, j;
- fin >> n;
- for(i=1;i<=n;++i)
- for(j=1;j<=n;++j)
- fin >> a[i][j];
- fin.close();
- }
- void afisare()
- {
- fout << max(l, c);
- fout << "\n";
- int m=min(l,c), i;
- for(i=1;i<=m;++i)
- fout << L[i] << " " << C[i] << "\n";
- for(i=m+1;i<=l;++i)
- fout << L[i] << " 1" << "\n";
- for(i=m+1;i<=c;++i)
- fout << "1 " << C[i] << "\n";
- fout.close();
- }
- void prelucrare()
- {
- int i, j;
- bool este;
- for(i=1;i<=n;++i)
- {
- este=1;
- for(j=1;j<=n;++j)
- if(a[i][j]!=0) este=0;
- if(este) L[++l]=i;
- }
- for(j=1;j<=n;++j)
- {
- este=1;
- for(i=1;i<=n;++i)
- if(a[i][j]!=0) este=0;
- if(este) C[++c]=j;
- }
- }
- int main()
- {
- citire();
- prelucrare();
- afisare();
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement