solution
stringlengths 11
983k
| difficulty
int64 0
21
| language
stringclasses 2
values |
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
inline int readint() {
char c = getchar();
while (!isdigit(c)) c = getchar();
int x = 0;
while (isdigit(c)) {
x = x * 10 + c - '0';
c = getchar();
}
return x;
}
inline long long readlong() {
char c = getchar();
while (!isdigit(c)) c = getchar();
long long x = 0;
while (isdigit(c)) {
x = x * 10 + c - '0';
c = getchar();
}
return x;
}
int mat[30][105][105];
int brr[105][105];
int arr[30][105];
int bits[30];
int n;
void turnto(int val) {
for (int i = 0; i < (int)(30); i++) {
bits[i] = val & 1;
val >>= 1;
}
}
int main() {
cin >> n;
for (int i = 0; i < (int)(n); i++) {
for (int j = 0; j < (int)(n); j++) {
cin >> brr[i][j];
}
}
if (n == 1) {
puts("0");
} else {
for (int i = 0; i < (int)(n); i++) {
for (int j = 0; j < (int)(n); j++) {
if (i == j) continue;
int val = brr[i][j];
turnto(val);
for (int k = 0; k < (int)(30); k++) {
mat[k][i][j] = bits[k];
}
}
}
memset(arr, 0, sizeof(arr));
for (int k = 0; k < (int)(30); k++) {
for (int i = 0; i < (int)(n); i++) {
for (int j = 0; j < (int)(n); j++) {
if (i == j || !mat[k][i][j]) continue;
arr[k][i] = 1;
arr[k][j] = 1;
}
}
}
for (int i = 0; i < (int)(n); i++) {
int res = 0;
for (int k = (int)(29); k >= (int)(0); k--) {
res <<= 1;
res |= arr[k][i];
}
cout << res << ' ';
}
cout << endl;
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
int main() {
long int N, a[105][105], b[105];
scanf("%ld", &N);
for (int i = 0; i < N; i++)
for (int j = 0; j < N; j++) scanf("%d", &a[i][j]);
memset(b, 0, sizeof(b));
for (int i = 0; i < N; i++)
for (int j = 0; j < N; j++) {
if (i != j) b[i] |= a[i][j];
}
for (int i = 0; i < N; i++) printf("%d ", b[i]);
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
int b[110][110][35], a[110][35];
int map[110][110];
int main() {
int n, i, j, len, temp, ans;
scanf("%d", &n);
for (i = 1; i <= n; ++i) {
for (j = 1; j <= n; ++j) {
scanf("%d", &map[i][j]);
if (i == j) continue;
len = 0;
temp = map[i][j];
while (temp) {
b[i][j][len++] = temp & 1;
temp >>= 1;
}
}
}
if (n == 1) {
printf("0\n");
} else if (n == 2) {
printf("%d %d\n", map[1][2], map[1][2]);
} else {
for (len = 0; len <= 30; ++len) {
for (i = 1; i <= n; ++i) {
for (j = i + 1; j <= n; ++j) {
if (b[i][j][len]) {
a[i][len] = a[j][len] = 1;
}
}
}
}
for (i = 1; i <= n; ++i) {
ans = 0;
for (len = 30; len >= 0; --len) {
ans = (ans << 1) + a[i][len];
}
printf("%d", ans);
if (i < n)
printf(" ");
else
printf("\n");
}
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int ans[600];
int a[800][800];
int main() {
int i, j, k, n;
scanf("%d", &n);
for (i = 0; i < n; i++)
for (j = 0; j < n; j++) scanf("%d", &a[i][j]);
for (i = 0; i < n; i++) {
for (k = 0; k < 30; k++) {
int ok = 0;
for (j = 0; j < n; j++) {
if (j == i) continue;
if (a[i][j] & (1 << k)) ok = 1;
}
if (ok) ans[i] += 1 << k;
}
}
for (i = 0; i < n; i++) {
if (i) printf(" ");
printf("%d", ans[i]);
}
printf("\n");
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long b[2000][2000];
long long a[2000];
long long i, j, now, n;
int main() {
cin >> n;
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++) cin >> b[i][j];
for (j = 1; j <= n; j++) {
for (i = 1; i < j; i++)
if (i != j) {
a[i] = a[i] | b[i][j];
a[j] = a[j] | b[i][j];
}
}
for (i = 1; i <= n; i++) cout << a[i] << " ";
cout << endl;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, x;
cin >> n;
for (int i = 0; i < n; i++) {
x = 0;
for (int j = 0; j < n; j++) {
cin >> a;
if (a != -1) x |= a;
}
cout << x << " ";
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e3 + 7;
int n, a[N][N], ans[N];
int main() {
cin >> n;
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j) cin >> a[i][j];
for (int i = 1; i <= n; ++i) {
int res = 0;
for (int j = i + 1; j <= n; ++j) res |= a[i][j];
for (int j = 1; j < i; ++j)
if ((res & ans[j]) != a[i][j]) res |= a[i][j];
ans[i] = res;
}
for (int i = 1; i <= n; ++i) cout << ans[i] << " ";
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0;
vector<int> a;
scanf("%d", &n);
a.resize(n + 1);
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++) {
int b;
scanf("%d", &b);
if (i != j) a[i] |= b;
}
for (int i = 0; i < n; i++) printf("%d ", a[i]);
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using std::cin;
using std::cout;
using std::endl;
using std::map;
using std::max;
using std::min;
using std::queue;
using std::sort;
using std::stack;
using std::string;
int two(int a, int *b) {
for (int i = 0;; i++) {
if (a == 0) return i;
b[i] = a % 2 == 1 ? 1 : b[i];
a /= 2;
}
}
int main() {
int n, a[110][50] = {0}, b[110][110] = {0};
int num[110] = {0};
cin >> n;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++) cin >> b[i][j];
for (int i = 0; i < n; i++)
for (int j = i + 1; j < n; j++) {
int count = two(b[i][j], a[i]);
num[i] = max(count, num[i]);
}
for (int i = n - 1; i > 0; i--)
for (int j = i - 1; j >= 0; j--) {
int count = two(b[j][i], a[i]);
num[i] = max(count, num[i]);
}
int count = 0;
for (int j = num[0] - 1; j >= 0; j--) count = count * 2 + a[0][j];
cout << count;
for (int i = 1; i < n; i++) {
count = 0;
for (int j = num[i] - 1; j >= 0; j--) count = count * 2 + a[i][j];
cout << " " << count;
}
cout << endl;
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
int a[110], x;
int main() {
int n, i, j;
scanf("%d", &n);
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++) {
scanf("%d", &x);
if (i != j) {
a[i] |= x;
a[j] |= x;
}
}
for (i = 1; i <= n; i++) printf("%s%d", i - 1 ? " " : "", a[i]);
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int inf = 0x7FFFFFFF;
const double eps = 1e-9L;
const double pi = acos(-1.0);
int main() {
int ans, x, n;
cin >> n;
for (int i = 0, _n = (n); i < _n; i++) {
ans = 0;
for (int j = 0, _n = (n); j < _n; j++) {
cin >> x;
if (i != j) ans |= x;
}
cout << ans << " ";
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
unsigned mx[112][112];
int main() {
int n;
cin >> n;
;
for (int i = (0); i < n; i++)
for (int j = (0); j < n; j++) cin >> mx[i][j];
bool f = 1;
for (int i = (0); i < n; i++) {
unsigned val = 0;
for (int j = (0); j < n; j++) {
if (i != j) val |= mx[i][j];
}
if (f)
f = 0;
else
cout << " ";
cout << val;
}
cout << endl;
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-12;
const double PI = acos(-1);
const long long INFF = (long long)1e18;
const int INF = (int)1e9;
const int mod = (int)1e9 + 7;
const int MAX = (int)1e2 + 7;
int st[MAX][MAX];
int ans[MAX];
int main(void) {
int n;
scanf("%d", &n);
;
for (int i = (1); i < (n + 1); ++i)
for (int j = (1); j < (n + 1); ++j) scanf("%d", st[i] + j);
if (n == 1)
puts("0");
else if (n == 2)
printf("%d %d\n", st[1][2], st[1][2]);
else {
for (int i = (1); i < (n + 1); ++i) {
for (int j = (1); j < (n + 1); ++j)
if (j != i) {
for (int l = 0; l < (30); ++l) {
if (st[i][j] & (1 << l)) {
ans[i] |= (1 << l);
ans[j] |= (1 << l);
}
}
}
}
for (int i = (1); i < (n + 1); ++i) printf("%d ", ans[i]);
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[105][105];
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) cin >> arr[i][j];
}
if (n == 1)
cout << "0";
else {
bool visit[105][105] = {false};
vector<int> ans(105);
for (int i = 0; i < ans.size(); i++) ans[i] = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (i == j) continue;
if (visit[i][j] == false) {
visit[i][j] = true, visit[j][i] = true;
ans[i] |= arr[i][j];
ans[j] |= arr[i][j];
}
}
}
for (int i = 1; i <= n; i++) cout << ans[i] << " ";
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int d[110][110];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++) cin >> d[i][j];
vector<int> a(n);
for (int i = 0; i < 30; i++)
for (int j = 0; j < n; j++) {
int c = 0;
for (int k = 0; k < n; k++)
if (k != j && (d[j][k] & (1 << i))) c++;
if (c > 0) a[j] = a[j] | (1 << i);
}
for (int i = 0; i < n; i++) cout << a[i] << " ";
cout << endl;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
string in;
int n;
int matrix[101][101];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; ++i)
for (int j = 0; j < n; ++j) scanf("%d", &matrix[i][j]);
for (int i = 0; i < n; ++i) {
int number = 0;
for (int j = 0; j < n; ++j) {
if (matrix[i][j] > 0) number |= matrix[i][j];
}
printf("%d ", number);
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long a[105];
long long n;
int main() {
while (cin >> n) {
memset(a, 0, sizeof(a));
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
long long tmp;
cin >> tmp;
if (i != j) a[i] = a[i] | tmp;
}
}
for (int i = 1; i <= n; i++) cout << a[i] << " ";
cout << '\n';
}
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 110;
int n, a[MAXN];
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) {
int temp;
cin >> temp;
if (i != j) {
for (int k = 0; k <= 29; k++)
if (temp & (1 << k)) {
a[i] |= (1 << k);
a[j] |= (1 << k);
}
}
}
for (int i = 1; i <= n; i++) cout << a[i] << " ";
cout << endl;
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int input[128];
int mat[128][128];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> mat[i][j];
}
}
int num = 0;
for (int i = 0; i < n; i++) {
num = 0;
for (int j = 0; j < n; j++) {
if (i == j) continue;
num |= mat[i][j];
}
input[i] = num;
}
for (int i = 0; i < n; i++) {
cout << input[i] << " ";
}
cout << endl;
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c;
int n;
cin >> n;
int i, j, k;
for (i = 0; i < n; i++) {
int ans = 0;
for (j = 0; j < n; j++) {
cin >> k;
if (i == j) continue;
ans |= k;
}
cout << ans << " ";
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 109;
int A[N][N], a[N];
char str[509];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) {
int aij;
cin >> aij;
if (i == j) continue;
a[i] |= aij;
}
for (int i = 1; i <= n; i++) cout << a[i] << " ";
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <class T>
void debug(T begin, T end) {
for (T i = begin; i != end; ++i) cerr << *i << " ";
cerr << endl;
}
inline bool valid(int x, int y, int W, int H) {
return (x >= 0 && y >= 0 && x < W && y < H);
}
const int INF = 100000000;
const double EPS = 1e-8;
const int MOD = 1000000007;
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
int main() {
int N;
cin >> N;
long long a[100] = {};
long long b[100][100] = {};
for (int i = (0); i < (int)(N); ++i)
for (int j = (0); j < (int)(N); ++j) cin >> b[i][j];
for (int i = (0); i < (int)(N); ++i)
for (int j = (0); j < (int)(N); ++j)
if (i != j) a[i] |= b[i][j];
for (int i = (0); i < (int)(N); ++i) {
cout << a[i];
if (i != N - 1)
cout << " ";
else
cout << endl;
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
long long n, i, j, a[200], b[200][200];
using namespace std;
int main() {
scanf("%I64d", &n);
memset(a, 0, sizeof(a));
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++) scanf("%I64d", &b[i][j]);
for (i = 1; i <= n; i++) {
for (j = 1; j <= n; j++)
if (i != j) a[i] = (a[i] | b[i][j]);
}
for (i = 1; i <= n; i++)
if (i != n)
printf("%I64d ", a[i]);
else
printf("%I64d\n", a[i]);
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n;
long long b[110][110], a[110];
for (int i = 0; i < n; i++) {
a[i] = 0;
for (int j = 0; j < n; j++) {
cin >> b[i][j];
if (i != j) {
a[i] = (a[i] | b[i][j]);
}
}
}
for (int i = 0; i < n; i++) {
cout << a[i] << " ";
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, a[111];
void input() {
cin >> n;
memset(a, 0, sizeof(a));
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++) {
int b;
cin >> b;
if (i == j) continue;
a[i] |= b;
a[j] |= b;
}
}
void solve() {
for (int i = 0; i < n; i++) cout << a[i] << " ";
}
int main(int argc, char* argv[]) {
input();
solve();
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, j, x;
cin >> n;
int a[n];
for (i = 0; i < n; i++) a[i] = 0;
for (i = 0; i < n; i++)
for (j = 0; j < n; j++) {
if (j > i) {
cin >> x;
a[i] = a[i] | x;
a[j] = a[j] | x;
} else
cin >> x;
}
for (i = 0; i < n; i++) cout << a[i] << " ";
}
| 10 | CPP |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:102400000,102400000")
using std::bitset;
using namespace std;
int b[110][110], a[110];
int n;
int main() {
int i, j, tem;
while (scanf("%d", &n) != EOF) {
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++) scanf("%d", &b[i][j]);
memset(a, 0, sizeof(a));
;
for (i = 1; i <= n; i++) {
for (j = 1; j <= n; j++)
if (j != i) a[i] |= b[i][j];
}
for (i = 1; i < n; i++) printf("%d ", a[i]);
printf("%d\n", a[n]);
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
string dv(long long a) {
string s = "";
while (a > 0) {
if (a % 2 == 0) {
s = s + "0";
} else
s = s + "1";
a = a / 2;
}
return s;
}
long long vd(string s) {
long long a = 0, i;
for (i = s.length() - 1; i >= 0; i--) {
a = a * 2 + s[i] - '0';
}
return a;
}
int main() {
vector<long long> v, v1, v2, v3;
long long a, b, c, d, e = 0, f, i, j = 0, n, m, k = 0;
long double x, y, x1, x2, y1, y2, x3, y3, x4, y4;
queue<long long> qu, qu1, qu2;
stack<long long> st, st1, st2;
vector<string> ve;
string s1, s;
cin >> n;
for (i = 0; i < n; i++) {
s = "";
for (j = 0; j < n; j++) {
cin >> a;
if (a == -1) continue;
s1 = dv(a);
for (k = 0; k < s1.length(); k++) {
if (k >= s.length()) {
s = s + s1[k];
} else {
if (s[k] != s1[k]) s[k] = '1';
}
}
}
if (s == "")
cout << 0 << " ";
else
cout << vd(s) << " ";
}
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long inf = 1000000000000000000LL;
const double EPS = 1e-9;
const long long mod = 1000000007ll;
const int maxn = (int)105 + 10;
int a[maxn][maxn];
int ret[maxn];
int n;
int te[maxn][maxn];
int main() {
scanf("%d", &n);
for (int i = 0; i < (int)(n); ++i)
for (int j = 0; j < (int)(n); ++j) scanf("%d", &a[i][j]);
for (int i = 0; i < (int)(n); ++i)
for (int j = 0; j < (int)(n); ++j)
if (i != j) ret[i] |= a[i][j];
for (int i = 0; i < (int)(n); ++i) printf("%d ", ret[i]);
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long a[200][200], b[200];
int c[200][35];
const long long N = 31;
int main() {
int i, j, h, ta, tb;
long long k, t;
int n, m, s, sb, max;
while (~scanf("%d", &n)) {
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++) {
scanf("%I64d", &a[i][j]);
}
for (i = 1; i <= n; i++)
for (j = i + 1; j <= n; j++) {
for (k = 0; k <= N; k++) {
t = 1 << k;
if (a[i][j] & t) {
c[i][k]++;
c[j][k]++;
}
}
}
for (i = 1; i <= n; i++)
for (j = 0; j <= N; j++)
if (c[i][j]) b[i] += 1 << j;
for (i = 1; i <= n; i++) printf("%I64d ", b[i]);
printf("\n");
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, j, a[102][102];
scanf("%d", &n);
;
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) scanf("%d", &a[i][j]);
;
}
if (i == 1) {
printf("0\n");
return 0;
}
for (i = 0; i < n; i++) {
int f[32] = {0};
for (j = 0; j < n; j++) {
if (i == j) continue;
int x = a[i][j], c = 0;
while (x > 0) {
if (x & 1) f[c] = 1;
c++;
x /= 2;
}
}
int ans = 0, k;
j = 1;
for (k = 0; k < 32; k++) {
if (f[k]) ans += j;
j *= 2;
}
printf("%d ", ans);
}
printf("\n");
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int a[200][200], ans[10000];
while (~scanf("%d", &n)) {
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) scanf("%d", &a[i][j]);
for (int i = 1; i <= n; i++) {
ans[i] = 0;
for (int j = 1; j <= n; j++) {
if (i == j) continue;
ans[i] = ans[i] | a[i][j];
}
}
for (int i = 1; i <= n - 1; i++) printf("%d ", ans[i]);
printf("%d\n", ans[n]);
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
int n;
cin >> n;
int M[n][n], a[n];
memset(a, 0, sizeof a);
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
cin >> M[i][j];
if (i != j) {
for (int k = 0; k <= 30; ++k) {
if (M[i][j] >> k & 1) {
a[i] |= (1 << k);
a[j] |= (1 << k);
}
}
}
}
}
for (int i = 0; i < n; ++i) {
if (i) cout << ' ';
cout << a[i];
}
cout << '\n';
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MODULO = 1000000007;
const int INF = 100000000;
int b[100][100];
int main() {
int n;
int a[100] = {};
cin >> n;
for (int i = 0; i < (n); i++)
for (int j = 0; j < (n); j++) cin >> b[i][j];
for (int i = 0; i < (n); i++)
for (int j = 0; j < (n); j++) {
if (i == j) continue;
a[i] |= b[i][j];
}
for (int i = 0; i < (n); i++) printf("%d%c", a[i], i == n - 1 ? '\n' : ' ');
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int b[110][110];
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) {
scanf("%d", &b[i][j]);
}
if (n == 1)
printf("0");
else {
for (int i = 1; i <= n; i++) {
int tmp = 0;
for (int j = 1; j <= n; j++) {
if (i == j) continue;
tmp |= b[i][j];
}
printf("%d ", tmp);
}
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
long i, n, b[200][200], ma, j, t, ans, a[200];
int main() {
cin >> n;
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++) {
cin >> t;
if (i != j) {
a[i] |= t;
a[j] |= t;
}
}
cout << a[1];
for (i = 2; i <= n; i++) cout << " " << a[i];
cout << endl;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int in[105][105];
int ans[105];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++) cin >> in[i][j];
for (int i = 0; i < n; i++) {
int temp = 0;
for (int j = i + 1; j < n; j++) temp |= in[i][j];
ans[i] = temp;
}
for (int j = 0; j < n; j++) {
for (int i = 0; i < j; i++) {
ans[j] |= in[i][j];
}
}
for (int i = 0; i < n; i++) cout << ans[i] << " ";
cout << endl;
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
int num[103][103];
int dist[103], vis[103];
int n;
void spfa() {
int a, b, i, j;
queue<int> q;
for (i = 1; i <= n; i++) {
dist[i] = 0;
for (j = 1; j <= n; j++) {
if (i == j) {
continue;
}
dist[i] |= num[i][j];
}
q.push(i);
vis[i] = 1;
}
while (!q.empty()) {
a = q.front();
q.pop();
vis[a] = 0;
for (i = 1; i <= n; i++) {
if (i == a) {
continue;
}
if ((dist[a] & dist[i]) != num[a][i]) {
dist[i] |= num[a][i];
dist[a] |= num[a][i];
q.push(a);
vis[a] = 1;
if (vis[i] == 0) {
q.push(i);
vis[i] = 1;
}
}
}
}
}
int main() {
cin >> n;
int i, j;
for (i = 1; i <= n; i++) {
for (j = 1; j <= n; j++) {
scanf("%d", &num[i][j]);
}
}
spfa();
for (i = 1; i <= n; i++) {
printf("%d ", dist[i]);
}
putchar(10);
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100 + 5;
const int maxbit = 30;
int n, x[maxn][maxn], sol[maxn], andAll;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++) scanf("%d", &x[i][j]);
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
if (i != j)
for (int k = 0; k < maxbit; k++)
if (x[i][j] & (1 << k) && !(sol[i] & (1 << k))) sol[i] += (1 << k);
for (int i = 0; i < n; i++) printf("%d ", sol[i]);
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
void fileio_in_out() {
freopen(".in", "r", stdin);
freopen(".out", "w", stdout);
}
void fileio_txt() {
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
}
int n, m, ans = 0;
int i, j, k, l;
int a[1111111];
int main() {
scanf("%d", &n);
for (i = 1; i <= n; i++) {
a[i] = 0;
for (j = 1; j <= n; j++) {
scanf("%d", &m);
if (i != j) a[i] |= m;
}
}
for (i = 1; i < n; i++) printf("%d ", a[i]);
printf("%d\n", a[n]);
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
void dk_98() {}
long long gcd(long long a, long long b) {
if (b == 0) return a;
return gcd(b, a % b);
}
void solve() {
int n;
cin >> n;
int arr[n][n];
for (long long i = 0; i < (int)(n); i++) {
for (long long j = 0; j < (int)(n); j++) {
cin >> arr[i][j];
}
}
if (n == 1) {
cout << 0;
return;
}
int ans[n];
memset(ans, 0, sizeof(ans));
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (j != i) ans[i] = ans[i] | arr[i][j];
}
}
for (long long i = 0; i < (int)(n); i++) {
cout << ans[i] << " ";
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
;
dk_98();
int t = 1;
while (t--) {
solve();
}
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n;
int b[105][105] = {0};
int a[105] = {0};
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
scanf("%d", &b[i][j]);
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (i != j) a[i] |= b[i][j];
}
}
for (int i = 0; i < n; i++) printf("%d ", a[i]);
printf("\n");
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 105;
int a[maxn], b[maxn][maxn], n, B[maxn][maxn];
int main() {
int i, j, p, flag;
while (~scanf("%d", &n)) {
if (n == 1) {
scanf("%d", &flag);
printf("0\n");
continue;
}
memset(b, 0, sizeof(b));
memset(a, 0, sizeof(a));
memset(B, 0, sizeof(B));
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++) scanf("%d", &b[i][j]);
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++) {
if (i != j) {
a[i] += (b[i][j] - (b[i][j] & a[i]));
a[j] += (b[i][j] - (b[i][j] & a[j]));
}
}
for (i = 1; i <= n; i++) {
if (i == 1)
printf("%d", a[i]);
else
printf(" %d", a[i]);
}
printf("\n");
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
const long long mod = 1000000007;
int a[111][111];
void solve() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int g = 0, x;
for (int j = 0; j < n; j++) {
cin >> x;
if (x != -1) g = g | x;
}
cout << g << " ";
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
solve();
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <class T>
T gcd(T a, T b) {
return b == 0 ? a : gcd(b, a % b);
}
template <class T>
T maxm(T a, T b) {
return a > b ? a : b;
}
template <class T>
T minm(T a, T b) {
return a < b ? a : b;
}
template <class T>
T abs(T a) {
return a > 0 ? a : (-1) * a;
}
template <class T>
T sq(T a) {
return a * a;
}
int main() {
int n, i, j;
int a[105][105];
int val[105];
scanf("%d", &n);
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
scanf("%d", &a[i][j]);
}
}
int ans;
for (i = 0; i < n; i++) {
ans = 0;
for (j = 0; j < n; j++) {
if (a[i][j] != -1) ans |= a[i][j];
}
val[i] = ans;
}
for (i = 0; i < n; i++) {
cout << val[i] << " ";
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int ans = 0;
for (int j = 0; j < n; j++) {
int a;
cin >> a;
if (a != -1) ans = ans | a;
}
cout << ans << " ";
}
cout << endl;
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int m[100][100];
int b[100][32];
int res[100];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
cin >> m[i][j];
}
}
for (int i = 0; i < n; ++i) {
for (int j = 0; j < 32; ++j) {
for (int k = 0; k < n; ++k) {
if (m[i][k] != -1) {
if (m[i][k] & (1 << j)) {
b[i][j] = 1;
}
}
}
}
}
for (int i = 0; i < n; ++i) {
for (int j = 0; j < 31; ++j) {
res[i] += (b[i][j] * (1 << j));
}
}
cout << res[0];
for (int i = 1; i < n; ++i) cout << ' ' << res[i];
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int i, j, k, m, n, l;
int a[100 + 10][100 + 10], b[100 + 10][100 + 10], c[100 + 10];
bool v[100 + 10];
int main() {
while (cin >> n) {
memset(c, 0, sizeof(c));
for (int i = (1); i <= (n); ++i)
for (int j = (1); j <= (n); ++j) scanf("%d", &a[i][j]);
for (int k = 0; k < (31); ++k) {
for (int i = (1); i <= (n); ++i)
for (int j = (1); j <= (n); ++j)
if (i != j) {
b[i][j] = a[i][j] & (1 << k);
if (b[i][j]) c[i] |= (1 << k), c[j] |= (1 << k);
}
}
for (int i = (1); i <= (n); ++i) {
if (i - 1) putchar(' ');
printf("%d", c[i]);
}
putchar('\n');
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[200][200];
int c[200];
for (int i = 1; i <= n; i++) {
int b = 0;
for (int j = 1; j <= n; j++) {
cin >> a[i][j];
if (a[i][j] == -1)
continue;
else
b = b | a[i][j];
}
c[i] = b;
}
for (int i = 1; i <= n; i++) cout << c[i] << " ";
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf(" %d ", &n);
int a[105][105];
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++) scanf(" %d ", &a[i][j]);
for (int i = 0; i < n; i++) {
int ans = 0;
for (int j = 0; j < n; j++)
if (i != j) ans |= a[i][j];
printf("%d ", ans);
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n, a[110];
int g[110][110];
scanf("%d", &n);
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++) scanf("%d", &g[i][j]);
if (n == 1) {
printf("0\n");
return;
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++)
if (i != j) {
a[i] = g[i][j];
break;
}
for (int j = 0; j < n; j++)
if (i != j) a[i] |= g[i][j];
}
for (int i = 0; i < n; i++) printf("%d%c", a[i], i == n - 1 ? '\n' : ' ');
}
int main() {
solve();
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
int arr[n][n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) cin >> arr[i][j];
}
a[0] = 0;
for (int j = 1; j < n; j++) {
a[0] = a[0] | arr[0][j];
a[j] = arr[0][j];
}
for (int i = 1; i < n; i++) {
for (int j = i + 1; j < n; j++) {
a[i] = a[i] | arr[i][j];
a[j] = arr[i][j] | a[j];
}
}
for (int i = 0; i < n; i++) cout << a[i] << " ";
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<int> > v(n, vector<int>(n));
vector<int> res(n);
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
cin >> v[i][j];
}
}
for (int i = 0; i < n; ++i) {
for (int k = 0; k < 32; ++k) {
int mask = 1 << k;
for (int j = 0; j < n; ++j) {
if (i == j) continue;
if (v[i][j] & mask) {
res[i] |= mask;
break;
}
}
}
}
for (int i = 0; i < n; ++i) cout << res[i] << ' ';
cout << endl;
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, k, l, m = 0, n;
int a[1111] = {0};
int map[111][111];
cin >> n;
for (i = 1; i <= n; i++) {
for (j = 1; j <= n; j++) {
cin >> map[i][j];
if (j != i) a[i] |= map[i][j];
}
}
cout << a[1];
for (i = 2; i <= n; i++) {
cout << " " << a[i];
}
cout << endl;
}
| 10 | CPP |
n=int(input())
A=[0]*n
ans=[0]*n
for i in range(n):
A[i]=list(map(int,input().split()))
for j in range(n):
if(j==i):continue
ans[i]|=A[i][j]
for i in range(n):
print(ans[i],' ',end='')
| 10 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, a = 0, b;
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> b;
if (i == j) continue;
a = a | b;
}
cout << a << " ";
a = 0;
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, a, x;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
x = 0;
for (int j = 1; j <= n; j++) {
cin >> a;
if (a == -1) continue;
x = x | a;
}
cout << x << " ";
}
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int ary[120][120];
int main(void) {
ios_base::sync_with_stdio(0);
int n;
cin >> n;
vector<int> re(n, 0);
vector<vector<int> > v(n);
for (int i = 0; i < (n); i++)
for (int j = 0; j < (n); j++) {
cin >> ary[i][j];
if (ary[i][j] == -1) {
v[i].push_back(j);
v[j].push_back(i);
}
}
for (int i = 0; i < (n); i++) {
for (int j = (i + 1); j < (n); j++) {
if (ary[i][j] != -1) {
re[i] = re[i] | ary[i][j];
re[j] = re[j] | ary[i][j];
}
}
int tmp = re[i];
for (int j = 0; j < (((int)(v[i]).size())); j++) {
tmp = tmp | re[v[i][j]];
}
re[i] = tmp;
for (int j = 0; j < (((int)(v[i]).size())); j++) re[v[i][j]] = tmp;
}
for (int i = 0; i < (((int)(re).size())); i++) cout << re[i] << " ";
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long b[110][110];
long long a[110];
int main() {
ios::sync_with_stdio(false);
long long n;
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> b[i][j];
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (b[i][j] != -1) {
a[i] |= b[i][j];
}
}
}
for (int i = 0; i < n; i++) {
cout << a[i] << " ";
}
}
| 10 | CPP |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:67108864")
using namespace std;
const long double EPS = 1e-9;
const int INF = 1 << 28;
const long double PI = fabsl(atan2l(0.0, -1.0));
const int MAXCHIPS = 5005;
int n;
int b[101][101];
void load() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) scanf("%d", &b[i][j]);
}
}
void solve() {
vector<int> a(n, 0);
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (i == j) continue;
a[i] |= b[i][j];
a[j] |= b[i][j];
}
}
for (int i = 0; i < n; i++) {
if (i > 0) printf(" ");
printf("%d", a[i]);
}
printf("\n");
}
int main() {
load();
solve();
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
int mtr[100][100];
int a[100];
int main(int argc, char *argv[]) {
int n, t;
scanf("%d", &n);
int max = 0, min = 0;
int cur = 0;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
scanf("%d", &mtr[i][j]);
}
}
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
if (i == j) continue;
a[i] |= mtr[i][j];
}
}
for (int i = 0; i < n; ++i) printf("%d ", a[i]);
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1.0);
int n, b[105][105], a[105];
void solve() {
memset(a, 0, sizeof(a));
for (int k = 0; k <= 30; k++) {
int t = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (i != j) {
a[i] |= (b[i][j] & (1 << k));
}
}
}
}
for (int i = 0; i < n; i++) {
cout << a[i] << ' ';
}
cout << endl;
}
int main() {
while (cin >> n) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> b[i][j];
}
}
solve();
}
}
| 10 | CPP |
#include <bits/stdc++.h>
#pragma comment(linker, "/stack:16777216")
using namespace std;
const int INF = 1 << 30;
const int MAX = 512;
const int MAX2 = 1 << 20;
const int ADD = 100000;
int n;
bool B[MAX][MAX][32];
bool R[MAX][32];
int A[MAX];
int Res[MAX];
int main() {
cin >> n;
for (int i = (0); i < (n); ++i)
for (int j = (0); j < (n); ++j) {
int t;
cin >> t;
if (t == -1) continue;
for (int k = (0); k < (32); ++k) B[i][j][k] = ((t & (1 << k)) != 0);
}
if (n == 1) {
cout << 0 << endl;
return 0;
}
for (int bit = (0); bit < (32); ++bit) {
bool was = false;
for (int i = (0); i < (n); ++i) {
bool all0 = true, all1 = true;
for (int j = (0); j < (n); ++j) {
if (i == j) continue;
if (B[i][j][bit] == 0)
all1 = false;
else
all0 = false;
}
if (all1) {
for (int j = (0); j < (n); ++j) R[j][bit] = true;
was = true;
break;
} else if (!all0 && !all1) {
R[i][bit] = true;
for (int j = (0); j < (n); ++j)
if (i != j) {
if (B[i][j][bit] == 1)
R[j][bit] = 1;
else
R[j][bit] = 0;
}
was = true;
break;
}
}
}
for (int i = (0); i < (n); ++i) {
for (int j = (0); j < (32); ++j) Res[i] += (1 << j) * R[i][j];
cout << Res[i] << ' ';
}
cout << endl;
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n = 0;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
a[i] = 0;
for (int j = 0; j < n; j++) {
int temp;
cin >> temp;
if (temp != -1) a[i] |= temp;
}
}
for (int i = 0; i < n; i++) cout << a[i] << " ";
return 0;
}
| 10 | CPP |
n = int(input())
p = [0] * n
for i in range(n):
t = list(map(int, input().split()))
t.pop(i)
s = 0
for j in t:
s |= j
p[i] = s
print(' '.join(map(str, p))) | 10 | PYTHON3 |
#include <bits/stdc++.h>
int ans[111][33];
int mp[111][111];
int main() {
int n;
scanf("%d", &n);
int i, j, k;
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++) scanf("%d", &mp[i][j]);
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
for (k = 0; k <= 30; k++)
if ((1 << k) & mp[i][j] && i != j) ans[i][k] = 1;
for (i = 1; i <= n; i++) {
int ans1 = 0;
for (j = 0; j <= 30; j++)
if (ans[i][j] == 1) ans1 += (1 << j);
printf("%d ", ans1);
}
}
| 10 | CPP |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:16777216")
using namespace std;
template <class _T>
inline string tostr(const _T& a) {
ostringstream os("");
os << a;
return os.str();
}
const long double pi = 3.1415926535897932384626433832795;
const long double eps = 1e-9;
const int N = (int)1e5 + 5;
const int INF = (int)1e9 + 10;
char a[101][40];
int n, b[101][101];
long long get(int ind) {
long long curst = 1;
long long ans = 0;
for (int i = 0; i < 40; i++) {
ans = ans + curst * (int)(a[ind][i] - '0');
curst *= 2;
}
return ans;
}
void go(int val, int x, int y) {
string second = "";
while (val != 0) {
second += tostr(val % 2);
val /= 2;
}
for (int i = 0; i < second.size(); i++)
if (second[i] == '1') {
a[x][i] = '1';
a[y][i] = '1';
}
return;
}
int main() {
ios_base::sync_with_stdio(0);
cout.flags(ios::fixed);
cout.precision(2);
cin >> n;
for (int i = 0; i < n; i++)
for (int j = 0; j < 40; j++) a[i][j] = '0';
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++) {
cin >> b[i][j];
if (i == j) continue;
go(b[i][j], i, j);
}
for (int i = 0; i < n; i++) cout << get(i) << ' ';
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, m, k, g, mx, mn, res, c, x, y, z, w, p, q, r, l, s, t;
cin >> n;
long long int a[n];
memset(a, 0, sizeof(a));
for (long long int i = 0; i < n; i++) {
for (long long int j = 0; j < n; j++) {
cin >> m;
if (i != j) a[i] |= m;
}
}
for (long long int x : a) cout << x << " ";
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
int table[105][105];
unsigned int a[105];
unsigned int power2[32];
inline void set(int ind, int pos) { a[ind] = a[ind] | power2[pos]; }
inline bool is_set(int i, int j, int pos) {
if (table[i][j] & power2[pos])
return true;
else
return false;
}
void calc() {
int i;
power2[0] = 1;
for (i = 1; i < 32; i++) {
power2[i] = 2 * power2[i - 1];
}
}
int main() {
int n, i, j, k;
scanf("%d", &n);
calc();
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
scanf("%d", &table[i][j]);
}
}
for (i = 0; i < n; i++) a[i] = 0;
for (i = 0; i < n; i++) {
for (j = i + 1; j < n; j++) {
for (k = 0; k < 32; k++) {
if (is_set(i, j, k)) {
set(i, k);
set(j, k);
}
}
}
}
for (i = 0; i < n; i++) {
printf("%d ", a[i]);
}
}
| 10 | CPP |
n=int(input())
a=[]
for i in range(n):
a.append(list(map(int,input().split())))
ans = [0]*n
for i in range(n):
for j in range(n):
if j!=i:
ans[i] |= a[i][j]
print(ans[i],end = ' ')
| 10 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long b[200][200], cnt, c[200][200], ans[200], n, po, a[200][200][70], m;
int main() {
cin >> n;
for (long long i = 1; i <= n; i++) {
for (long long j = 1; j <= n; j++) {
cin >> b[i][j];
if (i != j) {
cnt = 0;
long long cur = b[i][j];
while (cur != 0) {
a[i][j][cnt++] = cur % 2;
cur /= 2;
}
}
}
}
for (long long i = 1; i <= n; i++) {
for (long long j = 1; j <= n; j++) {
if (i != j) {
for (long long k = 0; k <= 50; k++) {
if (a[i][j][k] == 1) {
c[i][k] = 1;
c[j][k] = 1;
}
}
}
}
}
for (long long i = 1; i <= n; i++) {
po = 1;
for (long long j = 0; j <= 50; j++) {
ans[i] += c[i][j] * po;
po *= 2;
}
cout << ans[i] << ' ';
}
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int mat[101][101];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> mat[i][j];
if (i == j) mat[i][j] = 0;
}
}
for (int i = 0; i < n; i++) {
int x = 0;
for (int j = 0; j < n; j++) {
x |= mat[i][j];
}
cout << x << " ";
}
cout << endl;
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
queue<int> v;
bool used[10001][10001];
int ko = 100000, m, k, ans, n, a[(int)1e5], b[101][101];
int main() {
setlocale(LC_ALL, "Rus");
cin >> n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) {
scanf("%d", &b[i][j]);
if (i == j) continue;
a[i] |= b[i][j];
}
for (int i = 1; i <= n; i++) cout << a[i] << ' ';
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int a[105];
int main() {
int n, i, j, k, t;
scanf("%d", &n);
for (i = 0; i < n; ++i) {
k = 0;
for (j = 0; j < n; ++j) {
scanf("%d", &t);
if (t != -1) {
k |= t;
}
}
a[i] = k;
}
for (i = 0; i < n; ++i) {
if (i > 0) {
printf(" ");
}
printf("%d", a[i]);
}
printf("\n");
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
long long mat[102][102];
for (long long i = 1; i <= n; i++)
for (long long j = 1; j <= n; j++) cin >> mat[i][j];
for (long long i = 1; i <= n; i++) {
long long s = 0;
for (long long j = 1; j <= n; j++) {
if (mat[j][i] != -1) s = s | mat[i][j];
}
cout << s << " ";
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n;
long a[101][101], b[1000000];
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) cin >> a[i][j];
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
if (a[i][j] != -1) {
for (int k = 1; k <= 32; k++)
if (((b[i] >> (k - 1)) & 1) < (a[i][j] >> (k - 1) & 1))
b[i] = b[i] + (1 << (k - 1));
}
for (int i = 1; i <= n; i++) cout << b[i] << " ";
}
| 10 | CPP |
#include <bits/stdc++.h>
int n;
int i, j, k;
int a[101];
int b[101][101];
int main() {
while (scanf("%d", &n) != EOF) {
for (i = 1; i <= n; i++) {
a[i] = 0;
for (j = 1; j <= n; j++) scanf("%d", &b[i][j]);
}
for (i = 1; i <= n; i++)
for (j = i + 1; j <= n; j++) {
a[i] |= b[i][j];
a[j] |= b[i][j];
}
for (i = 1; i <= n; i++)
if (i == n)
printf("%d\n", a[i]);
else
printf("%d ", a[i]);
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
int m, n, t;
int a[110][31], b[110][110];
int ans[110];
int main() {
int i, j, k;
scanf("%d", &n);
for (i = 0; i < n; i++)
for (j = 0; j < n; j++) scanf("%d", &b[i][j]);
for (i = 0; i < n; i++) {
for (j = i + 1; j < n; j++) {
for (k = 0; k < 31; k++) {
if (b[i][j] & (1 << k)) a[i][k] = a[j][k] = 1;
}
}
}
for (i = 0; i < n; i++)
for (j = 0; j < 31; j++)
if (a[i][j]) ans[i] += (1 << j);
for (i = 0; i < n - 1; i++) printf("%d ", ans[i]);
printf("%d\n", ans[i]);
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
cerr << name << " : " << arg1 << "\n";
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
const char* comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << " : " << arg1 << " , ";
__f(comma + 1, args...);
}
inline long long int gcd(long long int a, long long int b) {
a = abs(a), b = abs(b);
while (b) a = a % b, swap(a, b);
return a;
}
inline long long int power(long long int a, long long int p) {
long long int res = 1, x = a;
while (p) {
if (p & 1) res = (res * x);
x = (x * x), p >>= 1;
}
return res;
}
inline long long int mul_mod(long long int a, long long int p,
long long int m) {
long long int res = 0, x = a % m;
while (p) {
if (p & 1) res = (res + x) % m;
x = (x << 1) % m, p >>= 1;
}
return res;
}
inline long long int big_mod(long long int a, long long int p,
long long int m) {
long long int res = 1 % m, x = a % m;
while (p) {
if (p & 1) res = (res * x) % m;
x = (x * x) % m, p >>= 1;
}
return res;
}
long long int ext_gcd(long long int A, long long int B, long long int* X,
long long int* Y) {
long long int x2, y2, x1, y1, x, y, r2, r1, q, r;
x2 = 1, y2 = 0;
x1 = 0, y1 = 1;
for (r2 = A, r1 = B; r1 != 0;
r2 = r1, r1 = r, x2 = x1, y2 = y1, x1 = x, y1 = y) {
q = r2 / r1, r = r2 % r1;
x = x2 - (q * x1), y = y2 - (q * y1);
}
*X = x2;
*Y = y2;
return r2;
}
inline long long int mod_inv(long long int a, long long int m) {
long long int x, y;
ext_gcd(a, m, &x, &y);
x %= m;
if (x < 0) x += m;
return x;
}
const int INF = 1e9 + 9;
int n;
int grid[109][109];
int ans[109];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
scanf("%d", &grid[i][j]);
if (i != j) {
ans[i] |= grid[i][j];
}
}
}
for (int i = 0; i < n; i++) {
printf("%d ", ans[i]);
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
int a;
int d[109];
int b[109][109];
int main() {
scanf("%d", &a);
for (int i = 0; i < a; i++)
for (int j = 0; j < a; j++) scanf("%d", &b[i][j]);
for (int i = 0; i < a; i++)
for (int j = 0; j < a; j++)
if (i != j) d[i] = (d[i] | b[i][j]);
for (int i = 0; i < a; i++) printf("%d ", d[i]);
}
| 10 | CPP |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;
template <typename X>
inline X abs(const X& a) {
return a < 0 ? -a : a;
}
template <typename X>
inline X sqr(const X& a) {
return a * a;
}
const int size = 1e5 + 5;
const double eps = 0.0001;
const long double PI = 3.1415926535897932384626433832795;
const long long MOD = 1000000007;
const long long INF = 1LL << 62;
const long long MAX5 = 100001;
const long long MAX6 = 1000001;
const long long MAX17 = 99999999999999999;
const double DMAX = 2e18 + 5;
void solution();
void include_file();
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solution();
return 0;
}
inline void include_file() {
ios_base::sync_with_stdio(true);
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
}
inline bool isPrime(long long n) {
for (int i = 2; i * i <= n; ++i)
if (n % i == 0) return false;
return true;
}
inline string ekv(string a) {
if (a.size() & 1) return a;
string x = ekv(a.substr(0, a.size() / 2));
string y = ekv(a.substr(a.size() / 2));
return min(x + y, y + x);
}
inline long long cubic_root(long long x) {
long long l = 0, r = MAX6;
while (l != r) {
long long m = (l + r + 1) / 2;
if (m * m * m > x)
r = m - 1;
else
l = m;
}
return l;
}
inline float FastInvSqrt(float x) {
float xhalf = 0.5f * x;
int i = *(int*)&x;
i = 0x5f3759df - (i >> 1);
x = *(float*)&i;
x = x * (1.5f - (xhalf * x * x));
return x;
}
inline long long gcd(long long a, long long b) {
while (b ^= a ^= b ^= a = a % b)
;
return a;
}
inline long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
constexpr uint64_t mod = (1ull << 61) - 1;
inline uint64_t modmul(uint64_t a, uint64_t b) {
uint64_t l1 = (uint32_t)a, h1 = a >> 32, l2 = (uint32_t)b, h2 = b >> 32;
uint64_t l = l1 * l2, m = l1 * h2 + l2 * h1, h = h1 * h2;
uint64_t ret =
(l & mod) + (l >> 61) + (h << 3) + (m >> 29) + (m << 35 >> 3) + 1;
ret = (ret & mod) + (ret >> 61);
ret = (ret & mod) + (ret >> 61);
return ret - 1;
}
void yes() { cout << "YES"; }
void no() { cout << "NO"; }
void yes(bool res, bool small = false) {
if (!small) {
if (res)
cout << "YES";
else
cout << "NO";
} else {
if (res)
cout << "Yes";
else
cout << "No";
}
}
void dabl(double x) { printf("%.10lf", x); }
namespace bits {
template <typename X>
inline X MAX(const X& a, const X& b) {
return b & ((a - b) >> 31) | a & (~(a - b) >> 31);
}
template <typename X>
inline X MIN(const X& a, const X& b) {
return a & ((a - b) >> 31) | b & (~(a - b) >> 31);
}
inline bool check2(const long long n) { return n > 0 && (n & (n - 1)); }
inline long long ostatok2(const long long n, const long long m) {
return m & (n - 1);
}
template <typename X>
inline void SWAP(X& a, X& b) {
a ^= b;
b ^= a;
a ^= b;
}
inline size_t count_1_in_LL(unsigned long long n) {
std::size_t i(0);
for (; n; ++i) n &= n - 1;
return i;
}
} // namespace bits
void debug() { cout << endl; }
template <typename H, typename... T>
void debug(H p, T... t) {
std::cout << p << " ";
debug(t...);
}
vector<vector<int> > g;
inline void solution() {
int n;
cin >> n;
int a[n];
int b;
for (long long i = 0; i < n; ++i) {
a[i] = 0;
for (long long j = 0; j < n; ++j) {
cin >> b;
if (b != -1) a[i] = a[i] |= b;
}
cout << a[i] << " ";
}
}
| 10 | CPP |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:65777216")
using namespace std;
const long double EPS = 1e-11;
const int INF = 2000000000;
const long long lINF = 9223372036854775807;
const long double PI = 3.14159265358979323846;
int main() {
int n, i, j, a[200][200], x;
cin >> n;
for (i = 0; i < n; i++)
for (j = 0; j < n; j++) {
cin >> a[i][j];
if (a[i][j] == -1) a[i][j] = 0;
}
for (i = 0; i < n; i++) {
x = 0;
for (j = 0; j < n; j++) x |= a[i][j];
cout << x << ' ';
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
int a[104], b[104][104];
int n;
int main() {
int i, j;
scanf("%d", &n);
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++) scanf("%d", &b[i][j]);
if (n == 1) {
puts("0");
return 0;
}
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
if (i != j) a[i] |= b[i][j];
for (i = 1; i <= n; i++) printf("%d ", a[i]);
puts("");
return 0;
}
| 10 | CPP |
n = int(input())
if (n == 1) :
print(0)
else :
m = [[0] * n] * n
a = [int(0)] * n
for i in range(0, n) :
m[i] = input().split()
a[i] = int(m[i][(i + 1) % n])
for j in range(0, n) :
if (j != i) :
a[i] = a[i] | int(m[i][j])
for i in range(0, n) :
print(a[i], end = ' ') | 10 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int mat[101][101];
vector<int> v;
int i, j, n;
bool a, b;
int main() {
cin >> n;
for (i = 0; i < n; i++)
for (j = 0; j < n; j++) cin >> mat[i][j];
for (i = 0; i < n; i++) {
int act = 0;
for (j = 0; j < n; j++)
if (mat[i][j] != -1) act |= mat[i][j];
v.push_back(act);
}
for (i = 0; i < v.size(); i++) cout << v[i] << " ";
cout << endl;
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
vector<int> give(long long int a) {
vector<int> res(35);
for (int i = 0; i < 35; i++) res[i] = 0;
int j = 0;
while (a) {
if (a & 1) res[j] = 1;
a = a >> 1;
j++;
}
return res;
}
long long int make(vector<int> v) {
long long int ans = 0, p = 1;
for (int i = 0; i < v.size(); i++) {
if (v[i]) ans += p;
p = p * 2;
}
return ans;
}
int main() {
int n;
cin >> n;
long long int mat[n][n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> mat[i][j];
}
}
vector<vector<int> > v;
vector<int> ini;
for (int i = 0; i < 35; i++) {
ini.push_back(0);
}
for (int i = 0; i < n; i++) {
v.push_back(ini);
}
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
vector<int> temp = give(mat[i][j]);
for (int l = 0; l < 35; l++) {
v[i][l] = v[i][l] || temp[l];
}
for (int l = 0; l < 35; l++) {
v[j][l] = v[j][l] || temp[l];
}
}
}
for (int i = 0; i < n; i++) {
long long int ans = make(v[i]);
cout << ans << " ";
}
cout << endl;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int x[101][101], y[101][101], maxi = 0, a[101];
int n;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
scanf("%d", &x[i][j]);
}
}
int g = 0;
for (int j = 1; j <= n; j++) {
for (int i = 1; i <= n; i++) {
if (j != i) {
g = g | x[i][j];
}
}
a[j] = g;
g = 0;
}
for (int i = 1; i <= n; i++) {
if (i == 1) {
printf("%d", a[i]);
} else {
printf(" %d", a[i]);
}
}
printf("\n");
scanf("%d", &g);
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long n, m, k, i, j, b[101][101], a[1000];
int main() {
cin >> n;
for (i = 1; i <= n; i++) {
for (j = 1; j <= n; j++) {
cin >> b[i][j];
}
}
for (i = 1; i <= n; i++) {
for (j = 1; j <= n && i != j; j++) {
a[i] = a[i] | b[i][j];
a[j] = a[j] | b[i][j];
}
}
for (i = 1; i <= n; i++) {
cout << a[i] << " ";
}
}
| 10 | CPP |
#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:256000000")
using namespace std;
int a[110][32];
int main() {
int n;
int b[110][110];
cin >> n;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++) cin >> b[i][j];
for (int i = 0; i < n; i++) {
for (int k = 0; k < 31; k++)
for (int j = 0; j < n; j++)
if (j != i && (b[i][j] >> k) % 2 == 1) a[i][k] = 1;
int result = 0;
for (int k = 0; k < 31; k++) result |= (a[i][k] << k);
cout << result << " ";
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
std::ios::sync_with_stdio(false);
int n;
cin >> n;
int arr[n][n];
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++) cin >> arr[i][j];
for (int i = 0; i < n; i++) {
int a = 0;
for (int j = 0; j < n; j++) {
if (i == j) continue;
a |= arr[i][j];
}
cout << a << " ";
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
int n;
int t[109][109];
int a[109];
int main() {
scanf("%d", &n);
for (int h = 0; h < n; h++)
for (int j = 0; j < n; j++) scanf("%d", &t[h][j]);
for (int h = 0; h < n; h++)
for (int j = 0; j < n; j++)
if (h != j) a[h] = a[h] | t[h][j];
for (int h = 0; h < n; h++) printf("%d ", a[h]);
}
| 10 | CPP |
n = int(input())
a = [0]*n
for i in range(n):
for x in map(int, input().split()):
if x!=-1:
a[i]|=x
print(*a)
| 10 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, d;
int b[100];
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> d;
if (i != j) {
b[i] = b[i] | d;
}
}
cout << b[i] << " ";
}
cin >> d;
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long b[101][101];
int n;
int a[101][50];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++) scanf("%I64d", &b[i][j]);
long long e = 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++)
if (i != j) {
e = 1;
for (int k = 0; k <= 40; k++, e *= 2)
if ((b[i][j] & e) == e) a[i][k] = 1;
}
}
for (int i = 0; i < n; i++) {
e = 1;
long long z = 0;
for (int j = 0; j <= 40; j++, e *= 2)
if (a[i][j] == 1) z += e;
cout << z << ' ';
}
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, res;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
res = 0;
for (int j = 1; j <= n; j++) {
int g;
scanf("%d", &g);
if (g != -1) res |= g;
}
printf("%d ", res);
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, b[111][111], bit[111][40], a[111];
int main() {
cin >> n;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++) {
cin >> b[i][j];
if (b[i][j] < 0) continue;
for (int k = 0; k < 31; k++)
if (b[i][j] >> k & 1) bit[i][k] = bit[j][k] = 1;
}
for (int i = 0; i < n; i++)
for (int k = 0; k < 31; k++) a[i] |= bit[i][k] << k;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
if (b[i][j] < 0) a[i] = max(a[i], a[j]), a[j] = a[i];
for (int i = 0; i < n; i++) cout << a[i] << ' ';
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
char C[108][68];
int A[108][108];
int main() {
int n;
while (scanf("%d", &n) != EOF && n) {
memset(C, 0, sizeof(C));
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
scanf("%d", &A[i][j]);
}
}
for (int i = 1; i < n; i++) {
for (int j = i + 1; j <= n; j++) {
int sum = A[i][j], bit = 63;
while (sum) {
if (sum & 1) {
C[i][bit] = '1';
C[j][bit] = '1';
}
sum = sum / 2;
bit--;
}
}
}
for (int i = 1; i <= n; i++) {
int value = 0;
for (int j = 0; j < 64; j++) {
if (C[i][j] == '1') {
value = value * 2 + 1;
} else
value = value * 2;
}
if (i == n)
cout << value << endl;
else
cout << value << " ";
}
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int s[105][105];
int a[105];
int main() {
int i, j, k, n;
while (cin >> n) {
memset(a, 0, sizeof(a));
for (i = 1; i <= n; i++) {
for (j = 1; j <= n; j++) {
scanf("%d", &s[i][j]);
}
a[i] = 0;
}
if (n == 1) {
cout << 0 << endl;
continue;
}
for (i = 1; i <= n; i++) {
for (j = 1; j <= n; j++) {
if (i == j) continue;
a[i] = a[i] | s[i][j];
}
}
for (i = 1; i <= n; i++) {
cout << a[i];
if (i != n)
cout << ' ';
else
cout << endl;
}
}
return 0;
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
if (N == 1) {
cout << 0;
return 0;
}
int M[100][100];
int A[100] = {0};
for (int i = 0; i < N; i++) {
int Num = 0;
for (int j = 0; j < N; j++) {
cin >> M[i][j];
if (i != j) Num = Num | M[i][j];
}
A[i] = Num;
}
for (int i = 0; i < N; i++) cout << A[i] << " ";
}
| 10 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int c = 110;
int main() {
int n;
scanf("%d", &n);
int arr[c] = {0};
int matr[c][c];
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++) {
int t;
scanf("%d", &matr[i][j]);
if (i != j) arr[i] |= matr[i][j];
}
for (int i = 0; i < n; i++) printf("%d ", arr[i]);
}
| 10 | CPP |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.