buggy_code stringlengths 11 625k | fixed_code stringlengths 17 625k | bug_type stringlengths 2 4.45k | language int64 0 8 | token_count int64 5 200k | change_count int64 0 100 |
|---|---|---|---|---|---|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define N 1005
main() {
int i, j, n, c[N][N], m, k, l;
char str1[N], str2[N];
scanf("%d", &n);
for (i = 0; i < n; i++) {
str1[0] = '0';
str2[0] = '0';
scanf("%s%s", str1 + 1, str2 + 1);
m = strlen(str1 + 1);
k = strlen(str2 + 1);... | #include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define N 1005
main() {
int i, j, n, c[N][N], m, k, l;
char str1[N], str2[N];
scanf("%d", &n);
for (i = 0; i < n; i++) {
str1[0] = '0';
str2[0] = '0';
scanf("%s%s", str1 + 1, str2 + 1);
m = strlen(str1 + 1);
k = strlen(str2 + 1);... | [["-", 0, 7, 8, 9, 0, 7, 10, 11, 31, 22], ["+", 0, 7, 8, 9, 0, 7, 10, 11, 31, 22], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 31, 22], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 31, 22], ["-", 0, 7, 8, 9, 0, 7, 26, 27, 28, 22], ["+", 0, 7, 8, 9, 0, 7, 26, 27, 28, 22]] | 0 | 326 | 6 |
#include <stdio.h>
#include <string.h>
#define LEN 1001
char X[LEN], Y[LEN];
int LCS() {
int m, n, i, j;
m = strlen(X);
n = strlen(Y);
int c[m + 1][n + 1];
for (i = 1; i <= m; i++) {
c[i][0] = 0;
}
for (j = 0; j <= n; j++) {
c[0][j] = 0;
}
for (i = 1; i <= m; i++) {
for (j = 1; j <= n; ... | #include <stdio.h>
#include <string.h>
#define LEN 1001
char X[LEN], Y[LEN];
int LCS() {
int m, n, i, j;
m = strlen(X);
n = strlen(Y);
int c[m + 1][n + 1];
for (i = 1; i <= m; i++) {
c[i][0] = 0;
}
for (j = 0; j <= n; j++) {
c[0][j] = 0;
}
for (i = 1; i <= m; i++) {
for (j = 1; j <= n; ... | [["+", 15, 23, 0, 16, 31, 69, 71, 16, 17, 33], ["+", 15, 23, 0, 16, 31, 69, 71, 16, 12, 13], ["+", 15, 23, 0, 16, 12, 69, 71, 16, 17, 33], ["+", 15, 23, 0, 16, 12, 69, 71, 16, 12, 13]] | 0 | 311 | 4 |
#include <stdio.h>
#include <string.h>
#define L 1000
int n;
int lcs(char X[], char Y[]) {
int i, j, c[L][L];
int m = strlen(X);
int n = strlen(Y);
for (i = 1; i <= m; i++)
c[i][0] = 0;
for (j = 0; j <= n; j++)
c[0][j] = 0;
for (i = 1; i <= m; i++) {
for (j = 1; j <= n; j++) {
if (X[i] =... | #include <stdio.h>
#include <string.h>
#define L 1001
int n;
int lcs(char X[], char Y[]) {
int i, j, c[L][L];
int m = strlen(X);
int n = strlen(Y);
for (i = 1; i <= m; i++)
c[i][0] = 0;
for (j = 0; j <= n; j++)
c[0][j] = 0;
for (i = 1; i <= m; i++) {
for (j = 1; j <= n; j++) {
if (X[i - ... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 15, 23, 0, 16, 31, 69, 71, 16, 17, 33], ["+", 15, 23, 0, 16, 31, 69, 71, 16, 12, 13], ["+", 15, 23, 0, 16, 12, 69, 71, 16, 17, 33], ["+", 15, 23, 0, 16, 12, 69, 71, 16, 12, 13]] | 0 | 348 | 6 |
#include <stdio.h>
#include <string.h>
int lcs(char *, char *);
main() {
int i, n, result[1001];
char X[1001], Y[1001];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%s", X);
scanf("%s", Y);
result[i] = lcs(X, Y);
}
for (i = 0; i < n; i++) {
printf("%d\n", result[i]);
}
return 0;... | #include <stdio.h>
#include <string.h>
int lcs(char *, char *);
main() {
int i, n, result[1001];
char X[1001], Y[1001];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%s", X);
scanf("%s", Y);
result[i] = lcs(X, Y);
}
for (i = 0; i < n; i++) {
printf("%d\n", result[i]);
}
return 0;... | [["+", 15, 23, 0, 16, 31, 69, 71, 16, 17, 33], ["+", 15, 23, 0, 16, 31, 69, 71, 16, 12, 13], ["+", 15, 23, 0, 16, 12, 69, 71, 16, 17, 33], ["+", 15, 23, 0, 16, 12, 69, 71, 16, 12, 13]] | 0 | 369 | 4 |
#include <stdio.h>
#include <string.h>
char X[1000];
char Y[1000];
int LCS() {
int i, j, lx, ly;
lx = strlen(X);
ly = strlen(Y);
int Z[lx + 1][ly + 1];
for (i = 1; i <= lx; i++) {
Z[i][0] = 0;
}
for (j = 0; j <= ly; j++) {
Z[0][j] = 0;
}
for (i = 1; i <= lx; i++) {
for (j = 1; j <= ly; ... | #include <stdio.h>
#include <string.h>
char X[1000];
char Y[1000];
int LCS() {
int i, j, lx, ly;
lx = strlen(X);
ly = strlen(Y);
int Z[lx + 1][ly + 1];
for (i = 1; i <= lx; i++) {
Z[i][0] = 0;
}
for (j = 0; j <= ly; j++) {
Z[0][j] = 0;
}
for (i = 1; i <= lx; i++) {
for (j = 1; j <= ly; ... | [["-", 15, 23, 0, 16, 12, 69, 71, 16, 31, 22], ["+", 15, 23, 0, 16, 12, 69, 71, 16, 31, 22]] | 0 | 313 | 2 |
#include <stdio.h>
#include <string.h>
char X[1001], Y[1001];
int LCS_Length(void) {
int i, j;
int m = strlen(X);
int n = strlen(Y);
int c[m + 1][n + 1];
for (i = 1; i <= m; i++)
c[i][0] = 0;
for (j = 0; j <= n; j++)
c[0][j] = 0;
for (i = 1; i <= m; i++) {
for (j = 1; j <= n; j++) {
... | #include <stdio.h>
#include <string.h>
char X[1001], Y[1001];
int LCS_Length(void) {
int i, j;
int m = strlen(X);
int n = strlen(Y);
int c[m + 1][n + 1];
for (i = 1; i <= m; i++)
c[i][0] = 0;
for (j = 0; j <= n; j++)
c[0][j] = 0;
for (i = 1; i <= m; i++) {
for (j = 1; j <= n; j++) {
... | [["+", 15, 23, 0, 16, 31, 69, 71, 16, 17, 33], ["+", 15, 23, 0, 16, 31, 69, 71, 16, 12, 13], ["+", 15, 23, 0, 16, 12, 69, 71, 16, 17, 33], ["+", 15, 23, 0, 16, 12, 69, 71, 16, 12, 13]] | 0 | 297 | 4 |
#include <stdio.h>
#include <string.h>
int main() {
int q, i, j;
char S1[1001], S2[1001];
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%s", S1);
scanf("%s", S2);
printf("%d", LCS(S1, S2));
}
return 0;
}
int LCS(char *S1, char *S2) {
int c[1001][1001], i, j, x, y;
x = strlen(S1) + 1;
... | #include <stdio.h>
#include <string.h>
int main() {
int q, i, j;
char S1[1001], S2[1001];
scanf("%d", &q);
for (i = 0; i < q; i++) {
scanf("%s", S1);
scanf("%s", S2);
printf("%d\n", LCS(S1, S2));
}
return 0;
}
int LCS(char *S1, char *S2) {
int c[1001][1001], i, j, x, y;
x = strlen(S1) + 1;
... | [["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 0 | 323 | 1 |
#include <stdio.h>
int judge(char A[], char B[]) {
int a = 0, b = 0, sw = 0, ans = 0;
int i, j;
int C[1001][1001];
while (sw == 0) {
if (A[a] != '\0')
a++;
else
sw = 1;
}
sw = 0;
while (sw = 0) {
if (B[b] != '\0')
b++;
else
sw = 1;
}
for (i = 1; i < a + 1; ... | #include <stdio.h>
int judge(char A[], char B[]) {
int a = 0, b = 0, sw = 0, ans = 0;
int i, j;
int C[1001][1001];
while (sw == 0) {
if (A[a] != '\0')
a++;
else
sw = 1;
}
sw = 0;
while (sw == 0) {
if (B[b] != '\0')
b++;
else
sw = 1;
}
for (i = 1; i < a + 1;... | [["-", 8, 9, 0, 52, 15, 339, 51, 11, 17, 32], ["+", 8, 9, 0, 52, 15, 339, 51, 16, 17, 60]] | 1 | 396 | 2 |
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int LCS(string p, string q) {
vector<vector<int>> f(p.size() + 1, vector<int>(q.size() + 1, 0));
int t;
for (int i = 1; i <= p.size(); i++) {
for (int j = 1; j <= q.size(); j++) {
if (p[i - 1] == p[j - 1])... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int LCS(string p, string q) {
vector<vector<int>> f(p.size() + 1, vector<int>(q.size() + 1, 0));
int t;
for (int i = 1; i <= p.size(); i++) {
for (int j = 1; j <= q.size(); j++) {
if (p[i - 1] == q[j - 1])... | [["-", 0, 57, 15, 339, 51, 16, 12, 69, 28, 22], ["+", 0, 57, 15, 339, 51, 16, 12, 69, 28, 22], ["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13]] | 1 | 310 | 4 |
#include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
#define MAX 100000
int lcs(std::string X, std::string Y) {
int c[MAX][MAX];
int maxl = 0;
int m = X.size();
int n = Y.size();
for (int i = 1; i <= m; i++) {
c[i][0] = 0;
}
for (int i = 1; i <= n; i++) {
c[0][i] = 0;
}... | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
#define MAX 1000
int lcs(std::string X, std::string Y) {
int c[MAX + 1][MAX + 1];
int maxl = 0;
int m = X.size();
int n = Y.size();
for (int i = 1; i <= m; i++) {
c[i][0] = 0;
}
for (int i = 1; i <= n; i++) {
c[0][i] = ... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 0, 43, 49, 80, 49, 80, 81, 16, 17, 72], ["+", 0, 43, 49, 80, 49, 80, 81, 16, 12, 13], ["+", 8, 9, 0, 43, 49, 80, 81, 16, 17, 72], ["+", 8, 9, 0, 43, 49, 80, 81, 16, 12, 13]] | 1 | 328 | 6 |
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
static const int N = 1000;
int lcs(string X, string Y) {
int c[N + 1][N + 1];
int m = X.size();
int n = Y.size();
int maxl = 0;
X = ' ' + X; // X[0] に空白を挿入
Y = ' ' + Y; // Y[0] に空白を挿入
for (int i = 1; i <= m; i++)
c[i][0] ... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
static const int N = 1000;
int lcs(string X, string Y) {
int c[N + 1][N + 1];
int m = X.size();
int n = Y.size();
int maxl = 0;
X = ' ' + X;
Y = ' ' + Y;
for (int i = 0; i <= m; i++)
c[i][0] = 0;
for (int j = 1; j <= n;... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 298 | 2 |
#include <stdio.h>
#include <string.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define repi(i, n) for (int i = 1; i < n; ++i)
int max(int a, int b) { return a > b ? a : b; }
int main(void) {
int n;
scanf("%d", &n);
rep(i, n) {
char x[1500], y[1500], h, w;
scanf("%s", x);
scanf("%s", y);
h ... | #include <stdio.h>
#include <string.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define repi(i, n) for (int i = 1; i < n; ++i)
int max(int a, int b) { return a > b ? a : b; }
int main(void) {
int n;
scanf("%d", &n);
rep(i, n) {
char x[1500], y[1500];
int h, w;
scanf("%s", x);
scanf("%s", y)... | [["-", 8, 9, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 8, 9, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 8, 9, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 57, 64, 1, 0, 34, 31, 11, 17, 32], ["+", 0, 57, 64, 1, 0, 34, 31, 11, 12, 13], ["+", 8, 9, 0, 57, 64, 1, 0, 34, 0, 21], ["+", 0, 57, 64, 1, 0, 34, 12, 11, 31, 22]] | 1 | 342 | 7 |
#include <bits/stdc++.h>
using namespace std;
int dp[1010][1010];
int main() {
int q;
cin >> q;
vector<string> x(q), y(q);
for (int i = 0; i < q; i++) {
cin >> x[i] >> y[i];
}
for (int i = 0; i <= 1000; i++) {
dp[i][0] = 0;
dp[0][i] = 0;
}
for (int i = 0; i < q; i++) {
for (int j = 1;... | #include <bits/stdc++.h>
using namespace std;
int dp[1010][1010];
int main() {
int q;
cin >> q;
vector<string> x(q), y(q);
for (int i = 0; i < q; i++) {
cin >> x[i] >> y[i];
}
for (int i = 0; i <= 1000; i++) {
dp[i][0] = 0;
dp[0][i] = 0;
}
for (int i = 0; i < q; i++) {
for (int j = 1;... | [["+", 51, 16, 31, 69, 341, 342, 0, 16, 17, 33], ["+", 51, 16, 31, 69, 341, 342, 0, 16, 12, 13], ["+", 51, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["+", 51, 16, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 337 | 4 |
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
static const int N = 1000;
int lcs(string x, string y) {
int c[N + 1][N + 1];
int m = x.size();
int n = y.size();
int res = 0;
x = ' ' + x;
y = ' ' + y;
for (int i = 0; i <= m; i++)
c[i][0] = 0;
for (int i = 0; i <=... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
static const int N = 1000;
int lcs(string x, string y) {
int c[N + 1][N + 1];
int m = x.size();
int n = y.size();
int res = 0;
x = ' ' + x;
y = ' ' + y;
for (int i = 0; i <= m; i++)
c[i][0] = 0;
for (int i = 0; i <=... | [["-", 0, 30, 0, 14, 8, 9, 0, 37, 0, 13], ["+", 0, 30, 0, 14, 8, 9, 0, 37, 0, 22]] | 1 | 302 | 2 |
#include <iostream>
#include <string>
using namespace std;
int main(void) {
int q;
cin >> q;
int dp[1001][1001];
for (int i = 0; i < 1001; i++)
dp[0][i] = dp[i][0] = 0;
for (int i = 0; i < q; i++) {
string a, b;
cin >> a >> b;
int len_a = (int)a.size(), len_b = (int)b.size();
for (int j ... | #include <iostream>
#include <string>
using namespace std;
int main(void) {
int q;
cin >> q;
int dp[1001][1001];
for (int i = 0; i < 1001; i++)
dp[0][i] = dp[i][0] = 0;
for (int i = 0; i < q; i++) {
string a, b;
cin >> a >> b;
int len_a = (int)a.size(), len_b = (int)b.size();
for (int j ... | [["+", 51, 16, 31, 69, 341, 342, 0, 16, 17, 33], ["+", 51, 16, 31, 69, 341, 342, 0, 16, 12, 13], ["+", 51, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["+", 51, 16, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 228 | 4 |
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int n;
char x[1000], y[1000];
int dp[1001][1001];
// load n;
cin >> n;
for (int i = 0; i < n; i++) {
// load string
scanf("%s", x);
scanf("%s", y);
// dp
for (int j = 0; j < strlen(x); j++) {
... | #include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int n;
char x[1001], y[1001];
int dp[1010][1010];
// load n;
cin >> n;
for (int i = 0; i < n; i++) {
// load string
scanf("%s", x);
scanf("%s", y);
// dp
for (int j = 0; j < strlen(x); j++) {
... | [["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["-", 8, 9, 0, 43, 49, 80, 49, 80, 81, 13], ["+", 8, 9, 0, 43, 49, 80, 49, 80, 81, 13], ["-", 0, 9, 0, 57, 75, 76, 0, 9, 0, 46], ["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46]] | 1 | 249 | 10 |
#include <array>
#include <iostream>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
const int MAX_V = 1001;
array<array<int, MAX_V>, MAX_V> ary;
string strx, stry;
int minimum(int x, int y) {
int res = strx[x] == stry[y] ? ary[x - 1][y - 1] + 1 : ary[x - 1][y - 1];
if (res < ary[x][y - 1]... | #include <array>
#include <iostream>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
const int MAX_V = 1001;
array<array<int, MAX_V>, MAX_V> ary;
string strx, stry;
int minimum(int x, int y) {
int res =
strx[x - 1] == stry[y - 1] ? ary[x - 1][y - 1] + 1 : ary[x - 1][y - 1];
if (res <... | [["+", 15, 16, 31, 69, 341, 342, 0, 16, 17, 33], ["+", 15, 16, 31, 69, 341, 342, 0, 16, 12, 13], ["+", 15, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["+", 15, 16, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 245 | 4 |
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.NoSuchElementException;
public class Main implements Runnable {
int a, b;
public void solve() {
a = nextInt();
b = nextInt();
if (a < b) {
if (b - a > 360 - b + a) {
double c = (a + 360 ... | import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.NoSuchElementException;
public class Main implements Runnable {
int a, b;
public void solve() {
a = nextInt();
b = nextInt();
if (a < b) {
if (b - a > 360 - b + a) {
double c = (a + 360 ... | [["-", 0, 16, 31, 23, 0, 16, 31, 16, 17, 33], ["-", 0, 16, 31, 23, 0, 16, 31, 16, 12, 22], ["-", 3, 4, 0, 16, 31, 23, 0, 16, 12, 499], ["+", 3, 4, 0, 16, 31, 23, 0, 16, 12, 22], ["-", 3, 4, 0, 16, 31, 23, 0, 16, 17, 72], ["+", 0, 16, 31, 23, 0, 16, 31, 16, 17, 33], ["+", 3, 4, 0, 16, 31, 23, 0, 16, 17, 72], ["+", 3, 4,... | 3 | 583 | 8 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <numeric>
#include <string>
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
int main() {
int x, y;
double s;
cin >> x >> y;
if (y - x > 180) {
s = (360 - (y - x)) / 2;
if (y + s > 360)
p... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <numeric>
#include <string>
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
int main() {
double x, y;
double s;
cin >> x >> y;
if (y - x > 180) {
s = (360 - (y - x)) / 2;
if (y + s > 360)
... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40]] | 1 | 270 | 2 |
t1 = gets.to_f
t2 = gets.to_f
r = (t1 + t2) / 2.0
if (r - t1).abs >= 180.0
r += 180.0
end
if r >= 360.0
r -= 360.0
end
puts r | t1 = gets.to_f
t2 = gets.to_f
r = (t1 + t2) / 2.0
if (r - t1).abs >= 90.0
r += 180.0
end
if r >= 360.0
r -= 360.0
end
puts r | [["-", 36, 36, 0, 493, 0, 121, 15, 738, 12, 531], ["+", 36, 36, 0, 493, 0, 121, 15, 738, 12, 531]] | 4 | 43 | 2 |
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i, n) for (... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i, n) for (... | [["-", 0, 43, 39, 344, 3, 347, 0, 77, 39, 40], ["+", 0, 43, 39, 344, 3, 347, 0, 77, 39, 40]] | 1 | 374 | 2 |
#include "bits/stdc++.h"
using namespace std;
string st;
int a;
int getnum() {
int num = 0;
while (a != st.size() && isdigit(st[a])) {
num *= 10;
num += st[a] - '0';
a++;
}
return num;
}
vector<int> kou() {
vector<int> v(10);
if (st[a] == 'x') {
a++;
if (a == st.size() || st[a] == '^') ... | #include "bits/stdc++.h"
using namespace std;
string st;
int a;
int getnum() {
int num = 0;
while (a != st.size() && isdigit(st[a])) {
num *= 10;
num += st[a] - '0';
a++;
}
return num;
}
vector<int> kou() {
vector<int> v(10);
if (st[a] == 'x') {
a++;
if (a == st.size() || st[a] != '^') ... | [["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 60], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 17, 79]] | 1 | 636 | 2 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) (v).begin(), (v).end()
#define pb push_back
#define fi first
#define se second
typedef vector<int> vint;
typedef pair<int, int> pint;
typedef vector<pint> vpint;
template <typename A, t... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) (v).begin(), (v).end()
#define pb push_back
#define fi first
#define se second
typedef vector<int> vint;
typedef pair<int, int> pint;
typedef vector<pint> vpint;
template <typename A, t... | [["-", 3, 4, 0, 16, 31, 69, 341, 342, 0, 22], ["+", 3, 4, 0, 16, 31, 69, 341, 342, 0, 22]] | 1 | 519 | 4 |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) (v).begin(), (v).end()
#define pb push_back
#define fi first
#define se second
typedef vector<int> vint;
typedef pair<int, int> pint;
typedef vector<pint> vpint;
template <typename A, t... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) (v).begin(), (v).end()
#define pb push_back
#define fi first
#define se second
typedef vector<int> vint;
typedef pair<int, int> pint;
typedef vector<pint> vpint;
template <typename A, t... | [["-", 31, 69, 341, 342, 0, 83, 0, 69, 28, 22], ["+", 31, 69, 341, 342, 0, 83, 0, 69, 28, 22]] | 1 | 821 | 4 |
#include <bits/stdc++.h>
using namespace std;
struct UnionFind {
vector<int> data;
UnionFind(int sz) { data.assign(sz, -1); }
bool unite(int x, int y) {
x = find(x), y = find(y);
if (x == y)
return (false);
if (data[x] > data[y])
swap(x, y);
data[x] += data[y];
data[y] = x;
... | #include <bits/stdc++.h>
using namespace std;
struct UnionFind {
vector<int> data;
UnionFind(int sz) { data.assign(sz, -1); }
bool unite(int x, int y) {
x = find(x), y = find(y);
if (x == y)
return (false);
if (data[x] > data[y])
swap(x, y);
data[x] += data[y];
data[y] = x;
... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 848 | 2 |
#include <algorithm>
#include <cfloat>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <vector>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define MOD 100000... | #include <algorithm>
#include <cfloat>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <vector>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define MOD 100000... | [["-", 341, 342, 0, 118, 28, 69, 341, 342, 0, 22], ["+", 341, 342, 0, 118, 28, 69, 341, 342, 0, 22], ["-", 3, 4, 0, 118, 28, 69, 341, 342, 0, 22], ["+", 3, 4, 0, 118, 28, 69, 341, 342, 0, 22]] | 1 | 774 | 6 |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define CIN_ONLY if (1)
struct cww {
cww() {
CIN_ONLY {
ios::sync_with_stdio(false);
cin.tie(0);
}
}
} star;
#define fin "\n"
#define FOR(i, bg, ed) for (int i = (bg); i < (ed); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define CIN_ONLY if (1)
struct cww {
cww() {
CIN_ONLY {
ios::sync_with_stdio(false);
cin.tie(0);
}
}
} star;
#define fin "\n"
#define FOR(i, bg, ed) for (int i = (bg); i < (ed); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v... | [["-", 0, 362, 8, 201, 0, 43, 49, 80, 81, 13], ["+", 0, 362, 8, 201, 0, 43, 49, 80, 81, 13], ["-", 0, 43, 49, 50, 51, 2, 3, 4, 0, 13], ["+", 0, 43, 49, 50, 51, 2, 3, 4, 0, 22], ["-", 0, 43, 49, 50, 51, 2, 3, 4, 0, 22]] | 1 | 1,603 | 6 |
#include <bits/stdc++.h>
using namespace std;
/*
struct Monoid {
using T = _type_;
static T op(const T& a, const T& b) {return _a_op_b_;}
static constexpr T e() {return _identity_element_;};
};
*/
/*
struct M_act {
using OS = _operand_set_(i.e. Monoid)_;
using OM = _operator_monoid_(i.e. Monoid)_;
using ... | #include <bits/stdc++.h>
using namespace std;
/*
struct Monoid {
using T = _type_;
static T op(const T& a, const T& b) {return _a_op_b_;}
static constexpr T e() {return _identity_element_;};
};
*/
/*
struct M_act {
using OS = _operand_set_(i.e. Monoid)_;
using OM = _operator_monoid_(i.e. Monoid)_;
using ... | [["-", 0, 43, 49, 50, 51, 2, 63, 343, 345, 348], ["+", 0, 43, 49, 50, 51, 2, 63, 343, 345, 348]] | 1 | 1,318 | 2 |
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> PP;
int n, m;
int c[1... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> PP;
int n, m;
int c[1... | [["+", 28, 69, 28, 69, 341, 342, 0, 69, 28, 22], ["+", 28, 69, 341, 342, 0, 69, 341, 342, 0, 70], ["+", 28, 69, 341, 342, 0, 69, 341, 342, 0, 73]] | 1 | 1,470 | 3 |
#include <stdio.h>
int main() {
int n, u, k, v, i, j;
int G[100][100];
scanf("%d, &n");
for (i = 0; i < n; i++) {
scanf("%d", &u);
scanf("%d", &k);
for (j = 0; j < k; j++) {
scanf("%d", &v);
G[u - 1][v - 1] = 1;
}
}
for (i = 0; i < n; i++) {
printf("%d", G[i][0]);
for ... | #include <stdio.h>
int main() {
int n, u, k, v, i, j;
int G[100][100] = {0};
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &u);
scanf("%d", &k);
for (j = 0; j < k; j++) {
scanf("%d", &v);
G[u - 1][v - 1] = 1;
}
}
for (i = 0; i < n; i++) {
printf("%d", G[i][0]);
... | [["+", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 45], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 13], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 46], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["+", 0, 1, 0, 2, 3, 4, 0, 66, 17, 6... | 0 | 189 | 9 |
#include <stdio.h>
#define N 100
int main() {
int i, j, n, u, k, U, Adj[N][N];
for (i = 0; i < N; i++) {
for (j = 0; j < N; j++) {
Adj[i][j] = 0;
}
}
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d%d", &u, &k);
for (j = 0; j < k; j++) {
scanf("%d", &U);
Adj[i][U - 1] =... | #include <stdio.h>
#define N 100
int main() {
int i, j, n, u, k, U, Adj[N][N];
for (i = 0; i < N; i++) {
for (j = 0; j < N; j++) {
Adj[i][j] = 0;
}
}
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d%d", &u, &k);
for (j = 0; j < k; j++) {
scanf("%d", &U);
Adj[i][U - 1] =... | [["-", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 62], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 0 | 222 | 7 |
#include <stdio.h>
static const int N = 100;
static const int INFTY = 1000000;
int main() {
int M[N][N];
int n, u, k, v;
int i, j;
scanf("%d", &n);
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
M[i][j] = 0;
}
}
for (i = 0; i < n; i++) {
scanf("%d %d", &u, &k);
u--;
f... | #include <stdio.h>
static const int N = 100;
static const int INFTY = 1000000;
int main() {
int M[N][N];
int n, u, k, v;
int i, j;
scanf("%d", &n);
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
M[i][j] = 0;
}
}
for (i = 0; i < n; i++) {
scanf("%d %d", &u, &k);
u--;
f... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 0 | 241 | 1 |
#include <stdio.h>
int main(void) {
int i, j, n, u, k, v;
int Adj[101][101] = {};
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d%d", &u, &k);
for (j = 0; j < k; j++) {
scanf("%d", &v);
Adj[u][v] = 1;
}
}
for (i = 1; i < n; i++) {
for (j = 1; j < n; j++) {
prin... | #include <stdio.h>
int main(void) {
int i, j, n, u, k, v;
int Adj[101][101] = {};
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d%d", &u, &k);
for (j = 0; j < k; j++) {
scanf("%d", &v);
Adj[u][v] = 1;
}
}
for (i = 1; i <= n; i++) {
for (j = 1; j < n; j++) {
pri... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 0, 7, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 2, 3, 4, 0, 69, 28, 69, 71, 22], ["+", 0, 2, 3, 4, 0, 69, 28, 69, 71, 22], ["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46]] | 0 | 171 | 6 |
#include <stdio.h>
int N[101][101];
int main() {
int n, a, b, i, j, k;
scanf("%d", &n);
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
N[i][j] = 0;
}
}
for (i = 0; i < n; i++) {
scanf("&d&d", &a, &b);
for (j = 0; j < 1; j++) {
scanf("%d", &k);
N[i][k - 1] = 1;
}... | #include <stdio.h>
int N[101][101];
int main() {
int n, a, b, i, j, k;
scanf("%d", &n);
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
N[i][j] = 0;
}
}
for (i = 0; i < n; i++) {
scanf("%d%d", &a, &b);
for (j = 0; j < b; j++) {
scanf("%d", &k);
N[i][k - 1] = 1;
}... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22]] | 0 | 211 | 4 |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
void to_adjacent_matrix(vector<vector<int>> &adjacent_list,
vector<vector<int>> &adjacent_matrix);
int main() {
int n;
cin >> n;
vector<vector<int>> vertex(n, vector<int>(n, -1));
for (int i = 0; i < n; ++i)... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
void to_adjacent_matrix(vector<vector<int>> &adjacent_list,
vector<vector<int>> &adjacent_matrix);
int main() {
int n;
cin >> n;
vector<vector<int>> vertex(n, vector<int>(n, -1));
for (int i = 0; i < n; ++i)... | [["-", 0, 57, 15, 339, 51, 16, 31, 16, 17, 19], ["+", 0, 57, 15, 339, 51, 16, 31, 16, 17, 18]] | 1 | 320 | 2 |
#include <iostream>
using namespace std;
int main() {
int g[10010][10010] = {}; //要素を0で初期化
int n, a, b, c;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a >> b;
for (int i = 0; i < b; ++i) {
cin >> c;
g[a - 1][c - 1] = 1; /* code */
}
}
for (int i = 0; i < n; ++i) {
for (int j... | #include <iostream>
using namespace std;
int main() {
int g[1001][1001] = {{0}}; //要素を0で初期化
int n, a, b, c;
cin >> n;
// for (int i = 0; i < n; ++i)
// {
// for (int j = 0; j < n; ++j)
// {
// g[i][j]=0;
// }
// }
for (int i = 0; i < n; ++i) {
cin >> a >> b;
for (int i = 0; i <... | [["-", 0, 43, 49, 50, 49, 80, 49, 80, 81, 13], ["+", 0, 43, 49, 50, 49, 80, 49, 80, 81, 13], ["-", 8, 9, 0, 43, 49, 50, 49, 80, 81, 13], ["+", 8, 9, 0, 43, 49, 50, 49, 80, 81, 13], ["+", 0, 43, 49, 50, 51, 83, 0, 83, 0, 45], ["+", 0, 43, 49, 50, 51, 83, 0, 83, 0, 13], ["+", 0, 43, 49, 50, 51, 83, 0, 83, 0, 46]] | 1 | 166 | 7 |
#include <iostream>
using namespace std;
static const int N = 100;
int main(void) {
int M[N][N];
int n, m, l, k;
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
M[i][j];
}
}
for (int i = 0; i < n; i++) {
cin >> m >> l;
m--;
for (int j = 0; j < n; j++) {
... | #include <iostream>
using namespace std;
static const int N = 1000;
int main(void) {
int M[N][N];
int n, m, l, k;
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
M[i][j];
}
}
for (int i = 0; i < n; i++) {
cin >> m >> l;
m--;
for (int j = 0; j < l; j++) {
... | [["-", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22]] | 1 | 199 | 4 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<int>> a(n, vector<int>(n, 0));
for (int i = 0; i < n; i++) {
int u, k, v;
cin >> u;
for (int j = 0; j < k; j++) {
cin >> v;
a[u - 1][v - 1] = 1;
}
}
for (int i = 0; i < n; i++... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<int>> a(n, vector<int>(n, 0));
for (int i = 0; i < n; i++) {
int u, k, v;
cin >> u >> k;
for (int j = 0; j < k; j++) {
cin >> v;
a[u - 1][v - 1] = 1;
}
}
for (int i = 0; i < n... | [["+", 0, 7, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 7, 8, 9, 0, 1, 0, 16, 12, 22]] | 1 | 166 | 2 |
#include <iostream>
int main() {
int node_num, adj[100][100];
std::cin >> node_num;
for (int i = 0; i < node_num; i++)
for (int j = 0; j < node_num; j++)
adj[i][j] = 0;
for (int i = 0; i < node_num; i++) {
int node, num;
std::cin >> node >> num;
for (int j = 0; j < num; j++) {
in... | #include <iostream>
int main() {
int node_num, adj[100][100];
std::cin >> node_num;
for (int i = 0; i < node_num; i++)
for (int j = 0; j < node_num; j++)
adj[i][j] = 0;
for (int i = 0; i < node_num; i++) {
int node, num;
std::cin >> node >> num;
for (int j = 0; j < num; j++) {
in... | [["+", 31, 69, 28, 69, 341, 342, 0, 16, 17, 33], ["+", 31, 69, 28, 69, 341, 342, 0, 16, 12, 13]] | 1 | 196 | 2 |
#include <iostream>
#include <vector>
using namespace std;
int N;
int main() {
cin >> N;
vector<vector<bool>> M(N, vector<bool>(N));
int u, k, v;
for (int i = 0; i < N; i++) {
cin >> u >> k;
for (int i = 0; i < k; i++) {
cin >> v;
M[u - 1][v - 1] = true;
}
}
for (int i = 0; ... | #include <iostream>
#include <vector>
using namespace std;
int N;
int main() {
cin >> N;
vector<vector<bool>> M(N, vector<bool>(N));
int u, k, v;
for (int i = 0; i < N; i++) {
cin >> u >> k;
for (int i = 0; i < k; i++) {
cin >> v;
M[u - 1][v - 1] = true;
}
}
for (int i = 0; ... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 79]] | 1 | 169 | 2 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const ... | [["+", 0, 14, 8, 9, 0, 1, 0, 16, 31, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 211 | 4 |
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int judge(int i, int n, int variable, vector<vector<int>> &v) {
for (int j = 0; j < v[variable].size(); ++j) {
if (i == v[variable][j]) {
return 1;
break;
}
}
return 0;
}
int main() {
int n, u, k, vv;
cin >> n;
... | #include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int judge(int i, int n, int variable, vector<vector<int>> &v) {
for (int j = 0; j < v[variable].size(); ++j) {
if (i == v[variable][j]) {
return 1;
break;
}
}
return 0;
}
int main() {
int n, u, k, vv;
cin >> n;
... | [["-", 0, 2, 3, 4, 0, 41, 64, 5, 0, 62], ["+", 0, 2, 3, 4, 0, 41, 64, 103, 0, 104], ["-", 0, 2, 3, 4, 0, 41, 75, 5, 0, 62], ["+", 0, 2, 3, 4, 0, 41, 75, 103, 0, 104]] | 1 | 281 | 8 |
#include <iostream>
using namespace std;
static const int N = 100;
int main() {
int M[N][N];
int n, u, k, v;
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < k; j++)
M[i][j] = 0;
}
for (int i = 0; i < n; i++) {
cin >> u >> k;
u--;
for (int j = 0; j < k; j++) {
cin >>... | #include <iostream>
using namespace std;
static const int N = 100;
int main() {
int M[N][N];
int n, u, k, v;
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++)
M[i][j] = 0;
}
for (int i = 0; i < n; i++) {
cin >> u >> k;
u--;
for (int j = 0; j < k; j++) {
cin >>... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22]] | 1 | 198 | 4 |
#include <iostream>
using namespace std;
int main(void) {
int m[100][100];
int n, u, k, v;
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
m[i][j] = 0;
}
}
for (int i = 0; i < n; i++) {
cin >> u >> k;
u--;
for (int j = 0; j < k; j++) {
cin >> v;
v... | #include <iostream>
using namespace std;
int main(void) {
int m[100][100];
int n, u, k, v;
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
m[i][j] = 0;
}
}
for (int i = 0; i < n; i++) {
cin >> u >> k;
u--;
for (int j = 0; j < k; j++) {
cin >> v;
v... | [["-", 0, 11, 31, 69, 28, 69, 341, 342, 0, 22], ["+", 0, 11, 31, 69, 28, 69, 341, 342, 0, 22], ["-", 0, 1, 0, 11, 31, 69, 341, 342, 0, 22], ["+", 0, 1, 0, 11, 31, 69, 341, 342, 0, 22]] | 1 | 194 | 4 |
//
// main.cpp
// graph
//
// Created by ???????????? on 2017/10/22.
// Copyright ?? 2017 ????????????. All rights reserved.
//
#include <iostream>
#include <stdio.h>
using namespace std;
int main(int argc, const char *argv[]) {
int n, i, j, id, num, node;
scanf("%d", &n);
int A[n][n];
// initialize wit... | //
// main.cpp
// graph
//
// Created by ???????????? on 2017/10/22.
// Copyright ?? 2017 ????????????. All rights reserved.
//
#include <iostream>
#include <stdio.h>
using namespace std;
int main(int argc, const char *argv[]) {
int n, i, j, id, num, node;
scanf("%d", &n);
int A[n][n];
// initialize wit... | [["-", 0, 7, 8, 9, 0, 57, 15, 339, 51, 22], ["+", 0, 7, 8, 9, 0, 57, 15, 339, 51, 22]] | 1 | 235 | 2 |
#include <iostream>
using namespace std;
static const int N = 100;
int main() {
int M[N][N]; // 0 オリジンの配列
int n, u, k, v;
cin >> n;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
M[i][j] = 0;
for (int i = 0; i < n; i++) {
cin >> u >> k;
u--; // 0 オリジンへ変換
for (int j = 0; j < ... | #include <iostream>
using namespace std;
static const int N = 100;
int main() {
int M[N][N]; // 0 オリジンの配列
int n, u, k, v;
cin >> n;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
M[i][j] = 0;
for (int i = 0; i < n; i++) {
cin >> u >> k;
u--; // 0 オリジンへ変換
for (int j = 0; j < ... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22]] | 1 | 200 | 2 |
#include <iostream>
using namespace std;
static const int N = 100;
int main() {
int M[N][N]; // 0 オリジンの配列
int n, u, k, v;
cin >> n;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
M[i][j] = 0;
for (int i = 0; i < n; i++) {
cin >> u >> k;
u--; // 0 オリジンへ変換
for (int j = 0; j < ... | #include <iostream>
using namespace std;
static const int N = 100;
int main() {
int M[N][N];
int n, u, k, v;
cin >> n;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
M[i][j] = 0;
for (int i = 0; i < n; i++) {
cin >> u >> k;
u--;
for (int j = 0; j < k; j++) {
cin >> v;
... | [["-", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 12, 22]] | 1 | 200 | 2 |
#include <stdio.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
int main(void) {
int n, i, j;
scanf("%d", &n);
char r[n][n];
rep(i, n) rep(j, n) r[i][j] = 0;
rep(i, n) {
int u, k;
scanf("%d%d", &u, &k);
u--;
rep(j, k) {
int v;
scanf("%d", &v);
v--;
r[v][u] = 1;
}
... | #include <stdio.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
int main(void) {
int n, i, j;
scanf("%d", &n);
char r[n][n];
rep(i, n) rep(j, n) r[i][j] = 0;
rep(i, n) {
int u, k;
scanf("%d%d", &u, &k);
u--;
rep(j, k) {
int v;
scanf("%d", &v);
v--;
r[u][v] = 1;
}
... | [["-", 0, 11, 31, 69, 28, 69, 341, 342, 0, 22], ["+", 0, 11, 31, 69, 28, 69, 341, 342, 0, 22], ["-", 0, 1, 0, 11, 31, 69, 341, 342, 0, 22], ["+", 0, 1, 0, 11, 31, 69, 341, 342, 0, 22]] | 1 | 182 | 4 |
#include <cstdio>
#include <iostream>
using namespace std;
static const int MAX = 100;
int main() {
int n, u, k, v;
cin >> n;
int M[MAX][MAX];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
M[i][j] = 0;
}
}
for (int i = 0; i < n; i++) {
cin >> u >> k;
u--;
for (int j =... | #include <cstdio>
#include <iostream>
using namespace std;
static const int MAX = 100;
int main() {
int n, u, k, v;
cin >> n;
int M[MAX][MAX];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
M[i][j] = 0;
}
}
for (int i = 0; i < n; i++) {
cin >> u >> k;
u--;
for (int j =... | [["-", 0, 7, 8, 9, 0, 57, 75, 76, 0, 95]] | 1 | 203 | 35 |
// 最長共通部分列 問題
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <stack>
#include <vector>
using namespace std;
#define MAX_N 100
// 無効な値の定義
const int INV = -1;
int main(void) {
int n, u, num, v_num;
int ary_graph[MAX_N + 1][MAX_N + 1];
f... | // 最長共通部分列 問題
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <stack>
#include <vector>
using namespace std;
#define MAX_N 100
// 無効な値の定義
const int INV = -1;
int main(void) {
int n, u, num, v_num;
int ary_graph[MAX_N + 1][MAX_N + 1];
f... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18]] | 1 | 235 | 4 |
#include <iostream>
//给一个图的邻接表，输出其邻接矩阵
using namespace std;
static const int N = 100;
int main() {
int M[N][N];
int n, u, k, v;
cin >> n;
for (int i = 0; i > n; i++) {
for (int j = 0; j < n; j++) {
M[i][j] = 0;
}
}
for (int i = 0; i < n; i++) {
cin >> u >> k;
u--;
for (int j... | #include <iostream>
//给一个图的邻接表，输出其邻接矩阵
using namespace std;
static const int N = 100;
int main() {
int M[N][N];
int n, u, k, v;
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
M[i][j] = 0;
}
}
for (int i = 0; i < n; i++) {
cin >> u >> k;
u--;
for (int j... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 47], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35], ["+", 0, 7, 8, 9, 0, 1, 0, 27, 28, 22], ["+", 0, 7, 8, 9, 0, 1, 0, 27, 17, 68]] | 1 | 195 | 5 |
#include <iostream>
using namespace std;
static const int N = 100;
int main() {
int M[N][N];
int n;
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
M[i][j] = 0;
}
}
int u, k, v;
for (int i = 0; i < n; i++) {
cin >> u >> k;
for (int j = 0; j < k; j++) {
... | #include <iostream>
using namespace std;
static const int N = 100;
int main() {
int M[N][N];
int n;
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
M[i][j] = 0;
}
}
int u, k, v;
for (int i = 0; i < n; i++) {
cin >> u >> k;
u--; // to 0 origin
for (int ... | [["+", 0, 7, 8, 9, 0, 1, 0, 27, 28, 22], ["+", 0, 7, 8, 9, 0, 1, 0, 27, 17, 68], ["+", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35]] | 1 | 201 | 3 |
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int u[n], k;
int a[n][n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
a[i][j] = 0;
}
}
for (int i = 0; i < n; i++) {
cin >> u[i];
cin >> k;
for (int j = 0; j < k; j++) {
int v;
ci... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int u[n], k;
int a[n][n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
a[i][j] = 0;
}
}
for (int i = 0; i < n; i++) {
cin >> u[i];
cin >> k;
for (int j = 0; j < k; j++) {
int v;
ci... | [["+", 31, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["+", 31, 16, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 202 | 2 |
#include <iostream>
using namespace std;
int main() {
int n, k, v, u;
cin >> n;
double V[n][n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
V[i][j] = 0;
}
}
for (int i = 0; i < n; i++) {
cin >> u;
cin >> k;
for (int j = 0; j < k; j++) {
cin >> v;
V[... | #include <iostream>
using namespace std;
int main() {
int n, k, v, u;
cin >> n;
double V[n][n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
V[i][j] = 0;
}
}
for (int i = 0; i < n; i++) {
cin >> u;
cin >> k;
for (int j = 0; j < k; j++) {
cin >> v;
V[... | [["-", 0, 57, 64, 9, 0, 1, 0, 16, 12, 22], ["+", 64, 9, 0, 1, 0, 16, 12, 5, 0, 62], ["+", 64, 9, 0, 1, 0, 16, 12, 5, 0, 6]] | 1 | 197 | 4 |
row = []
matrix = []
n = gets.chomp.to_i
[*0...n].each { |i| row[i] = 0 }
[*0...n].each { |i| matrix[i] = row.clone }
p matrix
n.times {
xs = gets.chomp.split.map(&:to_i)
num = xs.shift; num -= 1; xs.shift
xs.each { |x|
matrix[num][x - 1] = 1
}
}
[*0...n].each { |i|
if matrix[i] != nil
... | row = []
matrix = []
n = gets.chomp.to_i
[*0...n].each { |i| row[i] = 0 }
[*0...n].each { |i| matrix[i] = row.clone }
n.times {
xs = gets.chomp.split.map(&:to_i)
num = xs.shift; num -= 1; xs.shift
xs.each { |x|
matrix[num][x - 1] = 1
}
}
[*0...n].each { |i|
if matrix[i] != nil
put... | [["-", 36, 36, 36, 36, 0, 493, 0, 652, 735, 22], ["-", 36, 36, 0, 493, 0, 652, 3, 4, 0, 22]] | 4 | 140 | 2 |
# http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_11_A
n = gets.chop.to_i
a = []
n.times do
u, k, *v = gets.chop.split.map(&:to_i)
a << Array.new(n) { |i| (v.include?(i + 1)) ? 1 : 0 }
end
a.each { |i| i.join(' ') } | n = gets.chop.to_i
a = []
n.times do
u, k, *v = gets.chop.split.map(&:to_i)
a << Array.new(n) { |i| (v.include?(i + 1)) ? 1 : 0 }
end
a.each { |i| puts i.join(' ') } | [["+", 0, 652, 196, 196, 8, 734, 0, 652, 735, 22]] | 4 | 78 | 1 |
n = gets.to_i
g = (1..n).map{ Array.new(n, 0) }
n.times do
u, k, *v = gets.split(' ').map(&:to_i)
p v
v.each do |vi|
g[u - 1][vi - 1] = 1
end
end
# p g
g.each do |r|
puts r.join(" ")
end | n = gets.to_i
g = (1..n).map{ Array.new(n, 0) }
n.times do
u, k, *v = gets.split(' ').map(&:to_i)
v.each do |vi|
g[u - 1][vi - 1] = 1
end
end
# p g
g.each do |r|
puts r.join(" ")
end | [["-", 0, 652, 196, 737, 8, 736, 0, 652, 735, 22], ["-", 196, 737, 8, 736, 0, 652, 3, 4, 0, 22]] | 4 | 91 | 2 |
n = int(input())
x = [[0 for i in range(n)] for j in range(n)]
for i in range(n):
seq = list(map(int, input().split()))
tmp = seq[0]-1
n2 = seq[1]
if n2!=0:
for e in seq[2:]:
x[tmp][e-1]=1
for j in range(n):
print(" ".join(map(str,x[i]))) | n = int(input())
x = [[0 for i in range(n)] for j in range(n)]
for i in range(n):
seq = list(map(int,input().split()))
tmp = seq[0]-1
n2 = seq[1]
if n2!=0:
for e in seq[2:]:
x[tmp][e-1]=1
for i in range(n):
print(" ".join(map(str,x[i]))) | [["-", 36, 36, 36, 36, 0, 656, 0, 7, 31, 22], ["+", 36, 36, 36, 36, 0, 656, 0, 7, 31, 22]] | 5 | 120 | 2 |
N = int(input())
A = [0] * N
for i in range(N):
A[i] = [0] * N
for line in sys.stdin:
values = line.split()
u = int(values[0]) - 1
k = int(values[1])
nodes = values[2:]
for i in range(int(k)):
v = int(nodes[i]) - 1
A[u][v] = 1
for i in range(N):
print(" ".join([str(x) for x in A[i]])) | import sys
N = int(input())
A = [0] * N
for i in range(N):
A[i] = [0] * N
for line in sys.stdin:
values = line.split()
u = int(values[0]) - 1
k = int(values[1])
nodes = values[2:]
for i in range(int(k)):
v = int(nodes[i]) - 1
A[u][v] = 1
for i in range(N):
print(" ".join([str(x) for x in A[i]])... | [["+", 36, 36, 36, 36, 0, 656, 0, 596, 0, 487], ["+", 36, 36, 0, 656, 0, 596, 141, 673, 0, 22]] | 5 | 136 | 2 |
n = int(input())
for i in range(n):
node = list(map(int,input().split()))
node_list = node[2:]
matrix = [0] * n
for j in node_list:
matrix[j -1] = 1
print("".join(str(matrix))) | n = int(input())
for i in range(n):
node = list(map(int,input().split()))
node_list = node[2:]
matrix = ["0"]* n
for j in node_list:
matrix[j -1] = "1"
print(" ".join(matrix)) | [["+", 0, 662, 12, 657, 31, 634, 0, 557, 0, 654], ["+", 0, 662, 12, 657, 31, 634, 0, 557, 0, 655], ["+", 8, 196, 0, 1, 0, 662, 12, 557, 0, 654], ["+", 8, 196, 0, 1, 0, 662, 12, 557, 0, 655], ["+", 3, 4, 0, 652, 63, 319, 500, 557, 0, 6], ["-", 3, 4, 0, 652, 3, 4, 0, 652, 63, 22], ["-", 0, 652, 3, 4, 0, 652, 3, 4, 0, 24]... | 5 | 73 | 8 |
#include <stdio.h>
static const int N = 100;
int main() {
int A[N][N], n, u, k, v, i, j;
scanf("%d", &n);
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++)
A[i][j] = 0;
}
for (i = 0; i < n; i++) {
scanf("%d %d", &u, &k);
u--;
for (j = 0; j < k; j++) {
scanf("%d", &v);
v--... | #include <stdio.h>
static const int N = 100;
int main() {
int A[N][N], n, u, k, v, i, j;
scanf("%d", &n);
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++)
A[i][j] = 0;
}
for (i = 0; i < n; i++) {
scanf("%d %d", &u, &k);
u--;
for (j = 0; j < k; j++) {
scanf("%d", &v);
v--... | [["-", 64, 1, 0, 2, 3, 4, 0, 5, 0, 44], ["+", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 221 | 2 |
#include <stdio.h>
main() {
int n, k, i, j, t;
int Adj[101][101];
int g;
scanf("%d", &n);
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
Adj[i][j] = 0;
}
}
for (i = 0; i < n; i++) {
scanf("%d", &g);
scanf("%d", &k);
for (j = 0; j < k; j++) {
scanf("%d", &t);
A... | #include <stdio.h>
main() {
int n, k, i, j, t;
int Adj[101][101];
int g;
scanf("%d", &n);
for (i = 0; i <= n; i++) {
for (j = 0; j <= n; j++) {
Adj[i][j] = 0;
}
}
for (i = 0; i < n; i++) {
scanf("%d", &g);
scanf("%d", &k);
for (j = 0; j < k; j++) {
scanf("%d", &t);
... | [["-", 0, 30, 0, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 30, 0, 9, 0, 7, 15, 16, 17, 19], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 8, 9, 0, 57, 15, 23, 0, 16, 31, 22], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 31, 22], ["-", 8, 9, 0, 57, 15, 23, 0, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 2... | 0 | 255 | 12 |
#include <stdio.h>
#define MAX 500000
int v[MAX][MAX];
main() {
int a, b, ten, k, i, j, p, q;
scanf("%d", &ten);
for (i = 0; i < ten; i++) {
scanf("%d%d", &q, &p);
for (j = 0; j < p; j++) {
scanf("%d", &b);
v[q - 1][b - 1] = 1;
}
}
for (i = 0; i < ten; i++) {
for (j = 0; j < ten... | #include <stdio.h>
#define MAX 5000
int v[MAX][MAX];
main() {
int a, b, ten, k, i, j, p, q;
scanf("%d", &ten);
for (i = 0; i < ten; i++) {
scanf("%d%d", &q, &p);
for (j = 0; j < p; j++) {
scanf("%d", &b);
v[q - 1][b - 1] = 1;
}
}
for (i = 0; i < ten; i++) {
for (j = 0; j < ten -... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]] | 0 | 180 | 2 |
#include <stdio.h>
int N;
int A[101][101];
int hantei(int x, int y) {
int i;
int flag = 0;
for (i = 2; i <= N; i++) {
if (A[x][i] == y) {
flag = 1;
}
}
if (flag == 1) {
return 1;
} else if (flag == 0) {
return 0;
}
}
main() {
int i, j, k;
scanf("%d", &N);
for (i = 1; i <... | #include <stdio.h>
int N;
int A[101][101];
int hantei(int x, int y) {
int i;
int flag = 0;
for (i = 2; i <= N; i++) {
if (A[x][i] == y) {
flag = 1;
}
}
if (flag == 1) {
return 1;
} else if (flag == 0) {
return 0;
}
}
main() {
int i, j, k;
scanf("%d", &N);
for (i = 1; i <... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 256 | 2 |
#include <stdio.h>
main() {
int n, i, j, k, m, g[100][100];
scanf("%d", &n);
for (i = 0; i < 100; i++) {
for (j = 0; j < 100; j++) {
g[i][j] = 0;
}
}
for (i = 0; i < n; i++) {
scanf("%d%d", &j, &k);
for (j = 0; j < k; j++) {
scanf("%d", &m);
g[i][m - 1] = 1;
}
}
... | #include <stdio.h>
main() {
int n, i, j, k, m, g[100][100];
scanf("%d", &n);
for (i = 0; i < 100; i++) {
for (j = 0; j < 100; j++) {
g[i][j] = 0;
}
}
for (i = 0; i < n; i++) {
scanf("%d%d", &j, &k);
for (j = 0; j < k; j++) {
scanf("%d", &m);
g[i][m - 1] = 1;
}
}
... | [["+", 0, 7, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 62], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 0, 9, 0, 7, 8, 9, 0, 1, 0, 35]] | 0 | 207 | 7 |
#include <stdio.h>
#define MAX 101
main() {
int i, j, a, b, c, v;
int G[MAX][MAX];
scanf("%d", &c);
for (i = 1; i <= c; i++) {
for (j = 1; j <= c; j++) {
G[i][j] = 0;
}
}
for (i = 1; i <= c; i++) {
scanf("%d %d", &b, &a);
for (j = 1; j <= a; j++) {
scanf("%d", &v);
... | #include <stdio.h>
#define MAX 101
main() {
int i, j, a, b, c, v;
int G[MAX][MAX];
scanf("%d", &c);
for (i = 1; i <= c; i++) {
for (j = 1; j <= c; j++) {
G[i][j] = 0;
}
}
for (i = 1; i <= c; i++) {
scanf("%d %d", &b, &a);
for (j = 1; j <= a; j++) {
scanf("%d", &v);
... | [["+", 0, 7, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 62], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 0, 9, 0, 7, 8, 9, 0, 1, 0, 35]] | 0 | 207 | 7 |
#include <stdio.h>
int main() {
int i, j, n, u, k, v, N[101][101];
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%d", &u);
scanf("%d", &k);
for (j = 1; j <= k; j++) {
scanf("%d", &v);
N[u][v] = 1;
}
}
for (i = 1; i <= n; i++) {
for (j = 1; j <= n; j++) {
if (N[i... | #include <stdio.h>
int main() {
int i, j, n, u, k, v, N[110][110];
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%d", &u);
scanf("%d", &k);
for (j = 1; j <= k; j++) {
scanf("%d", &v);
N[u][v] = 1;
}
}
for (i = 1; i <= n; i++) {
for (j = 1; j <= n; j++) {
if (N[i... | [["-", 8, 9, 0, 43, 49, 80, 49, 80, 81, 13], ["+", 8, 9, 0, 43, 49, 80, 49, 80, 81, 13], ["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["-", 8, 9, 0, 57, 15, 23, 0, 16, 31, 22], ["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 60], ["-", 8, 9, 0, 57, 15, 23, 0, 16, 12, 13], ["+", 8, 9, 0, 5... | 0 | 199 | 10 |
#include <stdio.h>
#define N 100
int M[N][N];
int main() {
int n, i, j, x, v;
for (i = 0; i < N; i++) {
for (j = 0; j < N; j++) {
M[i][j] = 0;
}
}
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d %d", &x, &v);
for (j = 0; j < v; j++) {
scanf("%d", &x);
M[i][x - 1] ... | #include <stdio.h>
#define N 100
int M[N][N];
int main() {
int n, i, j, x, v;
for (i = 0; i < N; i++) {
for (j = 0; j < N; j++) {
M[i][j] = 0;
}
}
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d %d", &x, &v);
for (j = 0; j < v; j++) {
scanf("%d", &x);
M[i][x - 1] ... | [["+", 0, 7, 8, 9, 0, 57, 75, 76, 0, 95]] | 0 | 224 | 1 |
#include <stdio.h>
#include <stdlib.h>
int main(void) {
int **a;
int *b;
int i, j, n, s, t;
scanf("%d", &n);
a = (int **)calloc(n + 1, sizeof(int *));
for (i = 0; i < n + 1; i++) {
a[i] = (int *)calloc(n + 1, sizeof(int));
}
for (i = 0; i < n; i++) {
scanf("%d%d", &s, &t);
if (t != 0) ... | #include <stdio.h>
#include <stdlib.h>
int main(void) {
int **a;
int *b;
int i, j, n, s, t;
scanf("%d", &n);
a = (int **)calloc(n + 1, sizeof(int *));
for (i = 0; i < n + 1; i++) {
a[i] = (int *)calloc(n + 1, sizeof(int));
}
for (i = 0; i < n; i++) {
scanf("%d%d", &s, &t);
if (t != 0) ... | [["-", 0, 57, 64, 9, 0, 7, 10, 11, 31, 22], ["+", 0, 57, 64, 9, 0, 7, 10, 11, 31, 22], ["-", 0, 57, 64, 9, 0, 7, 15, 16, 31, 22], ["+", 0, 57, 64, 9, 0, 7, 15, 16, 31, 22], ["-", 0, 57, 64, 9, 0, 7, 26, 27, 28, 22], ["+", 0, 57, 64, 9, 0, 7, 26, 27, 28, 22], ["-", 0, 2, 3, 4, 0, 66, 28, 69, 71, 22], ["+", 0, 2, 3, 4, 0... | 0 | 300 | 10 |
#include <stdio.h>
int main(void) {
int x, p, i, j, y, h;
int a[100][100] = {0};
scanf("%d", &x);
for (i = 0; i < x; i++) {
scanf("%d%d", &p, &y);
for (j = 0; j < y; j++) {
scanf("%d", &p);
a[p][h] = 1;
}
}
for (i = 0; i < x; i++) {
for (j = 0; j < x; j++) {
printf("%d... | #include <stdio.h>
int main(void) {
int x, p, i, j, y, h;
int a[101][101] = {0};
scanf("%d", &x);
for (i = 0; i < x; i++) {
scanf("%d%d", &p, &y);
for (j = 0; j < y; j++) {
scanf("%d", &h);
a[p][h] = 1;
}
}
for (i = 0; i < x; i++) {
for (j = 0; j < x; j++) {
printf("%d... | [["-", 0, 43, 49, 50, 49, 80, 49, 80, 81, 13], ["+", 0, 43, 49, 50, 49, 80, 49, 80, 81, 13], ["-", 8, 9, 0, 43, 49, 50, 49, 80, 81, 13], ["+", 8, 9, 0, 43, 49, 50, 49, 80, 81, 13], ["-", 0, 1, 0, 2, 3, 4, 0, 66, 28, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 66, 28, 22]] | 0 | 176 | 6 |
#include <stdio.h>
int main() {
int u, k, x, n, a[200][200], i, j, v;
scanf("%d", &n);
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
a[i][j] = 0;
for (i = 1; i <= n; i++) {
scanf("%d%d", &u, &k);
for (j = 1; j <= k; j++) {
scanf("%d", &v);
a[i][v] = 1;
}
}
for (i... | #include <stdio.h>
int main() {
int u, k, x, n, a[200][200], i, j, v;
scanf("%d", &n);
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
a[i][j] = 0;
for (i = 1; i <= n; i++) {
scanf("%d%d", &u, &k);
for (j = 1; j <= k; j++) {
scanf("%d", &v);
a[i][v] = 1;
}
}
for (i... | [["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46], ["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46]] | 0 | 217 | 2 |
#include <stdio.h>
#define N 10000
int main() {
int M[N][N];
int i, j, k, n = 0, temp = 0, secret = 0;
scanf("%d", &n);
/*???????????\???*/
for (i = 1; i <= n; i++) {
for (j = 1; j <= n; j++) {
M[i][j] = 0;
}
}
/*adjacentmatrix??\???*/
for (i = 1; i <= n; i++) {
scanf("%d %d", &sec... | #include <stdio.h>
#define N 101
int main() {
int M[N][N];
int i, j, k, n = 0, temp = 0, secret = 0;
scanf("%d", &n);
/*???????????\???*/
for (i = 1; i <= n; i++) {
for (j = 1; j <= n; j++) {
M[i][j] = 0;
}
}
/*adjacentmatrix??\???*/
for (i = 1; i <= n; i++) {
scanf("%d %d", &secre... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]] | 0 | 274 | 2 |
#include <stdio.h>
int main() {
int i, j, n, u, k, v, a[101][101];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d %d", &u, &k);
for (j = 0; j < k; j++) {
scanf("%d", &v);
a[u][v] = 1;
}
}
for (i = 1; i <= n; i++) {
for (j = 1; j <= n; j++) {
printf("%d", a[i][j]);
... | #include <stdio.h>
int main() {
int i, j, n, u, k, v, a[1000][1000];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d%d", &u, &k);
for (j = 0; j < k; j++) {
scanf("%d", &v);
a[u][v] = 1;
}
}
for (i = 1; i <= n; i++) {
for (j = 1; j <= n; j++) {
printf("%d", a[i][j]);
... | [["-", 8, 9, 0, 43, 49, 80, 49, 80, 81, 13], ["+", 8, 9, 0, 43, 49, 80, 49, 80, 81, 13], ["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 60], ["+", 8, 9, 0, 57, 15, 23, 0... | 0 | 170 | 8 |
#include <stdio.h>
int main() {
int M[100][100];
int n, u, k, v, i, j;
scanf("%d", &n);
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++)
M[i][j] = 0;
}
for (i = 0; i < n; i++) {
scanf("%d%d", &u, &k);
for (j = 0; j < k; j++) {
scanf("%d", &v);
v--;
M[u][v] = 1;
}
... | #include <stdio.h>
int main() {
int M[200][200];
int n, u, k, v, i, j;
scanf("%d", &n);
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++)
M[i][j] = 0;
}
for (i = 0; i < n; i++) {
scanf("%d%d", &u, &k);
for (j = 0; j < k; j++) {
scanf("%d", &v);
v--;
M[u][v] = 1;
}
... | [["-", 8, 9, 0, 43, 49, 80, 49, 80, 81, 13], ["+", 8, 9, 0, 43, 49, 80, 49, 80, 81, 13], ["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, ... | 0 | 210 | 8 |
#include <stdio.h>
int main() {
int n, i, j, k, l, u, v[100][100];
scanf("%d", &n);
for (i = 1; i <= n; i++) {
for (j = 1; j <= n; j++) {
v[i][j] = 0;
}
}
for (i = 1; i <= n; i++) {
scanf("%d", &k);
scanf("%d", &u);
for (j = 1; j <= u; j++) {
scanf("%d", &l);
v[k][l... | #include <stdio.h>
int main() {
int n, i, j, k, l, u, v[101][101];
scanf("%d", &n);
for (i = 1; i <= n; i++) {
for (j = 1; j <= n; j++) {
v[i][j] = 0;
}
}
for (i = 1; i <= n; i++) {
scanf("%d", &k);
scanf("%d", &u);
for (j = 1; j <= u; j++) {
scanf("%d", &l);
v[k][l... | [["-", 8, 9, 0, 43, 49, 80, 49, 80, 81, 13], ["+", 8, 9, 0, 43, 49, 80, 49, 80, 81, 13], ["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["-", 0, 2, 3, 4, 0, 69, 28, 69, 71, 13], ["+", 0, 2, 3, 4, 0, 69, 28, 69, 71, 22]] | 0 | 219 | 6 |
#include <stdio.h>
#define MAX 100
int main() {
int n, i, j, tmp;
int tyouten[MAX], dekazu[MAX], ikisaki[MAX][MAX];
for (i = 0; i < MAX; i++) {
for (j = 0; j < MAX; j++)
ikisaki[i][j] = 0;
}
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d%d", &tyouten[i], &dekazu[i]);
for (j ... | #include <stdio.h>
#define MAX 100
int main() {
int n, i, j, tmp;
int tyouten[MAX], dekazu[MAX], ikisaki[MAX][MAX];
for (i = 0; i < MAX; i++) {
for (j = 0; j < MAX; j++)
ikisaki[i][j] = 0;
}
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d%d", &tyouten[i], &dekazu[i]);
for (j ... | [["-", 8, 9, 0, 57, 15, 23, 0, 11, 17, 32], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 60]] | 0 | 241 | 2 |
#include <stdio.h>
int main() {
int M[101][101];
int n, u, k, v, i, j;
scanf("%d", &n);
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
M[i][j] = 0;
}
}
for (i = 0; i < n; i++) {
scanf("%d", &u);
scanf("%d", &k);
u--;
for (j = 0; j < k; j++) {
scanf("%d", &v);
... | #include <stdio.h>
int main() {
int M[101][101];
int n, u, k, v, i, j;
scanf("%d", &n);
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
M[i][j] = 0;
}
}
for (i = 0; i < n; i++) {
scanf("%d", &u);
scanf("%d", &k);
u--;
for (j = 0; j < k; j++) {
scanf("%d", &v);
... | [["-", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 62], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 0 | 233 | 24 |
#include <stdio.h>
#include <stdlib.h>
typedef struct list {
int u, k, *v;
} T_list;
int main() {
int n;
scanf("%d", &n);
T_list lst[n];
int mat[n][n];
int i, j;
for (i = n - 1; i >= 0; i--)
for (j = n - 1; j >= 0; j--)
mat[i][j] = 0;
for (i = 0; i < n; i++) {
scanf("%d %d", &lst[i].u, &ls... | #include <stdio.h>
#include <stdlib.h>
typedef struct list {
int u, k, *v;
} T_list;
int main() {
int n;
scanf("%d", &n);
T_list lst[n];
int mat[n][n];
int i, j;
for (i = n - 1; i >= 0; i--)
for (j = n - 1; j >= 0; j--)
mat[i][j] = 0;
for (i = 0; i < n; i++) {
scanf("%d %d", &lst[i].u, &ls... | [["-", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 0 | 316 | 2 |
#include <stdio.h>
#define N 101
int main() {
int n, Adj[N][N], i, j, s, t, u;
int G[N][N];
scanf("%d", &n);
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
G[i][j] = 0;
}
}
for (i = 1; i <= n; i++) {
scanf("%d %d", &s, &t);
for (j = 0; j < t; j++) {
scanf("%d", &u);
... | #include <stdio.h>
#define N 101
int main() {
int n, Adj[N][N], i, j, s, t, u;
int G[N][N];
scanf("%d", &n);
for (i = 1; i <= n; i++) {
for (j = 1; j <= n; j++) {
G[i][j] = 0;
}
}
for (i = 1; i <= n; i++) {
scanf("%d %d", &s, &t);
for (j = 0; j < t; j++) {
scanf("%d", &u);
... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["-", 0, 7, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 7, 8, 9, 0, 7, 10, 11, 12, 13], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 7, 8, 9, 0, 7, 15, ... | 0 | 222 | 10 |
#include <stdio.h>
#define MAX 100
int number[MAX][MAX];
int main(void) {
int a, b, c, i, j, l;
scanf("%d", &l);
for (i = 0; i < l; i++) {
scanf("%d", &a);
scanf("%d", &b);
for (j = 0; j < b; j++) {
scanf("%d", &c);
number[a - 1][c - 1] = 1;
}
}
for (i = 0; i < l; i++) {
... | #include <stdio.h>
#define MAX 100
int number[MAX][MAX];
int main(void) {
int a, b, c, i, j, l;
scanf("%d", &l);
for (i = 0; i < l; i++) {
scanf("%d", &a);
scanf("%d", &b);
for (j = 0; j < b; j++) {
scanf("%d", &c);
number[a - 1][c - 1] = 1;
}
}
for (i = 0; i < l; i++) {
... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 184 | 2 |
#include <stdio.h>
int main() {
int i, j, n, n2, n3, n4[101][101], n5[101];
scanf("%d", &n);
for (i = 1; i <= n; i++) {
for (j = 1; j <= n; j++) {
n4[i][j] = 0;
}
}
for (i = 1; i <= n; i++) {
scanf("%d", &n5[i]);
scanf("%d", &n2);
if (n2 == 0)
continue;
else {
fo... | #include <stdio.h>
int main() {
int i, j, n, n2, n3, n4[101][101], n5[101];
scanf("%d", &n);
for (i = 1; i <= n; i++) {
for (j = 1; j <= n; j++) {
n4[i][j] = 0;
}
}
for (i = 1; i <= n; i++) {
scanf("%d", &n5[i]);
scanf("%d", &n2);
if (n2 == 0)
continue;
else {
fo... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 230 | 2 |
def main():
num = int(input())
T = [[0] * num for i in range(num)]
for n in range(num):
a = list(map(int,input().split()))
u = a[0] - 1
if a[1] > 0:
for i in a[2:]:
print(i)
T[u][i-1] = 1
for i in range(num):
print(" ".join(map... | def main():
num = int(input())
T = [[0] * num for i in range(num)]
for n in range(num):
a = list(map(int,input().split()))
u = a[0] - 1
if a[1] > 0:
for i in a[2:]:
T[u][i-1] = 1
for i in range(num):
print(" ".join(map(str,T[i])))
if __name__... | [["-", 0, 7, 8, 196, 0, 1, 0, 652, 63, 22], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 24], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 22], ["-", 8, 196, 0, 1, 0, 652, 3, 4, 0, 25]] | 5 | 131 | 4 |
# ??\???????????????
n = int(input())
data = [list(map(int,input().split())) for i in range(n)]
# N*N?????£??\??????????????°?????????
graph_table = [[0]*n for i in range(n)]
# ??£??\??????????????£??\???????????????
for d in data:
node_id = d[0]
num_of_e = d[1]
for e in d[2:]:#???????????????????????????... | # ??\???????????????
n = int(input())
data = [list(map(int,input().split())) for i in range(n)]
# N*N?????£??\??????????????°?????????
graph_table = [[0]*n for i in range(n)]
# ??£??\??????????????£??\???????????????
for d in data:
node_id = d[0]
num_of_e = d[1]
for e in d[2:]:#???????????????????????????... | [["-", 36, 36, 0, 656, 0, 1, 0, 652, 63, 22], ["-", 0, 656, 0, 1, 0, 652, 3, 4, 0, 24], ["-", 0, 656, 0, 1, 0, 652, 3, 4, 0, 22], ["-", 0, 656, 0, 1, 0, 652, 3, 4, 0, 25]] | 5 | 108 | 4 |
v_num = int(input())
adjacent = [[0 for n in range(v_num)] for m in range(v_num)]
for _ in range(v_num):
inp = (int(n) for n in input().split(" "))
for i in inp[2:]:
adjacent[inp[0] - 1][i - 1] = 1
for i in range(v_num):
print(*adjacent[i]) | v_num = int(input())
adjacent = [[0 for n in range(v_num)] for m in range(v_num)]
for _ in range(v_num):
inp = [int(n) for n in input().split(" ")]
for i in inp[2:]:
adjacent[inp[0] - 1][i - 1] = 1
for i in range(v_num):
print(*adjacent[i]) | [["-", 8, 196, 0, 1, 0, 662, 12, 668, 0, 24], ["+", 8, 196, 0, 1, 0, 662, 12, 658, 0, 70], ["-", 12, 668, 0, 659, 12, 652, 3, 4, 0, 25], ["+", 8, 196, 0, 1, 0, 662, 12, 658, 0, 73]] | 5 | 99 | 4 |
N=int(input())
for _ in[0]*N:
r=[0]*N
for i in input().split()[2:]:a[int(i)-1]=1
print(*a)
| N=int(input())
for _ in[0]*N:
r=[0]*N
for i in input().split()[2:]:r[int(i)-1]=1
print(*r)
| [["-", 8, 196, 0, 1, 0, 662, 31, 206, 51, 22], ["+", 8, 196, 0, 1, 0, 662, 31, 206, 51, 22], ["-", 0, 1, 0, 652, 3, 4, 0, 661, 0, 22], ["+", 0, 1, 0, 652, 3, 4, 0, 661, 0, 22]] | 5 | 55 | 4 |
(function main() {
const lines =
require('fs').readFileSync('/dev/stdin', 'utf8').trim().split('\n');
const n = Number(lines.shift());
const adjLists = Array.from(Array(n), () => []);
lines.forEach(
(l, i) => l.split(' ').splice(2).forEach(e => adjLists[i].push(e - 1)));
const d = [], f = [];
... | (function main() {
const lines =
require('fs').readFileSync('/dev/stdin', 'utf8').trim().split('\n');
const n = Number(lines.shift());
const adjLists = Array.from(Array(n), () => []);
lines.forEach(
(l, i) => l.split(' ').splice(2).forEach(e => adjLists[i].push(e - 1)));
const d = [], f = [];
... | [["-", 0, 1, 0, 2, 3, 3, 0, 561, 0, 44]] | 2 | 323 | 27 |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args)
throws NumberFormatException, IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(br.read... | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args)
throws NumberFormatException, IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(br.read... | [["+", 49, 200, 51, 227, 497, 505, 0, 16, 17, 48], ["+", 49, 200, 51, 227, 497, 505, 0, 16, 12, 22]] | 3 | 464 | 2 |
#include <stdio.h>
#define N 100
#define White 0
#define Black 2
#define Gray 1
int GX[N][N], x, color[N], time, d[N], f[N];
void visit(int u) {
int v;
color[u] = Gray;
d[u] = ++time;
for (v = 0; v < x; v++) {
if (GX[u][v] == 0)
continue;
if (color[v] == White)
visit(v);
}
color[u] = B... | #include <stdio.h>
#define N 100
#define White 0
#define Black 2
#define Gray 1
int GX[N][N], x, color[N], time, d[N], f[N];
void visit(int u) {
int v;
color[u] = Gray;
d[u] = ++time;
for (v = 0; v < x; v++) {
if (GX[u][v] == 0)
continue;
if (color[v] == White)
visit(v);
}
color[u] = B... | [["-", 0, 7, 8, 9, 0, 1, 0, 27, 28, 22], ["-", 0, 7, 8, 9, 0, 1, 0, 27, 17, 68], ["-", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35]] | 0 | 378 | 3 |
#include <stdio.h>
#define N 120
#define GRAY 99
#define WHITE 100
#define BLACK 101
void DFS(void);
void DFS_visit(int);
int n, u, k, d[N], f[N], t, color[N], G[N][N];
main() {
int i, j, v;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%d%d", &u, &k);
for (j = 1; j <= k; j++) {
scanf(... | #include <stdio.h>
#define N 120
#define GRAY 99
#define WHITE 100
#define BLACK 101
void DFS(void);
void DFS_visit(int);
int n, u, k, d[N], f[N], t, color[N], G[N][N];
main() {
int i, j, v;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%d%d", &u, &k);
for (j = 1; j <= k; j++) {
scanf(... | [["-", 8, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["-", 8, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 0 | 331 | 2 |
#include <stdio.h>
#define M 100
#define W -3
#define B -4
#define G -2
void Dfs();
void Dfsv(int);
int d[M];
int f[M];
int color[M];
int time;
int Adj[M][M]; //有向グラフGの隣接リスト
int n;
main() {
int i, j; // counter
int a, b, c;
scanf("%d", &n);
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
Ad... | #include <stdio.h>
#define M 100
#define W -3
#define B -4
#define G -2
void Dfs();
void Dfsv(int);
int d[M];
int f[M];
int color[M];
int time;
int Adj[M][M]; //有向グラフGの隣接リスト
int n;
main() {
int i, j; // counter
int a, b, c;
scanf("%d", &n);
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
Ad... | [["+", 0, 1, 0, 11, 31, 69, 71, 16, 17, 33], ["+", 0, 1, 0, 11, 31, 69, 71, 16, 12, 13], ["+", 36, 36, 0, 30, 0, 9, 0, 37, 0, 38], ["+", 36, 36, 0, 30, 0, 9, 0, 37, 0, 13], ["+", 36, 36, 0, 30, 0, 9, 0, 37, 0, 35]] | 0 | 386 | 5 |
#include <stdio.h>
#define N 101
#define WHITE -1
#define BLACK 1
#define GRAY 0
int color[N], n, G[N][N];
int d[N], f[N];
int time = 0;
void DFSvisit(int u) {
int i;
color[u] = GRAY;
d[u] = ++time;
for (i = 1; i <= n; i++) {
if (G[u][i] == 1) {
if (color[i] == WHITE)
DFSvisit(i);
}
}
... | #include <stdio.h>
#define N 101
#define WHITE -1
#define BLACK 1
#define GRAY 0
int color[N], n, G[N][N];
int d[N], f[N];
int time = 0;
void DFSvisit(int u) {
int i;
color[u] = GRAY;
d[u] = ++time;
for (i = 1; i <= n; i++) {
if (G[u][i] == 1) {
if (color[i] == WHITE)
DFSvisit(i);
}
}
... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 0 | 330 | 2 |
#include <stdio.h>
#define One -1
#define Two -2
#define Three -3
int A[101][101], B[101], C[101], D[101];
int n;
int time;
void DepthFirstSearch(int m) {
int i;
// printf("ok\n");
D[m] = Two;
time++;
B[m] = time;
for (i = 0; i <= n; i++) {
if (A[m][i] == Three && D[i] == Three) {
DepthFirst... | #include <stdio.h>
#define One -1
#define Two -2
#define Three -3
int A[101][101], B[101], C[101], D[101];
int n;
int time;
void DepthFirstSearch(int m) {
int i;
// printf("ok\n");
D[m] = Two;
time++;
B[m] = time;
for (i = 0; i <= n; i++) {
if (A[m][i] && D[i] == Three) {
DepthFirstSearch(i)... | [["-", 0, 57, 15, 23, 0, 16, 31, 16, 17, 60], ["-", 0, 57, 15, 23, 0, 16, 31, 16, 12, 22]] | 0 | 353 | 2 |
#include <stdio.h>
#define MAX 200
void DepthFirstSearch(int);
int graph[MAX][MAX];
int d[MAX], f[MAX];
int t = 0, n;
main() {
int u, k, v;
int i, j;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d%d", &u, &k);
}
for (j = 0; j < k; j++) {
scanf("%d", &v);
graph[u - 1][v - 1] = 1;
}
... | #include <stdio.h>
#define MAX 150
void DepthFirstSearch(int);
int graph[MAX][MAX];
int d[MAX], f[MAX];
int t = 0, n;
int main() {
int u, k, v;
int i, j;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d%d", &u, &k);
for (j = 0; j < k; j++) {
scanf("%d", &v);
graph[u - 1][v - 1] = 1;... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 14, 39, 40], ["-", 0, 1, 0, 2, 3, 4, 0, 25, 0, 35], ["-", 0, 30, 0, 9, 0, 7, 8, 9, 0, 46], ["+", 0, 7, 8, 9, 0, 7, 8, 9, 0, 46]] | 0 | 274 | 6 |
#include <stdio.h>
#define WHITE 0
#define GRAY 1
#define BLACK 2
int n, u, k, v, i, j, tt, n;
int M[200][200], d[200], f[200], c[200];
void visit(int u) {
int v;
c[u] = GRAY;
d[u] = ++tt;
for (v = 0; v < n; v++) {
if (M[u][v] == 0)
continue;
if (c[v] == WHITE) {
visit(v);
}
}
c[u] ... | #include <stdio.h>
#define WHITE 0
#define GRAY 1
#define BLACK 2
int n, u, k, v, i, j, tt, n;
int M[200][200], d[200], f[200], c[200];
void visit(int u) {
int v;
c[u] = GRAY;
d[u] = ++tt;
for (v = 0; v < n; v++) {
if (M[u][v] == 0)
continue;
if (c[v] == WHITE) {
visit(v);
}
}
c[u] ... | [["+", 0, 7, 8, 9, 0, 1, 0, 27, 28, 22], ["+", 0, 7, 8, 9, 0, 1, 0, 27, 17, 68], ["+", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35]] | 0 | 347 | 3 |
#include <stdio.h>
#define N 101
int n, M[N][N];
int color[N], d[N], f[N], time;
void visit(int);
int main() {
int i, j, v, vnext, k;
scanf("%d", &n);
for (i = 0; i < n; i++) {
color[i] = 0;
for (j = 0; j < n; j++) {
M[i][j] = 0;
;
}
}
for (i = 0; i < n; i++) {
scanf("%d %d"... | #include <stdio.h>
#define N 101
int n, M[N][N];
int color[N], d[N], f[N], time;
void visit(int);
int main() {
int i, j, v, vnext, k;
scanf("%d", &n);
for (i = 0; i < n; i++) {
color[i] = 0;
for (j = 0; j < n; j++) {
M[i][j] = 0;
;
}
}
for (i = 0; i < n; i++) {
scanf("%d %d"... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 12, 22], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 12, 13], ["-", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 0, 7, 8, 9, 0, 57, 64, 116, 0, 117], ["+", 0, 7, 8, 9, 0, 57, 64, 116, 0, 35], ["-", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46]] | 0 | 335 | 6 |
#include <stdio.h>
#define N 100
#define WHITE 0
#define GRAY 1
#define BLACK 2
int n, arr[N][N];
int col[N], d[N], f[N], time;
void dfs(void);
void visit(int);
int main() {
int i, j, a, b, c;
scanf("%d", &n);
for (i = 0; i < n; i++)
for (j = 0; i < n; i++)
arr[i][j] = 0;
for (i = 0; i < n; i++) ... | #include <stdio.h>
#define N 100
#define WHITE 0
#define GRAY 1
#define BLACK 2
int n, arr[N][N];
int col[N], d[N], f[N], time;
void dfs(void);
void visit(int);
int main() {
int i, j, a, b, c;
scanf("%d", &n);
for (i = 0; i < n; i++)
for (j = 0; j < n; j++)
arr[i][j] = 0;
for (i = 0; i < n; i++) ... | [["-", 8, 9, 0, 7, 8, 7, 15, 16, 31, 22], ["+", 8, 9, 0, 7, 8, 7, 15, 16, 31, 22], ["-", 8, 9, 0, 7, 8, 7, 26, 27, 28, 22], ["+", 8, 9, 0, 7, 8, 7, 26, 27, 28, 22], ["-", 0, 7, 8, 9, 0, 7, 15, 16, 31, 22], ["+", 0, 7, 8, 9, 0, 7, 15, 16, 31, 22], ["-", 0, 7, 8, 9, 0, 7, 26, 27, 28, 22], ["+", 0, 7, 8, 9, 0, 7, 26, 27, ... | 0 | 373 | 8 |
#include <stdio.h>
#define WHITE 0
#define GRAY 1
#define BLACK 2
void dfs();
void visit(int);
int color[101];
int graph[101][101];
int d[101];
int f[101];
int n;
int time;
int main() {
int i, j, x, y, z;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
for (j = 1; j <= n; j++) {
graph[i][j] = 0;
}
}... | #include <stdio.h>
#define WHITE 0
#define GRAY 1
#define BLACK 2
void dfs();
void visit(int);
int color[101];
int graph[101][101];
int d[101];
int f[101];
int n;
int time;
int main() {
int i, j, x, y, z;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
for (j = 1; j <= n; j++) {
graph[i][j] = 0;
}
}... | [["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 45], ["-", 8, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46]] | 0 | 367 | 4 |
#include <stdio.h>
#define N 10
#define WHITE 0
#define GRAY 1
#define BLACK 2
int n, Adj[N][N];
int color[N], d[N], f[N], time;
void visit(int);
void depth_first_search();
int main() {
int u, v, k, i, j;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d%d", &u, &k);
u--;
for (j = 0; j < k; j+... | #include <stdio.h>
#define N 100
#define WHITE 0
#define GRAY 1
#define BLACK 2
int n, Adj[N][N];
int color[N], d[N], f[N], time;
void visit(int);
void depth_first_search();
int main() {
int u, v, k, i, j;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d%d", &u, &k);
u--;
for (j = 0; j < k; j... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]] | 0 | 334 | 2 |
#include <stdio.h>
#define WHITE 0
#define GRAY 1
#define BLACK 2
int M[100][100];
int f[100], d[100], tt, n, color[100];
void df_d(int u) {
int v;
color[u] = GRAY;
d[u] = ++tt;
for (v = 0; v < n; v++) {
if (M[u][v] == 0)
continue;
if (color[v] == WHITE) {
df_d(v);
}
}
color[u] = B... | #include <stdio.h>
#define WHITE 0
#define GRAY 1
#define BLACK 2
int M[100][100];
int f[100], d[100], tt, n, color[100];
void df_d(int u) {
int v;
color[u] = GRAY;
d[u] = ++tt;
for (v = 0; v < n; v++) {
if (M[u][v] == 0)
continue;
if (color[v] == WHITE) {
df_d(v);
}
}
color[u] = B... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 49, 22], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21]] | 0 | 372 | 2 |
#include <stdio.h>
#define N 100
#define WHITE 0
#define GRAY 1
#define BLACK 2
int n, M[N][N];
int color[N], d[N], f[N], tt;
void dfs_visit(int u) {
int v;
color[u] = GRAY;
d[u] = ++tt;
for (v = 0; v < n; v++) {
if (M[u][v] == 0)
continue;
if (color[v] == WHITE) {
dfs_visit(v);
}
}
... | #include <stdio.h>
#define N 100
#define WHITE 0
#define GRAY 1
#define BLACK 2
int n, M[N][N];
int color[N], d[N], f[N], tt;
void dfs_visit(int u) {
int v;
color[u] = GRAY;
d[u] = ++tt;
for (v = 0; v < n; v++) {
if (M[u][v] == 0)
continue;
if (color[v] == WHITE) {
dfs_visit(v);
}
}
... | [["-", 8, 9, 0, 57, 15, 23, 0, 11, 17, 32], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 60]] | 0 | 369 | 2 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.