#include <bits/stdc++.h> using namespace std; vector<string> shapes[300]; char t[101][101]; void fix(vector<string> &v){ for(int i=1;i<v.size()-1;++i){ for(int j=0;j<v[0].size();++j){ if(v[i][j]=='1'){ int jj=j; bool czy=0; while(jj<v[0].size()-1&&v[i][jj]=='1'){ //sa 4 ale na razie tak if(v[i-1][jj+1]=='1'||(jj!=0&&v[i-1][jj-1]=='1')||v[i+1][jj-1]=='1'||v[i+1][jj+1]=='1'){ czy=1; break; } ++jj; } if(!czy&&jj<v[0].size()-1){ v[i-1][j+1]='1'; } else if(!czy){ v[i-1][j-1]='1'; } if(j!=jj)j=jj-1; } } } } vector<string> gen(){ int n=3+rand()%20; int m=3+rand()%20; vector<string>v; for(int i=0;i<n;++i){ string s=""; for(int j=0;j<m;++j){ if(rand()%12>4){ s+='1'; } else s+='0'; } v.push_back(s); } fix(v); return v; } void print(vector<string> v){ for(int i=0;i<v.size();++i){ cout<<v[i]<<endl; } cout<<"\n\n"; } void draw(int i,int j,int k){ //cout<<k<<endl; int a=0,b=0,jj=j,ii=i; while(i<100){ // cout<<shapes[k][a][b]<<endl; t[i][j]=shapes[k][a][b]; ++j; ++b; if(b==shapes[k][a].size()){ b=0; ++a; j=jj; ++i; } if(a==shapes[k].size())break; // cout<<i<<' '<<j<<endl; } } int main() { /* srand(time(NULL)); //shapes[0]={"1000","0110","0110","0010"}; for(int i=0;i<100;++i){ shapes[i]=gen(); //print(shapes[i]); } // cout<<"done"; int i=20,j=20,k=0; while(1){ // draw(i,j,k); j+=shapes[k][0].size(); if(j>99){ i+=shapes[k].size(); j=0; } if(i>99)break; k++; if(k==99)break; break; // cout<<k<<endl; } //cout<<"done"; //cout<<shapes[0].size()<<' '<<shapes[0][0].size()<<endl; for(int i=0;i<100;++i){ for(int j=0;j<100;++j){ if(t[i][j]=='1')cout<<1; else if(t[i][j]=='0')cout<<0; else cout<<"0"; } cout<<"\n"; } */ cout<<1<<0; for(int i=0;i<98;++i)cout<<0; cout<<"\n"; for(int i=0;i<99;++i){ // cout<<0; for(int j=0;j<100;++j){ if(i==0&&j==0||(j==0))cout<<0; // else if((i%8==5||i%8==6||i%8==7)&&j==0)cout<<1; else if(j==99)cout<<1;//i%8==1||i%8==2||i%8==3)&& else if(i%2==0)cout<<1; else cout<<0; } cout<<"\n"; } return 0; } /* 0000000000000000000000000000000000000000000000000000000111100000000000000001110000000000000000000000 0000000000000000000000000000000000000000000000000100000111100000000000000010000000000000000000000000 0000000000000000000000000000000000000000000000000010000111100000000000000010000001110000000000000000 0000000000000000000000000000000000000000000000000001000111100000000000000010011111110000000000000000 0000000000000000000000000000000000000000000000000000100000000000000000000010010001110000000000000000 0000000000000000000000000000000000000000000000000000011110000000000000000010100000000000000000000000 0000000000000000000000000000000000000000000000000000000001000000000000000010000000000000000000000000 0000000000000000000000000000000000000000000000000000000000100000000001111110000000000000000000000000 0000000000000000000000000000000000000000000000000000000000010000000010000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000001111111100000000000000000000000000000000 */
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 | #include <bits/stdc++.h> using namespace std; vector<string> shapes[300]; char t[101][101]; void fix(vector<string> &v){ for(int i=1;i<v.size()-1;++i){ for(int j=0;j<v[0].size();++j){ if(v[i][j]=='1'){ int jj=j; bool czy=0; while(jj<v[0].size()-1&&v[i][jj]=='1'){ //sa 4 ale na razie tak if(v[i-1][jj+1]=='1'||(jj!=0&&v[i-1][jj-1]=='1')||v[i+1][jj-1]=='1'||v[i+1][jj+1]=='1'){ czy=1; break; } ++jj; } if(!czy&&jj<v[0].size()-1){ v[i-1][j+1]='1'; } else if(!czy){ v[i-1][j-1]='1'; } if(j!=jj)j=jj-1; } } } } vector<string> gen(){ int n=3+rand()%20; int m=3+rand()%20; vector<string>v; for(int i=0;i<n;++i){ string s=""; for(int j=0;j<m;++j){ if(rand()%12>4){ s+='1'; } else s+='0'; } v.push_back(s); } fix(v); return v; } void print(vector<string> v){ for(int i=0;i<v.size();++i){ cout<<v[i]<<endl; } cout<<"\n\n"; } void draw(int i,int j,int k){ //cout<<k<<endl; int a=0,b=0,jj=j,ii=i; while(i<100){ // cout<<shapes[k][a][b]<<endl; t[i][j]=shapes[k][a][b]; ++j; ++b; if(b==shapes[k][a].size()){ b=0; ++a; j=jj; ++i; } if(a==shapes[k].size())break; // cout<<i<<' '<<j<<endl; } } int main() { /* srand(time(NULL)); //shapes[0]={"1000","0110","0110","0010"}; for(int i=0;i<100;++i){ shapes[i]=gen(); //print(shapes[i]); } // cout<<"done"; int i=20,j=20,k=0; while(1){ // draw(i,j,k); j+=shapes[k][0].size(); if(j>99){ i+=shapes[k].size(); j=0; } if(i>99)break; k++; if(k==99)break; break; // cout<<k<<endl; } //cout<<"done"; //cout<<shapes[0].size()<<' '<<shapes[0][0].size()<<endl; for(int i=0;i<100;++i){ for(int j=0;j<100;++j){ if(t[i][j]=='1')cout<<1; else if(t[i][j]=='0')cout<<0; else cout<<"0"; } cout<<"\n"; } */ cout<<1<<0; for(int i=0;i<98;++i)cout<<0; cout<<"\n"; for(int i=0;i<99;++i){ // cout<<0; for(int j=0;j<100;++j){ if(i==0&&j==0||(j==0))cout<<0; // else if((i%8==5||i%8==6||i%8==7)&&j==0)cout<<1; else if(j==99)cout<<1;//i%8==1||i%8==2||i%8==3)&& else if(i%2==0)cout<<1; else cout<<0; } cout<<"\n"; } return 0; } /* 0000000000000000000000000000000000000000000000000000000111100000000000000001110000000000000000000000 0000000000000000000000000000000000000000000000000100000111100000000000000010000000000000000000000000 0000000000000000000000000000000000000000000000000010000111100000000000000010000001110000000000000000 0000000000000000000000000000000000000000000000000001000111100000000000000010011111110000000000000000 0000000000000000000000000000000000000000000000000000100000000000000000000010010001110000000000000000 0000000000000000000000000000000000000000000000000000011110000000000000000010100000000000000000000000 0000000000000000000000000000000000000000000000000000000001000000000000000010000000000000000000000000 0000000000000000000000000000000000000000000000000000000000100000000001111110000000000000000000000000 0000000000000000000000000000000000000000000000000000000000010000000010000000000000000000000000000000 0000000000000000000000000000000000000000000000000000000000001111111100000000000000000000000000000000 */ |