Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <fstream>
- #include <bitset>
- #define MAX 505
- using namespace std;
- ifstream fin("pereti.in");
- ofstream fout("pereti.out");
- bitset<32> v[5]= {7, 11, 13, 14};
- struct bits
- {
- int valnat,doors=0;
- bitset<32>pebiti;
- };
- bits a[MAX][MAX];
- void bitwall();
- bitset<32> bitconversion(int a);
- int main()
- {
- bitwall();
- return 0;
- }
- bitset<32> bitconversion(int a)
- {
- bitset <32> x = a;
- return x;
- }
- void bitwall()
- {
- int n, m;
- fin>>n>>m;
- for(int i=1; i<=n; i++)
- {
- for(int j=1; j<=m; j++)
- {
- fin>>a[i][j].valnat;
- a[i][j].pebiti= bitconversion(a[i][j].valnat);
- }
- }
- fin.close();
- /*for(int i=1; i<=n; i++)
- {
- for(int j=1; j<=m; j++)
- {
- fout<<a[i][j].pebiti<<endl;
- }
- }*/
- for(int i=1; i<=n; i++)
- {
- for(int j=1; j<=m; j++)
- {
- for(int k=0; k<4; k++)
- {
- if((v[k] | a[i][j].pebiti)==v[k])
- {
- a[i][j].doors+=1;
- ///fout<<a[i][j].valnat<<" are minim o usa."<<endl;
- }
- }
- }
- }
- for(int i=1; i<=n; i++)
- {
- for(int j=1; j<=m; j++)
- {
- fout<<a[i][j].valnat<<" are "<<a[i][j].doors<<" usi."<<endl;
- }
- }
- fout.close();
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement