text
stringlengths 49
983k
|
|---|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2000;
char m[MAXN][MAXN];
int pot[20];
int main() {
int n;
cin >> n;
int p = 1;
for (int i = 0; i < 15; i++) {
pot[i] = p;
p *= 2;
}
for (int i = 0; i <= n; i++) {
if (i == 0) {
m[1][1] = '+';
continue;
}
for (int k = 1; k <= pot[i - 1]; k++) {
for (int j = pot[i - 1] + 1; j <= 2 * pot[i - 1]; j++) {
m[k][j] = m[k][j - pot[i - 1]];
}
}
for (int k = pot[i - 1] + 1; k <= 2 * pot[i - 1]; k++) {
for (int j = 1; j <= pot[i - 1]; j++) {
m[k][j] = m[k - pot[i - 1]][j];
}
}
for (int k = 1; k <= pot[i - 1]; k++) {
for (int j = pot[i - 1] + 1; j <= 2 * pot[i - 1]; j++) {
m[k][j] = m[k][j - pot[i - 1]];
}
}
for (int k = pot[i - 1] + 1; k <= 2 * pot[i - 1]; k++) {
for (int j = pot[i - 1] + 1; j <= 2 * pot[i - 1]; j++) {
if (m[k - pot[i - 1]][j - pot[i - 1]] == '*')
m[k][j] = '+';
else
m[k][j] = '*';
}
}
}
for (int i = 1; i <= pot[n]; i++) {
for (int j = 1; j <= pot[n]; j++) {
cout << m[i][j];
}
cout << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
const int RETURN = 1061109567;
const int INF = 987654321;
const int MAX_SIZE = 500000 * 4;
const int MAX_NUM = 2000000010;
const long long INFF = 9876543212345;
const int MAX_V = 410;
int k, cnt, ssize = 1;
string s;
void func(int k, string s) {
if (k == 0) {
cout << s << endl;
return;
}
string t;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '+')
t += '*';
else
t += '+';
}
func(k - 1, s + s);
func(k - 1, s + t);
}
int main() {
scanf("%d", &k);
if (k == 0) {
printf("+\n");
return 0;
}
int ssize = 1;
for (int i = 0; i < k; i++) ssize *= 2;
func(k, "+");
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
iostream::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
n = (1 << n);
char a[n][n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (__builtin_popcount(i | j) % 2 == 0)
cout << '*';
else
cout << '+';
}
cout << "\n";
}
}
|
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:256000000")
using namespace std;
typedef long long ll;
void my_return(ll code) { exit(code); }
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll my_exp(ll a, ll b, ll MOD = numeric_limits<ll>::max()) {
a %= MOD;
if (b == 0) {
return 1;
} else {
return ((b % 2 == 1 ? a : 1) * my_exp(a * a, b / 2, MOD)) % MOD;
}
}
bool is_prime(ll n) {
if (n != 2 && n % 2 == 0) {
return false;
} else {
for (int i = 3; (i * i) <= n; i += 2) {
if (n % i == 0) return false;
}
return true;
}
}
void sol(ll k, vector<vector<char>>& ans, ll x1, ll x2, ll y1, ll y2);
void solc(ll k, vector<vector<char>>& ans, ll x1, ll x2, ll y1, ll y2) {
sol(k, ans, x1, x2, y1, y2);
for (ll i = x1; i < x2; ++i) {
for (ll j = y1; j < y2; ++j) {
if (ans[i][j] == '+') {
ans[i][j] = '*';
} else {
ans[i][j] = '+';
}
}
}
}
void sol(ll k, vector<vector<char>>& ans, ll x1, ll x2, ll y1, ll y2) {
if (k == 0) {
ans[x1][y1] = '+';
} else {
sol(k - 1, ans, x1 + 0, x1 + my_exp(2, k - 1), y1 + 0,
y1 + my_exp(2, k - 1));
sol(k - 1, ans, x1 + 0, x1 + my_exp(2, k - 1), y1 + my_exp(2, k - 1),
y1 + my_exp(2, k));
sol(k - 1, ans, x1 + my_exp(2, k - 1), x1 + my_exp(2, k), y1 + 0,
y1 + my_exp(2, k - 1));
solc(k - 1, ans, x1 + my_exp(2, k - 1), x1 + my_exp(2, k),
y1 + my_exp(2, k - 1), y1 + my_exp(2, k));
}
}
int main() {
ios_base::sync_with_stdio(false);
ll k;
cin >> k;
vector<vector<char>> ans(my_exp(2, k), vector<char>(my_exp(2, k), '-'));
sol(k, ans, 0, my_exp(2, k), 0, my_exp(2, k));
for (ll i = 0; i < my_exp(2, k); ++i) {
for (ll j = 0; j < my_exp(2, k); ++j) {
cout << ans[i][j];
}
cout << "\n";
}
my_return(0);
}
|
#include <bits/stdc++.h>
using namespace std;
string rev(string s) {
for (int i = 0; i < (int)s.length(); i++) {
if (s[i] == '+')
s[i] = '*';
else
s[i] = '+';
}
return s;
}
vector<string> rec_sol(int k) {
if (!k) {
vector<string> v;
v.push_back("+");
return v;
}
vector<string> v;
vector<string> v2 = rec_sol(k - 1);
int n2 = 1 << (k - 1);
for (int i = 0; i < n2; i++) {
string cur = v2[i] + v2[i];
v.push_back(cur);
}
for (int i = 0; i < n2; i++) {
string cur = v2[i] + rev(v2[i]);
v.push_back(cur);
}
return v;
}
void solve() {
int k;
cin >> k;
vector<string> ans = rec_sol(k);
int n = 1 << k;
for (int i = 0; i < n; i++) {
cout << ans[i] << endl;
}
}
int main() {
int t = 1;
while (t--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = (int)1e9;
const double EPS = (long double)1e-7;
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 << ((__builtin_popcount(x + y + (x ^ y)) & 1) ? '+' : '*');
}
cout << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int K;
cin >> K;
if (K == 0) {
cout << "+" << endl;
return 0;
}
vector<string> ans;
ans.push_back("++");
ans.push_back("+*");
for (int k = 2; k <= K; ++k) {
vector<string> tmp(ans);
for (int i = 0; i < tmp.size(); ++i) {
for (int j = 0; j < tmp[i].size(); ++j) {
tmp[i][j] = tmp[i][j] == '*' ? '+' : '*';
}
}
vector<string> next;
for (auto s : ans) {
next.push_back(s + s);
}
for (int i = 0; i < ans.size(); ++i) {
next.push_back(ans[i] + tmp[i]);
}
ans.swap(next);
}
for (auto s : ans) {
cout << s << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
void gett() { cerr << (clock()) / (double)CLOCKS_PER_SEC << "\n"; }
long long powr(long long a, long long b, long long mod) {
long long x = 1 % mod;
a %= mod;
while (b) {
if (b & 1) x = (x * a) % mod;
a = (a * a) % mod;
b >>= 1;
}
return x;
}
long long inv(long long a, long long mod) { return powr(a, mod - 2, mod); }
const int maxn = 1e6 + 10;
const long long mod = 1e9 + 7;
vector<vector<int> > mat(int k) {
if (k == 0) {
vector<vector<int> > ret = {{1}};
return ret;
}
vector<vector<int> > ret1 = mat(k - 1);
vector<vector<int> > ret2(1 << k, vector<int>(1 << k, 0));
for (__typeof(1 << (k - 1)) i = (0) - ((0) > (1 << (k - 1)));
i != (1 << (k - 1)) - ((0) > (1 << (k - 1))); i += 1)
for (__typeof(1 << (k - 1)) j = (0) - ((0) > (1 << (k - 1)));
j != (1 << (k - 1)) - ((0) > (1 << (k - 1))); j += 1) {
ret2[i][j] = ret2[i][j + (1 << (k - 1))] = ret2[i + (1 << (k - 1))][j] =
ret1[i][j];
ret2[i + (1 << (k - 1))][j + (1 << (k - 1))] = -ret1[i][j];
}
return ret2;
}
int main() {
int k;
scanf("%d", &(k));
vector<vector<int> > vec = mat(k);
for (__typeof(1 << k) i = (0) - ((0) > (1 << k));
i != (1 << k) - ((0) > (1 << k)); i += 1) {
for (__typeof(1 << k) j = (0) - ((0) > (1 << k));
j != (1 << k) - ((0) > (1 << k)); j += 1)
printf("%c", (vec[i][j] == 1 ? '+' : '*'));
printf("\n");
}
}
|
#include <bits/stdc++.h>
using namespace std;
char a[1000][1000];
void func(int x, int i, int j) {
if (x == 1) {
a[i][j] = '+';
return;
}
if (x == -1) {
a[i][j] = '*';
return;
}
func(x / 2, i, j);
func(x / 2, i, j + abs(x / 2));
func(x / 2, i + abs(x / 2), j);
func(-x / 2, i + abs(x / 2), j + abs(x / 2));
return;
}
int main() {
int k, x, i, j;
scanf("%d", &k);
x = pow(2, k);
func(x, 0, 0);
for (i = 0; i < x; i++) {
for (j = 0; j < x; j++) printf("%c", a[i][j]);
printf("\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
int main() {
scanf("%d", &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;
const int mod = 1e9 + 7;
const int maxn = 1e6 + 5;
int ans[(1 << 9) + 10][(1 << 9) + 10], temp[(1 << 9) + 10][(1 << 9) + 10];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int k, i, j, x, tj, tx;
cin >> k;
ans[1][1] = 1;
temp[1][1] = 1;
for (i = 1; i <= k; i++) {
tj = 1;
for (j = 1; j <= (1 << (i - 1)); j++) {
tx = 1;
for (x = 1; x <= (1 << (i - 1)); x++) {
ans[j][x] = temp[tj][tx++];
}
tj++;
}
tj = 1;
for (j = (1 << (i - 1)) + 1; j <= (1 << (i)); j++) {
tx = 1;
for (x = 1; x <= (1 << (i - 1)); x++) {
ans[j][x] = temp[tj][tx++];
}
tj++;
}
tj = 1;
for (j = 1; j <= (1 << (i - 1)); j++) {
tx = 1;
for (x = (1 << (i - 1)) + 1; x <= (1 << (i)); x++) {
ans[j][x] = temp[tj][tx++];
}
tj++;
}
tj = 1;
for (j = 1 + (1 << (i - 1)); j <= (1 << (i)); j++) {
tx = 1;
for (x = 1 + (1 << (i - 1)); x <= (1 << (i)); x++) {
ans[j][x] = -temp[tj][tx++];
}
tj++;
}
for (j = 1; j <= (1 << i); j++) {
for (x = 1; x <= (1 << i); x++) {
temp[j][x] = ans[j][x];
}
}
}
for (i = 1; i <= (1 << k); i++) {
for (j = 1; j <= (1 << k); j++) {
if (ans[i][j] == 1)
cout << "+";
else
cout << "*";
}
cout << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long MAX = 1e6 + 8;
const long long sz = 1e5 + 5;
void f_io() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
}
int32_t main() {
f_io();
long long t = 1;
while (t--) {
long long k;
cin >> k;
long long pw = pow(2, k);
char arr[pw + 1][pw + 1];
for (long long i = 1; i < pw + 1; i++)
for (long long j = 1; j < pw + 1; j++)
arr[i][j] = ((__builtin_popcount((i - 1) | (j - 1)) % 2) ? '*' : '+');
for (long long i = 1; i < pw + 1; i++) {
for (long long j = 1; j < pw + 1; j++) {
cout << arr[i][j];
}
cout << "\n";
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int i, j, it, k, n, rs[520][520];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> k;
rs[0][0] = 1;
for (i = 1; i <= k; ++i) {
for (j = 0, n = (1 << i) / 2; j < n; ++j)
for (it = 0; it < n; ++it) {
rs[j + n][it] = rs[j][it];
rs[j][it + n] = rs[j][it];
rs[j + n][it + n] = rs[j][it] ^ 1;
}
}
for (i = 0; i < (1 << k); ++i, cout << '\n')
for (j = 0; j < (1 << k); ++j) cout << (rs[i][j] ? '+' : '*');
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool arr[513][513];
void process(int rowSource, int rowDest1, int rowDest2, int sourceLength) {
int destLength = 2 * sourceLength;
for (int i = sourceLength - 1, k = destLength - 2; i >= 0; --i, k -= 2) {
bool t = arr[rowSource][i];
arr[rowDest1][k + 1] = t;
arr[rowDest1][k] = t;
arr[rowDest2][k] = t;
arr[rowDest2][k + 1] = !t;
}
}
int main(void) {
ios_base::sync_with_stdio(0);
int n;
cin >> n;
arr[0][0] = false;
int len = 1;
for (int i = 0; i < n; ++i) {
for (int k = len - 1; k >= 0; --k) {
process(k, 2 * k, 2 * k + 1, len);
}
len *= 2;
}
for (int i = 0; i < len; ++i) {
for (int k = 0; k < len; ++k) {
cout << (arr[i][k] ? '+' : '*');
}
cout << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
template <typename T>
T pow(T a, T b, long long m) {
T ans = 1;
while (b > 0) {
if (b % 2 == 1) ans = (ans * a) % m;
b /= 2;
a = (a * a) % m;
}
return ans % m;
}
const long long N = 10005;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
long long k;
cin >> k;
long long n = 1 << k;
for (long long i = 0; i < n; i++) {
for (long long j = 0; j < n; j++) {
if (__builtin_parity(i & j))
cout << "+";
else
cout << "*";
}
cout << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int a[1033][1033];
void recurse(int size) {
int i, j;
if (size > 1) {
recurse(size / 2);
int temp = size / 2;
for (i = 0; i < temp; i++) {
for (j = 0; j < temp; j++) {
a[i][j + temp] = a[i][j];
a[i + temp][j + temp] = a[i][j];
a[i + temp][j] = -a[i][j];
}
}
} else {
a[0][0] = 1, a[0][1] = 1, a[1][1] = 1, a[1][0] = -1;
}
}
int main() {
int i, j, n, k;
cin >> k;
n = 1 << k;
recurse(n);
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
if (a[i][j] == 1)
cout << "+";
else
cout << "*";
}
cout << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<string> gen(long long int k) {
if (k == 0)
return {"+"};
else {
auto ans = gen(k - 1);
vector<string> res = ans;
for (long long int i = 0; i < ans.size(); i++) res[i] += ans[i];
for (long long int i = 0; i < ans.size(); i++) res.push_back(res[i]);
for (long long int i = ans.size(); i < res.size(); i++) {
for (long long int j = ans.size(); j < res.size(); j++) {
if (res[i][j] == '+')
res[i][j] = '*';
else
res[i][j] = '+';
}
}
return res;
}
}
signed main() {
long long int k;
cin >> k;
vector<string> ans = gen(k);
for (auto i : ans) cout << i << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
class uchi {
public:
int m;
char a[1 << 10];
void turn(int x) {
if (a[x] == '+')
a[x] = '*';
else
a[x] = '+';
}
void find(int i) {
if (!i) {
cout << a << endl;
return;
}
find(i / 2);
int t = m / i / 2;
for (int j = 0; j < t; ++j) {
for (int k = 0; k < i; ++k) turn(j * i * 2 + k);
}
find(i / 2);
for (int j = 0; j < t; ++j) {
for (int k = 0; k < i; ++k) turn(j * i * 2 + k);
}
}
uchi() {
int n;
cin >> n;
m = 1 << n;
for (int j = 0; j < m; ++j) a[j] = '+';
a[m] = '\0';
find(m / 2);
}
};
int main() {
ios::sync_with_stdio();
uchi kotori;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 2000;
int k;
int x = 0;
char second[N][N], d[N][N];
int n, m;
char p[N][N];
bool check() {
if (1ll * n * n * n > 2000000) return 1;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
int res = 0;
for (int k = 0; k < n; k++) {
if (second[i][k] != second[j][k])
res++;
else
res--;
}
if (res != 0) return 1;
}
}
return 0;
}
int main() {
cin >> k;
if (k == 0) {
cout << '+';
return 0;
}
if (k == 1) {
cout << "++\n*+";
return 0;
}
second[0][0] = '+';
second[0][1] = '+';
second[1][0] = '*';
second[1][1] = '+';
for (int t = 2; t <= k; t++) {
n = (1 << (t - 1));
for (int i = 0; i < n; i++) {
for (int j = 0; j < 2 * n; j++) {
d[i][j] = second[i][j % n];
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
p[i][j] = second[i][j];
if (second[i][j] == '+')
second[i][j] = '*';
else
second[i][j] = '+';
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
d[i + n][j] = second[i][j];
d[i + n][j + n] = p[i][j];
}
}
n = n * 2;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
second[i][j] = d[i][j];
}
}
}
for (int i = 0; i < n; i++) {
printf("%s\n", second[i]);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, sizeA;
char a[10][512][512];
a[0][0][0] = 1;
cin >> k;
for (int i = 1; i <= k; i++) {
int temp = pow(2, i);
int temp2 = pow(2, i - 1);
for (int j = 0; j < temp; j++) {
for (int v = 0; v < temp; v++) {
int t1 = v % temp2;
int t2 = j % temp2;
a[i][j][v] = a[i - 1][t1][t2];
}
}
for (int j = temp / 2; j < temp; j++) {
for (int v = temp / 2; v < temp; v++) {
a[i][j][v] = -1 * a[i][j][v];
}
}
}
int temp = pow(2, k);
for (int i = 0; i < temp; i++) {
for (int j = 0; j < temp; j++) {
if (a[k][i][j] == 1) cout << "+";
if (a[k][i][j] == -1) cout << "*";
}
cout << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
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))
cout << '*';
else
cout << '+';
}
cout << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int ans[1000][1000];
int main() {
ios_base::sync_with_stdio(false);
int k;
cin >> k;
int tmp = 1;
ans[0][0] = 1;
while (tmp <= k) {
for (int i = 0; i < (1 << tmp); i++)
for (int j = 0; j < (1 << tmp); j++) {
if (i < (1 << tmp - 1) && j < (1 << tmp - 1)) continue;
int mod1 = i % (1 << tmp - 1);
int mod2 = j % (1 << tmp - 1);
if (i < (1 << tmp - 1) || j < (1 << tmp - 1))
ans[i][j] = ans[mod1][mod2];
if (i >= (1 << tmp - 1) && j >= (1 << tmp - 1))
ans[i][j] = 1 - ans[mod1][mod2];
}
tmp++;
}
for (int i = 0; i < (1 << k); i++, cout << endl)
for (int j = 0; j < (1 << k); j++) cout << (ans[i][j] == 1 ? "+" : "*");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAX = 100001;
const int INF = 1000000001;
void dfs(int k, string s) {
if (k == 0) {
cout << s << endl;
return;
}
string t = "";
for (int i = 0; i < (int)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;
int main() {
int n;
scanf("%d", &n);
int i, N = pow(2, n);
char **h = (char **)calloc(N, sizeof(char *));
for (i = 0; i < N; i++) {
h[i] = (char *)calloc(N, sizeof(char));
}
int ii, xx, yy;
h[0][0] = '+';
for (ii = 2; ii <= N; ii *= 2) {
for (xx = 0; xx < (ii / 2); ++xx) {
for (yy = (ii / 2); yy < ii; ++yy) {
h[xx][yy] = h[xx][yy - (ii / 2)];
}
}
for (yy = 0; yy < (ii / 2); ++yy) {
for (xx = (ii / 2); xx < ii; ++xx) {
h[xx][yy] = h[xx - (ii / 2)][yy];
}
}
for (xx = (ii / 2); xx < ii; ++xx) {
for (yy = (ii / 2); yy < ii; ++yy) {
h[xx][yy] = h[xx - (ii / 2)][yy - (ii / 2)];
if (h[xx][yy] == '+') {
h[xx][yy] = '*';
} else {
h[xx][yy] = '+';
}
}
}
}
for (xx = 0; xx < N; ++xx) {
for (yy = 0; yy < N; ++yy) {
printf("%c", h[xx][yy]);
}
printf("\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char a[1 << 10][1 << 10] = {"+*"}, b[1 << 10][1 << 10];
int main() {
int x;
cin >> x;
if (x == 0) {
puts("*");
return 0;
}
for (int i = 2; i <= x; i++) {
int n = (1 << i - 1);
for (int j = 0; j < n - 1; j++)
for (int k = 0; k < n; k++) {
b[j * 2][k] = b[j * 2][k + n] = b[j * 2 + 1][k] = a[j][k];
b[j * 2 + 1][k + n] = (a[j][k] == '+' ? '*' : '+');
}
n *= 2;
for (int j = 0; j < n - 2; j++) strcpy(a[j], b[j]);
for (int j = 0; j < n; j++) a[n - 2][j] = (j < n / 2 ? '+' : '*');
}
int n = (1 << x);
for (int i = 0; i < n; i++) a[n - 1][i] = '+';
for (int i = 0; i < n; i++) puts(a[i]);
}
|
#include <bits/stdc++.h>
using namespace std;
string flip(string tmp) {
string ret = "";
int n = tmp.size();
for (int i = 0; i < n; i++) {
if (tmp[i] == '+')
ret += '*';
else
ret += '+';
}
return ret;
}
vector<string> ans;
vector<string> tp;
vector<string> fin;
int main() {
ans.push_back("++");
ans.push_back("+*");
int k;
cin >> k;
if (k == 0) {
cout << "+";
return 0;
}
int tmp = powl(2, k);
while (tmp != ans.size()) {
for (int i = 0; i < ans.size(); i++) tp.push_back(flip(ans[i]));
for (int i = 0; i < ans.size(); i++) {
fin.push_back(ans[i] + ans[i]);
}
for (int i = 0; i < ans.size(); i++) {
fin.push_back(ans[i] + tp[i]);
}
ans.clear();
for (int i = 0; i < fin.size(); i++) {
ans.push_back(fin[i]);
}
fin.clear();
tp.clear();
}
for (int i = 0; i < ans.size(); i++) {
cout << ans[i] << endl;
}
}
|
#include <bits/stdc++.h>
int main() {
int k;
char A[513][513];
A[0][0] = '+';
scanf("%d", &k);
if (k == 0) {
printf("+");
return 0;
}
int p = 1;
for (int z = 0; z < k; z++) {
for (int i = 0; i < p; i++) {
for (int j = 0; j < p; j++) {
A[i][j + p] = A[i][j];
A[i + p][j] = A[i][j];
if (A[i][j] == '+')
A[i + p][j + p] = '*';
else
A[i + p][j + p] = '+';
}
}
p = p * 2;
}
for (int i = 0; i < p; i++) {
for (int j = 0; j < p; j++) {
printf("%c", A[i][j]);
}
printf("\n");
}
}
|
#include <bits/stdc++.h>
using namespace std;
int a[600][600];
int n;
void build(int x) {
int y = x >> 1;
for (int i = 1; i <= y; ++i) {
for (int j = 1; j <= y; ++j) {
a[i + y][j] = a[i][j + y] = a[i][j];
a[i + y][j + y] = -a[i][j];
}
}
}
int main() {
cin >> n;
if (!n) {
puts("+");
return 0;
}
a[1][1] = 1;
build(n);
for (int i = 1; i <= n; ++i) build(1 << i);
int x = 1 << n;
for (int i = 1; i <= x; ++i) {
for (int j = 1; j <= x; ++j)
if (a[i][j] > 0)
putchar('+');
else
putchar('*');
puts("");
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1 << 11;
char s[maxn][maxn];
char op(char c) {
if (c == '*') {
return '+';
} else
return '*';
}
int main(int argc, const char* argv[]) {
int n;
cin >> n;
s[1][0] = '+';
s[1][1] = '\0';
int l = 1;
for (int i = 0; i < n; i++) {
for (int j = 1; j <= l; j++) {
for (int k = 0; k < l; k++) {
s[j][k + l] = s[j][k];
}
s[j][l * 2] = '\0';
}
for (int j = l + 1; j <= 2 * l; j++) {
for (int k = 0; k < l; k++) {
s[j][k] = s[j - l][k];
s[j][k + l] = op(s[j][k]);
}
s[j][l * 2] = '\0';
}
l *= 2;
}
for (int i = 1; i <= l; i++) {
cout << s[i] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<string> vec[10];
inline char rev(char c) { return c == '+' ? '*' : '+'; }
int main() {
int n, ss = 0;
cin.tie(NULL);
cin.sync_with_stdio(false);
vec[0].push_back("+");
for (int i = 1, max = 2; i <= 9; i++, max *= 2) {
vec[i] = vec[i - 1];
vec[i].insert(vec[i].end(), vec[i - 1].begin(), vec[i - 1].end());
for (int j = 0; j < max; j++) {
for (int k = 0; k < max / 2; k++) {
if (j < max / 2) {
vec[i][j].push_back(rev(vec[i][j][k]));
} else {
vec[i][j].push_back(vec[i][j][k]);
}
}
}
}
cin >> n;
for (int i = 0; i < vec[n].size(); i++) {
cout << vec[n][i] << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void null() { return; }
const long long INF = 3e18 + 9237;
const long long maxn = 1e5 + 7;
const long long mod = 1e9 + 7;
const long long sqN = 320;
const long long lgN = 20;
vector<string> vec;
char a[1 << 9][1 << 9];
string nagh(string s) {
for (long long i = 0; i < s.size(); i++)
if (s[i] == '+')
s[i] = '*';
else
s[i] = '+';
return s;
}
void check(long long n) {
for (long long i = 0; i < n; i++)
for (long long j = 0; j < n; j++) a[i][j] = vec[i][j];
for (long long i = 0; i < n; i++) {
for (long long j = 0; j < n; j++) {
if (i == j) continue;
long long sum = 0;
for (long long k = 0; k < n; k++)
sum += (a[i][k] == '*' ? -1 : 1) * (a[j][k] == '*' ? -1 : 1);
if (sum) return cout << i << " " << j << " you have been haked!", null();
}
}
}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long n;
cin >> n;
vec.push_back("+");
for (long long i = 0; i < n; i++) {
long long sz = vec.size();
for (long long j = 0; j < sz; j++) {
string tmp = vec[j] + nagh(vec[j]);
vec.push_back(tmp);
vec[j] = vec[j] + vec[j];
}
}
for (auto u : vec) cout << u << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
int i, j, k, n, m, a[611][611];
int main() {
scanf("%d", &n);
a[1][1] = 1;
m = 1;
for (i = 1; i <= n; i++) {
for (j = 1; j <= m; j++)
for (k = 1; k <= m; k++) a[j + m][k] = a[j][k];
for (j = 1; j <= m; j++)
for (k = 1; k <= m; k++) a[j][k + m] = a[j][k];
for (j = m + 1; j <= 2 * m; j++)
for (k = m + 1; k <= 2 * m; k++) a[j][k] = a[j - m][k] ^ 1;
m *= 2;
}
for (i = 1; i <= m; i++) {
for (j = 1; j <= m; j++) putchar(a[i][j] ? '+' : '*');
puts("");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<string> solve(int k) {
vector<string> s;
if (k == 0) {
s.push_back("+");
return s;
}
vector<string> prev = solve(k - 1), rev;
for (int i = 0; i < prev.size(); i++) {
string temp;
for (int j = 0; j < prev.size(); j++) {
if (prev[i][j] == '+')
temp += '*';
else
temp += '+';
}
rev.push_back(temp);
}
for (int i = 0; i < prev.size(); i++) {
s.push_back(prev[i] + prev[i]);
s.push_back(prev[i] + rev[i]);
}
return s;
}
int main() {
int k;
cin >> k;
vector<string> s;
s = solve(k);
for (int i = 0; i < s.size(); i++) {
cout << s[i] << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
void print(int num, int bits) {
for (int i = 0; i < bits; i++) {
if ((num >> i) & 1)
printf("+");
else
printf("-");
}
printf("\n");
}
int X[555][555];
int main() {
X[0][0] = 1;
int k;
scanf("%d", &k);
for (int i = 1; i < k + 1; i++) {
int sz = 1 << (i - 1);
for (int j = 0; j < sz; j++)
for (int k = 0; k < sz; k++) {
X[j + sz][k] = X[j][k];
X[j][k + sz] = X[j][k];
X[j + sz][k + sz] = -X[j][k];
}
}
for (int i = 0; i < 1 << k; i++) {
for (int j = 0; j < 1 << k; j++) {
if (X[i][j] == 1)
printf("+");
else
printf("*");
}
printf("\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k;
cin >> k;
vector<vector<int> > v = {{1}};
for (int i = 0; i < k; i++) {
int current = v.size();
for (int j = 0; j < current; j++) {
vector<int> vnew(2 * current);
for (int l = 0; l < current; l++) {
vnew[l] = v[j][l];
vnew[current + l] = v[j][l];
v[j].push_back(-v[j][l]);
}
v.push_back(vnew);
}
}
for (int i = 0; i < v.size(); i++) {
for (int j = 0; j < v[i].size(); j++) {
cout << ((v[i][j] == 1) ? "+" : "*");
}
cout << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 7;
const int MOD = 1e9 + 7;
const int MAXN = (1 << 9) + 3;
int k;
int a[MAXN][MAXN];
void dien(int x) {
if (x == 1) return;
dien(x / 2);
for (int i = 1; i <= x / 2; i++) {
for (int j = 1; j <= x / 2; j++) {
a[i + x / 2][j] = a[i][j + x / 2] = a[i][j];
a[i + x / 2][j + x / 2] = 1 - a[i][j];
}
}
}
int main() {
cin >> k;
dien(1 << k);
for (int i = 1; i <= 1 << k; i++) {
for (int j = 1; j <= 1 << k; j++) {
if (a[i][j] == 0)
cout << '*';
else
cout << '+';
}
cout << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N_MAX = 512;
char a[N_MAX + 1][N_MAX + 1];
int k;
char dif(char a) {
if (a == '+')
return '*';
else
return '+';
}
int main() {
cin >> k;
a[1][1] = '+';
for (int i = 1; i <= k; i++) {
for (int j = 1; j <= (1 << (i - 1)); j++)
for (int f = 1; f + (1 << (i - 1)) <= (1 << i); f++)
a[j][f + (1 << (i - 1))] = a[j][f];
for (int j = 1; j <= (1 << (i - 1)); j++)
for (int f = 1; f <= (1 << (i - 1)); f++)
a[j + (1 << (i - 1))][f] = a[j][f];
for (int j = 1; j <= (1 << (i - 1)); j++)
for (int f = 1; f <= (1 << (i - 1)); f++)
a[j + (1 << (i - 1))][f + (1 << (i - 1))] = dif(a[j][f]);
}
for (int i = 1; i <= (1 << k); i++) {
for (int j = 1; j <= (1 << k); j++) cout << a[i][j];
cout << '\n';
}
}
|
#include <bits/stdc++.h>
using namespace std;
const long long N = (long long)(5e5) + 322;
const long long INF = (long long)(1e9);
const long long mod = (long long)(1e9) + 7;
const double eps = 1e-9;
long long n;
int ch[(1 << 10)][(1 << 10)];
void build(int x) {
if (x == 10) return;
int q = (1 << (x - 1));
for (int i = 1; i <= q; ++i) {
for (int j = 1; j <= q; ++j) {
ch[i + q][j] = ch[i][j];
ch[i][j + q] = ch[i][j];
ch[i + q][j + q] = ch[i][j] ^ 1;
}
}
build(x + 1);
}
int main() {
ios_base ::sync_with_stdio(false);
cin.tie(0);
cin >> n;
n = (1 << n);
ch[1][1] = 1;
build(1);
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j) {
if (ch[i][j]) {
cout << '+';
} else {
cout << '*';
}
}
cout << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long mat[1 << 10][1 << 10];
void run() {
long long n;
cin >> n;
long long num = 1 << n;
mat[0][0] = 0;
for (long long k = 1; k < num; k *= 2) {
for (long long i = 0; i < k; i++) {
for (long long j = 0; j < k; j++) {
mat[i + k][j] = mat[i][j];
mat[i][j + k] = mat[i][j];
mat[i + k][j + k] = (mat[i][j] + 1) % 2;
}
}
}
for (int i = 0; i < num; i++) {
for (int j = 0; j < num; j++) {
if (mat[i][j])
printf("+");
else
printf("*");
}
printf("\n");
}
}
int main() { run(); }
|
#include <bits/stdc++.h>
using namespace std;
string op(string x) {
string s;
for (int i = 0; i < x.size(); i++) {
if (x[i] == '*')
s += '+';
else
s += '*';
}
return s;
}
int main() {
int k;
cin >> k;
vector<string> v[10];
v[0].push_back("+");
for (int i = 1; i <= k; i++) {
for (int j = 0; j < v[i - 1].size(); j++) {
v[i].push_back(v[i - 1][j]);
v[i].back() += op(v[i - 1][j]);
v[i].push_back(v[i - 1][j]);
v[i].back() += v[i - 1][j];
}
}
for (int i = 0; i < v[k].size(); i++) {
cout << v[k][i] << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<vector<int>> f(int k) {
vector<vector<int>> r;
if (k == 0) {
r.push_back({1});
} else if (k == 1) {
r.push_back({1, 1});
r.push_back({1, -1});
} else {
r = f(k - 1);
int n = 1 << (k - 1);
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
r[i].push_back(r[i][j]);
}
}
for (int i = 0; i < n; ++i) {
r.push_back(r[i]);
for (int j = 0; j < n; ++j) {
r[i + n][j + n] *= -1;
}
}
}
return r;
}
void solve() {
int k;
cin >> k;
auto r = f(k);
for (auto x : r) {
for (auto y : x) {
cout << (y == 1 ? '+' : '*');
}
cout << "\n";
}
}
void init() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
}
int main() {
init();
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string s[10][600];
void dfs(int x, int t) {
if (!s[x][t].empty()) return;
dfs(x - 1, t / 2);
s[x][t] = s[x - 1][t / 2];
if (t & 1) {
int len = s[x][t].size();
for (int i = 0; i < len; ++i) {
if (s[x][t][i] == '*') {
s[x][t].push_back('+');
} else {
s[x][t].push_back('*');
}
}
} else {
s[x][t] += s[x][t];
}
}
int main() {
s[0][0] = "+";
int k;
while (cin >> k) {
int n = 1 << k;
for (int i = 0; i < n; ++i) {
dfs(k, i);
cout << s[k][i] << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
char a[540][540];
int main() {
int n;
scanf("%d", &n);
a[0][0] = '+';
a[0][1] = '*';
a[1][0] = '+';
a[1][1] = '+';
if (n == 0) {
printf("+\n");
return 0;
}
for (int i = 2; i <= n; i++) {
int k = 1 << (i - 1);
for (int j = k; j < 2 * k; j++) {
for (int t = 0; t < k; t++) {
a[j][t] = a[j - k][t];
}
}
for (int j = 0; j < k; j++) {
for (int t = 0; t < k; t++) {
a[j][t + k] = a[j][t];
}
}
for (int j = k; j < 2 * k; j++) {
for (int t = 0; t < k; t++) {
if (a[j][t] == '*')
a[j][t + k] = '+';
else
a[j][t + k] = '*';
}
}
}
int d = 1 << n;
for (int i = 0; i < d; i++) {
a[i][d] = '\0';
printf("%s\n", a[i]);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int pow(int a, int n) {
if (n == 0) return 1;
if (n % 2) {
return a * pow(a, n / 2) * pow(a, n / 2);
} else
return pow(a, n / 2) * pow(a, n / 2);
}
int main() {
int k;
cin >> k;
char nn[1024][1024];
k += 1;
nn[0][0] = '+';
for (int i = 1; i < k; i++) {
for (int j = 0; j < pow(2, (i - 1)); j++) {
for (int p = 0; p < pow(2, (i - 1)); p++) {
nn[j + pow(2, (i - 1))][p] = nn[j][p];
if ((i + j) % 2) {
if (nn[j][p] == '+')
nn[j][p + pow(2, (i - 1))] = '+';
else
nn[j][p + pow(2, (i - 1))] = '*';
if (nn[j + pow(2, (i - 1))][p] == '+')
nn[j + pow(2, (i - 1))][p + pow(2, (i - 1))] = '*';
else
nn[j + pow(2, (i - 1))][p + pow(2, (i - 1))] = '+';
} else {
if (nn[j][p] == '+')
nn[j][p + pow(2, (i - 1))] = '*';
else
nn[j][p + pow(2, (i - 1))] = '+';
if (nn[j + pow(2, (i - 1))][p] == '+')
nn[j + pow(2, (i - 1))][p + pow(2, (i - 1))] = '+';
else
nn[j + pow(2, (i - 1))][p + pow(2, (i - 1))] = '*';
}
}
}
}
for (int i = 0; i < pow(2, k - 1); i++) {
for (int j = 0; j < pow(2, k - 1); j++) {
cout << nn[i][j];
}
cout << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = (1 << 9) + 10;
bool ans[maxn][maxn];
void dfs(int n, int x, int y, int v) {
if (n == 1) {
ans[x][y] = v;
return;
}
dfs(n / 2, x, y, v);
dfs(n / 2, x + n / 2, y, v);
dfs(n / 2, x, y + n / 2, v);
dfs(n / 2, x + n / 2, y + n / 2, v ^ 1);
}
int main() {
int k;
scanf("%d", &k);
dfs(1 << k, 0, 0, 1);
for (int i = 0; i < (1 << k); i++) {
for (int j = 0; j < (1 << k); j++)
if (ans[i][j] == 0)
printf("+");
else
printf("*");
printf("\n");
}
return 0;
}
|
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:1024000000,1024000000")
using namespace std;
int a[512 + 10][512 + 10];
int main() {
a[1][1] = 1;
for (int k = 1; k <= 256; k <<= 1) {
for (int i = 1; i <= k; i++) {
for (int j = 1; j <= k; j++) {
a[i][k + j] = a[k + i][j] = a[i][j];
a[i + k][j + k] = -a[i][j];
}
}
}
int n;
scanf("%d", &n);
n = 1 << n;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++)
if (a[i][j] == 1)
printf("+");
else
printf("*");
printf("\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = (1 << 9) + 5;
int a[maxn][maxn];
void dfs(int n, int x, int y, int v) {
if (n == 1) {
a[x][y] = v;
return;
}
dfs(n / 2, x, y, v);
dfs(n / 2, x + n / 2, y, v);
dfs(n / 2, x, y + n / 2, v);
dfs(n / 2, x + n / 2, y + n / 2, -v);
}
int main() {
int n;
while (cin >> n) {
dfs((1 << n), 1, 1, 1);
for (int i = 1; i <= (1 << n); i++) {
for (int j = 1; j <= (1 << n); j++)
if (a[i][j] == 1)
printf("+");
else
printf("*");
printf("\n");
}
}
return 0;
}
|
#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>
const long long int INF = 1e18;
const double PI = 4 * atan(1);
using namespace std;
long long int mpow(long long int base, long long int exp);
void solve();
long long int POW(long long int base, long long int exp);
long long int gcd(long long int a, long long int b);
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int i = 0, j = 0;
int t;
t = 1;
while (t--) {
solve();
}
}
void solve() {
long long int k;
cin >> k;
if (k == 0) {
cout << "*" << '\n';
return;
}
long long int val = 1 << k;
long long int a[val + 1][val + 1];
for (long long int i = 0; i <= val; i++) {
for (long long int j = 0; j <= val; j++) a[i][j] = 1;
}
a[0][0] = 1;
a[1][1] = 1;
a[1][2] = 1;
a[2][1] = 1;
a[2][2] = -1;
for (long long int i = 2; i <= k; i++) {
long long int prev = 1 << (i - 1);
for (long long int j = 1; j <= prev; j++) {
for (long long int k = prev + 1; k <= 2 * prev; k++) {
a[k][j] = a[k - prev][j];
}
}
for (long long int j = prev + 1; j <= 2 * prev; j++) {
for (long long int k = 1; k <= prev; k++) {
a[k][j] = a[k][j - prev];
}
}
for (long long int j = prev + 1; j <= 2 * prev; j++) {
for (long long int k = prev + 1; k <= 2 * prev; k++) {
a[k][j] = -a[k - prev][j - prev];
}
}
}
for (long long int i = 1; i <= val; i++) {
for (long long int j = 1; j <= val; j++) {
if (a[i][j] == 1)
cout << '+';
else
cout << '*';
}
cout << '\n';
}
}
long long int POW(long long int base, long long int exp) {
long long int result = 1;
while (exp > 0) {
if (exp & 1) result = ((long long int)result * base);
base = ((long long int)base * base);
exp >>= 1;
}
return result;
}
long long int mpow(long long int base, long long int exp) {
base %= 1000000007;
long long int result = 1;
while (exp > 0) {
if (exp & 1) result = ((long long int)result * base) % 1000000007;
base = ((long long int)base * base) % 1000000007;
exp >>= 1;
}
return result;
}
long long int gcd(long long int a, long long int b) {
if (b == 0) return a;
return gcd(b, a % b);
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
int k;
vector<string> vs;
vector<string> upg() {
vector<string> res0 = vs;
for (string& s : res0) {
string sc = s;
reverse(sc.begin(), sc.end());
s += sc;
}
vector<string> res1 = res0;
for (string& s : res1) {
for (int i = vs.size(); i < s.size(); i++) {
if (s[i] == '+')
s[i] = '*';
else
s[i] = '+';
}
}
for (string s : res1) res0.push_back(s);
return move(res0);
}
int main() {
cin >> k;
vs.push_back("+");
for (int i = 1; i <= k; i++) vs = upg();
for (string& s : vs) cout << s << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
int k, n = 1;
int a[520][520];
int main() {
ios_base::sync_with_stdio(false);
cin >> k;
a[1][1] = 1;
int i, x, y;
for (i = 1; i <= k; i++) {
for (x = 1; x <= n; x++)
for (y = 1; y <= n; y++) {
a[x + n][y] = a[x][y];
a[x][y + n] = a[x][y];
a[x + n][y + n] = -a[x][y];
}
n *= 2;
}
for (x = 1; x <= n; x++) {
for (y = 1; y <= n; y++)
if (a[x][y] == 1)
cout << "+";
else
cout << "*";
cout << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char Not(char c) {
if (c == '*') return '+';
return '*';
}
int main() {
ios_base::sync_with_stdio(false);
int k;
char arr[520][520];
arr[0][0] = '+';
for (int c = 1; c < 10; c++) {
for (int i = 0; i < (1 << (c - 1)); i++)
for (int j = (1 << (c - 1)); j < (1 << c); j++)
arr[i][j] = Not(arr[i][(1 << c) - j - 1]);
for (int i = 1 << (c - 1); i < (1 << c); i++)
for (int j = 0; j < (1 << (c - 1)); j++)
arr[i][j] = arr[(1 << c) - i - 1][j];
for (int i = 1 << (c - 1); i < (1 << c); i++)
for (int j = (1 << (c - 1)); j < (1 << c); j++)
arr[i][j] = arr[(1 << c) - i - 1][(1 << c) - j - 1];
}
while (cin >> k) {
for (int i = 0; i < (1 << k); i++, cout << endl)
for (int j = 0; j < (1 << k); j++) cout << arr[i][j];
}
}
|
#include <bits/stdc++.h>
using namespace std;
vector<vector<int> > go(int k) {
if (k == 0) {
return {{+1}};
}
if (k == 1) {
return {{+1, +1}, {+1, -1}};
}
vector<vector<int> > prev = go(k - 1);
vector<vector<int> > ans = prev;
for (auto v : prev) {
ans.push_back(v);
}
int size = 1 << (k - 1);
for (int i = 0; i < size; ++i) {
for (int j = 0; j < size; ++j) {
if (i < size / 2) {
ans[i].push_back(-1 * prev[i][j]);
} else {
ans[i].push_back(prev[i][j]);
}
}
}
for (int i = 0; i < size; ++i) {
for (int j = 0; j < size; ++j) {
if (i < size / 2) {
ans[size + i].push_back(prev[i][j]);
} else {
ans[size + i].push_back(-1 * prev[i][j]);
}
}
}
return ans;
}
inline void printAnswer(const vector<vector<int> >& ans) {
for (int i = 0; i < ans.size(); ++i) {
for (int j = 0; j < ans[i].size(); ++j) {
putchar((ans[i][j] == +1 ? '+' : '*'));
}
puts("");
}
}
inline void checkAnswer(const vector<vector<int> >& ans) {
for (int i = 0; i < ans.size(); ++i) {
for (int j = 0; j < i; ++j) {
int cur = 0;
for (int k = 0; k < ans[i].size(); ++k) {
cur += ans[i][k] * ans[j][k];
}
assert(cur == 0);
}
}
}
int main() {
int k;
scanf("%d", &k);
vector<vector<int> > ans = go(k);
printAnswer(ans);
return 0;
}
|
#include <bits/stdc++.h>
int k, ans[550][550];
int main() {
scanf("%d", &k);
ans[1][1] = 1;
for (int n = 1; n <= k; n++) {
int tmp = pow(2, n - 1);
for (int i = 1; i <= tmp; i++)
for (int j = 1; j <= tmp; j++)
ans[tmp + i][j] = ans[i][tmp + j] = ans[i][j],
ans[tmp + i][tmp + j] = ans[i][j] ^ 1;
}
int tmp = pow(2, k);
for (int i = 1; i <= tmp; i++) {
for (int j = 1; j <= tmp; j++) putchar(ans[i][j] ? '+' : '*');
putchar('\n');
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long k;
string arr[550][550];
string rev(string t) {
string tmp = "";
long long len = t.length();
for (long long i = (long long)(0); i <= (long long)(len - 1); i++)
if (t[i] == '+')
tmp += '*';
else
tmp += '+';
return tmp;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> k;
arr[0][1] = "+";
arr[1][1] = "++";
arr[1][2] = "+*";
for (long long i = (long long)(2); i <= (long long)(k); i++) {
long long tmp = 1 << i;
for (long long j = (long long)(1); j <= (long long)(tmp / 2); j++)
arr[i][j] = arr[i - 1][j] + arr[i - 1][j];
for (long long j = (long long)(tmp / 2 + 1); j <= (long long)(tmp); j++)
arr[i][j] = arr[i - 1][j - tmp / 2] + rev(arr[i - 1][j - tmp / 2]);
}
for (long long j = (long long)(1); j <= (long long)(1 << k); j++)
cout << arr[k][j] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string neg(string s) {
for (int i = 0; i < (int)s.size(); i++)
if (s[i] == '+')
s[i] = '*';
else
s[i] = '+';
return s;
}
vector<string> harmony(int k) {
vector<string> v, tmp;
if (k == 2) {
v.push_back("++**");
v.push_back("+*+*");
v.push_back("++++");
v.push_back("+**+");
} else {
tmp = harmony(k - 1);
v = tmp;
for (int i = 0; i < (int)tmp.size(); i++) v[i] += tmp[i];
for (int i = 0; i < (int)tmp.size(); i++) v.push_back(neg(tmp[i]) + tmp[i]);
}
return v;
}
int main() {
int k;
cin >> k;
if (k == 0) {
cout << "+";
return 0;
}
if (k == 1) {
cout << "++" << endl << "+*" << endl;
return 0;
}
vector<string> v = harmony(k);
for (int i = 0; i < (int)v.size(); i++) cout << v[i] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
int calc(int a, int b, int k) {
if (a == 1)
return 1;
else {
if (a % 2 == 0 && (b > (1 << (k - 1))))
return -1 * calc((a + 1) / 2, b - (1 << (k - 1)), k - 1);
if (b > (1 << (k - 1))) return calc((a + 1) / 2, b - (1 << (k - 1)), k - 1);
return calc((a + 1) / 2, b, k - 1);
}
}
int main() {
int i, j;
while (scanf("%d", &n) != EOF) {
int k = (1 << n);
for (i = 1; i <= k; i++) {
for (j = 1; j <= k; j++)
if (calc(i, j, n) == -1)
printf("*");
else
printf("+");
puts("");
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = int(1.5 * 1e7);
const int inf = ~0U;
const long long ll_inf = 1e18 + 420;
const double eps = 1e-4;
const int N = 1e6 + 7;
const int MAX = 2e5 + 9;
const int MOD = 1e9 + 7;
const long double pi = 3.14159265359;
int main(int n) {
cin >> n;
n = 1 << n;
for (int i = 0; i < n; i++, cout << "\n") {
for (int j = 0; j < n; j++) {
cout << (__builtin_parity(i & j) ? '*' : '+');
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int a[1025][1025];
int main() {
int n;
cin >> n;
int t = 1;
a[0][0] = 1;
while (n--) {
for (int i = 0; i < t; i++) {
for (int j = 0; j < t; j++) {
a[i + t][j] = a[i][j + t] = a[i][j];
a[i + t][j + t] = -a[i][j];
}
}
t <<= 1;
}
for (int i = 0; i < t; i++) {
for (int j = 0; j < t; j++) {
if (a[i][j] == 1)
putchar('+');
else
putchar('*');
}
printf("\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[600][600];
int n;
void build(int x) {
int y = x >> 1;
for (int i = 1; i <= y; ++i) {
for (int j = 1; j <= y; ++j) {
a[i + y][j] = a[i][j + y] = a[i][j];
a[i + y][j + y] = -a[i][j];
}
}
}
int main() {
scanf("%d", &n);
if (!n) {
puts("+");
return 0;
}
a[1][1] = 1;
for (int i = 1; i <= n; ++i) build(1 << i);
int x = 1 << n;
for (int i = 1; i <= x; ++i) {
for (int j = 1; j <= x; ++j)
if (a[i][j] > 0)
putchar('+');
else
putchar('*');
puts("");
}
}
|
#include <bits/stdc++.h>
const char en = '\n';
using namespace std;
string neg(string s) {
string t;
for (int i = 0; i < s.length(); i++)
if (s[i] == '+')
t += '*';
else
t += '+';
return t;
}
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
int poc = (1 << n);
vector<string> V;
V.push_back("+");
for (int i = 1; i <= n; i++) {
vector<string> T;
for (int j = 0; j < V.size(); j++) {
T.push_back(V[j] + V[j]);
T.push_back(V[j] + neg(V[j]));
}
swap(V, T);
}
for (int i = 0; i < V.size(); i++) cout << V[i] << en;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = (int)1E9;
char g[513];
int solve(int i, int j, int k) {
if (k == 0)
return 0;
else if (k == 1)
return i == 0 && j == 0 ? 0 : 1;
int div = 1 << k - 1;
if (i < div && j < div)
return solve(i, j, k - 1);
else if (i >= div && j < div)
return solve(i - div, j, k - 1);
else if (i < div && j >= div)
return solve(i, j - div, k - 1);
else
return !solve(i - div, j - div, k - 1);
}
int main() {
int k;
cin >> k;
for (int i = (0); i < (1 << k); i++) {
for (int j = (0); j < (1 << k); j++) {
g[j] = solve(i, j, k) ? '*' : '+';
}
printf("%s\n", g);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[550][550];
int main() {
int n;
memset(a, 0, sizeof(a));
a[0][0] = 1;
int cnt = 1;
int sum = 9;
while (sum--) {
for (int i = 0; i < cnt; i++) {
for (int j = 0; j < cnt; j++) {
a[i + cnt][j] = a[i][j + cnt] = a[i][j];
a[i + cnt][j + cnt] = -a[i][j];
}
}
cnt *= 2;
}
while (scanf("%d", &n) != EOF) {
int ans = 1;
for (int i = 0; i < n; i++) ans *= 2;
for (int i = 0; i < ans; i++) {
for (int j = 0; j < ans; j++) {
if (a[i][j] == 1)
printf("+");
else
printf("*");
}
printf("\n");
}
}
return 0;
}
|
#include <bits/stdc++.h>
long long mpoll(long long a, long long n, long long mod) {
long long ret = 1;
long long b = a;
while (n) {
if (n & 1) ret = (ret * b) % mod;
b = (b * b) % mod;
n >>= 1;
}
return (long long)ret;
}
using namespace std;
using namespace std;
char a[1001][1001];
int main() {
int x;
cin >> x;
memset(a, '.', sizeof(a));
a[0][0] = '+';
for (int p = 1; p <= x; p++) {
int k = (1 << (p - 1));
int n = (1 << p);
for (int i = 0; i < n; i++) {
if (i >= k) {
for (int j = 0; j < k; j++) {
a[i][j] = a[i - k][j];
}
}
for (int j = k; j < n; j++) {
a[i][j] = a[i][j - k];
}
}
for (int i = k; i < n; i++) {
for (int j = k; j < n; j++) {
if (a[i][j] == '+')
a[i][j] = '*';
else
a[i][j] = '+';
}
}
}
for (int i = 0; i < (1 << x); i++) {
for (int j = 0; j < (1 << x); j++) {
cout << a[i][j];
}
cout << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int INF = 1 << 29;
int a[5055][5055];
int main() {
memset(a, 0, sizeof a);
a[0][0] = a[0][1] = a[1][0] = 1;
a[1][1] = -1;
int r = 2;
int c = 2;
while (r < 1055) {
for (int i = 0; i < r / 2; ++i) {
for (int j = 0; j < c; ++j) {
a[i][j + c] = -a[i][j];
}
}
for (int i = r / 2; i < r; ++i) {
for (int j = 0; j < c; ++j) {
a[i][j + c] = a[i][j];
}
}
for (int i = 0; i < r; ++i) {
for (int j = 0; j < c; ++j) {
a[i + r][j] = a[i][j];
}
}
for (int i = 0; i < r; ++i) {
for (int j = c; j < c * 2; ++j) {
a[i + r][j] = -a[i][j];
}
}
r <<= 1;
c <<= 1;
}
int n;
scanf("%d", &n);
n = 1 << n;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
if (a[i][j] > 0)
putchar('+');
else
putchar('*');
}
putchar('\n');
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = (int)1e9;
const double EPS = (long double)1e-7;
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 << ((__builtin_popcount(x & y) & 1) ? '+' : '*');
}
cout << "\n";
}
return 0;
}
|
#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 += '*';
}
}
int len = v.size(), e = 0, o = 0;
bool flag1 = true;
for (int I = 0; I < len; I++) {
for (int j = 0; j < n; j++) {
if (str[j] == v[I].str[j])
e++;
else
o++;
}
if (e != o) {
flag1 = false;
break;
}
}
if (flag1) {
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;
int len = v.size();
bool flag1 = true;
for (int I = 0; I < len; I++) {
for (int j = 0; j < n; j++) {
if (str[j] == v[I].str[j])
e++;
else
o++;
}
if (e != o) {
flag1 = false;
break;
}
}
if (flag1) {
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;
int A[512][512];
void fun(int n, int m, int k, int s) {
int i, j, x, y;
for (i = 0, x = n; i < k; i++, x++) {
for (j = 0, y = m; j < k; j++, y++) A[x][y] = s * A[i][j];
}
}
int main() {
int n, k, i, j, m;
n = 1;
A[0][0] = 1;
cin >> m;
while (m--) {
fun(0, n, n, 1);
fun(n, 0, n, 1);
fun(n, n, n, -1);
n *= 2;
}
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++)
if (A[i][j] == 1)
putchar('+');
else
putchar('*');
putchar('\n');
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[1520][1520];
int main(void) {
int i, j, k, n;
scanf("%d", &n);
a[0][0] = 1;
for (k = 1; k <= n; k++)
for (i = 0; i < (1 << (k - 1)); i++)
for (j = 0; j < (1 << (k - 1)); j++) {
a[i][j + (1 << (k - 1))] = a[i][j];
a[i + (1 << (k - 1))][j] = a[i][j];
a[i + (1 << (k - 1))][j + (1 << (k - 1))] = 1 - a[i][j];
}
for (i = 0; i < (1 << n); i++) {
for (j = 0; j < (1 << n); j++) {
if (a[i][j])
printf("+");
else
printf("*");
}
printf("\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-9;
const int N = 100010;
int n;
char res[10][1010][1010];
char ch(char x) {
if (x == '+') return '*';
return '+';
}
int main() {
res[0][0][0] = '+';
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
for (int j = 0; j < (1 << i); j += 2) {
for (int k = 0; k < (1 << i - 1); k++) {
res[i][j][k + (1 << i - 1)] = res[i][j][k] = res[i - 1][j / 2][k];
res[i][j + 1][k] = res[i - 1][j / 2][k];
res[i][j + 1][k + (1 << i - 1)] = ch(res[i - 1][j / 2][k]);
}
}
}
for (int i = 0; i < (1 << n); i++) printf("%s\n", res[n][i]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int M = 10;
char a[1 << M][1 << M];
int32_t main() {
int k;
cin >> k;
a[0][0] = '+';
a[0][1] = '+';
a[1][0] = '*';
a[1][1] = '+';
int siz = (1 << k);
for (int x = 1; x < k; x++)
for (int i = 0; i < (1 << x); i++)
for (int j = 0; j < (1 << x); j++) {
a[i][j + (1 << x)] = a[i + (1 << x)][j] = a[i][j];
a[i + (1 << x)][j + (1 << x)] = a[i][j] == '+' ? '*' : '+';
}
for (int i = 0; i < siz; i++) {
for (int j = 0; j < siz; j++) printf("%c", a[i][j]);
printf("\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = (1 << 9);
int base[2][2];
int ans[N][N], aux[N][N];
int k;
int main() {
base[0][0] = base[1][0] = base[1][1] = 1;
base[0][1] = -1;
scanf(" %d", &k);
if (k <= 1) {
for (int i = 0; i < (1 << k); i++, putchar('\n'))
for (int j = 0; j < (1 << k); j++)
if (base[i][j] > 0)
putchar('+');
else
putchar('*');
return 0;
}
for (int i = 0; i < 2; i++)
for (int j = 0; j < 2; j++) ans[i][j] = base[i][j];
for (int l = 1; l < k; l++) {
for (int i = 0; i < (1 << l); i++)
for (int j = 0; j < (1 << l); j++) aux[i][j] = base[0][0] * ans[i][j];
for (int i = 0; i < (1 << l); i++)
for (int j = 0; j < (1 << l); j++)
aux[i][(1 << l) + j] = base[0][1] * ans[i][j];
for (int i = 0; i < (1 << l); i++)
for (int j = 0; j < (1 << l); j++)
aux[(1 << l) + i][j] = base[1][0] * ans[i][j];
for (int i = 0; i < (1 << l); i++)
for (int j = 0; j < (1 << l); j++)
aux[(1 << l) + i][(1 << l) + j] = base[1][1] * ans[i][j];
for (int i = 0; i < N; i++)
for (int j = 0; j < N; j++) ans[i][j] = aux[i][j];
}
for (int i = 0; i < (1 << k); i++, putchar('\n'))
for (int j = 0; j < (1 << k); j++)
if (ans[i][j] == 1)
putchar('+');
else if (ans[i][j] == -1)
putchar('*');
}
|
#include <bits/stdc++.h>
using namespace std;
const char newline = '\n';
const int dy[4] = {-1, 0, 0, 1};
const int dx[4] = {0, -1, 1, 0};
const int mod = 1000000007;
long long powmod(long long a, long long b) {
long long res = 1;
a %= mod;
assert(b >= 0);
for (; b; b >>= 1) {
if (b & 1) res = res * a % mod;
a = a * a % mod;
}
return res;
}
void solve(int n) {
if (n == 0) {
cout << '+' << newline;
return;
}
int k = pow(2, n);
for (int i = 0; i < k; i++) {
for (int j = 0; j < k; j++) {
if (__builtin_popcount(i | j) % 2 == 0)
cout << '+';
else
cout << '*';
}
cout << newline;
}
}
int main(int argc, char **argv) {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
solve(n);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, j;
scanf("%d", &n);
n = 1 << n;
for (i = 0; i < n; i++, puts(""))
for (j = 0; j < n; j++) putchar(__builtin_parity(i & j) ? '+' : '*');
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int k;
int mat[1024][1024];
void preenche(int x) {
for (int i = 0; i < x; i++) {
for (int j = 0; j < x; j++) {
mat[i][j + x] = mat[i][j];
mat[i + x][j] = mat[i][j];
mat[i + x][j + x] = -mat[i][j];
}
}
}
int main(void) {
ios_base::sync_with_stdio(false);
cin >> k;
mat[0][0] = 1;
for (int i = 0; i < k; i++) {
preenche(1 << i);
}
for (int i = 0; i < (1 << k); i++) {
for (int j = 0; j < (1 << k); j++) {
if (mat[i][j] == 1)
cout << "+";
else
cout << "*";
}
cout << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int deg;
cin >> deg;
deg %= 360;
long long int ans[4];
ans[0] = deg;
for (int i = 1; i < 4; i++) ans[i] = ((ans[i - 1] - 90)) % 360;
for (int i = 0; i < 4; i++) ans[i] = abs(ans[i]);
for (int i = 0; i < 4; i++)
if (ans[i] > 180) ans[i] = 360 - ans[i];
int mini = 360;
int k = -1;
for (int i = 0; i < 4; i++)
if (ans[i] < mini) {
mini = ans[i];
k = i;
}
cout << k;
}
|
#include <bits/stdc++.h>
int main() {
long long n;
scanf("%I64d", &n);
n = (n % 360 + 404) % 360;
printf("%I64d", n / 90 * !!(n - 359));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
long long a, ans, k;
int main() {
cin >> a;
a = -a;
a %= 360;
k = 0;
ans = min(abs(a), 360 - abs(a));
a += 90;
a %= 360;
if (ans > min(abs(a), 360 - abs(a))) {
ans = min(abs(a), 360 - abs(a));
k = 1;
}
a += 90;
a %= 360;
if (ans > min(abs(a), 360 - abs(a))) {
ans = min(abs(a), 360 - abs(a));
k = 2;
}
a += 90;
a %= 360;
if (ans > min(abs(a), 360 - abs(a))) {
ans = min(abs(a), 360 - abs(a));
k = 3;
}
cout << k;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m;
int i, j, k;
while (scanf("%lld", &n) != EOF) {
n = n % 360;
if (n < 0) n += 360;
if (n <= 45 || n >= 315) {
printf("0\n");
continue;
}
k = 0;
while (1) {
n -= 90;
k++;
if (n <= 0 && n + 90 >= 0) break;
}
if (abs(n) < n + 90)
printf("%d\n", k);
else
printf("%d\n", k - 1);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long x;
cin >> x;
x = (x % 360 + 360) % 360;
if (x >= 315 || x <= 45)
cout << 0;
else if (x > 45 && x <= 135)
cout << 1;
else if (x > 135 && x <= 225)
cout << 2;
else if (x > 225 && x < 315)
cout << 3;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
n = -n;
n %= 360;
if (n < 0) n += 360;
int best = min(n, 360 - n);
int res = 0;
for (int i = 0; i < 4; ++i) {
int cur = n + 90 * i;
cur %= 360;
if (best > min(cur, 360 - cur)) {
best = min(cur, 360 - cur);
res = i;
}
}
cout << res << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
n = (((n % 360 + 404) % 360) % 359) / 90;
cout << n;
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
const int MOD = 1e9 + 7;
const int INF32 = 1 << 30;
const long long INF64 = 1LL << 60;
long long gcd(long long a, long long b) { return (!b ? a : gcd(b, a % b)); }
long long lcm(long long a, long long b) { return a * b / gcd(a, b); }
long long mul(long long a, long long b) { return a * b % MOD; }
long long modpow(long long b, long long i) {
long long s = 1;
while (i) {
if (i % 2) s = (s * b) % MOD;
b = (b * b) % MOD;
i /= 2;
}
return s;
}
long long inv(long long a) { return modpow(a, MOD - 2); }
void solve() {
long long n;
cin >> n;
n %= 360;
if (n < 0) n += 360;
cout << (n < 315 ? (n + 44) / 90 : 0);
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
solve();
return 0;
}
|
#include <bits/stdc++.h>
long long min(long long a, long long b) { return a < b ? a : b; }
int main() {
long long x;
int best, i, angles[4];
scanf("%I64d", &x);
x %= 360;
x += 360;
x %= 360;
for (best = i = 0; i < 4; ++i) {
angles[i] = min(llabs(x - 360), x);
x -= 90;
if (x < 0) x += 360;
if (angles[i] < angles[best]) best = i;
}
printf("%d\n", best);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m;
int i, j, k;
while (scanf("%lld", &n) != EOF) {
n = n % 360;
if (n < 0) n += 360;
if (n <= 45 || n >= 315) {
printf("0\n");
continue;
}
k = 0;
while (1) {
n -= 90;
k++;
if (n <= 0 && n + 90 >= 0) break;
}
if (abs(n) < n + 90)
printf("%d\n", k);
else
printf("%d\n", k - 1);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void Max(T &a, T b) {
if (a < b) a = b;
}
template <class T>
inline void Min(T &a, T b) {
if (a > b) a = b;
}
inline void add(int &a, int b) {
a += b;
while (a >= 1000000007) a -= 1000000007;
}
int pow(int a, int b) {
int ans = 1;
while (b) {
if (b & 1) ans = 1LL * ans * a % 1000000007;
a = 1LL * a * a % 1000000007;
b >>= 1;
}
return ans;
}
int main() {
int T, i, j, k, m, n;
long long first;
cin >> first;
first %= 360;
if (first < 0) first += 360;
int ans = -1, mx = 5;
if (first >= 0) {
int second = 0;
for (i = 0; i <= 3; i++) {
int d = abs(first - second);
if (d >= 180) d = 360 - d;
if (ans == -1)
ans = i, mx = d;
else if (mx > d)
mx = d, ans = i;
second += 90;
}
}
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
int m = -(n % 360);
int ans = 400;
int cnt;
for (int i = 0; i <= 3; i++) {
if (i) m += 90;
m %= 360;
int Min;
if (m < 0)
Min = min(-m, 360 + m);
else
Min = min(m, 360 - m);
if (ans > Min) {
ans = Min;
cnt = i;
}
}
cout << cnt << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
std::ios_base::sync_with_stdio(false);
long long x;
cin >> x;
x %= 360;
if (x < 0 && x >= -45) {
cout << "0" << endl;
return 0;
}
if (x > 0 && x >= 360 - 45) {
cout << "0" << endl;
return 0;
}
if (x < 0) x += 360;
int res = 0;
while (x > 45) {
x -= 90;
res++;
}
cout << res << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long x;
cin >> x;
x = ((x % 360) + 360) % 360;
int a = x;
int ans = 0;
int mn = min(a, 360 - a);
for (int i = 1; i <= 3; i++) {
a = ((a - 90) % 360 + 360) % 360;
int t = min(a, 360 - a);
if (t < mn) {
mn = t;
ans = i;
}
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T gcd(T a, T b) {
while (b) {
a %= b;
swap(a, b);
}
return a;
}
inline int nxt() {
int wow;
scanf("%d", &wow);
return wow;
}
inline long long int lxt() {
long long int wow;
scanf("%lld", &wow);
return wow;
}
int main() {
long long int n = lxt();
if (n < 0) n = 360 - (-n) % 360;
n %= 360;
if (n >= 315) {
cout << 0 << endl;
return 0;
}
int ans = n / 90;
if (n % 90 > 45) ans++;
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long x, b;
cin >> x;
x = ((x % 360) + 360) % 360;
b = min(x, 360 - x);
int out = 0;
for (int i = 0; i < 10; ++i) {
x = (x - 90 + 360) % 360;
if (min(x, 360 - x) < b) b = min(x, 360 - x), out = i + 1;
}
cout << out;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, t, res;
int i, r;
scanf("%I64d", &n);
n %= 360;
r = 0;
res = 10000;
for (i = 0; i <= 4; i++) {
if (n > 0)
t = min(n, 360 - n);
else
t = min(-n, n + 360);
if (t < res) {
r = i;
res = t;
}
n -= 90;
n %= 360;
}
printf("%d\n", r);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
long long n;
void run() {
scanf("%I64d", &n);
n %= 360;
if (n < 0) n += 360;
printf("%d\n", n <= 45 ? 0 : n <= 135 ? 1 : n <= 225 ? 2 : n < 315 ? 3 : 0);
}
int main() {
run();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long deg, cur;
int count, ans;
cin >> deg;
deg %= 360;
if (deg < 0) deg += 360;
if (deg <= 45 || deg >= 315)
ans = 0;
else if (deg <= 135)
ans = 1;
else if (deg <= 225)
ans = 2;
else
ans = 3;
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
long long int x;
cin >> x;
int angle;
if (x > 0) {
angle = x % 360;
if (angle > 180) {
angle -= 360;
}
} else {
angle = -((-x) % 360);
if (angle <= -180) {
angle += 360;
}
}
int ans = 0;
if (angle <= 45 && angle >= -45) {
ans = 0;
} else if (angle <= 135 && angle > 45) {
ans = 1;
} else if (angle <= 180 && angle > 135 || angle <= -135 && angle > -180) {
ans = 2;
} else if (angle < -45 && angle >= -135) {
ans = 3;
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const int MAXN = 1000005;
int main() {
long long du;
cin >> du;
du = (du % 360 + 360) % 360;
if (abs(du - 360) <= 45)
cout << 0 << endl;
else if (du % 90 <= 45)
cout << du / 90 << endl;
else
cout << du / 90 + 1 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 200100;
const double INF = 1e15, EPS = 1e-7, PI = acos(-1);
long long angle;
int main() {
while (cin >> angle) {
angle = ((angle % 360) + 360) % 360;
for (int i = 0; i < (int)(5); i++) {
long long act = i * 90;
if (min(abs(act - angle), 360 - abs(act - angle)) <= 45) {
cout << i << endl;
break;
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n;
cin >> n;
n %= 360;
if (n == 0) {
cout << "0";
return 0;
}
if (n < 0) n += 360;
if (n <= 45)
cout << "0";
else if (n <= 90 + 45)
cout << "1";
else if (n <= 90 + 90 + 45)
cout << "2";
else if (n < 90 + 90 + 90 + 45)
cout << "3";
else
cout << "0";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long mins(long long a) {
return min(abs(180 - a), min(a, (360 + a) % 360));
}
int main() {
long long x, tx;
cin >> x;
if (x == 0) {
cout << "0" << endl;
return 0;
}
x = (360 + ((abs(x) % 360) * (x / (abs(x))))) % 360;
x = (x + 44) % 360;
cout << (x % 359) / 90 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long dist(long long a) { return min(a, 360 - a); }
int main() {
long long n;
cin >> n;
long long p = -n;
p %= 360;
p = (p + 360) % 360;
long long d0 = dist(p);
long long d1 = dist((p + 90) % 360);
long long d2 = dist((p + 180) % 360);
long long d3 = dist((p + 270) % 360);
long long minD = d0;
minD = min(minD, d1);
minD = min(minD, d2);
minD = min(minD, d3);
int res = 3;
if (minD == d0)
res = 0;
else if (minD == d1)
res = 1;
else if (minD == d2)
res = 2;
cout << res << endl;
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.