Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <fstream>
- #define N 1008
- #define M 1005
- using namespace std;
- char a[N][M];
- int zero[7][4]=
- {
- {0,1,1,0},
- {1,0,0,1},
- {1,0,0,1},
- {1,0,0,1},
- {1,0,0,1},
- {1,0,0,1},
- {0,1,1,0},
- };
- int unu[7][4]=
- {
- {0,0,1,0},
- {0,1,1,0},
- {1,0,1,0},
- {0,0,1,0},
- {0,0,1,0},
- {0,0,1,0},
- {0,1,1,1},
- };
- int doi[7][4]=
- {
- {0,1,1,0},
- {1,0,0,1},
- {1,0,0,1},
- {0,0,1,0},
- {0,1,0,0},
- {1,0,0,0},
- {1,1,1,1},
- };
- int trei[7][4]=
- {
- {0,1,1,0},
- {1,0,0,1},
- {1,0,0,1},
- {0,0,1,0},
- {1,0,0,1},
- {1,0,0,1},
- {0,1,1,0},
- };
- int patru[7][4]=
- {
- {0,0,1,0},
- {0,1,0,0},
- {1,0,0,0},
- {1,1,1,1},
- {0,0,1,0},
- {0,0,1,0},
- {0,0,1,0},
- };
- int cinci[7][4]=
- {
- {0,1,1,1},
- {1,0,0,0},
- {1,0,0,0},
- {0,1,1,0},
- {0,0,0,1},
- {1,0,0,1},
- {0,1,1,0},
- };
- int sase[7][4]=
- {
- {0,1,1,0},
- {1,0,0,1},
- {1,0,0,0},
- {1,1,1,0},
- {1,0,0,1},
- {1,0,0,1},
- {0,1,1,0},
- };
- int sapte[7][4]=
- {
- {1,1,1,1},
- {0,0,0,1},
- {0,0,1,0},
- {0,0,1,0},
- {0,1,0,0},
- {0,1,0,0},
- {0,1,0,0},
- };
- int opt[7][4]=
- {
- {0,1,1,0},
- {1,0,0,1},
- {1,0,0,1},
- {0,1,1,0},
- {1,0,0,1},
- {1,0,0,1},
- {0,1,1,0},
- };
- int noua[7][4]=
- {
- {0,1,1,0},
- {1,0,0,1},
- {1,0,0,1},
- {0,1,1,1},
- {0,0,0,1},
- {1,0,0,1},
- {0,1,1,0},
- };
- void umple(int c[][4],int lin,int col)
- {
- for(int i=0;i<7;++i)
- for(int j=0;j<4;++j)
- if(c[i][j])
- a[lin+i][col+j]='1';
- }
- int main()
- {
- int n,m,c;
- ifstream f("cifre13.in");
- f>>n>>m>>c;
- int t,lin,col;
- while(c--)
- {
- f>>t>>lin>>col;
- switch(t)
- {
- case 0: umple(zero,lin,col);break;
- case 1: umple(unu,lin,col);break;
- case 2: umple(doi,lin,col);break;
- case 3: umple(trei,lin,col);break;
- case 4: umple(patru,lin,col);break;
- case 5: umple(cinci,lin,col);break;
- case 6: umple(sase,lin,col);break;
- case 7: umple(sapte,lin,col);break;
- case 8: umple(opt,lin,col);break;
- case 9: umple(noua,lin,col);break;
- }
- }
- f.close();
- int sol=0;
- for(int i=1;i<=n;++i)
- for(int j=1;j<=m;++j)
- if(a[i][j]=='1')
- ++sol;
- ofstream g("cifre13.out");
- g<<sol;
- g.close();
- return 0;
- }
Add Comment
Please, Sign In to add comment