text
stringlengths 49
983k
|
|---|
#include <bits/stdc++.h>
const int maxn = (int)1e3 + 111;
const int mod = (int)1e9 + 7;
using namespace std;
int n, a[maxn][maxn];
int main() {
scanf("%d", &n);
a[0][0] = 1;
for (int i = 0; i < n; i++) {
int k = 1 << i;
for (int i = 0; i < k; i++) {
for (int j = 0; j < k; j++) {
a[i + k][j] = a[i][j + k] = a[i + k][j + k] = a[i][j];
}
}
for (int i = 0; i < k; i++) {
for (int j = 0; j < k; j++) {
a[i + k][j] *= -1;
}
}
}
int k = 1 << n;
for (int i = 0; i < k; i++) {
for (int j = 0; j < k; j++) {
if (a[i][j] == 1)
printf("%c", '+');
else
printf("%c", '*');
}
printf("\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
if (n == 0) {
printf("+");
return 0;
}
string s[20004];
string ans[20004];
ans[0] = "++", ans[1] = "+*";
for (int i = 1; i < n; i++) {
for (int j = 0; j < (1 << i); j++) {
s[j] = ans[j];
ans[j] += ans[j];
}
for (int j = 1 << i, k = 0; j < (1 << (i + 1)); j++, k++) {
ans[j] = s[k];
for (int m = 0; m < s[k].size(); m++) {
if (s[k][m] == '+')
ans[j] += '*';
else
ans[j] += '+';
}
}
}
for (int i = 0; i < (1 << n); i++) {
cout << ans[i] << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
double Fib(double x, double z);
string BinDec(unsigned long long x);
string StringInt(long long x);
unsigned long long StringInt(string x);
unsigned long long BinDec(string x);
unsigned long long POWMOD(unsigned long long x, unsigned long long y,
unsigned long long mod);
unsigned long long POWE(long long, long long);
long long fast_pow(long long a, long long b, long long mod) {
if (b == 0) return 1ll;
long long ans = 1;
if (b % 2) return ans = (fast_pow(a, b - 1, mod) * a) % mod;
ans = (fast_pow(a, b / 2, mod) % mod);
return ((ans * ans) % mod);
}
string in(string b) {
string a;
for (int i = 0; i < b.size(); i++) {
if (b[i] == '+')
a += '*';
else
a += '+';
}
return a;
}
char a[4000][4000], d[4000][4000];
char t[4000][4000], t3[4000][4000];
void rec(int i) {
if (i == 0) {
a[0][0] = '+';
d[0][0] = '*';
return;
}
rec(i - 1);
int j, k, s = (1 << (i - 1));
for (j = 0; j < s; j++) {
for (k = 0; k < s; k++) {
t[j][k] = t[j + s][k] = t[j][k + s] = a[j][k];
t[j + s][k + s] = d[j][k];
t3[j][k] = t3[j + s][k] = t3[j][k + s] = d[j][k];
t3[j + s][k + s] = a[j][k];
}
}
s *= 2;
for (j = 0; j < s; j++) {
for (k = 0; k < s; k++) {
a[j][k] = t[j][k];
d[j][k] = t3[j][k];
}
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int x;
string z;
cin >> x;
x++;
rec(x);
int j, k, s = (1 << (x - 1));
for (j = 0; j < s; j++) {
for (k = 0; k < s; k++) {
cout << a[j][k];
}
cout << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int mod = 1000000007;
const double PI = acos(-1), ebs = 1e-8;
vector<vector<double> > Matrix_Zero(int n, int m) {
return vector<vector<double> >(n, vector<double>(m, 0.0));
}
vector<vector<double> > Matrix_Ident(int n) {
vector<vector<double> > Res = Matrix_Zero(n, n);
for (int i = 0; i < n; i++) Res[i][i] = 1.0;
return Res;
}
vector<vector<double> > Matrix_Multy(const vector<vector<double> >& A,
const vector<vector<double> >& B) {
assert(A[0].size() == B.size());
vector<vector<double> > Res = Matrix_Zero(A.size(), B[0].size());
for (int i = 0; i < A.size(); i++)
for (int j = 0; j < B[0].size(); j++)
for (int k = 0; k < A[0].size(); k++) Res[i][j] += A[i][k] * B[k][j];
return Res;
}
vector<vector<double> > Matrix_Power(const vector<vector<double> >& A, int k) {
if (!k) return Matrix_Ident(A.size());
if (k & 1) return Matrix_Multy(A, Matrix_Power(A, k - 1));
return Matrix_Power(Matrix_Multy(A, A), k >> 1);
}
string add(string s1, string s2) {
reverse(s1.begin(), s1.end());
reverse(s2.begin(), s2.end());
string ss = "";
int i = 0, j = 0, nxt = 0;
while (i < s1.size() || j < s2.size() || nxt) {
int temp = (i < s1.size() ? s1[i] - '0' : 0) +
(j < s2.size() ? s2[j] - '0' : 0) + nxt;
ss.push_back(temp % 10 + '0');
nxt = temp / 10;
i++, j++;
}
reverse(ss.begin(), ss.end());
return ss;
}
void yes() { cout << "YES" << '\n'; }
void no() { cout << "NO" << '\n'; }
bool cmp(const pair<int, string>& a, const pair<int, string>& b) {
return (a.first > b.first);
}
long long int ceil(long long int x, long long int y) {
return x % y ? x / y + 1 : x / y;
}
long long int power(long long int x, long long int y, long long int mo) {
long long int r = 1;
x = x % mo;
while (y) {
if (y & 1) r = (r * x % mo) % mo;
y = y >> 1;
x = ((x % mo) * (x % mo)) % mo;
}
return r % mo;
}
long long int gcd(long long int x, long long int y) {
return y ? gcd(y, x % y) : x;
}
long long int fac(long long int x) { return (x ? x * fac(x - 1) : 1); }
long long int inv(long long int x, long long int y) {
return (x * power(y, mod - 2, mod)) % mod;
}
long long int Twafiq(int n, int r) {
long long int res = fac(n);
long long int div = fac(n - r) * fac(r);
div %= mod;
div = power(div, mod - 2, mod);
return (res * div) % mod;
}
void GO() {
ios_base::sync_with_stdio(false), cin.tie(NULL);
cout << fixed << setprecision(12);
}
long long int n;
string nott(string s) {
for (int i = 0; i < s.size(); i++) {
if (s[i] == '+')
s[i] = '*';
else
s[i] = '+';
}
return s;
}
vector<string> mul(vector<string> v) {
vector<string> vv;
for (int i = 0; i < v.size(); i++) {
vv.push_back(v[i] + v[i]);
}
for (int i = 0; i < v.size(); i++) {
vv.push_back(v[i] + nott(v[i]));
}
return vv;
}
vector<string> solve(int i) {
if (i == 0) {
vector<string> v;
v.push_back("+");
return v;
}
return mul(solve(i - 1));
}
int main() {
cin >> n;
vector<string> ans = solve(n);
for (auto s : ans) cout << s << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, k, ans, v1, v2;
char a[3000][3000];
bool ok;
int main() {
cin >> n;
a[1][1] = '+';
k = 1;
for (int w = 1; w <= n; w++) {
for (int i = 1; i <= k; i++)
for (int j = 1; j <= k; j++) a[i][j + k] = a[k - j + 1][k - i + 1];
for (int i = 1; i <= k; i++)
for (int j = 1; j <= k; j++) a[i + k][j] = a[k - i + 1][j];
for (int i = 1; i <= k; i++)
for (int j = 1; j <= k; j++)
if (a[k - i + 1][j + k] == '+')
a[i + k][j + k] = '*';
else
a[i + k][j + k] = '+';
k *= 2;
}
for (int i = 1; i <= k; i++) {
for (int j = 1; j <= k; j++) cout << a[i][j];
cout << "\n";
}
cin >> n;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long int n;
char ans[1000][1000] = {0};
void solve(int k) {
if (k == 1) {
ans[0][0] = '+';
return;
}
k = k >> 1;
solve(k);
for (int i = 0; i < k; i++) {
for (int j = 0; j < k; j++) {
ans[i][j + k] = ans[i][j];
ans[i + k][j] = ans[i][j];
ans[i + k][j + k] = ans[i][j] == '+' ? '*' : '+';
}
}
return;
}
int main() {
cin >> n;
n = 1 << n;
solve(n);
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cout << ans[i][j];
}
cout << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long linf = 1000000000000000043;
const int inf = 1000000043;
void pause(bool a = true) {}
template <class T>
inline T prod(pair<T, T> a, pair<T, T> b, pair<T, T> c = make_pair(0, 0)) {
return (a.first - c.first) * (b.second - c.second) -
(a.second - c.second) * (b.first - c.first);
}
template <class T>
inline bool intriangle(pair<T, T> a, pair<T, T> b, pair<T, T> c, pair<T, T> d) {
return (abs(prod(a, b, c)) ==
abs(prod(a, b, d)) + abs(prod(a, c, d)) + abs(prod(b, c, d)));
}
template <class T>
inline int sg(T a) {
return (a < 0 ? -1 : a ? 1 : 0);
}
long long rng(long long a, long long b) {
return (((((long long)rand()) << 16) + rand()) % (b - a + 1)) + a;
}
bool inConvPoly(const vector<pair<long long, long long>> &a,
pair<long long, long long> b) {
long long l = 1;
long long r = a.size() - 1;
if (sg(prod(a[l], b, a[0])) * sg(prod(a[r], b, a[0])) >= 0) return false;
if (intriangle(a[l], a[r], a[0], b)) return true;
while (l != r - 1)
(prod(a[(l + r) / 2], b, a[0]) < 0) ? l = (l + r) / 2 : r = (l + r) / 2;
return sg(prod(b, a[r], a[l])) * sg(prod(b, a[0], a[l])) < 0;
}
template <class T>
T mex(vector<T> a) {
set<T> b(a.begin(), a.end());
for (int i = 0;; ++i)
if (!b.count(i)) return i;
}
long long gcd(long long a, long long b) {
while (b) {
a %= b;
swap(a, b);
}
return a;
}
long long lcm(long long a, long long b) { return a * b / gcd(a, b); }
template <class T>
inline const T sqr(const T &x) {
return x * x;
}
unsigned long long powi(unsigned long long a, unsigned long long b,
long long mod = 1000000007) {
if (b < 2) return b ? a : 1;
return (powi((a * a) % mod, b / 2, mod) * (b % 2 ? a : 1)) % mod;
}
bool isn(char c) { return ('0' <= c && c <= '9'); }
template <class T>
bool read(T &out) {
int c = getchar(), sign = 1;
T num = 0;
for (; !isn(c) && c != '-'; c = getchar())
if (c == EOF) return false;
if (c == '-') {
sign = -1;
c = getchar();
}
if (c == EOF) return false;
for (; isn(c); c = getchar()) num = num * 10 + c - '0';
out = sign * num;
return true;
}
long long time_limit = 1000000;
long long start = clock();
bool time_break() {
int g = clock();
return (clock() - start > time_limit * 0.8);
}
long long fact(long long n, long long mod = linf) {
long long g = 1;
for (int i = 0; i < (n); i++) g *= (i + 1);
return g;
}
void init(long long tl = 1000000) {
ios::sync_with_stdio(false);
srand(time(0));
time_limit = tl;
}
template <class T>
void maxz(T &a, T b) {
a = max(a, b);
}
template <class T>
void minz(T &a, T b) {
a = min(a, b);
}
long long mod7 = 1000000007;
long long mod9 = 1000000009;
bool isprime(long long n) {
if (n < 2) return 0;
for (long long i = 2; i * i <= n; i++)
if (n % i == 0) return 0;
return 1;
}
long long randLL() {
return (((long long)rand()) << 47) + (((long long)rand()) << 31) +
(((long long)rand()) << 15) + (((long long)rand()) >> 1);
}
bool isprimeL(long long n, int it = 50) {
if (n < 2) return 0;
if (n == 2) return 1;
if (n % 2 == 0) return 0;
for (int i = 0; i < (it); i++) {
long long x = randLL() % (n - 1) + 1;
if (gcd(x, n) != 1) return 0;
if (powi(x, n - 1, n) != 1) return 0;
}
return 1;
}
vector<vector<int>> get(int k) {
if (k == 0) return vector<vector<int>>(1, vector<int>(1, 1));
auto g = get(k - 1);
vector<vector<int>> a(1 << k, vector<int>(1 << k, 0));
long long d = 1 << (k - 1);
for (int i = 0; i < (d); i++)
for (int j = 0; j < (d); j++) a[i][j] = g[i][j];
for (int i = 0; i < (d); i++)
for (int j = 0; j < (d); j++) a[i + d][j] = g[i][j];
for (int i = 0; i < (d); i++)
for (int j = 0; j < (d); j++) a[i][j + d] = g[i][j];
for (int i = 0; i < (d); i++)
for (int j = 0; j < (d); j++) a[i + d][j + d] = -g[i][j];
return a;
}
int main() {
ios::sync_with_stdio(false);
int k;
cin >> k;
auto ans = get(k);
for (int i = 0; i < (ans.size()); i++) {
for (int j = 0; j < (ans[i].size()); j++)
cout << (ans[i][j] == 1 ? "+" : "*");
cout << endl;
}
pause();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e3, mod = 1e9 + 7;
vector<string> v[10 + 2];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
v[0].push_back("1");
v[1].push_back("11");
v[1].push_back("10");
for (int i = 2; i <= 9; i++) {
string a, b;
for (int j = 0; j < (1 << i); j++) a.push_back('1');
v[i].push_back(a);
for (int j = 0; j < (1 << (i - 1)); j++) b.push_back('1');
for (int j = 0; j < (1 << (i - 1)); j++) b.push_back('0');
v[i].push_back(b);
for (int j = 1; j < v[i - 1].size(); j++) {
a = v[i - 1][j];
v[i].push_back(a + a);
b.clear();
for (int k = 0; k < a.size(); k++) {
if (a[k] == '0')
b.push_back('1');
else
b.push_back('0');
}
v[i].push_back(a + b);
}
}
int n;
cin >> n;
for (auto x : v[n]) {
for (auto z : x) {
if (z == '1')
cout << '+';
else
cout << '*';
}
cout << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long N = 100000000;
class Harmony {
int n;
int a[515][515] = {};
public:
void read() { cin >> n; }
void gen() { a[1][1] = 1; }
void next_gen(int k) {
for (int i = 1; i <= pow(2, k - 1); i++)
for (int j = pow(2, k - 1) + 1, k1 = 1; j <= pow(2, k); j++, k1++)
a[i][j] = a[i][k1];
for (int i = pow(2, k - 1) + 1, k1 = 1; i <= pow(2, k); i++, k1++)
for (int j = 1; j <= pow(2, k - 1); j++) a[i][j] = a[k1][j];
for (int i = pow(2, k - 1) + 1, k1 = 1; i <= pow(2, k); i++, k1++)
for (int j = pow(2, k - 1) + 1, l = 1; j <= pow(2, k); j++, l++)
a[i][j] = -a[k1][l];
if (k < n) next_gen(k + 1);
}
void show_ans() {
for (int i = 1; i <= pow(2, n); i++) {
for (int j = 1; j <= pow(2, n); j++)
if (a[i][j] == 1)
printf("+");
else
printf("*");
printf("\n");
}
}
};
int main() {
Harmony har;
har.read();
har.gen();
har.next_gen(1);
har.show_ans();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<string> v[10];
void solve(int n) {
if (n == 1) {
v[1].push_back("++");
v[1].push_back("*+");
return;
}
solve(n - 1);
for (int i = 0; i < v[n - 1].size(); i++) {
v[n].push_back(v[n - 1][i] + v[n - 1][i]);
string tmp = v[n - 1][i];
for (int j = 0; j < tmp.size(); j++)
if (tmp[j] == '+')
tmp[j] = '*';
else
tmp[j] = '+';
v[n].push_back(v[n - 1][i] + tmp);
}
}
int main() {
int n;
scanf("%d", &n);
if (n == 0) {
cout << "+" << endl;
return 0;
}
solve(n);
for (int i = 0; i < v[n].size(); i++) printf("%s\n", v[n][i].c_str());
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, k = 1, i;
cin >> n;
if (n == 0) {
cout << "+" << endl;
return 0;
}
vector<string> ans(2);
ans[0] = "++";
ans[1] = "+*";
while (k < n) {
vector<string> temp;
for (i = 0; i < ans.size(); i++) {
temp.push_back(ans[i] + ans[i]);
string flip;
for (int j = 0; j < ans[i].size(); j++)
flip.push_back((ans[i][j] == '*') ? '+' : '*');
temp.push_back(ans[i] + flip);
}
k++;
ans = temp;
}
stringstream out;
for (i = 0; i < ans.size(); i++) {
out << ans[i] << endl;
}
cout << out.str();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
int mp[1 << 10][1 << 10];
void rec(int k) {
if (k == 0) {
mp[0][0] = 1;
} else {
int i, j;
rec(k - 1);
for (i = (1 << (k - 1)); i < (1 << k); i++)
for (j = 0; j < (1 << (k - 1)); j++) mp[i][j] = mp[i - (1 << (k - 1))][j];
for (j = 0; j < (1 << (k - 1)); j++)
for (i = (1 << (k - 1)); i < (1 << k); i++)
mp[j][i] = mp[j][i - (1 << (k - 1))];
for (i = (1 << (k - 1)); i < (1 << k); i++)
for (j = (1 << (k - 1)); j < (1 << k); j++)
mp[i][j] = !mp[i][j - (1 << (k - 1))];
}
}
int main() {
cin >> n;
rec(n);
int i, j;
for (i = 0; i < (1 << n); i++) {
for (j = 0; j < (1 << n); j++) {
if (mp[i][j])
printf("+");
else
printf("*");
}
printf("\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2048;
string s[maxn];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int k;
cin >> k;
if (k == 0) {
cout << '*' << endl;
return 0;
}
s[0] = "+";
for (int i = 0; i < k; i++) {
int mab = (1 << i);
for (int j = 0; j < (1 << i); j++) {
s[mab + j] = s[j];
string t = "";
for (int l = 0; l < (int)s[j].size(); l++) {
if (s[j][l] == '+')
t.push_back('*');
else
t.push_back('+');
}
s[j] = s[j] + s[j];
s[mab + j] = s[mab + j] + t;
}
}
for (int i = 0; i < (1 << k); i++) cout << s[i] << endl;
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int k, i, j;
scanf("%d", &k), k = 1 << k;
for (i = 0; i < k; i++, puts(""))
for (j = 0; j < k; j++) putchar(__builtin_parity(i & j) ? '+' : '*');
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 1050;
int grid[12][N][N];
int n, pot;
void pintar(int f, int c, int l, int ok, int k) {
for (int i = f; i < f + l; i++) {
for (int j = c; j < c + l; j++) {
grid[k][i][j] = grid[k - 1][i - f][j - c] * ok;
}
}
}
int main() {
scanf("%d", &n);
pot = 1;
grid[0][0][0] = 1;
for (int i = 1; i <= n; i++) {
pot *= 2;
int t = pot / 2;
pintar(0, 0, t, 1, i);
pintar(0, t, t, 1, i);
pintar(t, 0, t, 1, i);
pintar(t, t, t, -1, i);
}
for (int i = 0; i < (int)(pot); i++) {
for (int j = 0; j < (int)(pot); j++) {
printf("%c", grid[n][i][j] == 1 ? '+' : '*');
}
puts("");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1025;
inline void read(int &x) {
x = 0;
int f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-') f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + ch - '0';
ch = getchar();
}
x *= f;
}
inline void judge() {
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
}
int ans[maxn][maxn];
inline void get(int x) {
if (x == 0) {
ans[1][1] = 1;
return;
}
get(x - 1);
int n = 1 << (x - 1);
for (int i = (1); i <= (n); i++)
for (int j = (n + 1); j <= (n << 1); j++) ans[i][j] = ans[i][j - n];
for (int i = (n + 1); i <= (n << 1); i++)
for (int j = (1); j <= (n); j++) ans[i][j] = ans[i - n][j];
for (int i = (n + 1); i <= (n << 1); i++)
for (int j = (n + 1); j <= (n << 1); j++) ans[i][j] = -ans[i][j - n];
}
int main() {
int k;
read(k);
get(k);
for (int i = (1); i <= ((1 << k)); i++) {
for (int j = (1); j <= ((1 << k)); j++)
if (ans[i][j] == 1)
putchar('+');
else
putchar('*');
puts("");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = (int)1e9;
const double EPS = (long double)1e-7;
bool f(int x, int y, int t) {
if (t == 0) return true;
int l = (1 << --t);
bool b = (x >= l) && (y >= l);
if (x >= l) x = 2 * l - x - 1;
if (y >= l) y = 2 * l - y - 1;
assert(x < l && y < l);
return b ^ f(x, y, t);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
for (int x = (0); x < (int)((1 << n)); ++x) {
for (int y = (0); y < (int)((1 << n)); ++y) {
cout << (f(x, y, n) ? '+' : '*');
}
cout << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char a[1 << 9][1 << 9];
void solve(int n) {
if (n == 0) {
a[0][0] = '+';
return;
}
solve(n - 1);
n = 1 << (n - 1);
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++) {
a[i + n][j] = a[i][j + n] = a[i][j];
a[i + n][j + n] = '+' + '*' - a[i][j];
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
solve(n);
for (int i = 0; i < 1 << n; i++) {
for (int j = 0; j < 1 << n; j++) cout << a[i][j];
cout << '\n';
}
}
|
#include <bits/stdc++.h>
using namespace std;
int n, a[600][600], x = 1;
int main() {
cin >> n;
a[1][1] = 1;
for (int i = 1; i <= n; i++, x *= 2)
for (int u = 1; u <= x; u++)
for (int v = 1; v <= x; v++) {
a[u + x][v] = a[u][v + x] = a[u][v];
a[u + x][v + x] = -a[u][v];
}
for (int u = 1; u <= x; u++) {
for (int v = 1; v <= x; v++) printf("%c", a[u][v] == 1 ? '+' : '*');
printf("\n");
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 515;
char a[maxn][maxn][10];
void solve(int x);
int main() {
int n;
cin >> n;
a[0][0][0] = '+';
for (int i = 1; i <= n; i++) solve(i);
for (int i = 0; i < pow(2, n); i++) {
for (int j = 0; j < pow(2, n); j++) cout << a[i][j][n];
cout << endl;
}
}
void solve(int x) {
int t = pow(2, x);
int m = pow(2, x - 1);
for (int i = 0; i < m; i++) {
for (int j = 0; j < m; j++) {
a[i][j][x] = a[i][j][x - 1];
a[i + m][j][x] = a[i][j][x];
a[i][j + m][x] = a[i][j][x];
}
}
for (int i = m; i < t; i++) {
for (int j = m; j < t; j++) {
if (a[i - m][j - m][x - 1] == '+')
a[i][j][x] = '*';
else
a[i][j][x] = '+';
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
cout.tie(0);
int n;
cin >> n;
int run = 1 << n;
for (int i = 0; i < run; i++) {
for (int j = 0; j < run; j++) {
if (__builtin_parity(i & j))
putchar('*');
else
putchar('+');
}
putchar('\n');
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long power(long long a, long long b) {
long long x = 1, y = a;
while (b > 0) {
if (b % 2 == 1) {
x = (x * y);
}
y = (y * y);
b /= 2;
}
return x;
}
int main() {
ios_base::sync_with_stdio(0);
long long k;
cin >> k;
long long n = power(2, k);
if (n == 1) {
cout << "+\n";
return 0;
}
if (n == 2) {
cout << "+*\n";
cout << "++\n";
return 0;
}
long long y = power(2, 9);
string a[y + 1];
string ra[y + 1];
a[0] = "++**";
ra[0] = "**++";
a[1] = "+*+*";
ra[1] = "*+*+";
a[2] = "++++";
ra[2] = "****";
a[3] = "+**+";
ra[3] = "*++*";
if (n == 4) {
for (int i = 0; i < 4; i++) {
cout << a[i] << "\n";
}
return 0;
}
string b[y + 1];
for (long long i = 3; i <= k; i++) {
long long x = power(2, i);
for (long long j = 0; j < x / 2; j++) {
b[j] = a[j] + a[j];
}
for (long long j = 0; j < x / 2; j++) {
b[j + x / 2] = ra[j] + a[j];
}
for (long long j = 0; j < x; j++) {
a[j] = b[j];
}
for (long long j = 0; j < x; j++) {
string t = a[j];
ra[j].resize(t.length());
for (long long q = 0; q < t.length(); q++) {
if (t[q] == '+')
ra[j][q] = '*';
else
ra[j][q] = '+';
}
}
}
for (long long i = 0; i < n; i++) {
cout << b[i] << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long k, m, n;
bool a[1000][1000];
long long mx(long long a, long long b) { return a < b ? b : a; }
int main() {
a[0][0] = 1;
a[0][1] = 1;
a[1][0] = 1;
a[1][1] = 0;
cin >> k;
if (k == 0) {
cout << "+" << endl;
return 0;
} else
for (int i = 2; i <= k; i++) {
n = 1 << i;
n /= 2;
bool b[1000][1000];
for (int u = 0; u < n; u++)
for (int y = 0; y < n; y++) b[u][y] = a[u][n - y - 1];
for (int j = n; j < 2 * n; j++)
for (int u = 0; u < n; u++) a[j][u] = a[j - n][u];
for (int j = 0; j < n; j++)
for (int u = n; u < 2 * n; u++) a[j][u] = !b[j][u - n];
for (int j = n; j < 2 * n; j++)
for (int u = n; u < 2 * n; u++) a[j][u] = b[j - n][u - n];
}
for (int i = 0; i < (1 << k); i++) {
for (int j = 0; j < (1 << k); j++) cout << (a[i][j] == 0 ? '+' : '*');
cout << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k;
cin >> k;
int n = 1;
for (int i = 0; i < k; i++) n *= 2;
int **prev = new int *[n], **cur = new int *[n];
for (int i = 0; i < n; i++) {
prev[i] = new int[n];
cur[i] = new int[n];
}
cur[0][0] = 0;
for (int i = 0, s = 1; i < k; i++, s *= 2) {
int **tmp = prev;
prev = cur;
cur = tmp;
for (int j = 0; j < s; j++) {
for (int k = 0; k < s; k++) {
cur[j][2 * k] = cur[j][2 * k + 1] = cur[j + s][2 * (s - k) - 1] =
prev[j][k];
cur[j + s][2 * (s - k) - 2] = !prev[j][k];
}
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (cur[i][j])
printf("+");
else
printf("*");
}
printf("\n");
}
}
|
#include <bits/stdc++.h>
char s[520][520];
char q[520][520];
int main() {
int n, m;
scanf("%d", &n);
memset(s, '\0', sizeof(s));
memset(q, '\0', sizeof(q));
q[1][1] = '+', q[1][2] = '+', q[2][1] = '+', q[2][2] = '*';
s[1][1] = '+', s[1][2] = '+', s[2][1] = '+', s[2][2] = '*';
m = 2;
if (n == 0)
printf("+\n");
else {
while (--n) {
for (int i = 1; i <= m; ++i)
for (int j = 1; j <= m; ++j)
s[i][j] = q[i][j], s[i + m][j] = q[i][j], s[i][j + m] = q[i][j],
s[i + m][j + m] = q[i][j] == '+' ? '*' : '+';
for (int i = 1; i <= m * 2; ++i)
for (int j = 1; j <= m * 2; ++j) q[i][j] = s[i][j];
m *= 2;
}
for (int i = 1; i <= m; ++i) printf("%s\n", s[i] + 1);
}
}
|
#include <bits/stdc++.h>
using namespace std;
int k;
int a[517][517];
int main() {
cin >> k;
a[1][1] = 1;
for (int i = 1; i <= k; i++) {
for (int x = (1 << (i - 1)) + 1; x <= (1 << i); x++)
for (int y = 1; y <= (1 << (i - 1)); y++)
a[x][y] = a[x - (1 << (i - 1))][y];
for (int x = 1; x <= (1 << (i - 1)); x++)
for (int y = (1 << (i - 1)) + 1; y <= (1 << i); y++)
a[x][y] = a[x][y - (1 << (i - 1))];
for (int x = (1 << (i - 1)) + 1; x <= (1 << i); x++)
for (int y = (1 << (i - 1)) + 1; y <= (1 << i); y++)
a[x][y] = -a[x - (1 << (i - 1))][y - (1 << (i - 1))];
}
for (int i = 1; i <= (1 << k); i++) {
for (int j = 1; j <= (1 << k); j++)
if (a[i][j] == 1)
cout << '+';
else
cout << '*';
cout << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int MX = 4e5 + 69;
const long long inf = 1e18 + 69;
const long long mod = (1 << 31) - 1;
const long double eps = 1e-7;
int ans[1111][1111];
int k;
void f(int c) {
if (c >= 10) {
return;
}
for (int i = 0; i < (1 << c); i++) {
for (int j = (1 << c); j < 2 * (1 << c); j++) {
ans[i][j] = ans[i][j - (1 << c)];
}
}
for (int i = (1 << c); i < 2 * (1 << c); i++) {
for (int j = 0; j < (1 << c); j++) {
ans[i][j] = ans[i - (1 << c)][j];
}
}
for (int i = (1 << c); i < 2 * (1 << c); i++) {
for (int j = (1 << c); j < 2 * (1 << c); j++) {
ans[i][j] = ans[i - (1 << c)][j - (1 << c)] ^ 1;
}
}
f(c + 1);
}
int main() {
ans[0][0] = 0;
ans[0][1] = 0;
ans[1][0] = 0;
ans[1][1] = 1;
f(1);
cin >> k;
for (int i = 0; i < (1 << k); i++) {
for (int j = 0; j < (1 << k); j++) {
if (ans[i][j]) {
printf("*");
} else {
printf("+");
}
}
printf("\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int k;
int res[1000][1000];
int res2[1000][1000];
int main(void) {
scanf("%d", &k);
if (k == 0) {
printf("+\n");
} else {
res[0][0] = 1;
res[0][1] = 1;
res[1][0] = 1;
res[1][1] = -1;
int n = 2;
for (int l = 1; l < k; l++) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
res[i + n][j] = res[i][j];
res[i][n * 2 - 1 - j] = -res[i][j];
res[i + n][n * 2 - 1 - j] = res[i][j];
}
}
n *= 2;
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
printf("%c", res[i][j] == 1 ? '+' : '*');
}
printf("\n");
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int HadamardMatrix[515][515];
int curr = 1;
int pow2[10];
void solve(int p) {
int i = p + 1;
for (int j = 1; j <= p; j++) {
for (int v = i; v <= 2 * p; v++) {
HadamardMatrix[j][v] = HadamardMatrix[j][v - p];
}
}
for (int v = i; v <= 2 * p; v++) {
for (int j = 1; j <= p; j++) {
HadamardMatrix[v][j] = HadamardMatrix[v - p][j];
}
}
for (int v = i; v <= 2 * p; v++) {
for (int j = i; j <= 2 * p; j++) {
HadamardMatrix[v][j] = -1 * HadamardMatrix[v - p][j - p];
}
}
}
int main() {
HadamardMatrix[1][1] = 1;
pow2[0] = 1;
for (int i = 1; i < 10; i++) {
pow2[i] = 2 * pow2[i - 1];
}
int k;
scanf("%d", &k);
if (k == 0) {
printf("+\n");
return 0;
}
for (int t = 0; t < k; t++) {
solve(pow2[t]);
}
for (int i = 1; i <= pow2[k]; i++) {
for (int j = 1; j <= pow2[k]; j++) {
if (HadamardMatrix[i][j] == 1)
printf("+");
else
printf("*");
}
printf("\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string neg(string s) {
string ans = s;
for (int i = 0; i < s.size(); i++) {
if (ans[i] == '*')
ans[i] = '+';
else if (ans[i] == '+')
ans[i] = '*';
}
return ans;
}
vector<string> inflate(vector<string> x, int curr, int count) {
if (curr == count) return x;
vector<string> t;
for (int i = 0; i < x.size(); i++) {
t.push_back(x[i] + x[i]);
t.push_back(x[i] + neg(x[i]));
}
return inflate(t, curr + 1, count);
}
int main() {
int n;
cin >> n;
vector<string> v1;
v1.push_back("+*");
v1.push_back("++");
if (n == 0) {
cout << "+\n";
return 0;
}
vector<string> ans = inflate(v1, 1, n);
for (int i = 0; i < ans.size(); i++) {
cout << ans[i] << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int A92[] = {1, 1, -1, -1, -1, 1, -1, -1, -1, 1, -1, 1,
1, -1, 1, -1, -1, -1, 1, -1, -1, -1, 1};
int B92[] = {1, -1, 1, 1, -1, 1, 1, -1, -1, 1, 1, 1,
1, 1, 1, -1, -1, 1, 1, -1, 1, 1, -1};
int C92[] = {1, 1, 1, -1, -1, -1, 1, 1, -1, 1, -1, 1,
1, -1, 1, -1, 1, 1, -1, -1, -1, 1, 1};
int D92[] = {1, 1, 1, -1, 1, 1, 1, -1, 1, -1, -1, -1,
-1, -1, -1, 1, -1, 1, 1, 1, -1, 1, 1};
set<int> paley1, paley2;
struct MAT {
vector<vector<int> > a;
int n;
MAT(int _n) {
n = _n;
a.resize(n);
for (int i = 0; i < n; i++) {
a[i].resize(n, 0);
}
}
};
MAT construct_circulant_symmetric_matrix(int first_row[], int n) {
MAT R(n);
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
R.a[i][j] = first_row[(n + j - i) % n];
}
}
return R;
}
MAT get_negative(MAT A) {
int n = A.n;
MAT B(n);
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
B.a[i][j] = -A.a[i][j];
}
}
return B;
}
MAT join_mat(MAT A, MAT B, MAT C, MAT D, int n) {
MAT R(2 * n);
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
R.a[i][j] = A.a[i][j];
R.a[i][n + j] = B.a[i][j];
R.a[n + i][j] = C.a[i][j];
R.a[n + i][n + j] = D.a[i][j];
}
}
return R;
}
MAT construct_williamson_92() {
MAT A = construct_circulant_symmetric_matrix(A92, 23);
MAT B = construct_circulant_symmetric_matrix(B92, 23);
MAT C = construct_circulant_symmetric_matrix(C92, 23);
MAT D = construct_circulant_symmetric_matrix(D92, 23);
MAT nB = get_negative(B);
MAT nC = get_negative(C);
MAT X = join_mat(A, B, nB, A, 23);
MAT Y = join_mat(C, D, D, nC, 23);
MAT nY = get_negative(Y);
MAT R = join_mat(X, Y, nY, X, 46);
return R;
}
bool has_solution(int n) { return n == 1 || n == 2 || (n % 4 == 0); }
vector<int> get_prime_residues(int n) {
vector<int> is_square(n, -1);
is_square[0] = 0;
for (int i = 1; i < n; i++) {
int res = (i * i) % n;
if (res < 0) res += n;
is_square[res] = 1;
}
return is_square;
}
vector<int> get_square_residues(int n) {
int a1, a0, p;
if (n == 25)
a1 = -4, a0 = -2, p = 5;
else
a1 = -6, a0 = -3, p = 7;
vector<int> is_square(n, -1);
is_square[0] = 0;
for (int i = 0; i < p; i++) {
for (int j = 0; j < p; j++) {
if (i + j == 0) continue;
int res1 = (a1 * i * i + 2 * i * j) % p;
int res2 = (a0 * i * i + j * j) % p;
if (res1 < 0) res1 += p;
if (res2 < 0) res2 += p;
is_square[p * res1 + res2] = 1;
}
}
return is_square;
}
MAT expand_paley(MAT A, int n) {
MAT R(2 * n);
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (A.a[i][j] == 0) {
R.a[2 * i][2 * j] = 1;
R.a[2 * i][2 * j + 1] = -1;
R.a[2 * i + 1][2 * j] = -1;
R.a[2 * i + 1][2 * j + 1] = -1;
} else if (A.a[i][j] == 1) {
R.a[2 * i][2 * j] = 1;
R.a[2 * i][2 * j + 1] = 1;
R.a[2 * i + 1][2 * j] = 1;
R.a[2 * i + 1][2 * j + 1] = -1;
} else {
R.a[2 * i][2 * j] = -1;
R.a[2 * i][2 * j + 1] = -1;
R.a[2 * i + 1][2 * j] = -1;
R.a[2 * i + 1][2 * j + 1] = 1;
}
}
}
return R;
}
MAT get_solution(int n) {
if (n == 1) {
MAT ret(1);
ret.a[0][0] = 1;
return ret;
} else if (n == 2) {
MAT ret(2);
ret.a[0][0] = ret.a[0][1] = ret.a[1][0] = 1;
ret.a[1][1] = -1;
return ret;
} else if (n == 92) {
return construct_williamson_92();
} else if (paley1.find(n) != paley1.end()) {
int q = n - 1;
vector<int> is_square = get_prime_residues(q);
MAT R(n);
R.a[0][0] = 1;
for (int i = 1; i < q + 1; i++) {
R.a[0][i] = 1;
R.a[i][0] = -1;
}
for (int i = 0; i < q; i++) {
for (int j = 0; j < q; j++) {
if (i == j)
R.a[i + 1][j + 1] = 1;
else
R.a[i + 1][j + 1] = is_square[(q + i - j) % q];
}
}
return R;
} else if (paley2.find(n) != paley2.end()) {
int q = (n / 2) - 1;
MAT R2(q + 1);
for (int i = 1; i < q + 1; i++) {
R2.a[0][i] = 1;
R2.a[i][0] = 1;
}
if (n == 52 || n == 100) {
vector<int> is_square = get_square_residues(q);
int q_root;
if (n == 52)
q_root = 5;
else
q_root = 7;
for (int i = 0; i < q; i++) {
for (int j = 0; j < q; j++) {
int i1 = i / q_root, j1 = j / q_root;
int block = (i1 - j1 + q_root) % q_root;
int ni = i - i1 * q_root, nj = j - j1 * q_root;
int inx = q_root * block + (ni - nj + q_root) % q_root;
R2.a[i + 1][j + 1] = is_square[inx];
if (i % q_root >= j % q_root && i >= j) cout << 0 << "";
if (i % q_root < j % q_root && i >= j) cout << 1 << "";
if (i % q_root >= j % q_root && i < j) cout << 1 << "";
if (i % q_root < j % q_root && i < j) cout << 2 << "";
}
cout << endl;
}
cout << endl;
} else {
vector<int> is_square = get_prime_residues(q);
for (int i = 0; i < q; i++) {
for (int j = 0; j < q; j++) {
R2.a[i + 1][j + 1] = is_square[(q + i - j) % q];
}
}
}
MAT R = expand_paley(R2, q + 1);
return R;
}
MAT A = get_solution(n / 2);
MAT nA = get_negative(A);
MAT R = join_mat(A, A, A, nA, n / 2);
return R;
}
void construct_paley_sets() {
paley1.insert(4), paley1.insert(8), paley1.insert(12), paley1.insert(20),
paley1.insert(24);
paley1.insert(32), paley1.insert(44), paley1.insert(48), paley1.insert(60);
paley1.insert(68), paley1.insert(72), paley1.insert(80), paley1.insert(84);
paley2.insert(28), paley2.insert(36), paley2.insert(52);
paley2.insert(76), paley2.insert(100);
}
int main() {
construct_paley_sets();
int t;
t = 1;
while (t--) {
int n;
cin >> n;
n = 1 << n;
if (!has_solution(n)) {
} else {
MAT ans = get_solution(n);
int len = ans.n;
for (int i = 0; i < len; i++) {
for (int j = 0; j < len; j++) {
if (ans.a[i][j] == 1) cout << "+";
if (ans.a[i][j] == -1) cout << "*";
}
cout << endl;
}
cout << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int a[1 << 10][1 << 10];
int main() {
a[0][0] = 0;
a[0][1] = 1;
a[1][0] = 1;
a[1][1] = 1;
for (int k = 2; k < 10; k++) {
int p = k - 1;
for (int i = 0; i < (1 << p); i++)
for (int j = (1 << p); j < (1 << k); j++) a[i][j] = a[i][j - (1 << p)];
for (int i = (1 << p); i < (1 << k); i++)
for (int j = 0; j < (1 << p); j++) a[i][j] = a[i - (1 << p)][j];
for (int i = (1 << p); i < (1 << k); i++)
for (int j = (1 << p); j < (1 << k); j++)
a[i][j] = (a[i - (1 << p)][j - (1 << p)] + 1) % 2;
}
int n;
scanf("%d", &n);
for (int i = 0; i < (1 << n); i++) {
for (int j = 0; j < (1 << n); j++) printf("%c", a[i][j] == 0 ? '*' : '+');
puts("");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a2[4][4] = {1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1}, a3[8][8],
a4[16][16], a5[32][32], a6[64][64], a7[128][128], a8[256][256],
a9[512][512];
int main() {
int n;
cin >> n;
if (n == 0) {
cout << "+" << endl;
return 0;
} else if (n == 1) {
cout << "+*" << endl << "++" << endl;
return 0;
}
for (int x = 0; x < 4; x++) {
for (int y = 0; y < 4; y++) {
if (a2[x][y] == 1) {
a3[x][2 * y] = 1;
a3[x][2 * y + 1] = 1;
a3[x + 4][2 * y] = 1;
a3[x + 4][2 * y + 1] = 0;
} else {
a3[x][2 * y] = 0;
a3[x][2 * y + 1] = 0;
a3[x + 4][2 * y] = 0;
a3[x + 4][2 * y + 1] = 1;
}
}
}
for (int x = 0; x < 8; x++) {
for (int y = 0; y < 8; y++) {
if (a3[x][y] == 1) {
a4[x][2 * y] = 1;
a4[x][2 * y + 1] = 1;
a4[x + 8][2 * y] = 1;
a4[x + 8][2 * y + 1] = 0;
} else {
a4[x][2 * y] = 0;
a4[x][2 * y + 1] = 0;
a4[x + 8][2 * y] = 0;
a4[x + 8][2 * y + 1] = 1;
}
}
}
for (int x = 0; x < 16; x++) {
for (int y = 0; y < 16; y++) {
if (a4[x][y] == 1) {
a5[x][2 * y] = 1;
a5[x][2 * y + 1] = 1;
a5[x + 16][2 * y] = 1;
a5[x + 16][2 * y + 1] = 0;
} else {
a5[x][2 * y] = 0;
a5[x][2 * y + 1] = 0;
a5[x + 16][2 * y] = 0;
a5[x + 16][2 * y + 1] = 1;
}
}
}
for (int x = 0; x < 32; x++) {
for (int y = 0; y < 32; y++) {
if (a5[x][y] == 1) {
a6[x][2 * y] = 1;
a6[x][2 * y + 1] = 1;
a6[x + 32][2 * y] = 1;
a6[x + 32][2 * y + 1] = 0;
} else {
a6[x][2 * y] = 0;
a6[x][2 * y + 1] = 0;
a6[x + 32][2 * y] = 0;
a6[x + 32][2 * y + 1] = 1;
}
}
}
for (int x = 0; x < 64; x++) {
for (int y = 0; y < 64; y++) {
if (a6[x][y] == 1) {
a7[x][2 * y] = 1;
a7[x][2 * y + 1] = 1;
a7[x + 64][2 * y] = 1;
a7[x + 64][2 * y + 1] = 0;
} else {
a7[x][2 * y] = 0;
a7[x][2 * y + 1] = 0;
a7[x + 64][2 * y] = 0;
a7[x + 64][2 * y + 1] = 1;
}
}
}
for (int x = 0; x < 128; x++) {
for (int y = 0; y < 128; y++) {
if (a7[x][y] == 1) {
a8[x][2 * y] = 1;
a8[x][2 * y + 1] = 1;
a8[x + 128][2 * y] = 1;
a8[x + 128][2 * y + 1] = 0;
} else {
a8[x][2 * y] = 0;
a8[x][2 * y + 1] = 0;
a8[x + 128][2 * y] = 0;
a8[x + 128][2 * y + 1] = 1;
}
}
}
for (int x = 0; x < 256; x++) {
for (int y = 0; y < 256; y++) {
if (a8[x][y] == 1) {
a9[x][2 * y] = 1;
a9[x][2 * y + 1] = 1;
a9[x + 256][2 * y] = 1;
a9[x + 256][2 * y + 1] = 0;
} else {
a9[x][2 * y] = 0;
a9[x][2 * y + 1] = 0;
a9[x + 256][2 * y] = 0;
a9[x + 256][2 * y + 1] = 1;
}
}
}
if (n == 2) {
for (int x = 0; x < 4; x++) {
for (int y = 0; y < 4; y++) {
if (a2[x][y] == 1)
cout << '+';
else
cout << '*';
}
cout << endl;
}
} else if (n == 3) {
for (int x = 0; x < 8; x++) {
for (int y = 0; y < 8; y++) {
if (a3[x][y] == 1)
cout << '+';
else
cout << '*';
}
cout << endl;
}
} else if (n == 4) {
for (int x = 0; x < 16; x++) {
for (int y = 0; y < 16; y++) {
if (a4[x][y] == 1)
cout << '+';
else
cout << '*';
}
cout << endl;
}
} else if (n == 5) {
for (int x = 0; x < 32; x++) {
for (int y = 0; y < 32; y++) {
if (a5[x][y] == 1)
cout << '+';
else
cout << '*';
}
cout << endl;
}
} else if (n == 6) {
for (int x = 0; x < 64; x++) {
for (int y = 0; y < 64; y++) {
if (a6[x][y] == 1)
cout << '+';
else
cout << '*';
}
cout << endl;
}
} else if (n == 7) {
for (int x = 0; x < 128; x++) {
for (int y = 0; y < 128; y++) {
if (a7[x][y] == 1)
cout << '+';
else
cout << '*';
}
cout << endl;
}
} else if (n == 8) {
for (int x = 0; x < 256; x++) {
for (int y = 0; y < 256; y++) {
if (a8[x][y] == 1)
cout << '+';
else
cout << '*';
}
cout << endl;
}
} else {
for (int x = 0; x < 512; x++) {
for (int y = 0; y < 512; y++) {
if (a9[x][y] == 1)
cout << '+';
else
cout << '*';
}
cout << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAX_K = 600;
char ans[MAX_K][MAX_K];
void build(int k) {
if (!k) {
ans[0][0] = '+';
return;
}
build(k - 1);
int R = (int)pow(2, k - 1);
if (k == 4) {
}
for (int i = 0; i < pow(2, k - 1); i++) {
for (int j = R; j < pow(2, k); j++) {
ans[i][j] = ans[i][j - R];
}
}
for (int i = R; i < pow(2, k); i++) {
for (int j = 0; j < pow(2, k - 1); j++) {
ans[i][j] = ans[i - R][j];
}
}
for (int i = R; i < pow(2, k); i++) {
for (int j = R; j < pow(2, k); j++) {
if (ans[i][j - R] == '+')
ans[i][j] = '*';
else
ans[i][j] = '+';
}
}
}
int main() {
int k;
scanf("%d", &k);
build(k);
for (int i = 0; i < pow(2, k); i++) {
for (int j = 0; j < pow(2, k); j++) cout << ans[i][j];
cout << "\n";
}
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
char c[1000][1000];
void f(int a, int b, int n, int d) {
if (n == 1) {
if (d == 1) {
c[a][b] = c[a + 1][b] = c[a][b + 1] = '+';
c[a + 1][b + 1] = '*';
}
if (d == 0) {
c[a][b] = c[a + 1][b] = c[a][b + 1] = '*';
c[a + 1][b + 1] = '+';
}
} else {
f(a, b, n - 1, d);
f(a + pow(2, n - 1), b, n - 1, d);
f(a, b + pow(2, n - 1), n - 1, d);
f(a + pow(2, n - 1), b + pow(2, n - 1), n - 1, 1 - d);
}
}
int main() {
int n;
cin >> n;
if (n == 0) {
cout << "+";
return 0;
} else
f(1, 1, n, 1);
for (int i = 1; i <= pow(2, n); i++) {
for (int j = 1; j <= pow(2, n); j++) {
cout << c[i][j];
}
cout << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
const long long mod = 1e9 + 7;
const long long inf = 1e17 + 10;
using namespace std;
const long long N = 520;
vector<vector<long long> > dp[10];
int32_t main() {
std::ios::sync_with_stdio(false);
cin.tie(NULL);
long long q;
cin >> q;
dp[0].resize(1);
dp[0][0].resize(1);
dp[0][0][0] = 1;
for (long long i = 1; i <= 9; i++) {
long long sz = 1 << i;
long long n = sz;
dp[i].resize(n);
sz /= 2;
for (long long j = 0; j < n; j++) {
dp[i][j].resize(n);
for (long long k = 0; k < n; k++) {
dp[i][j][k] = dp[i - 1][j % sz][k % sz];
if (j >= sz && k >= sz) dp[i][j][k] ^= 1;
}
}
}
for (long long j = 0; j < (1 << q); j++) {
for (long long k = 0; k < (1 << q); k++) {
if ((dp[q][j][k]))
cout << "+";
else
cout << "*";
}
cout << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int g[1024][1024];
void init(int m) {
int half = m >> 1;
if (half > 1) {
init(half);
for (int i = 1; i <= half; i++) {
for (int j = 1; j <= half; j++) {
g[i + half][j] = g[i][j + half] = g[i][j];
g[i + half][j + half] = -g[i][j];
}
}
}
}
int main() {
int k;
g[1][1] = g[1][2] = g[2][1] = 1;
g[2][2] = -1;
cin >> k;
init(1 << k);
for (int i = 1; i <= 1 << k; i++) {
for (int j = 1; j <= 1 << k; j++) {
if (g[i][j] == 1) {
printf("+");
} else {
printf("*");
}
}
printf("\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using lli = long long int;
using pii = pair<int, int>;
using vi = vector<int>;
using vb = vector<bool>;
using vvi = vector<vector<int>>;
using vlli = vector<long long int>;
using vpii = vector<pair<int, int>>;
void solve(int k, string s) {
if (!k) {
cout << s << '\n';
return;
}
string r = "";
for (int i = 0; i < s.size(); i++)
if (s[i] == '*')
r += '+';
else
r += '*';
solve(k - 1, s + r);
solve(k - 1, s + s);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int k;
cin >> k;
solve(k, "*");
}
|
#include <bits/stdc++.h>
using namespace std;
long long max(long long a, long long b) {
if (a > b) return a;
return b;
}
long long min(long long a, long long b) { return a + b - max(a, b); }
long long mulmod(long long a, long long b, long long mod) {
return ((a % 1000000007) * (b % 1000000007) % 1000000007);
}
long long mod(long long a, long long b) {
if (a > b)
return a - b;
else
return b - a;
}
long long power(long long x, long long y, long long p) {
long long res = 1;
x = x % p;
while (y > 0) {
if (y & 1) res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
long long get(long long a, long long b, long long c, long long d) {
if (a == b && (c == 0 || d == 0)) return 0;
long long ans = 1000000000000000000;
for (long long i = 0; i < 11; i++)
for (long long j = 0; j < 11; j++) {
if ((b + (i * c + j * d)) % 10 == a && i + j - 1 >= 0)
ans = min(ans, i + j - 1);
}
return ans;
}
string negs(string str) {
string res;
for (auto it : str) {
if (it == '*')
res.push_back('+');
else
res.push_back('*');
}
return res;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
;
long long n;
cin >> n;
if (n == 0) {
cout << '+';
return 0;
}
vector<string> vec(1 << n);
vec[0] = "++";
vec[1] = "+*";
long long cursize = 2;
for (long long i = 0; i < n - 1; i++) {
for (long long j = 0; j < cursize; j++) {
vec[j + cursize] = vec[j];
vec[j] = (vec[j] + vec[j]);
vec[j + cursize] = (vec[j + cursize] + negs(vec[j + cursize]));
}
cursize *= 2;
}
for (long long i = 0; i < (1 << n); i++) cout << vec[i] << "\n";
}
|
#include <bits/stdc++.h>
int map[525][525];
int note[10] = {1, 2, 4, 8, 16, 32, 64, 128, 256, 512};
int main() {
int time = 0, size = 1, i, j, head, tail;
map[1][1] = 1;
while (time != 9) {
time++;
head = size + 1;
tail = 2 * size;
for (i = 1; i <= size; i++)
for (j = head; j <= tail; j++) map[i][j] = map[i][j - size];
for (i = head; i <= tail; i++)
for (j = 1; j <= size; j++) map[i][j] = map[i - size][j];
for (i = head; i <= tail; i++)
for (j = head; j <= tail; j++) map[i][j] = -map[i - size][j - size];
size *= 2;
}
int k;
scanf("%d", &k);
for (i = 1; i <= note[k]; i++) {
for (j = 1; j <= note[k]; j++)
if (map[i][j] == 1)
printf("+");
else
printf("*");
puts("");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k;
char a[600][600];
void ope(int n) {
if (n == 2) {
a[1][1] = a[1][2] = a[1][3] = a[1][4] = a[2][1] = a[2][2] = a[3][1] =
a[3][3] = a[4][2] = a[4][3] = '+';
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++)
if (a[i][j] != '+') a[i][j] = '*';
}
return;
}
ope(n - 1);
int t = 1 << (n - 1);
for (int i = 1; i <= t; i++) {
for (int j = 1; j <= t; j++)
a[i][j + t] = a[i + t][j] = a[i][j],
a[i + t][j + t] = ('+') + ('*') - a[i][j];
}
}
int main() {
scanf("%d", &n);
if (n == 0)
printf("+\n");
else if (n == 1)
printf("++\n+*\n");
else {
k = 1 << n;
for (int i = 1; i <= k; i++) {
for (int j = 1; j <= k; j++) a[i][j] = '*';
}
ope(n);
for (int i = 1; i <= k; i++) {
for (int j = 1; j <= k; j++) printf("%c", a[i][j]);
printf("\n");
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string flip(string a) {
for (int i = 0; i < a.size(); i++) {
if (a[i] == '+')
a[i] = '*';
else
a[i] = '+';
}
return a;
}
int main() {
int n;
cin >> n;
vector<string> v;
v.push_back("+");
for (int i = 0; i < n; i++) {
vector<string> a;
for (int j = 0; j < v.size(); j++) {
a.push_back(v[j] + v[j]);
a.push_back(v[j] + flip(v[j]));
}
v = a;
}
for (auto it : v) cout << it << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename T>
T nextInt() {
T x = 0, p = 1;
char ch;
do {
ch = getchar();
} while (ch <= ' ');
if (ch == '-') {
p = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + (ch - '0');
ch = getchar();
}
return x * p;
}
const int maxN = (int)5e2 + 10;
const int INF = (int)1e9;
const int mod = (int)1e9 + 7;
const long long LLINF = (long long)1e18;
char rev(char x) {
if (x == '+') return '*';
return '+';
}
vector<vector<char> > build(int k) {
vector<vector<char> > ret(1 << k, vector<char>(1 << k, '?'));
if (k == 0) {
ret[0][0] = '*';
return ret;
}
vector<vector<char> > prev = build(k - 1);
int prevsz = (1 << k) / 2;
for (int i = 0; i < prevsz; ++i) {
for (int j = 0; j < prevsz; ++j) {
ret[i][2 * j] = ret[i][2 * j + 1] = prev[i][j];
}
}
for (int j = prevsz - 1; j >= 0; --j) {
for (int i = 0; i < prevsz; ++i) {
ret[prevsz + i][2 * j + 1] = prev[i][j];
ret[prevsz + i][2 * j] = rev(prev[i][j]);
}
}
return ret;
}
int main() {
int k;
cin >> k;
vector<vector<char> > answer = build(k);
for (int i = 0; i < answer.size(); ++i) {
for (int j = 0; j < answer[i].size(); ++j) {
putchar(answer[i][j]);
}
putchar('\n');
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[1010][1010];
int main(void) {
ios::sync_with_stdio(false);
int k;
cin >> k;
a[0][0] = 1;
for (int i = 0; i < k; ++i) {
int m = (1 << i);
for (int j = 0; j < m; ++j) {
for (int t = 0; t < m; ++t) {
a[j + m][t] = a[j][t];
}
for (int t = 0; t < m; ++t) {
a[j][t + m] = a[j][t];
a[j + m][t + m] = a[j][t + m] ^ 1;
}
}
}
int n = (1 << k);
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
if (a[i][j])
cout << '+';
else
cout << '*';
}
cout << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 9;
int k;
char ans[1000][1000];
int r, c;
void gao(int x) {
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
ans[i][j + c] = ans[i + r][j] = ans[i][j];
}
}
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
char tmp = ans[i][j];
if (tmp == '+')
tmp = '*';
else
tmp = '+';
ans[i + r][j + c] = tmp;
}
}
r *= 2;
for (int i = 0; i < c; i++) {
ans[r][i] = '+';
ans[r][i + c] = '*';
}
r++;
c *= 2;
}
int main() {
scanf("%d", &k);
r = 0;
c = 1;
for (int i = 0; i < k; i++) gao(i);
for (int i = 0; i < r; i++) {
for (int j = 0; j < c; j++) {
printf("%c", ans[i][j]);
}
printf("\n");
}
for (int i = 0; i < (1 << k); i++) printf("+");
printf("\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
int n;
cin >> n;
int run = 1 << n;
for (int i = 0; i < run; i++) {
for (int j = 0; j < run; j++) {
if (__builtin_parity(i & j))
cout << '*';
else
cout << '+';
}
cout << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void DFS(int k, string s) {
if (k == 0) {
cout << s << endl;
} else {
string t = "";
for (int i = 0; i < s.length(); i++) {
if (s[i] == '+') {
t += "*";
} else {
t += "+";
}
}
DFS(k - 1, s + s);
DFS(k - 1, s + t);
}
}
int main() {
int k;
cin >> k;
DFS(k, "+");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 600;
int a[maxn][maxn];
int T[maxn];
int main() {
a[0][0] = 1;
int n;
cin >> n;
T[0] = 1;
for (int i = 1; i <= n; i++) T[i] = T[i - 1] * 2;
for (int l = 0; l < n; l++)
for (int j = 0; j < T[l]; j++)
for (int k = 0; k < T[l]; k++)
a[T[l] + j][k] = a[j][T[l] + k] = a[T[l] + j][T[l] + k] = 1 ^ a[k][j];
for (int i = 0; i < (1 << n); i++, cout << endl)
for (int j = 0; j < (1 << n); j++) cout << (a[i][j] ? '+' : '*');
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int NMAX = 1026;
int k;
char a[NMAX][NMAX], b[NMAX][NMAX];
int main() {
cin >> k;
if (k == 0) {
cout << "+";
return 0;
}
a[1][1] = '+';
a[1][2] = '+';
a[2][1] = '+';
a[2][2] = '*';
for (int t = 2; t <= k; ++t) {
int x = (1 << (t - 1));
int currLine = 1;
for (int i = 1; i <= x; ++i) {
for (int j = 1; j <= x; ++j) {
b[currLine][j] = a[i][j];
b[currLine + 1][j] = a[i][j];
}
currLine += 2;
}
int y = x * 2;
for (int i = 1; i <= y; ++i) {
for (int j = x + 1; j <= y; ++j) {
if (i % 2 == 1) {
b[i][j] = b[i][j - x];
} else {
if (b[i][j - x] == '+') {
b[i][j] = '*';
} else {
b[i][j] = '+';
}
}
}
}
for (int i = 1; i <= y; ++i) {
for (int j = 1; j <= y; ++j) {
a[i][j] = b[i][j];
}
}
}
for (int i = 1; i <= (1 << k); ++i) {
for (int j = 1; j <= (1 << k); ++j) {
cout << a[i][j];
}
cout << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 600;
char ans[N][N], yuan[N][N];
int er[N];
int k;
void init() {
er[0] = 1;
for (int i = 1; i <= 10; i++) er[i] = er[i - 1] * 2;
ans[0][0] = '+';
}
void kuo(int c) {
for (int i = 0; i < er[c]; i++)
for (int j = 0; j < er[c]; j++) {
ans[er[c] + i][j] = ans[i][j];
}
for (int i = 0; i < er[c]; i++)
for (int j = 0; j < er[c]; j++) {
if (ans[i][er[c] - j - 1] == '*')
ans[i][er[c] + j] = '+';
else
ans[i][er[c] + j] = '*';
}
for (int i = 0; i < er[c]; i++)
for (int j = 0; j < er[c]; j++) {
ans[er[c] + i][er[c] + j] = ans[er[c] + i][er[c] - j - 1];
}
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
init();
cin >> k;
for (int i = 1; i <= k; i++) kuo(i - 1);
for (int i = 0; i < er[k]; i++) cout << ans[i] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char m[1025][1025];
int main() {
int n;
cin >> n;
m[1][1] = '+';
m[1][2] = '+';
m[2][1] = '+';
m[2][2] = '*';
for (int i = 1; i <= 9; i++) {
int len = pow(2, i);
for (int j = 1; j <= len; j++) {
for (int k = 1; k <= len; k++) {
m[len + j][k] = m[j][k];
m[len + j][len + k] = m[j][k];
if (m[j][k] == '+')
m[j][len + k] = '*';
else
m[j][len + k] = '+';
}
}
}
int l = pow(2, n);
for (int i = 1; i <= l; i++) {
for (int j = 1; j <= l; j++) printf("%c", m[i][j]);
printf("\n");
}
}
|
#include <bits/stdc++.h>
using namespace std;
inline long long getnum() {
char c = getchar();
long long num, sign = 1;
for (; c < '0' || c > '9'; c = getchar())
if (c == '-') sign = -1;
for (num = 0; c >= '0' && c <= '9';) {
c -= '0';
num = num * 10 + c;
c = getchar();
}
return num * sign;
}
int A[540][540][12];
int main() {
int n = getnum();
A[1][1][0] = 1;
for (int i = 1; i <= 9; i++) {
int l = 1 << i;
int fx = l, fy = 1;
int sx = l, sy = l;
int tx = 1, ty = l;
l /= 2;
for (int j = 1; j <= l; j++) {
for (int k = 1; k <= l; k++) {
A[j][k][i] = A[j][k][i - 1];
A[fx][fy][i] = A[j][k][i - 1];
A[sx][sy][i] = A[j][k][i - 1];
A[tx][ty][i] = 1 - A[j][k][i - 1];
fy++, sy--, ty--;
}
fx--, sx--, tx++;
fy = 1, sy = l * 2, ty = l * 2;
}
}
int l = 1 << n;
for (int i = 1; i <= l; i++) {
for (int j = 1; j <= l; j++) {
if (A[i][j][n])
putchar('+');
else
putchar('*');
}
putchar('\n');
}
}
|
#include <bits/stdc++.h>
using namespace std;
int getInt(int &x) { return scanf("%d", &x); }
int main() {
int n;
getInt(n);
n = 1 << n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
printf("%c", __builtin_parity(i & j) ? '*' : '+');
}
printf("\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
char a[1 << 9][1 << 9];
void solve(int n) {
if (n == 0) {
a[0][0] = '+';
return;
}
solve(n - 1);
int mid = 1 << (n - 1);
for (int i = (mid), _b = ((1 << n) - 1); i <= _b; ++i)
for (int j = 0, _a = (mid); j < _a; ++j) a[i][j] = a[i - mid][j];
for (int i = 0, _a = (mid); i < _a; ++i)
for (int j = (mid), _b = ((1 << n) - 1); j <= _b; ++j)
a[i][j] = a[i][j - mid];
for (int i = (mid), _b = ((1 << n) - 1); i <= _b; ++i)
for (int j = (mid), _b = ((1 << n) - 1); j <= _b; ++j)
a[i][j] = '+' + '*' - a[i - mid][j - mid];
}
int main() {
ios ::sync_with_stdio(0);
cin.tie(0);
while (cin >> n) {
solve(n);
for (int i = 0, _a = (1 << n); i < _a; ++i) {
for (int j = 0, _a = (1 << n); j < _a; ++j) putchar(a[i][j]);
puts("");
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int bit_parity(int x) {
int s = x % 2;
;
while (x /= 2) {
s += x % 2;
}
return s % 2;
}
int main() {
int a, i, j;
unsigned k, n;
cin >> k;
n = 1 << k;
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
if (bit_parity(i & j))
cout << "+";
else
cout << "*";
}
cout << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n;
cin >> n;
n = 1 << n;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) cout << (__builtin_parity(i & j) ? '*' : '+');
cout << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char s[2000];
char f(char x) {
if (x == '+') return '*';
return '+';
}
void play(int i, int n) {
if (i == n) {
printf("%s", s);
printf("\n");
return;
}
int j;
for (j = 0; j < (1 << i); j++) s[(1 << i) + j] = s[j];
play(i + 1, n);
for (j = 0; j < (1 << i); j++) s[(1 << i) + j] = f(s[j]);
play(i + 1, n);
}
void initial() {}
void solve() {
int n;
scanf("%d", &n);
s[0] = '+';
play(0, n);
}
int main() {
int i, T = 1;
while (T--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string a[10][2050];
int main() {
int k;
cin >> k;
a[0][0] = "+";
for (int i = 1; i <= k; i++) {
for (int j = 0; j < (1 << (i - 1)); j++) {
a[i][2 * j] = a[i - 1][j] + a[i - 1][j];
a[i][2 * j + 1] = a[i - 1][j];
for (int p = 0; p < a[i - 1][j].size(); p++) {
if (a[i - 1][j].at(p) == '+')
a[i][2 * j + 1] = a[i][2 * j + 1] + '*';
else
a[i][2 * j + 1] = a[i][2 * j + 1] + '+';
}
}
}
for (int i = 0; i < (1 << k); i++) cout << a[k][i] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18 + 1;
const double eps = 1e-6;
void f(vector<vector<int>>& v) {
int n = v.size();
for (int i = 0; i < n; ++i) {
v.push_back(v[i]);
}
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
v[i].push_back(v[i][j]);
}
}
for (int i = n; i < n * 2; ++i) {
for (int j = 0; j < n; ++j) {
v[i].push_back(-v[i][j]);
}
}
}
int main() {
int n = 1, s, t, st = 1;
cin >> s;
vector<vector<int>> v;
for (int i = 0; i < s; ++i) {
n *= 2;
}
vector<int> c;
c.push_back(1);
v.push_back(c);
for (int i = 0; i < s; ++i) {
f(v);
}
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
if (v[i][j] == 1) {
cout << "+";
} else {
cout << "*";
}
}
cout << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char a[1100][1100];
int n, p, flag, m;
int qpow(int base, int b) {
int r = 1;
while (b) {
if (b & 1) r *= base;
base *= base;
b >>= 1;
}
return r;
}
int main() {
a[1][1] = '*';
p = 1;
for (int i1 = 2; i1 < 12; i1++) {
for (int i = 1; i <= p; i++) {
for (int i0 = 1; i0 <= p; i0++) {
a[i][i0 + p] = a[i + p][i0] = a[i][i0];
if (a[i][i0] == '*')
a[i + p][i0 + p] = '+';
else
a[i + p][i0 + p] = '*';
}
}
p *= 2;
}
while (scanf("%d", &n) != EOF) {
n = qpow(2, n);
for (int i = 1; i <= n; i++) {
for (int i0 = 1; i0 <= n; i0++) printf("%c", a[i][i0]);
printf("\n");
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string ans[1 << 9 + 2];
string rec(string a) {
string p;
int i, n = a.length();
for (i = 0; i < n; i++) {
if (a[i] == '+') {
p.append("*");
} else {
p.append("+");
}
}
return p;
}
void recurse(int k) {
if (k > 9) {
return;
} else {
int l, i;
l = k - 1;
for (i = (1 << l) + 1; i <= 1 << k; i++) {
ans[i] = rec(ans[i - (1 << l)]);
}
for (i = 1; i <= 1 << l; i++) {
string temp = ans[i];
ans[i].append(ans[i]);
ans[i + (1 << l)].append(temp);
}
recurse(k + 1);
}
}
int main() {
int k, i;
ans[1] = "++";
ans[2] = "+*";
cin >> k;
recurse(2);
for (i = 1; i <= 1 << k; i++) {
cout << ans[i].substr(0, 1 << k) << '\n';
}
}
|
#include <bits/stdc++.h>
using namespace std;
int N, i, j, k, P = 1;
bool A[512][512];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> N;
A[0][0] = 1;
for (i = 0; i < N; i++) {
for (j = 0; j < P; j++) {
for (k = 0; k < P; k++) {
A[j][k + P] = A[j][k];
A[j + P][k] = A[j][k];
A[j + P][k + P] = !A[j][k];
}
}
P *= 2;
}
for (i = 0; i < P; i++) {
for (j = 0; j < P; j++) {
if (A[i][j]) {
cout << '+';
} else
cout << '*';
}
cout << '\n';
}
}
|
#include <bits/stdc++.h>
using namespace std;
char br[600][600];
char nt(char a) {
if (a == '+') return '*';
return '+';
}
void fill(int k, int r1, int c1, int r2, int c2) {
if (k == 1) {
br[r1][c1] = '+';
br[r2][c1] = '+';
br[r1][c2] = '+';
br[r2][c2] = '*';
return;
}
int mr = (r2) / 2;
int mc = (c2) / 2;
fill(k - 1, r1, c1, mr, mc);
for (int i = mr + 1; i <= r2; i++)
for (int j = c1; j <= mc; j++) br[i][j] = br[i - mr][j];
for (int i = r1; i <= mr; i++)
for (int j = mc + 1; j <= c2; j++) br[i][j] = nt(br[i][mc - (j - mc - 1)]);
for (int i = mr + 1; i <= r2; i++)
for (int j = mc + 1; j <= c2; j++) br[i][j] = br[i][mc - (j - mc - 1)];
}
int main() {
int k;
cin >> k;
if (k == 0) {
cout << "+" << endl;
return 0;
}
int t = pow(2, k);
fill(k, 1, 1, t, t);
for (int i = 1; i <= t; i++) {
for (int j = 1; j <= t; j++) cout << br[i][j];
cout << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char getn(char e) {
if (e == '+') return '*';
return '+';
}
vector<string> getvecs(int n) {
if (n <= 0) return {"+"};
auto sr(getvecs(n - 1));
vector<string> res;
for (auto s : sr) {
res.push_back(s + s);
auto ts(s);
for (auto &c : ts) c = getn(c);
res.push_back(s + ts);
}
return res;
}
int n;
int main() {
scanf("%d", &n);
auto res(getvecs(n));
for (auto s : res) cout << s << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct debugger {
template <typename T>
debugger& operator,(const T& v) {
cerr << v << " ";
return *this;
}
} dbg;
long long mod = 1000000007;
long long mod_v(long long nn) { return nn % mod; }
template <class T>
T fast_pow(T n, T p) {
if (p == 0) return 1;
if (p % 2) {
T g = mod_v(mod_v(n) * mod_v(fast_pow(n, p - 1)));
return g;
} else {
T g = fast_pow(n, p / 2);
g = mod_v(mod_v(g) * mod_v(g));
return g;
}
}
template <class T>
inline T modInverse(T n) {
return fast_pow(n, mod - 2);
}
const int mxn = 4222;
int a[mxn][mxn];
int n;
int main() {
cin >> n;
a[0][0] = 1;
a[0][1] = -1;
a[1][0] = 1;
a[1][1] = 1;
for (int i = 2; i < 11; i++) {
int turn = 1 << i;
int prv = 1 << (i - 1);
for (int j = 0; j < prv; j++) {
for (int k = prv; k < turn; k++) {
a[j][k] = a[j][k - prv];
}
}
for (int j = prv; j < turn; j++) {
for (int k = 0; k < prv; k++) {
a[j][k] = a[j - prv][k];
}
}
for (int j = prv; j < turn; j++) {
for (int k = prv; k < turn; k++) {
a[j][k] = -a[j - prv][k];
}
}
}
cin >> n;
int dim = 1 << n;
for (int i = 0; i < dim; i++) {
for (int j = 0; j < dim; j++) {
if (a[i][j] == 1) {
printf("+");
} else {
printf("*");
}
}
printf("\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
long long k;
cin >> k;
vector<string> v;
v.push_back("+");
for (long long i = 0; i < k; i++) {
vector<string> temp;
for (auto j : v) {
temp.push_back(j + j);
}
for (auto j : v) {
string s = j;
for (auto &x : s) x ^= '*' ^ '+';
temp.push_back(j + s);
}
v = temp;
}
for (auto i : v) cout << i << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k;
string ans[(1 << 9) + 5];
cin >> k;
ans[0] = "+";
for (int i = 1; i <= k; i++) {
for (int j = 0; j < (1 << (i - 1)); j++) {
ans[j] += ans[j];
}
for (int j = (1 << (i - 1)); j < (1 << i); j++) {
ans[j] += ans[j - (1 << (i - 1))];
for (int l = (1 << (i - 1)); l < (1 << i); l++) {
if (ans[j][l] == '+')
ans[j][l] = '*';
else
ans[j][l] = '+';
}
}
}
for (int i = 0; i < (1 << k); i++) {
cout << ans[i] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
const int INF = (int)1e9 + 7, mod = (int)1e9 + 9, pw = 31, N = (int)1e5 + 123,
M = (int)1e6 + 123;
const double eps = 1e-11;
const long long inf = 1e18;
struct node {
int a[1000][1000];
node() { memset(a, 0, sizeof a); }
} ans;
void get(int n) {
if (!n) {
ans.a[0][0] = 1;
return;
}
get(n - 1);
for (int i = (1 << (n - 1)) + 1; i <= (1 << n); i++) {
for (int j = 0; j <= (1 << (n - 1)); j++) {
ans.a[i][j] = ans.a[i - (1 << (n - 1))][j];
}
}
for (int i = 0; i <= (1 << (n - 1)); i++) {
for (int j = (1 << (n - 1)) + 1; j <= (1 << n); j++) {
ans.a[i][j] = ans.a[i][j - (1 << (n - 1))];
}
}
for (int i = (1 << (n - 1)) + 1; i <= (1 << n); i++) {
for (int j = (1 << (n - 1)) + 1; j <= (1 << n); j++) {
ans.a[i][j] = !ans.a[i][j - (1 << (n - 1))];
}
}
}
int n;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cin >> n;
get(n);
for (int i = 1; i <= (1 << n); i++) {
for (int j = 1; j <= (1 << n); j++) cout << (ans.a[i][j] ? '+' : '*');
cout << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18 + 1;
inline long long input(void) {
char t;
long long x = 0;
int neg = 0;
t = getchar();
while ((t < 48 || t > 57) && t != '-') t = getchar();
if (t == '-') {
neg = 1;
t = getchar();
}
while (t >= 48 && t <= 57) {
x = (x << 3) + (x << 1) + t - 48;
t = getchar();
}
if (neg) x = -x;
return x;
}
inline void output(long long x) {
char a[20];
int i = 0, j;
a[0] = '0';
if (x < 0) {
putchar('-');
x = -x;
}
if (x == 0) putchar('0');
while (x) {
a[i++] = x % 10 + 48;
x /= 10;
}
for (j = i - 1; j >= 0; j--) {
putchar(a[j]);
}
putchar('\n');
}
int dat[1 << 9][1 << 9];
inline void solve(int n) {
if (n == 0) {
dat[0][0] = 1;
return;
}
solve(n - 1);
long long x = 1 << (n - 1);
for (int i = 0; i < x; ++i)
for (int j = 0; j < x; ++j) {
dat[i + x][j] = dat[i][j];
dat[i][j + x] = dat[i][j];
dat[i + x][j + x] = -dat[i][j];
}
}
int main() {
long long t;
t = input();
solve(t);
for (int i = 0; i < 1 << t; ++i) {
for (int j = 0; j < 1 << t; ++j) {
if (dat[i][j] == 1)
putchar('+');
else
putchar('*');
}
putchar('\n');
}
return 0;
}
|
#include <bits/stdc++.h>
int k, q, x, cc = '+' + '*';
char c[513][513];
int main() {
scanf("%d", &k);
q = 1 << k;
for (int i = 1; i <= q; i++) {
c[1][i] = '+';
}
for (int i = 0; i < k; i++) {
for (int j = 1; j <= 1 << i; j++) {
for (int l = 1; l <= 1 << i; l++) {
x = (l - 1) * (q >> i);
for (int m = 1; m <= q >> (i + 1); m++) {
c[j + (1 << i)][x + m] = c[j][x + m];
c[j + (1 << i)][x + m + (q >> (i + 1))] =
cc - c[j][x + m + (q >> (i + 1))];
}
}
}
}
for (int i = 1; i <= q; i++) {
for (int j = 1; j <= q; j++) {
printf("%c", c[i][j]);
}
printf("\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void FastIO() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
cout.precision(15);
}
string fun(string str) {
int i, l = str.length();
for (i = 0; i < l; i++) {
if (str[i] == '+')
str[i] = '*';
else
str[i] = '+';
}
return str;
}
string s[10][1000];
int main() {
FastIO();
int i, n, j;
cin >> n;
if (n == 0) {
cout << '+' << "\n";
return 0;
}
s[0][0] = "++";
s[0][1] = "+*";
if (n == 1) {
cout << s[0][0] << "\n";
cout << s[0][1] << "\n";
return 0;
}
for (i = 1; i < 9; i++) {
for (j = 0; j < (1 << i); j++) s[i][j] = s[i - 1][j] + s[i - 1][j];
for (j = (1 << i); j < (1 << (i + 1)); j++)
s[i][j] = s[i - 1][j - (1 << i)] + fun(s[i - 1][j - (1 << i)]);
if (i == (n - 1)) {
for (j = 0; j < (1 << n); j++) cout << s[i][j] << "\n";
return 0;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = numeric_limits<int>::max();
const long long LLINF = numeric_limits<long long>::max();
const unsigned long long ULLINF = numeric_limits<unsigned long long>::max();
vector<string> s;
string negat(string a) {
string s = a;
for (int i = 0; i < a.size(); i++) {
if (a[i] == '+')
s[i] = '*';
else
s[i] = '+';
}
return s;
}
bool check(string s) {
for (int i = 0; i < s.size(); i++)
if (s[i] == '+') return 0;
return 1;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
s.push_back("****");
s.push_back("**++");
s.push_back("*+*+");
s.push_back("+**+");
int k;
cin >> k;
if (k == 0)
cout << "+";
else if (k == 1)
cout << "++\n*+";
else {
for (int i = 3; i <= k; i++) {
int sz = s.size();
for (int j = s.size() - (1 << (i - 1)); j < sz; j++) {
s.push_back(s[j] + s[j]);
if (!check(s[j]))
s.push_back(negat(s[j]) + s[j]);
else
s.push_back(s[j] + negat(s[j]));
}
}
for (int i = s.size() - (1 << k); i < s.size(); i++) cout << s[i] << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string str[4];
string s[10][1000];
int cnt;
int main(int argc, const char* argv[]) {
std::ios_base::sync_with_stdio(false);
int n, k, i, q, j, x;
string ts;
char chr;
cin >> x;
str[0] = "++**";
str[1] = "+*+*";
str[2] = "++++";
str[3] = "+**+";
if (x >= 2) {
s[2][0] = str[0];
s[2][1] = str[1];
s[2][2] = str[2];
s[2][3] = str[3];
for (i = 3; i <= x; i++) {
j = 1;
for (k = 0; k < i; k++) j = j * 2;
for (k = 0; k < j / 2; k++) {
s[i][k] = s[i - 1][k] + s[i - 1][k];
}
n = 0;
for (k = j / 2; k < j; k++) {
ts.clear();
for (q = 0; q < j / 2; q++) {
if (s[i - 1][n][q] == '*')
ts += '+';
else
ts += '*';
}
s[i][k] = s[i - 1][n] + ts;
n++;
}
}
j = 1;
for (k = 0; k < x; k++) j = j * 2;
for (i = 0; i < j; i++) cout << s[x][i] << "\n";
} else {
if (x == 0)
cout << "*";
else if (x == 1) {
cout << "++\n";
cout << "+*\n";
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
int main() {
int k;
scanf("%d", &k);
if (k == 0) {
puts("+");
exit(0);
}
function<vector<string>(int)> Make = [&](int n) {
if (n == 1) return vector<string>{"+*", "++"};
auto a = Make(n - 1);
auto b = a;
for (auto& s : b) {
for (auto& c : s) c = (char)((int)'+' + '*' - c);
}
vector<string> ret;
for (auto s : a) ret.push_back(s + s);
for (int i = 0; i < (int)a.size(); ++i) ret.push_back(a[i] + b[i]);
return ret;
};
auto a = Make(k);
for (auto s : a) printf("%s\n", s.c_str());
return 0;
}
|
#include <bits/stdc++.h>
const int N = 510000;
using namespace std;
int n;
vector<vector<int> > had[20];
int main() {
ios_base::sync_with_stdio(0);
cin >> n;
had[0].resize(1);
had[0][0].push_back(1);
for (int i = 1; i <= 9; i++) {
had[i].resize(1 << i);
int sz = (1 << i);
sz /= 2;
for (int j = 0; j < (1 << i); j++) {
had[i][j].resize(1 << i);
for (int q = 0; q < (1 << i); q++) {
had[i][j][q] = had[i - 1][j % sz][q % sz];
if (j >= sz && q >= sz) had[i][j][q] ^= 1;
}
}
}
for (int i = 0; i < (1 << n); i++) {
for (int j = 0; j < (1 << n); j++) {
if (had[n][i][j])
cout << "+";
else
cout << "*";
}
cout << endl;
}
cin.get();
cin.get();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[600][600];
void consruct(int k) {
int i, j;
for (i = k; i < 2 * k; i++) {
for (j = 0; j < k; j++) a[i][j] = a[i - k][j];
}
for (i = 0; i < k; i++) {
for (j = k; j < 2 * k; j++) a[i][j] = a[i][j - k];
}
for (i = k; i < 2 * k; i++) {
for (j = k; j < 2 * k; j++) a[i][j] = -a[i - k][j - k];
}
}
int main() {
ios_base::sync_with_stdio(false);
int k, ans, i, j;
cin >> k;
ans = 2;
a[0][0] = 1;
a[0][1] = 1;
a[1][0] = 1;
a[1][1] = -1;
if (k == 0)
cout << "+" << endl;
else {
for (i = 1; i < k; i++) {
consruct(ans);
ans = ans * 2;
}
for (i = 0; i < ans; i++) {
for (j = 0; j < ans; j++) {
if (a[i][j] == 1)
cout << "+";
else
cout << "*";
}
cout << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
char s[2][1000][1000];
int main() {
unsigned int k;
cin >> k;
unsigned int q = 1 << k, p = 1;
s[0][0][0] = '+';
unsigned int cc = 1;
for (; p < q; p *= 2) {
for (unsigned int i = 0; i < p; ++i) {
unsigned int fi = 2 * i, ni = fi + 1;
strcpy(s[cc][fi], s[1 - cc][i]);
strcpy(s[cc][ni], s[1 - cc][i]);
strcat(s[cc][fi], s[1 - cc][i]);
strcat(s[cc][ni], s[1 - cc][i]);
for (unsigned int j = p; j < 2 * p; ++j)
s[cc][ni][j] = s[cc][ni][j] == '+' ? '*' : '+';
}
cc = 1 - cc;
}
for (unsigned int i = 0; i < q; ++i) cout << s[1 - cc][i] << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int k, n;
int main() {
cin >> k;
n = (1 << k);
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
cout << (__builtin_parity(i & j) ? "+" : "*") << (j == n - 1 ? "\n" : "");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int k;
cin >> k;
vector<vector<bool> > vec(1, vector<bool>(1, 1));
while (k--) {
int n = vec.size();
for (int i = 0; i < n; i++) {
vec[i].insert(vec[i].end(), vec[i].begin(), vec[i].end());
vec.push_back(vec[i]);
for (int j = 0; j < n; j++) vec[i][n + j] = !vec[i][j];
}
}
int n = vec.size();
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) cout << ((vec[i][j]) ? '+' : '*');
cout << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long powmod(long long a, long long b) {
long long res = 1;
a %= 1000000007;
for (; b; b >>= 1) {
if (b & 1) res = res * a % 1000000007;
a = a * a % 1000000007;
}
return res;
}
int b[4203][4203];
string s[2][4];
int num = 0;
void f(int n, int x, int y, int fckn) {
if (n == 0) {
b[x][y] = fckn;
return;
}
f(n - 1, x, y, fckn);
f(n - 1, x, y + (1 << (n - 1)), fckn);
f(n - 1, x + (1 << (n - 1)), y, fckn);
f(n - 1, x + (1 << (n - 1)), y + (1 << (n - 1)), fckn ^ 1);
}
int main() {
int k;
cin >> k;
int n = (1 << k);
f(k, 0, 0, 1);
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) printf("%c", b[i][j] == 1 ? '+' : '*');
puts("");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string s[1000];
int p[10];
int main() {
p[0] = 1, p[1] = 2, p[2] = 4, p[3] = 8, p[4] = 16, p[5] = 32;
p[6] = 64, p[7] = 128, p[8] = 256, p[9] = 512;
s[1] = "++**";
s[2] = "+*+*";
s[3] = "++++";
s[4] = "+**+";
for (int i = 3; i <= 9; i++) {
for (int j = p[i] / 2 + 1; j <= p[i]; j++) s[j] = s[p[i] - j + 1];
for (int j = 1; j <= p[i]; j++) s[j] = s[j] + s[j];
for (int j = p[i] / 2 + 1; j <= p[i]; j++) {
int kk = 0;
for (int k = p[i] / 2; k < p[i]; k++) {
if (s[j][kk] == '+')
s[j][k] = '*';
else
s[j][k] = '+';
kk++;
}
}
}
int n;
while (scanf("%d", &n) != EOF) {
if (n == 0)
printf("+\n");
else if (n == 1)
printf("+*\n++\n");
else {
for (int i = 1; i <= p[n]; i++) {
for (int j = 0; j < p[n]; j++) {
printf("%c", s[i][j]);
}
printf("\n");
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, k, ans, v1, v2;
char a[3000][3000];
bool ok;
int main() {
cin >> n;
a[1][1] = '+';
k = 1;
for (int w = 1; w <= n; w++) {
for (int i = 1; i <= k; i++)
for (int j = 1; j <= k; j++) a[i][j + k] = a[k - j + 1][k - i + 1];
for (int i = 1; i <= k; i++)
for (int j = 1; j <= k; j++) a[i + k][j] = a[k - i + 1][j];
for (int i = 1; i <= k; i++)
for (int j = 1; j <= k; j++)
if (a[k - i + 1][j + k] == '+')
a[i + k][j + k] = '*';
else
a[i + k][j + k] = '+';
k *= 2;
}
for (int i = 1; i <= k; i++) {
for (int j = 1; j <= k; j++) cout << a[i][j];
cout << "\n";
}
cin >> n;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, k;
pair<int, int> d[3] = {{0, 1}, {1, 0}, {1, 1}};
int b[550][550];
void rec(int k) {
if (k == 1) {
b[0][0] = 1;
return;
}
rec(k /= 2);
for (int c = 0; c < 3; c++) {
for (int i = 0; i < k; i++) {
for (int j = 0; j < k; j++) {
b[i + d[c].first * k][j + d[c].second * k] = !b[i][j];
}
}
}
}
int main() {
cin >> k;
n = pow(2, k);
rec(n);
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) cout << (b[i][j] ? '+' : '*');
cout << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int K;
int V[1024][1024];
int main() {
cin >> K;
if (K == 0) {
cout << "+\n";
return 0;
}
V[1][1] = 1;
V[1][2] = 1;
V[2][1] = 1;
V[2][2] = -1;
for (int T = 2; T <= K; ++T) {
int pMic = 1 << (T - 1);
int pMare = 1 << T;
for (int i = pMic + 1; i <= pMare; ++i)
for (int j = 1; j <= pMic; ++j) V[i][j] = V[i - pMic][j];
for (int i = 1; i <= pMic; ++i)
for (int j = pMic + 1; j <= pMare; ++j) V[i][j] = V[i][j - pMic];
for (int i = pMic + 1; i <= pMare; ++i)
for (int j = pMic + 1; j <= pMare; ++j) V[i][j] = -1 * V[i][j - pMic];
}
for (int i = 1; i <= (1 << K); ++i) {
for (int j = 1; j <= (1 << K); ++j) {
if (V[i][j] == 1)
cout << '+';
else
cout << '*';
}
cout << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
int n;
cin >> n;
vector<bitset<2000> > ans(2000);
ans[0][0] = 1;
ans[0][1] = 1;
ans[1][0] = 1;
ans[1][1] = 0;
for (int(i) = (1); (i) < (n); (i)++) {
int s = 1 << i;
for (int((x)) = (0); ((x)) < ((s)); ((x))++)
for (int((y)) = (0); ((y)) < ((s)); ((y))++) {
ans[x + s][y] = ans[x][y];
ans[x][y + s] = ans[x][y];
ans[x + s][y + s] = !ans[x][y];
}
}
for (int((y)) = (0); ((y)) < ((1 << n)); ((y))++) {
for (int((x)) = (0); ((x)) < ((1 << n)); ((x))++) {
cout << (ans[y][x] ? "+" : "*");
}
cout << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
vector<string> v;
vector<string> tmp;
string neg(string s) {
int i;
for (i = 0; i < s.size(); ++i) s[i] = (s[i] == '+' ? '*' : '+');
return s;
}
int main() {
int n, i, j;
cin >> n;
v.push_back("+");
for (i = 1; i <= n; ++i) {
tmp = v;
v.clear();
for (j = 0; j < tmp.size(); ++j) {
v.push_back(tmp[j] + tmp[j]);
v.push_back(tmp[j] + neg(tmp[j]));
}
}
for (i = 0; i < v.size(); ++i) cout << v[i] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<vector<int> > Solve(int N) {
vector<vector<int> > ans;
ans.assign(1 << N, vector<int>(1 << N, 0));
if (N == 1) {
ans[0][0] = ans[0][1] = ans[1][0] = 1;
ans[1][1] = -1;
return ans;
}
vector<vector<int> > _ans = Solve(N - 1);
for (int i = 0; i < (1 << (N - 1)); ++i) {
for (int j = 0; j < (1 << N); ++j)
ans[i][j] =
(j < (1 << (N - 1))) ? _ans[i][j] : ans[i][j - (1 << (N - 1))];
for (int j = 0; j < (1 << N); ++j)
ans[i + (1 << (N - 1))][j] =
(j < (1 << (N - 1))) ? -ans[i][j] : ans[i][j];
}
return ans;
}
int N;
int main() {
scanf("%d", &N);
if (N == 0) {
printf("+");
return 0;
}
vector<vector<int> > ans = Solve(N);
for (int i = 0; i < (1 << N); ++i, printf("\n"))
for (int j = 0; j < (1 << N); ++j) printf("%c", ans[i][j] == 1 ? '+' : '*');
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline bool fs(T &x) {
int c = getchar();
int sgn = 1;
while (~c && c < '0' || c > '9') {
if (c == '-') sgn = -1;
c = getchar();
}
for (x = 0; ~c && '0' <= c && c <= '9'; c = getchar()) x = x * 10 + c - '0';
x *= sgn;
return ~c;
}
int ara[600][600];
void boshao(int n) {
int ln = n * 2;
for (int i = 1; i <= n; i++)
for (int j = n + 1; j <= ln; j++) ara[i][j] = ara[i][j - n];
for (int j = 1; j <= n; j++)
for (int i = n + 1; i <= ln; i++) ara[i][j] = ara[i - n][j];
for (int j = n + 1; j <= ln; j++)
for (int i = n + 1; i <= ln; i++) ara[i][j] = ara[i - n][j - n] ^ 1;
}
int main() {
ara[1][1] = 1;
ara[1][2] = 1;
ara[2][1] = 1;
ara[2][2] = 0;
int n;
fs(n);
int x = 2;
for (int i = 2; i <= 9; i++) {
boshao(x);
x *= 2;
}
for (int i = 1; i <= (1 << n); i++) {
for (int j = 1; j <= (1 << n); j++) cout << ((ara[i][j]) ? '*' : '+');
cout << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int mul(int k) {
int i = 1;
while (k--) i = i * 2;
return i;
}
int main() {
int ar[513][513] = {};
ar[0][0] = 1;
ar[0][1] = 1;
ar[1][0] = 1;
ar[1][1] = 0;
int k;
cin >> k;
if (k == 0)
cout << "+";
else {
int f = mul(k);
int l = 1;
while (l != f) {
for (int i = 0; i < 2 * l; i++) {
for (int j = 0; j < 2 * l; j++) {
int x = i % l;
int y = j % l;
if (i >= l && j >= l) {
ar[i][j] = abs(ar[i % l][j % l] - 1);
} else {
ar[i][j] = ar[i % l][j % l];
}
}
}
l = l * 2;
}
for (int i = 0; i < f; i++) {
for (int j = 0; j < f; j++) {
if (ar[i][j] == 1)
cout << "+";
else
cout << "*";
}
cout << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
void builder(string s, int n) {
int m = s.length();
if (m == n)
cout << s << endl;
else {
string s1 = s, s2 = s;
for (int i = 0; i < m; i++) {
if (s[i] == '+') {
s1 += '+';
s2 += '*';
} else {
s2 += '+';
s1 += '*';
}
}
builder(s1, n);
builder(s2, n);
}
}
int main() {
int k;
cin >> k;
int n = 1;
for (int i = 0; i < k; i++) n *= 2;
string s = "+";
builder(s, n);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T sqr(T x) {
return x * x;
}
char d[1000][1000];
char rev(char a) {
if (a == '*') return '+';
return '*';
}
int main() {
int n;
cin >> n;
d[0][0] = '*';
for (int i = 0; i < n; i++) {
for (int x = 0; x < (1 << i); x++) {
for (int y = 0; y < (1 << i); y++) {
int t = 1 << i;
d[x + t][y] = d[x][y + t] = d[x][y];
d[x + t][y + t] = rev(d[x][y]);
}
}
}
for (int x = 0; x < (1 << n); x++) {
for (int y = 0; y < (1 << n); y++) {
cout << d[x][y];
}
cout << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char comp(char x) {
if (x == '+')
return '*';
else
return '+';
}
int main() {
if (!0) {
ios::sync_with_stdio(false);
cin.tie(NULL);
}
cout << fixed;
cout << setprecision(12);
int k, i, j, x;
cin >> k;
char ar[10][515][515];
ar[1][1][1] = '+';
ar[1][1][2] = '+';
ar[1][2][1] = '+';
ar[1][2][2] = '*';
for ((x) = (2); (x) <= (9); (x)++) {
int sz = 1 << x, prevsz = 1 << (x - 1), pprevsz = 1 << (x - 2);
for ((i) = (1); (i) <= (prevsz); (i)++)
for ((j) = (1); (j) <= (prevsz); (j)++) ar[x][i][j] = ar[x - 1][i][j];
for ((i) = (1); (i) <= (prevsz); (i)++)
for ((j) = (1); (j) <= (prevsz); (j)++)
ar[x][i + prevsz][j] = ar[x - 1][i][j];
for ((i) = (1); (i) <= (prevsz); (i)++)
for ((j) = (1); (j) <= (prevsz); (j)++)
if (i <= pprevsz)
ar[x][i][j + prevsz] = ar[x - 1][i][j];
else
ar[x][i][j + prevsz] = comp(ar[x - 1][i][j]);
for ((i) = (1); (i) <= (prevsz); (i)++)
for ((j) = (1); (j) <= (prevsz); (j)++)
if (i > pprevsz)
ar[x][i + prevsz][j + prevsz] = ar[x - 1][i][j];
else
ar[x][i + prevsz][j + prevsz] = comp(ar[x - 1][i][j]);
}
int sz = 1 << k;
if (k == 0) {
cout << "+";
return 0;
}
for ((i) = (1); (i) <= (sz); (i)++) {
for ((j) = (1); (j) <= (sz); (j)++) cout << ar[k][i][j];
cout << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long BigMod(long long B, long long P, long long M) {
long long R = 1;
while (P > 0) {
if (P % 2 == 1) {
R = (R * B) % M;
}
P /= 2;
B = (B * B) % M;
}
return R;
}
template <class T1>
void deb(T1 e1) {
cout << e1 << endl;
}
template <class T1, class T2>
void deb(T1 e1, T2 e2) {
cout << e1 << " " << e2 << endl;
}
template <class T1, class T2, class T3>
void deb(T1 e1, T2 e2, T3 e3) {
cout << e1 << " " << e2 << " " << e3 << endl;
}
template <class T1, class T2, class T3, class T4>
void deb(T1 e1, T2 e2, T3 e3, T4 e4) {
cout << e1 << " " << e2 << " " << e3 << " " << e4 << endl;
}
template <class T1, class T2, class T3, class T4, class T5>
void deb(T1 e1, T2 e2, T3 e3, T4 e4, T5 e5) {
cout << e1 << " " << e2 << " " << e3 << " " << e4 << " " << e5 << endl;
}
template <class T1, class T2, class T3, class T4, class T5, class T6>
void deb(T1 e1, T2 e2, T3 e3, T4 e4, T5 e5, T6 e6) {
cout << e1 << " " << e2 << " " << e3 << " " << e4 << " " << e5 << " " << e6
<< endl;
}
int H[10][513][513];
void rec(int k) {
if (k == 1) return;
rec(k - 1);
int lim = 1 << (k - 1);
for (int i = 0; i < lim; i++) {
for (int j = 0; j < lim; j++) {
H[k][i][j] = H[k - 1][i][j];
H[k][i][j + lim] = H[k - 1][i][j];
H[k][i + lim][j] = H[k - 1][i][j];
H[k][i + lim][j + lim] = -H[k - 1][i][j];
}
}
return;
}
char mpp[100];
int main() {
H[1][0][0] = 1;
H[1][0][1] = 1;
H[1][1][0] = 1;
H[1][1][1] = -1;
mpp[0] = '*';
mpp[2] = '+';
int n;
scanf("%d", &n);
if (n == 0) {
puts("+");
} else {
rec(n);
for (int i = 0; i < (1 << n); i++) {
for (int j = 0; j < (1 << n); j++) {
printf("%c", mpp[H[n][i][j] + 1]);
}
puts("");
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = (int)1e9 + 37;
const double PI = acos(-1.0);
string inverted(string s) {
int sz = (int)s.length();
string ret;
for (int i = 0; i < sz; i++) {
if (s[i] == '+') {
ret += '*';
} else {
ret += '+';
}
}
return ret;
}
int main() {
int n;
cin >> n;
if (n == 0) {
cout << "+" << endl;
return 0;
}
if (n == 1) {
cout << "++\n+*" << endl;
return 0;
}
vector<string> s(4);
s[0] = "++++";
s[1] = "++**";
s[2] = "+**+";
s[3] = "+*+*";
if (n == 2) {
for (int i = 0; i < 4; i++) {
cout << s[i] << endl;
}
return 0;
}
int k = 4;
for (int i = 2; i < n; i++) {
k *= 2;
s.resize(k);
for (int j = k / 2; j < k; j++) {
s[j] = s[j - k / 2];
}
for (int j = 0; j < k / 2; j++) {
s[j] = s[j] + s[j];
}
for (int j = k / 2; j < k; j++) {
s[j] = s[j] + inverted(s[j]);
}
}
for (int i = 0; i < k; i++) {
cout << s[i] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, tavan2[100], idx = 1;
char a[10000][10000];
int main() {
a[0][0] = '+';
cin >> n;
for (int i = 0; i < 10; i++) {
tavan2[i] = idx;
idx *= 2;
}
for (int i = 0; i <= 9; i++) {
for (int j = 0; j < tavan2[i]; j++) {
for (int x = 0; x < tavan2[i]; x++) {
a[j][x + tavan2[i]] = a[j + tavan2[i]][x] = a[j][x];
if (a[j][x] == '+') {
a[j + tavan2[i]][x + tavan2[i]] = '*';
} else {
a[j + tavan2[i]][x + tavan2[i]] = '+';
}
}
}
}
for (int i = 0; i < tavan2[n]; i++) {
for (int j = 0; j < tavan2[n]; j++) {
cout << a[i][j];
}
cout << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long mod_v(long long num) {
if (num >= 0)
return (num % 1000000007);
else
return (num % 1000000007 + 1000000007) % 1000000007;
}
long long bigmod(long long b, long long p, long long m) {
long long res = 1 % m, x = b % m;
while (p) {
if (p & 1) res = (res * x) % m;
x = (x * x) % m;
p >>= 1;
}
return res;
}
class node {
public:
string str;
int a, b;
node() {}
node(string str, int a, int b) {
this->str = str;
this->a = a;
this->b = b;
}
};
vector<node> v;
map<string, bool> mark;
int main() {
int n, K, temp;
scanf("%d", &K);
n = 1 << K;
if (n == 1) {
printf("+\n");
return 0;
}
string str = "";
for (int i = 1; i <= n / 2; i++) str += '+';
for (int i = 1; i <= n / 2; i++) str += '*';
v.push_back(node(str, -1, -1));
mark[str] = 1;
int x = n / 4;
for (int i = 1; i <= x; i = i * 2) {
str = "";
temp = 1;
for (int j = 1; j <= n; j += i) {
temp = (temp + 1) % 2;
for (int k = 0; k < i; k++) {
if (temp == 0)
str += '+';
else
str += '*';
}
}
v.push_back(node(str, -1, -1));
mark[str] = 1;
}
int ind = 0, len;
while (v.size() < n) {
bool flag = false;
for (int i = 0; i < v.size() && i < n; i++) {
if (v[ind].a == i || v[ind].b == i || ind == i) continue;
str = "";
int o = 0, e = 0;
for (int j = 0; j < n; j++) {
if (v[ind].str[j] == v[i].str[j]) {
str += '+';
o++;
} else {
str += '*';
e++;
}
}
if (mark[str] == 1 || o != e) continue;
v.push_back(node(str, ind, i));
mark[str] = 1;
flag = true;
}
if (!flag) break;
ind++;
}
if (v.size() < n) {
str = "";
for (int i = 0; i < n; i++) str += '+';
v.push_back(node(str, -1, -1));
}
for (int i = 0; i < v.size(); i++) cout << v[i].str << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
vector<string> rep(int i, int k, vector<string> a) {
vector<string> res;
res = a;
for (int i = 0; i < a.size(); i++) res[i] += a[i];
for (int i = 0; i < a[0].length(); i++) res.push_back(a[i]);
for (int i = 0; i < a.size(); i++)
for (int j = 0; j < a[0].length(); j++)
if (a[i][j] == '+')
a[i][j] = '*';
else
a[i][j] = '+';
for (int i = 0; i < a.size(); i++) res[a.size() + i] += a[i];
if (i < k) res = rep(i + 1, k, res);
return res;
}
int main() {
int k;
cin >> k;
vector<string> result(1, "+");
if (k > 0) result = rep(1, k, result);
for (int i = 0; i < result.size(); i++) cout << result[i] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int arr[10][1 << 9][1 << 9];
int main() {
int n, m, d, t, tem1, tem2, tem3, tem4, sum = 0, ans = 0;
string s, c;
cin >> n;
for (int i = 1; i <= n; i++) {
int x = (1 << (i - 1));
for (int j = 0, y = 0; j < x; j++, y++) {
if (y > x) y = 0;
for (int k = 0, l = 0; k < x; k++, l++) {
if (l > x) l = 0;
arr[i][j][k] = arr[i - 1][y][l];
}
}
for (int j = 0, y = 0; j < x; j++, y++) {
if (y > x) y = 0;
for (int k = x, l = 0; k < x * 2; k++, l++) {
if (l > x) l = 0;
arr[i][j][k] = arr[i - 1][y][l];
}
}
for (int j = x, y = 0; j < x * 2; j++, y++) {
if (y > x) y = 0;
for (int k = 0, l = 0; k < x; k++, l++) {
if (l > x) l = 0;
arr[i][j][k] = arr[i - 1][y][k];
}
}
for (int j = x, y = 0; j < x * 2; j++, y++) {
if (y > x) y = 0;
for (int k = x, l = 0; k < x * 2; k++, l++) {
if (l > x) l = 0;
arr[i][j][k] = !arr[i - 1][y][l];
}
}
}
for (int i = 0; i < (1 << n); i++) {
for (int j = 0; j < (1 << n); j++) {
if (!arr[n][i][j])
printf("+");
else
printf("*");
}
printf("\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long int mod = 1000000000 + 7;
const long long int N = 10000000 + 6;
int arr[1000][1000];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int k;
cin >> k;
int t = 9;
arr[1][1] = 1;
int c = 1;
while (t--) {
for (int i = 1; i <= c; i++) {
for (int j = 1; j <= c; j++) {
arr[i + c][j] = arr[i][j];
arr[i][j + c] = arr[i][j];
if (arr[i][j] == 1)
arr[i + c][j + c] = -1;
else
arr[i + c][j + c] = 1;
}
}
c = c * 2;
}
for (int i = 1; i <= pow(2, k); i++) {
for (int j = 1; j <= pow(2, k); j++) {
if (arr[i][j] == 1)
cout << '+';
else
cout << '*';
}
cout << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct Point {
double X, Y;
void Input() { scanf("%lf %lf", &X, &Y); }
void Print() { printf("x=%10.3lf y=%10.3lf\n", X, Y); }
double Dist(Point p) {
return sqrt(((X - p.X) * (X - p.X)) + ((Y - p.Y) * (Y - p.Y)));
}
};
struct Line {
double A, B, C;
void Create(Point a, Point b) {
A = b.Y - a.Y, B = a.X - b.X, C = -A * a.X - B * a.Y;
}
double Dist(Point p) {
return fabs((A * p.X + B * p.Y + C) / sqrt(A * A + B * B));
}
void Print() { printf("A=%10.3lf B=%10.3lf C=%10.3lf\n", A, B, C); }
};
const int N = 1024;
const int K = 21;
const int M = 100000;
const int INF = 2000000000;
int n, m, k, l, p;
bool ok;
int a, b;
char s[N][N];
void PrintData(int par = 0);
void Input();
void Output();
void Main();
void Init();
int Find(char* s);
int main() {
Init();
Input();
Main();
Output();
return 0;
}
void Init() { n = 0, m = 0, k = 0; }
void Main() {
s[0][0] = '+';
p = 1;
if (k == 0) return;
p = 1;
for (int i = 0; i < k; i++, p += p) {
for (int j = 0; j < p; j++) strcpy(s[j + p], s[j]);
for (int l = 0; l < p; l++) s[0][l + p] = '+';
for (int l = 0; l < p; l++) s[p][l + p] = '*';
for (int j = 1; j < p; j++) {
for (int l = 0; l < p; l++) s[j][l + p] = s[j][l];
for (int l = 0, ll = p - 1; l < p; l++, ll--)
s[j + p][l + p] = (s[j + p][l] == '*' ? '+' : '*');
}
}
}
void Input() { scanf("%d", &k); }
void Output() {
for (int i = 0; i < p; i++) printf("%s\n", s[i]);
}
void PrintData(int par) {
if (par == 0) {
} else {
}
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.