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 <algorithm>
#include <iostream>
using namespace std;
int main(void) {
// Your code here!
int N;
cin >> N;
int A[1001];
int i, j, v, k;
for (i = 0; i < N; i++) {
cin >> A[i];
}
for (i = 0; i < N - 1; i++) {
cout << A[i] << " ";
}
cout << A[i] << endl;
for (i = 1; i < N; i++) {
... | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
// Your code here!
int N;
cin >> N;
int A[1001];
int i, j, v, k;
for (i = 0; i < N; i++) {
cin >> A[i];
}
for (i = 0; i < N - 1; i++) {
cout << A[i] << " ";
}
cout << A[i] << endl;
for (i = 1; i < N; i++) {
... | [["-", 0, 16, 31, 16, 12, 69, 341, 342, 0, 22], ["+", 0, 16, 31, 16, 12, 69, 341, 342, 0, 22]] | 1 | 201 | 2 |
#include <algorithm>
#include <cstdio>
int A[100], v, j;
int main() {
int N;
scanf("%d", &N);
for (int i = 0; i < N; i++)
scanf("%d", &A[i]);
for (int k = 0; k < N; k++) {
if (k)
printf(" ");
printf("%d", A[k]);
}
for (int i = 1; i < N; i++) {
v = A[i];
j = i - 1;
while (j >= ... | #include <algorithm>
#include <cstdio>
int A[100], v, j;
int main() {
int N;
scanf("%d", &N);
for (int i = 0; i < N; i++)
scanf("%d", &A[i]);
for (int k = 0; k < N; k++) {
if (k)
printf(" ");
printf("%d", A[k]);
}
printf("\n");
for (int i = 1; i < N; i++) {
v = A[i];
j = i - 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]] | 1 | 216 | 7 |
#include <iostream>
int N; //整数の長さN
int A[100]; // N個の数列A
int v;
int i, j, k;
int main() {
std::cin >> N;
for (i = 0; i < N; i++) {
std::cin >> A[i];
}
for (i = 0; i < N; i++) {
if (i == N - 1) {
std::cout << A[i];
} else
std::cout << A[i] << ' ';
}
std::cout << std::endl;
f... | #include <iostream>
int N; //整数の長さN
int A[100]; // N個の数列A
int v;
int i, j, k;
int main() {
std::cin >> N;
for (i = 0; i < N; i++) {
std::cin >> A[i];
}
for (i = 0; i < N; i++) {
if (i == N - 1) {
std::cout << A[i];
} else
std::cout << A[i] << ' ';
}
std::cout << std::endl;
f... | [["-", 0, 57, 15, 339, 51, 16, 12, 16, 12, 22], ["+", 0, 57, 15, 339, 51, 16, 12, 16, 12, 13]] | 1 | 243 | 2 |
#include <cstdio>
using namespace std;
int main() {
int n;
int a[100];
int v;
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
for (int i = 1; i < n; i++) {
v = a[i];
for (int j = i - 1; j >= 0; j--) {
if (a[j] > v) {
a[j + 1] = a[j];
a[j] = v;
} el... | #include <cstdio>
using namespace std;
int main() {
int n;
int a[1000];
int v;
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
for (int i = 0; i < n; i++) {
v = a[i];
for (int j = i - 1; j >= 0; j--) {
if (a[j] > v) {
a[j + 1] = a[j];
a[j] = v;
} e... | [["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 181 | 4 |
#include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long i64;
#define put(n) cout << (n) << "\n"
#define FOR(i, num, N) for (int(i) = (num); (i) < (N); (i)++)
#define RFOR(i, num, N) for (int(i) = (num); (i) > (... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long i64;
#define put(n) cout << (n) << "\n"
#define FOR(i, num, N) for (int(i) = (num); (i) < (N); (i)++)
#define RFOR(i, num, N) for (int(i) = (num); (i) > (... | [["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 31, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 206 | 6 |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
void InputSet(std::vector<int> &a) {
int n;
cin >> n;
a.resize(n, 0);
for (int i = 0; i < n; ++i) {
cin >> a.at(i);
}
}
void Print(std::vector<int> &a) {
for (int j = 0; j < (int)a.size(); ++j) {
if (j == 0) {
cout <... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
void InputSet(std::vector<int> &a) {
int n;
cin >> n;
a.resize(n, 0);
for (int i = 0; i < n; ++i) {
cin >> a.at(i);
}
}
void Print(std::vector<int> &a) {
for (int j = 0; j < (int)a.size(); ++j) {
if (j == 0) {
cout <... | [["+", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 240 | 5 |
#include <iostream>
using namespace std;
int input[100];
int output[100];
int number = 0;
void insertion_sort(int a[]);
void print(int a[]);
int main() {
cin >> number;
for (int i = 0; i < number; i++) {
cin >> input[i];
}
insertion_sort(input);
}
void insertion_sort(int a[]) {
for (int j = 1; j < nu... | #include <iostream>
using namespace std;
int input[100];
int output[100];
int number = 0;
void insertion_sort(int a[]);
void print(int a[]);
int main() {
cin >> number;
for (int i = 0; i < number; i++) {
cin >> input[i];
}
insertion_sort(input);
}
void insertion_sort(int a[]) {
print(a);
for (int j... | [["+", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 214 | 5 |
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n;
int a[100];
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 1; i < n; i++) {
int j;
int tmp = a[i];
for (j = 0; j < i; j++) {
if (a[i] < a[j]) {
break;
}
}
for (int k = ... | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n;
int a[100];
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++) {
int j;
int tmp = a[i];
for (j = 0; j < i; j++) {
if (a[i] < a[j]) {
break;
}
}
for (int k = ... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 186 | 2 |
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
for (int j = 0; j < n; ++j)
cout << a[j] << ((j == n - 1) ? "\n" : " ");
for (int i = 1; i <= n; ++i) {
int key = a[i], j = i - 1;
for (; j... | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
for (int j = 0; j < n; ++j)
cout << a[j] << ((j == n - 1) ? "\n" : " ");
for (int i = 1; i < n; ++i) {
int key = a[i], j = i - 1;
for (; j ... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18]] | 1 | 203 | 2 |
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, a;
vector<int> v(1, 0);
cin >> n;
while (n--) {
cin >> a;
v.push_back(a);
}
for (int j = 2; j < v.size(); j++) {
int key = v[j], i = j - 1;
while (i > 0 && v[i] > key) {
v[i + 1] = v[i];
i--;
}
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n, a;
vector<int> v(1, 0);
cin >> n;
while (n--) {
cin >> a;
v.push_back(a);
}
for (int j = 1; j < v.size(); j++) {
int key = v[j], i = j - 1;
while (i > 0 && v[i] > key) {
v[i + 1] = v[i];
i--;
}
... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 169 | 2 |
#include <iostream>
#define REP(i, a, b) for (i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
#define N 1000
using namespace std;
void trace(int A[], int n) {
int i;
rep(i, n) {
if (i > 0)
cout << " ";
cout << A[i];
}
cout << endl;
}
int main() {
int n, A[N + 1];
int i, j, key;
// inp... | #include <iostream>
#define REP(i, a, b) for (i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
#define N 1000
using namespace std;
void trace(int A[], int n) {
int i;
rep(i, n) {
if (i > 0)
cout << " ";
cout << A[i];
}
cout << endl;
}
int main() {
int n, A[N + 1];
int i, j, key;
// inp... | [["-", 0, 1, 0, 2, 3, 4, 0, 16, 17, 33], ["-", 0, 1, 0, 2, 3, 4, 0, 16, 12, 13]] | 1 | 204 | 2 |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <s... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <s... | [["+", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 431 | 5 |
#include <iostream>
#include <vector>
int main() {
int n;
std::cin >> n;
std::vector<int> A(n);
for (int i = 0; i < n; ++i)
std::cin >> A[i];
for (int i = 1; i < n - 1; ++i) {
for (int k = 0; k < n; ++k) {
if (k != n - 1)
std::cout << A[k] << ' ';
else
std::cout << A[k] <<... | #include <iostream>
#include <vector>
int main() {
int n;
std::cin >> n;
std::vector<int> A(n);
for (int i = 0; i < n; ++i)
std::cin >> A[i];
for (int i = 1; i < n; ++i) {
for (int k = 0; k < n; ++k) {
if (k != n - 1)
std::cout << A[k] << ' ';
else
std::cout << A[k] << std... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 230 | 2 |
package main
import "fmt"
/*
Insertion Sort
*/
func main() {
var N int
fmt.Scan(&N)
A := make([]int, N)
for i := 0; i < N; i++ {
fmt.Scan(&A[i])
}
for i := 1; i < N; i++ {
key := A[i]
j := i - 1
for j >= 0 && A[j] > key {
A[j+1] = A[j]
j--
}
A[j+1] = key
trace(A, N)
}
}
func trace(A [... | package main
import "fmt"
/*
Insertion Sort
*/
func main() {
var N int
fmt.Scan(&N)
A := make([]int, N)
for i := 0; i < N; i++ {
fmt.Scan(&A[i])
}
trace(A, N)
for i := 1; i < N; i++ {
key := A[i]
j := i - 1
for j >= 0 && A[j] > key {
A[j+1] = A[j]
j--
}
A[j+1] = key
trace(A, N)
}
}
f... | [["+", 0, 435, 8, 196, 0, 1, 0, 2, 63, 22], ["+", 8, 196, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 8, 196, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 8, 196, 0, 1, 0, 2, 3, 4, 0, 21], ["+", 8, 196, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 36, 36, 0, 434, 0, 435, 8, 196, 0, 165]] | 7 | 202 | 7 |
package main
import (
"bufio"
"fmt"
"os"
"strconv"
"strings"
)
func main() {
sc := bufio.NewScanner(os.Stdin)
N := 0
if sc.Scan() {
N, _ = strconv.Atoi(sc.Text())
}
A := make([]int, N)
if sc.Scan() {
for i, s := range strings.Fields(sc.Text()) {
A[i], _ = strconv.Atoi(s)
}
}
String(A)
insertion... | package main
import (
"bufio"
"fmt"
"os"
"strconv"
"strings"
)
func main() {
sc := bufio.NewScanner(os.Stdin)
N := 0
if sc.Scan() {
N, _ = strconv.Atoi(sc.Text())
}
A := make([]int, N)
if sc.Scan() {
for i, s := range strings.Fields(sc.Text()) {
A[i], _ = strconv.Atoi(s)
}
}
fmt.Println(String(A... | [["+", 8, 196, 0, 1, 0, 2, 63, 438, 439, 22], ["+", 8, 196, 0, 1, 0, 2, 63, 438, 0, 131], ["+", 8, 196, 0, 1, 0, 2, 63, 438, 119, 120], ["+", 8, 196, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 0, 2, 3, 4, 0, 2, 3, 4, 0, 25]] | 7 | 278 | 5 |
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using VI = vector<int>;
using PI = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n - 1; i++) {
int v = a[i];
int j = i - 1;
while (j >= 0 &... | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
using VI = vector<int>;
using PI = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
int v = a[i];
int j = i - 1;
while (j >= 0 && a[... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 1 | 190 | 2 |
#include <iostream>
#include <vector>
using namespace std;
void printVector(const vector<int> &A) {
for (int i = 0; i < A.size(); i++) {
cout << A[i];
if (i + 1 < A.size())
cout << ' ';
}
cout << endl;
}
int main() {
int n;
cin >> n;
vector<int> A(n);
for (int i = 0; i < n; i++)
cin... | #include <iostream>
#include <vector>
using namespace std;
void printVector(const vector<int> &A) {
for (int i = 0; i < A.size(); i++) {
cout << A[i];
if (i + 1 < A.size())
cout << ' ';
}
cout << endl;
}
int main() {
int n;
cin >> n;
vector<int> A(n);
for (int i = 0; i < n; i++)
cin... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["-", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["-", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 1 | 195 | 7 |
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
//#include <vector>
using namespace std;
int main(void) {
int n, a[100];
cin >> n;
for (int i = 0; i <... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <sstream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
//#include <vector>
using namespace std;
int main(void) {
int n, a[100];
cin >> n;
for (int i = 0; i <... | [["+", 0, 7, 8, 9, 0, 1, 0, 16, 17, 151], ["+", 8, 9, 0, 1, 0, 16, 12, 5, 0, 62], ["+", 8, 9, 0, 1, 0, 16, 12, 5, 0, 6]] | 1 | 265 | 4 |
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 1; i < n; i++) {
for (int i = 0; i < n - 1; i++)
cout << a[i] << " ";
cout << a[n - 1] << endl;
int v = a[i];
int j = i - 1;
while ((j >= 0) ... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 1; i < n; i++) {
for (int i = 0; i < n - 1; i++)
cout << a[i] << " ";
cout << a[n - 1] << endl;
int v = a[i];
int j = i - 1;
while ((j >= 0) ... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 1 | 197 | 2 |
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <list>
#include <map>
#include <vector>
using namespace std;
void trace(vector<int> v) {
for (int i = 0; i < v.size(); i++) {
if (i != 0) {
cout << " ";
}
cout << v[i];
}
cout << endl;
}
vo... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <list>
#include <map>
#include <vector>
using namespace std;
void trace(vector<int> v) {
for (int i = 0; i < v.size(); i++) {
if (i != 0) {
cout << " ";
}
cout << v[i];
}
cout << endl;
}
vo... | [["-", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22]] | 1 | 229 | 4 |
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 1; i < n; i++) {
int v = a[i];
int j = i - 1;
while (j >= 0 && v < a[j]) {
a[j + 1] = a[j];
j--;
}
a[j + 1] = v;
for (int k = 0; k < n ... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++) {
int v = a[i];
int j = i - 1;
while (j >= 0 && v < a[j]) {
a[j + 1] = a[j];
j--;
}
a[j + 1] = v;
for (int k = 0; k < n ... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 31, 16, 12, 69, 341, 342, 0, 16, 17, 33], ["+", 31, 16, 12, 69, 341, 342, 0, 16, 12, 13]] | 1 | 152 | 4 |
#include <stdio.h>
#include <stdlib.h>
void insertionSort(int *data, int size) {
int i;
int j;
int key;
for (i = 1; i < size; ++i) {
key = data[i];
j = i - 1;
while ((j >= 0) && (data[j] > key)) {
data[j + 1] = data[j];
--j;
}
data[j + 1] = key;
for (j = 0; j < size - 1; ++... | #include <stdio.h>
#include <stdlib.h>
void insertionSort(int *data, int size) {
int i;
int j;
int key;
for (i = 1; i < size; ++i) {
key = data[i];
j = i - 1;
while ((j >= 0) && (data[j] > key)) {
data[j + 1] = data[j];
--j;
}
data[j + 1] = key;
for (j = 0; j < size - 1; ++... | [["+", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["+", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 0 | 263 | 2 |
#include <stdio.h>
int main() {
int N, A[100], i, j, k, v;
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
for (i = 0; i < N; i++) {
v = A[i];
j = i - 1;
while (j >= 0 && A[j] > v) {
A[j + 1] = A[j];
j--;
A[j + 1] = v;
}
for (k = 0; k < N; k++) {... | #include <stdio.h>
int main() {
int N, A[100], i, j, k, v;
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
for (i = 0; i < N; i++) {
v = A[i];
j = i - 1;
while (j >= 0 && A[j] > v) {
A[j + 1] = A[j];
j--;
A[j + 1] = v;
}
for (k = 0; k < N; k++) {... | [["-", 15, 23, 0, 16, 12, 16, 12, 16, 17, 33], ["-", 15, 23, 0, 16, 12, 16, 12, 16, 12, 13]] | 0 | 187 | 2 |
#include <stdio.h>
static const int N = 1000;
void trace(int A[], int n) {
int i;
for (i = 1; i <= n; i++) {
if (i > 1)
printf(" ");
printf("%d", A[i]);
}
printf("\n");
}
int main() {
int n, i, j;
int A[N + 1];
scanf("%d", &n);
for (i = 1; i <= n; i++)
scanf("%d", &A[i]);
trace... |
#include <stdio.h>
static const int N = 1000;
void trace(int A[], int n) {
int i;
for (i = 1; i <= n; i++) {
if (i > 1)
printf(" ");
printf("%d", A[i]);
}
printf("\n");
}
int main() {
int n, i, j;
int A[N + 1];
scanf("%d", &n);
for (i = 1; i <= n; i++)
scanf("%d", &A[i]);
trace... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13]] | 0 | 215 | 2 |
#include <stdio.h>
static inline void disp(short n, short *a) {
short i;
printf("%hd", a[0]);
for (i = 1; i < n; ++i)
printf("%hd ", a[i]);
printf("\n");
}
int main(void) {
short n, i, j;
short a[100], v;
scanf("%hd", &n);
for (i = 0; i < n; ++i)
scanf("%hd", a + i);
disp(n, a);
for (i ... | #include <stdio.h>
static inline void disp(short n, short *a) {
short i;
printf("%hd", a[0]);
for (i = 1; i < n; ++i)
printf(" %hd", a[i]);
printf("\n");
}
int main(void) {
short n, i, j;
short a[100], v;
scanf("%hd", &n);
for (i = 0; i < n; ++i)
scanf("%hd", a + i);
disp(n, a);
for (i ... | [["-", 8, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 8, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 203 | 2 |
#include <stdio.h>
#define MAX 100
void insertionSort(int A[], int n) {
int i, j;
int x;
for (i = 1; i < n; i++) {
x = A[i];
j = i - 1;
while (j >= 0 && x < A[j]) {
A[j + 1] = A[j];
j--;
}
A[j + 1] = x;
for (j = 0; j < n - 1; j++)
printf("%d ", A[j]);
printf("%d\n"... | #include <stdio.h>
#define MAX 100
void insertionSort(int A[], int n) {
int i, j;
int x;
for (i = 0; i < n; i++) {
x = A[i];
j = i - 1;
while (j >= 0 && x < A[j]) {
A[j + 1] = A[j];
j--;
}
A[j + 1] = x;
for (j = 0; j < n - 1; j++)
printf("%d ", A[j]);
printf("%d\n"... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13]] | 0 | 200 | 2 |
#include "stdio.h"
int main() {
int N, a, A[1000];
scanf("%d", &N);
for (a = 0; a < N; a++)
scanf("%d\n", &A[a]);
for (a = 0; a < N - 1; a++)
printf("%d ", A[a]);
printf("%d\n", A[a - 1]);
int j;
for (int i = 1; i < N; i++) {
int v = A[i];
j = i - 1;
while (j >= 0 && A[j] > v) {
... |
#include "stdio.h"
int main() {
int N, a, A[1000];
scanf("%d", &N);
for (a = 0; a < N; a++)
scanf("%d\n", &A[a]);
for (a = 0; a < N - 1; a++)
printf("%d ", A[a]);
printf("%d\n", A[N - 1]);
int j;
for (int i = 1; i < N; i++) {
int v = A[i];
j = i - 1;
while (j >= 0 && A[j] > v) {
... | [["-", 0, 2, 3, 4, 0, 69, 71, 16, 31, 22], ["+", 0, 2, 3, 4, 0, 69, 71, 16, 31, 22]] | 0 | 216 | 2 |
#include <stdio.h>
int main(void) {
int a[1000];
int i, v, j, k, N;
scanf("%d", &N);
for (i = 0; i < N; i++)
scanf("%d", &a[i]);
for (k = 1; k < N; k++) {
if (k > 0)
printf(" ");
printf("%d", a[k]);
}
printf("\n");
for (i = 1; i < N; i++) {
v = a[i];
j = i - 1;
while (... | #include <stdio.h>
int main(void) {
int a[1000];
int i, v, j, k, N;
scanf("%d", &N);
for (i = 0; i < N; i++)
scanf("%d", &a[i]);
for (k = 0; k < N; k++) {
if (k > 0)
printf(" ");
printf("%d", a[k]);
}
printf("\n");
for (i = 1; i < N; i++) {
v = a[i];
j = i - 1;
while (... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["-", 0, 7, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 7, 8, 9, 0, 7, 10, 11, 12, 13], ["-", 8, 9, 0, 57, 15, 23, 0, 16, 31, 22], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 31, 22]] | 0 | 226 | 6 |
#include <stdio.h>
int main(void) {
int N, A[100], i, j, k, v;
scanf("%d", &N);
for (i = 0; i < N; i++)
scanf("%d", &A[i]);
for (i = 0; i <= N; i++) {
v = A[i];
j = i - 1;
while (j >= 0 && A[j] > v) {
A[j + 1] = A[j];
j--;
}
A[j + 1] = v;
for (k = 0; k < N; k++) {
... | #include <stdio.h>
int main(void) {
int N, A[100], i, j, k, v;
scanf("%d", &N);
for (i = 0; i < N; i++)
scanf("%d", &A[i]);
for (i = 0; i < N; i++) {
v = A[i];
j = i - 1;
while (j >= 0 && A[j] > v) {
A[j + 1] = A[j];
j--;
}
A[j + 1] = v;
for (k = 0; k < N; k++) {
... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18]] | 0 | 178 | 2 |
#include <stdio.h>
#define N 100
int a[N];
void PrintMatrix(int n) {
int i;
for (i = 0; i < n - 1; i++)
printf("%d ", a[i]);
printf("%d\n", a[n - 1]);
}
void Insertion(int n) {
int i, j, k, temp;
for (i = 1; i < n; i++) {
for (j = 0; j < i; j++) {
if (a[i] < a[j]) {
temp = a[i];
... | #include <stdio.h>
#define N 100
int a[N];
void PrintMatrix(int n) {
int i;
for (i = 0; i < n - 1; i++)
printf("%d ", a[i]);
printf("%d\n", a[n - 1]);
}
void Insertion(int n) {
int i, j, k, temp;
for (i = 1; i < n; i++) {
for (j = 0; j < i; j++) {
if (a[i] < a[j]) {
temp = a[i];
... | [["+", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 8, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35]] | 0 | 225 | 5 |
#include <stdio.h>
int main(void) {
int N, i, j, k, v;
scanf("%d", &N);
int A[N];
for (i = 0; i < N; i++)
scanf("%d", &A[i]);
for (i = 0; i < N - 1; i++)
printf("%d ", A[i]);
printf("%d\n", A[N - 1]);
for (i = 1; i < N - 1; i++) {
v = A[i];
j = i - 1;
while (j >= 0 && A[j] > v) {
... | #include <stdio.h>
int main(void) {
int N, i, j, k, v;
scanf("%d", &N);
int A[N];
for (i = 0; i < N; i++)
scanf("%d", &A[i]);
for (i = 0; i < N - 1; i++)
printf("%d ", A[i]);
printf("%d\n", A[N - 1]);
for (i = 1; i < N; i++) {
v = A[i];
j = i - 1;
while (j >= 0 && A[j] > v) {
... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 0 | 218 | 2 |
#include <stdio.h>
int main(void) {
int n, i, j, v;
int A[100];
/*???°?????\???*/
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
/**/
for (i = 1; i < n; i++) {
v = A[i];
j = i - 1;
while (j >= 0 && A[j] > v) {
A[j + 1] = A[j];
j--;
}
A[j + 1] = ... |
#include <stdio.h>
int main(void) {
int n, i, j, v;
int A[100];
/*???°?????\???*/
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
/**/
for (i = 0; i < n; i++) {
v = A[i];
j = i - 1;
while (j >= 0 && A[j] > v) {
A[j + 1] = A[j];
j--;
}
A[j + 1] = ... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13]] | 0 | 183 | 2 |
#include <stdio.h>
void output_array(int *array, int num) {
int i;
for (i = 0; i < num - 1; i++) {
printf("%d ", array[i]);
}
printf("%d\n", array[i]);
return;
}
int main(void) {
int N;
int array[100];
int i, j;
int tmp;
scanf("%d", &N);
/* if (N > 100)
{
return... |
#include <stdio.h>
void output_array(int *array, int num) {
int i;
for (i = 0; i < num - 1; i++) {
printf("%d ", array[i]);
}
printf("%d\n", array[i]);
return;
}
int main(void) {
int N;
int array[100];
int i, j;
int tmp;
scanf("%d", &N);
/* if (N > 100)
{
return... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 0 | 210 | 2 |
#include <stdio.h>
#define N 100
int main() {
int n, A[N + 1], k;
int i;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
for (k = 0; k < n; k++) {
if (k > 0)
printf(" ");
printf("%d", A[k]);
}
printf("\n");
int j, v;
for (i = 0; i < n; i++) {
v = A[i];
j... |
#include <stdio.h>
#define N 100
int main() {
int n, A[N + 1], k;
int i;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
for (k = 0; k < n; k++) {
if (k > 0)
printf(" ");
printf("%d", A[k]);
}
printf("\n");
int j, v;
for (i = 1; i < n; i++) {
v = A[i];
j... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13]] | 0 | 233 | 2 |
#include <stdio.h>
#define N 100
int main(void) {
int i, j, n, a[N], temp;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (i = 1; i < n; i++) {
temp = a[i];
for (j = i - 1; j >= 0 && a[j] > temp; j--)
a[j + 1] = a[j];
a[j + 1] = temp;
printf("%d", a[0]);
f... |
#include <stdio.h>
#define N 100
int main(void) {
int i, j, n, a[N], temp;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < n; i++) {
temp = a[i];
for (j = i - 1; j >= 0 && a[j] > temp; j--)
a[j + 1] = a[j];
a[j + 1] = temp;
printf("%d", a[0]);
f... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13]] | 0 | 176 | 2 |
#include <stdio.h>
int main() {
int a[100];
int n, i, j, v, k;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < n; i++) {
v = a[i];
j = i - 1;
while (j >= 0 && a[j] > v) {
a[j + 1] = a[j];
j--;
}
a[j + 1] = v;
for (k = 0; k < n; k++) {... | #include <stdio.h>
int main() {
int a[100];
int n, i, j, v, k;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < n; i++) {
v = a[i];
j = i - 1;
while (j >= 0 && a[j] > v) {
a[j + 1] = a[j];
j--;
}
a[j + 1] = v;
for (k = 0; k < n; k++) {... | [["-", 8, 9, 0, 57, 15, 23, 0, 11, 17, 32], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 60]] | 0 | 183 | 2 |
#include <stdio.h>
#include <stdlib.h>
#define MAX_DATA_NUM 100
static void Exchange_Void(int *pSortBuff, int insert, int key);
int main(void) {
int data_num; /* Data Num */
int cd; /* Count Data */
int key = 0; /* Compare Num */
int *pSortBuff;
int insert;
int loop;
pSortBuff = (int *)malloc(s... | #include <stdio.h>
#include <stdlib.h>
#define MAX_DATA_NUM 100
static void Exchange_Void(int *pSortBuff, int insert, int key);
int main(void) {
int data_num; /* Data Num */
int cd; /* Count Data */
int key = 0; /* Compare Num */
// int pSortBuff[MAX_DATA_NUM];
int *pSortBuff;
int in... | [["-", 3, 4, 0, 66, 28, 23, 0, 69, 71, 22], ["+", 3, 4, 0, 66, 28, 23, 0, 69, 71, 22], ["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 47]] | 0 | 315 | 4 |
#include <stdio.h>
int main(void) {
int i, j;
int n, a[100];
int v;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &a[i]);
for (i = 1; i < n; i++) {
v = a[i];
j = i - 1;
while (j >= 0 && a[j] > v) {
a[j + 1] = a[j];
j--;
}
a[j + 1] = v;
printf("%d", a[0]);
f... | #include <stdio.h>
int main(void) {
int i, j;
int n, a[100];
int v;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &a[i]);
for (i = 0; i < n; i++) {
v = a[i];
j = i - 1;
while (j >= 0 && a[j] > v) {
a[j + 1] = a[j];
j--;
}
a[j + 1] = v;
printf("%d", a[0]);
f... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13]] | 0 | 177 | 2 |
#include <stdio.h>
/* out function */
void trace(int A[], int N) {
int i;
for (i = 0; i < N; i++) {
if (i > 0)
printf(" "); // single space to separate elments
printf("%d", A[i]);
}
printf("\n");
}
/* insert sort (zero origin) */
void insertSort(int A[], int N) {
int j, i, v;
for (i = 1; i <... | #include <stdio.h>
/* out function */
void trace(int A[], int N) {
int i;
for (i = 0; i < N; i++) {
if (i > 0)
printf(" "); // single space to separate elments
printf("%d", A[i]);
}
printf("\n");
}
/* insert sort (zero origin) */
void insertSort(int A[], int N) {
int j, i, v;
for (i = 1; i <... | [["-", 0, 52, 15, 23, 0, 34, 31, 16, 17, 19], ["+", 0, 52, 15, 23, 0, 16, 31, 16, 17, 20], ["-", 8, 9, 0, 52, 15, 23, 0, 34, 0, 21], ["+", 8, 9, 0, 52, 15, 23, 0, 16, 17, 98]] | 0 | 235 | 4 |
/*16D8104007J 1-A 兼弘真帆 */
#include <stdio.h>
void insertionSort(int A[], int N);
int main() {
int N;
// printf("長さN:");
scanf("%d", &N);
int A[N];
int i;
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
insertionSort(A, N);
return 0;
}
void insertionSort(int A[], int N) {
int i, j, v, n;
f... | /*16D8104007J 1-A 兼弘真帆 */
#include <stdio.h>
void insertionSort(int A[], int N);
int main() {
int N;
// printf("長さN:");
scanf("%d", &N);
int A[N];
int i;
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
insertionSort(A, N);
return 0;
}
void insertionSort(int A[], int N) {
int i, j, v, n;
f... | [["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46], ["+", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 0 | 276 | 5 |
#include <stdio.h>
void insertionSort(int A[], int N) {
int i, v, j;
for (i = 1; i < N; i++) {
v = A[i];
j = i - 1;
while (j >= 0 && A[j] > v) {
A[j + 1] = A[j];
j--;
}
A[j + 1] = v;
for (i = 0; i < N - 1; i++) {
printf("%d ", A[i]);
}
printf("%d\n", A[N - 1]);
}... | #include <stdio.h>
void insertionSort(int A[], int N) {
int i, v, j;
for (i = 1; i < N; i++) {
v = A[i];
j = i - 1;
while (j >= 0 && A[j] > v) {
A[j + 1] = A[j];
j--;
}
A[j + 1] = v;
for (j = 0; j < N - 1; j++) {
printf("%d ", A[j]);
}
printf("%d\n", A[N - 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, 1, 0, 2, 3, 4, 0, 69, 71, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 69, 71... | 0 | 239 | 8 |
#include <stdio.h>
void insertionSort(int A[], int N) {
int i, v, j;
for (i = 1; i < N; i++) {
v = A[i];
j = i - 1;
while ((j >= 0) && (A[j] > v)) {
A[j + 1] = A[j];
j--;
A[j + 1] = v;
}
for (j = 0; j < N; j++) {
printf("%d", A[i]);
if (j != N - 1)
print... | #include <stdio.h>
void insertionSort(int A[], int N) {
int i, v, j;
for (i = 1; i < N; i++) {
v = A[i];
j = i - 1;
while ((j >= 0) && (A[j] > v)) {
A[j + 1] = A[j];
j--;
A[j + 1] = v;
}
for (j = 0; j < N; j++) {
printf("%d", A[j]);
if (j != N - 1)
print... | [["-", 0, 1, 0, 2, 3, 4, 0, 69, 71, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 69, 71, 22]] | 0 | 255 | 2 |
#include <stdio.h>
#define MAX 100
int N, A[MAX];
void print() {
int i;
for (i = 0; i < N; i++) {
if (i > 0)
printf(" ");
print("%d", A[i]);
}
printf("\n");
}
void sort() {
int j, i, val;
for (i = 1; i < N; i++) {
val = A[i];
j = i - 1;
while ((j >= 0) && (A[j] > val)) {
A... | #include <stdio.h>
#define MAX 100
int N, A[MAX];
void print() {
int i;
for (i = 0; i < N; i++) {
if (i > 0)
printf(" ");
printf("%d", A[i]);
}
printf("\n");
}
void sort() {
int j, i, val;
for (i = 1; i < N; i++) {
val = A[i];
j = i - 1;
while ((j >= 0) && (A[j] > val)) {
... | [["-", 0, 7, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 0, 7, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 45], ["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46]] | 0 | 216 | 4 |
#include <stdio.h>
#define MAX 101
void print(int n, int *A) {
int i;
for (i = 0; i < n - 1; i++)
printf("%d ", A[i]);
printf("%d\n", A[i]);
}
/*
void insertion_sort(int n,int *A){
int i,j,v;
for(i=0;i<n;i++){
v=A[i];
j=i-1;
while(j>=0 && A[j]>v){
A[j+1]=A[j];
j--;
}
A[j+1... | #include <stdio.h>
#define MAX 101
void print(int n, int *A) {
int i;
for (i = 0; i < n - 1; i++)
printf("%d ", A[i]);
printf("%d\n", A[i]);
}
void insertion_sort(int n, int *A) {
int i, j, v;
for (i = 0; i < n; i++) {
v = A[i];
j = i - 1;
while (j >= 0 && A[j] > v) {
A[j + 1] = A[j];
... | [["+", 8, 9, 0, 1, 0, 11, 12, 16, 17, 33], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 12, 13]] | 0 | 215 | 2 |
#include <stdio.h>
int main() {
int N, i, j, k, v;
int a[100];
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &a[i]);
}
for (i = 1; i <= N - 1; i++) {
for (k = 0; k < N; k++) {
printf("%d", a[k]);
if (k != N - 1)
printf(" ");
}
printf("\n");
v = a[i];
j = ... | #include <stdio.h>
int main() {
int N, i, j, k, v;
int a[100];
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &a[i]);
}
for (i = 1; i <= N - 1; i++) {
for (k = 0; k < N; k++) {
printf("%d", a[k]);
if (k != N - 1)
printf(" ");
}
printf("\n");
v = a[i];
j = ... | [["-", 0, 52, 15, 23, 0, 16, 12, 16, 17, 18], ["+", 0, 52, 15, 23, 0, 16, 12, 16, 17, 47], ["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["-", 0, 30, 0, 14, 8, 9, 0, 37, 0, 38], ["-", 0, 30, 0, 14, 8, 9, 0, 37, 0, 13]] | 0 | 233 | 5 |
#include <stdio.h>
#include <stdlib.h>
int main() {
int a, b;
int i = 0, j, k;
int *s;
scanf("%d", &a);
s = (int *)malloc(a * sizeof(int));
while (i < a) {
scanf("%d", &s[i]);
i++;
}
printf("%d", s[0]);
for (k = 1; k < a; k++) {
printf(" %d", s[k]);
}
printf("\n");
for (i = 1; i < a... | #include <stdio.h>
#include <stdlib.h>
int main() {
int a, b;
int i = 0, j, k;
int *s;
scanf("%d", &a);
s = (int *)malloc(a * sizeof(int));
while (i < a) {
scanf("%d", &s[i]);
i++;
}
printf("%d", s[0]);
for (k = 1; k < a; k++) {
printf(" %d", s[k]);
}
printf("\n");
for (i = 1; i < a... | [["-", 8, 9, 0, 52, 15, 23, 0, 16, 17, 106], ["+", 8, 9, 0, 52, 15, 23, 0, 16, 17, 98]] | 0 | 245 | 2 |
#include <stdio.h>
int main() {
int n;
int A[100];
int i, j, k;
int key;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
// printf("--------------\n");
for (i = 0; i < n; i++) {
if (i == n - 1)
printf("%d", A[i]);
else
printf("%d", A[i]);
}
printf("\n");
... | #include <stdio.h>
int main() {
int n;
int A[100];
int i, j, k;
int key;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
// printf("--------------\n");
for (i = 0; i < n; i++) {
if (i == n - 1)
printf("%d", A[i]);
else
printf("%d ", A[i]);
}
printf("\n");... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 248 | 2 |
#include <stdio.h>
#include <stdlib.h>
int main() {
int i = 0;
int j = 0;
int k = 0;
int N;
int *A, v;
scanf("%d", &N);
A = (int *)malloc(sizeof(int) * N);
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
printf("%d", A[0]);
for (k = 1; k < N; k++) {
printf(" %d", A[k]);
}
// N個の要素を含む... | #include <stdio.h>
#include <stdlib.h>
int main() {
int i = 0;
int j = 0;
int k = 0;
int N;
int *A, v;
scanf("%d", &N);
A = (int *)malloc(sizeof(int) * N);
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
printf("%d", A[0]);
for (k = 1; k < N; k++) {
printf(" %d", A[k]);
}
printf("\n")... | [["+", 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 | 244 | 7 |
#include <stdio.h>
int main() {
int i, j, v, N, n;
int A[1000];
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
for (n = 1; n < N - 1; n++) {
printf("%d ", A[n]);
}
printf("%d", A[N - 1]);
printf("\n");
for (i = 1; i <= N - 1; i++) {
v = A[i];
j = i - 1;
while (j... | #include <stdio.h>
int main() {
int i, j, v, N, n;
int A[1000];
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
for (n = 0; n < N - 1; n++) {
printf("%d ", A[n]);
}
printf("%d", A[N - 1]);
printf("\n");
for (i = 1; i <= N - 1; i++) {
v = A[i];
j = i - 1;
while (j... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["-", 0, 7, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 7, 8, 9, 0, 7, 10, 11, 12, 13]] | 0 | 232 | 4 |
#include <stdio.h>
#define N 100
int insertionSort(int *A, int n) {
int i, j, v, k;
for (i = 0; i < n; i++) {
if (i == n - 1)
printf("%d", A[i]);
printf("%d ", A[i]);
}
printf("\n");
for (i = 1; i < n; i++) {
v = A[i];
j = i - 1;
while (j >= 0 && A[j] > v) {
A[j + 1] = A[j]... | #include <stdio.h>
#define N 100
int insertionSort(int *A, int n) {
int i, j, v, k;
for (i = 0; i < n; i++) {
if (i == n - 1)
printf("%d", A[i]);
else
printf("%d ", A[i]);
}
printf("\n");
for (i = 1; i < n; i++) {
v = A[i];
j = i - 1;
while (j >= 0 && A[j] > v) {
A[j ... | [["+", 0, 7, 8, 9, 0, 57, 75, 76, 0, 95], ["-", 8, 9, 0, 57, 15, 23, 0, 16, 12, 13], ["+", 0, 57, 15, 23, 0, 16, 12, 16, 31, 22], ["+", 0, 57, 15, 23, 0, 16, 12, 16, 17, 33], ["+", 0, 57, 15, 23, 0, 16, 12, 16, 12, 13]] | 0 | 268 | 6 |
#include <stdio.h>
#define N 100
int main() {
int A[N] = {0};
int length, key;
int i = 0, j = 0;
scanf("%d", &length);
while (i < length) {
scanf("%d", &A[i]);
i++;
}
for (j = 0; j < length - 1; j++) {
printf("%d ", A[j]);
}
printf("%d\n", A[length - 1]);
for (i = 1; i < length - 1... | #include <stdio.h>
#define N 100
int main() {
int A[N] = {0};
int length, key;
int i = 0, j = 0;
scanf("%d", &length);
while (i < length) {
scanf("%d", &A[i]);
i++;
}
for (j = 0; j < length - 1; j++) {
printf("%d ", A[j]);
}
printf("%d\n", A[length - 1]);
for (i = 1; i < length; i+... | [["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 33], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13]] | 0 | 229 | 2 |
#include <stdio.h>
int main() {
int n;
scanf("%d", &n);
int A[n], v;
int i, j;
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
for (i = 0; i < n; i++) {
printf("%d", &A[i]);
if (i < n - 1)
printf(" ");
else
printf("\n");
}
for (i = 1; i < n; i++) {
v = A[i];
j ... | #include <stdio.h>
int main() {
int n;
scanf("%d", &n);
int A[100], v;
int i, j;
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
for (i = 0; i < n; i++) {
printf("%d", A[i]);
if (i < n - 1)
printf(" ");
else
printf("\n");
}
for (i = 1; i < n; i++) {
v = A[i];
j... | [["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 22], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["-", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67]] | 0 | 233 | 3 |
#include <stdio.h>
int main(void) {
int N;
int a[1000];
int i, j, key;
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &a[i]);
printf("%d", a[i]);
if (i < N - 1)
printf(" ");
}
printf("\n");
for (i = 1; i <= N - 1; i++) {
key = a[i];
j = i - 1;
while (a[i] > 0 &&... | #include <stdio.h>
int main(void) {
int N;
int a[1000];
int i, j, key;
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &a[i]);
printf("%d", a[i]);
if (i < N - 1)
printf(" ");
}
printf("\n");
for (i = 1; i <= N - 1; i++) {
key = a[i];
j = i - 1;
while (j >= 0 && a... | [["-", 15, 23, 0, 16, 31, 16, 31, 69, 28, 22], ["-", 15, 23, 0, 16, 31, 16, 31, 69, 0, 70], ["-", 15, 23, 0, 16, 31, 16, 31, 69, 71, 22], ["-", 15, 23, 0, 16, 31, 16, 31, 69, 0, 73], ["-", 0, 52, 15, 23, 0, 16, 31, 16, 17, 47], ["+", 0, 52, 15, 23, 0, 16, 31, 16, 31, 22], ["+", 0, 52, 15, 23, 0, 16, 31, 16, 17, 20]] | 0 | 221 | 7 |
#include <stdio.h>
int main() {
int n;
int a, b, i, j;
scanf("%d", &n);
int A[n];
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
for (j = 0; j < n; j++) {
if (j < 0)
printf(" ");
printf("%d", A[j]);
}
printf("\n");
for (i = 1; i < n; i++) {
a = A[i];
b = i - 1;
whi... | #include <stdio.h>
int main() {
int n;
int a, b, i, j;
scanf("%d", &n);
int A[n];
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
for (j = 0; j < n; j++) {
if (j > 0)
printf(" ");
printf("%d", A[j]);
}
printf("\n");
for (i = 1; i < n; i++) {
a = A[i];
b = i - 1;
whi... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 47], ["-", 8, 9, 0, 57, 15, 23, 0, 16, 31, 22], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 31, 22]] | 0 | 228 | 4 |
#include <stdio.h>
int A[1000];
int main() {
int i, j, v, N, a;
scanf("%d", &N); //数列の長さ//
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
for (i = 0; i < N; i++) {
for (a = 0; a < N - 1; a++) {
printf("%d ", A[a]);
}
printf("%d\n", A[N - 1]);
v = A[i];
j = i - 1;
while (j... | #include <stdio.h>
int A[1000];
int main() {
int i, j, v, N, a;
scanf("%d", &N); //数列の長さ//
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
for (i = 1; i < N; i++) {
for (a = 0; a < N - 1; a++) {
printf("%d ", A[a]);
}
printf("%d\n", A[N - 1]);
v = A[i];
j = i - 1;
while (j... | [["-", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 10, 11, 12, 13]] | 0 | 222 | 2 |
#include <stdio.h>
int main() {
int i, j, n, key, k, A[100];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
for (i = 0; i < n; i++) {
if (i > 0) {
printf(" ");
}
printf("%d", A[i]);
}
printf("\n");
for (i = 1; i < n; i++) {
key = A[i];
j = i - 1;
while... | #include <stdio.h>
int main() {
int i, j, n, key, k, A[100];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &A[i]);
}
for (i = 0; i < n; i++) {
if (i > 0)
printf(" ");
printf("%d", A[i]);
}
printf("\n");
for (i = 1; i < n; i++) {
key = A[i];
j = i - 1;
while (j >= ... | [["-", 0, 7, 8, 9, 0, 57, 64, 9, 0, 45], ["-", 0, 7, 8, 9, 0, 57, 64, 9, 0, 46], ["+", 0, 7, 8, 9, 0, 52, 8, 9, 0, 46], ["-", 0, 7, 8, 9, 0, 52, 8, 9, 0, 46]] | 0 | 230 | 6 |
#include <stdio.h>
int main() {
int N;
int A[1000];
int i, j, k, v;
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
for (i = 0; i < N - 1; i++) {
printf("%d ", A[i]);
}
printf("%d\n", A[N - 1]);
for (i = 1; i < N - 1; i++) {
v = A[i];
j = i - 1;
while (j >= 0 ... | #include <stdio.h>
int main() {
int N;
int A[1000];
int i, j, k, v;
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
for (i = 0; i < N - 1; i++) {
printf("%d ", A[i]);
}
printf("%d\n", A[N - 1]);
for (i = 1; i <= N - 1; i++) {
v = A[i];
j = i - 1;
while (j >= 0 ... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19]] | 0 | 224 | 2 |
#include <stdio.h>
#include <stdlib.h>
int main() {
int i, j, p, N, v;
int *A;
scanf("%d", &N);
A = (int *)malloc(N * sizeof(int));
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
for (i = 0; i < N; i++) {
if (i != N - 1) {
printf("%d", A[i]);
} else if (i == N - 1) {
printf("%d... | #include <stdio.h>
#include <stdlib.h>
int main() {
int i, j, p, N, v;
int *A;
scanf("%d", &N);
A = (int *)malloc(N * sizeof(int));
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
for (i = 0; i < N; i++) {
if (i != N - 1) {
printf("%d ", A[i]);
} else if (i == N - 1) {
printf("%... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 290 | 4 |
#include <stdio.h>
void trace(int A[], int N) {
int i;
for (i = 0; i < N; i++) {
if (i > 0)
printf("%d", A[i]);
}
printf("\n");
}
void insertionSort(int A[], int N) {
int j, i, v;
for (i = 1; i < N; i++) {
v = A[i];
j = i - 1;
while (j >= 0 && A[j] > v) {
A[j + 1] = A[j];
... | #include <stdio.h>
void trace(int A[], int N) {
int i;
for (i = 0; i < N; i++) {
if (i > 0)
printf(" ");
printf("%d", A[i]);
}
printf("\n");
}
void insertionSort(int A[], int N) {
int j, i, v;
for (i = 1; i < N; i++) {
v = A[i];
j = i - 1;
while (j >= 0 && A[j] > v) {
A[j +... | [["+", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 64, 1, 0, 2, 3, 4, 0, 5, 0, 62], ["+", 0, 57, 64, 1, 0, 2, 3, 4, 0, 25], ["+", 0, 7, 8, 9, 0, 57, 64, 1, 0, 35], ["+", 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 | 224 | 7 |
#include <stdio.h>
int main() {
int i, j, v, N, l = 0;
int A[1000];
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
for (i = 0; i < N - 1; i++) {
printf("%d ", A[i]);
}
printf("%d\n", A[i + 1]);
for (i = 1; i <= N - 1; i++) {
v = A[i];
j = i - 1;
while (j >= 0 &... | #include <stdio.h>
int main() {
int i, j, v, N, l = 0;
int A[1000];
scanf("%d", &N);
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
for (i = 0; i < N - 1; i++) {
printf("%d ", A[i]);
}
printf("%d\n", A[i]);
for (i = 1; i <= N - 1; i++) {
v = A[i];
j = i - 1;
while (j >= 0 && A[... | [["-", 0, 2, 3, 4, 0, 69, 71, 16, 17, 72], ["-", 0, 2, 3, 4, 0, 69, 71, 16, 12, 13]] | 0 | 225 | 4 |
#include <stdio.h>
void tra(int A[], int N);
void insertionSort(int A[], int N);
int main() {
int N, i, j;
int A[100];
scanf("%d", &N);
for (i = 0; i < N; i++)
scanf("%d", &A[i]);
tra(A, N);
insertionSort(A, N);
return 0;
}
void tra(int A[], int N) {
int i;
for (i = 0; i < N; i++) {
if (... | #include <stdio.h>
void tra(int A[], int N);
void insertionSort(int A[], int N);
int main() {
int N, i, j;
int A[100];
scanf("%d", &N);
for (i = 0; i < N; i++)
scanf("%d", &A[i]);
tra(A, N);
insertionSort(A, N);
return 0;
}
void tra(int A[], int N) {
int i;
for (i = 0; i < N; i++) {
if (... | [["+", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 256 | 1 |
#include <stdio.h>
int main() {
int i, j, s, t, N, A[1000];
scanf("%d", &N);
for (i = 0; N > i; i++) {
scanf("%d", &A[i]);
}
for (i = 1; N > i; i++) {
for (j = 0; j < N - 1; j++) {
printf("%d", A[j]);
}
printf("%d\n", A[N - 1]);
s = A[i];
t = i - 1;
while (t >= 0 && s < A... | #include <stdio.h>
int main() {
int i, j, s, t, N, A[1000];
scanf("%d", &N);
for (i = 0; N > i; i++) {
scanf("%d", &A[i]);
}
for (i = 1; N > i; i++) {
for (j = 0; j < N - 1; j++) {
printf("%d ", A[j]);
}
printf("%d\n", A[N - 1]);
s = A[i];
t = i - 1;
while (t >= 0 && s < ... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 220 | 4 |
#include <stdio.h>
void trace(int A[], int N) {
int i;
for (i = 0; i < N; i++) {
if (i > 0)
putchar(' ');
printf("%d", A[i]);
}
putchar('\n');
}
void insertionSort(int A[], int N) {
int j, i, v;
for (i = 1; i < N; i++) {
v = A[i];
j = i - 1;
while (j >= 0 && A[j] > v) {
A[j... | #include <stdio.h>
void trace(int A[], int N) {
int i;
for (i = 0; i < N; i++) {
if (i > 0)
printf(" ");
printf("%d", A[i]);
}
printf("\n");
}
void insertionSort(int A[], int N) {
int j, i, v;
for (i = 1; i < N; i++) {
v = A[i];
j = i - 1;
while (j >= 0 && A[j] > v) {
A[j +... | [["-", 8, 9, 0, 57, 64, 1, 0, 2, 63, 22], ["+", 8, 9, 0, 57, 64, 1, 0, 2, 63, 22], ["-", 64, 1, 0, 2, 3, 4, 0, 103, 0, 104], ["+", 64, 1, 0, 2, 3, 4, 0, 5, 0, 62], ["-", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 2, 63, 22], ["-", 0, 1, 0, 2, 3, 4, 0, 103, 0, 104], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 62... | 0 | 231 | 14 |
#include <stdio.h>
int A[101];
int N, v, j;
int main(void) {
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
for (int i = 1; i < N; i++) {
v = A[i];
j = i - 1;
while (j >= 0 && A[j] > v) {
A[j + 1] = A[j];
j--;
A[j + 1] = v;
}
for (int i = 0; i ... | #include <stdio.h>
int A[10001];
int N, v, j;
int main(void) {
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%d", &A[i]);
}
for (int i = 0; i < N; i++) {
v = A[i];
j = i - 1;
while (j >= 0 && A[j] > v) {
A[j + 1] = A[j];
j--;
A[j + 1] = v;
}
for (int i = 0; ... | [["-", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 80, 81, 13], ["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13]] | 0 | 184 | 4 |
#include <stdio.h>
main() {
int i, j, k, n, key, length[100];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &length[i]);
}
for (i = 0; i < n; i++) {
if (i < n - 1) {
printf("%d ", length[i]);
} else {
printf("%d", length[i]);
}
}
for (i = 1; i < n; i++) {
key... | #include <stdio.h>
main() {
int i, j, k, n, key, length[100];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%d", &length[i]);
}
for (i = 0; i < n; i++) {
if (i < n - 1) {
printf("%d ", length[i]);
} else {
printf("%d\n", length[i]);
}
}
for (i = 1; i < n; i++) {
k... | [["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]] | 0 | 246 | 1 |
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using int_vec = vector<int>;
int_vec kmp_table(const string &p) {
auto m = p.size();
int_vec A(m + 1);
A[0] = -1;
int j = -1;
for (int i = 0; i < m; ++i) {
while (j >= 0 && p[i] != p[j])
j = A[j];
j++;
A[i + 1] =... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
using int_vec = vector<int>;
int_vec kmp_table(const string &p) {
auto m = p.size();
int_vec A(m + 1);
A[0] = -1;
int j = -1;
for (int i = 0; i < m; ++i) {
while (j >= 0 && p[i] != p[j])
j = A[j];
j++;
A[i + 1] =... | [["-", 64, 9, 0, 43, 49, 50, 51, 16, 17, 72], ["-", 64, 9, 0, 43, 49, 50, 51, 16, 12, 13]] | 1 | 250 | 2 |
def kmpTable(w):
lw = len(w)
nx = [-1] * (lw + 1)
j = -1
for i in xrange(lw):
while j >= 0 and w[i] != w[j]:
j = nx[j]
j += 1
nx[i + 1] = j
return nx
def kmpSearch(s, w):
ls = len(s)
start = 0
w_idx = 0
ret = []
nx = kmpTable(w)
while sta... | def kmpTable(w):
lw = len(w)
nx = [-1] * (lw + 1)
j = -1
for i in range(lw):
while j >= 0 and w[i] != w[j]:
j = nx[j]
j += 1
nx[i + 1] = j
return nx
def kmpSearch(s, w):
ls = len(s)
start = 0
w_idx = 0
ret = []
nx = kmpTable(w)
while start ... | [["-", 0, 14, 8, 196, 0, 7, 12, 652, 63, 22], ["+", 0, 14, 8, 196, 0, 7, 12, 652, 63, 22]] | 5 | 210 | 18 |
#include <iostream>
using namespace std;
#define MOD 10000000000000007LL
long long dp[1001][1001];
long long x[1001][1001];
long long y[1001][1001];
long long z[1001];
long long H, W, N, M;
long long modpow[1001];
int main() {
modpow[0] = 1;
for (int i = 1; i <= 1000; i++) {
modpow[i] = modpow[i - 1] * 256;
... | #include <iostream>
using namespace std;
#define MOD 100000000000007LL
long long dp[1001][1001];
long long x[1001][1001];
long long y[1001][1001];
long long z[1001];
long long H, W, N, M;
long long modpow[1001];
int main() {
modpow[0] = 1;
for (int i = 1; i <= 1000; i++) {
modpow[i] = modpow[i - 1] * 256;
m... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59]] | 1 | 529 | 2 |
#include <iostream>
using namespace std;
#include <stdio.h>
#include <string>
#define A 1355471101 // large prime number 1.
#define B 1466700101 // large prime number 2.
#define M 1522101101 // large prime number 3, larger than A and B.
int main() {
int i, j, H, W, R, C;
string *T;
scanf("%d %d", &H, &W);
T ... | #include <iostream>
using namespace std;
#include <stdio.h>
#include <string>
#define A 1355471101 // large prime number 1.
#define B 1466700101 // large prime number 2.
#define M 1522101101 // large prime number 3, larger than A and B.
int main() {
int i, j, H, W, R, C;
string *T;
scanf("%d %d", &H, &W);
T ... | [["-", 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], ["-", 12, 16, 31, 23, 0, 16, 31, 16, 12, 22], ["+", 12, 16, 31, 23, 0, 16, 31, 16, 12, 22]] | 1 | 714 | 12 |
#include <bits/stdc++.h>
#define base 950527
#define base2 1777771
using namespace std;
typedef unsigned long long ll;
typedef pair<int, int> P;
ll A[1001][1001];
string a[1001], b[1001];
int main() {
int W, H, w, h;
cin >> H >> W;
for (int i = 0; i < H; i++)
cin >> a[i];
cin >> h >> w;
for (int i = 0; i... | #include <bits/stdc++.h>
#define base 950527
#define base2 1777771
using namespace std;
typedef unsigned long long ll;
typedef pair<int, int> P;
ll A[1001][1001];
string a[1001], b[1001];
int main() {
int W, H, w, h;
cin >> H >> W;
for (int i = 0; i < H; i++)
cin >> a[i];
cin >> h >> w;
for (int i = 0; i... | [["+", 0, 7, 10, 43, 49, 50, 51, 16, 17, 33], ["+", 0, 7, 10, 43, 49, 50, 51, 16, 12, 13]] | 1 | 447 | 28 |
package main
import "fmt"
func printSlice(src []int) {
for i, v := range src {
if i == len(src)-1 {
fmt.Printf("%d\n", v)
} else {
fmt.Printf("%d ", v)
}
}
}
func insertionSort(src []int, len int) []int {
for i := 1; i < len-1; i++ {
v := src[i]
j := i - 1
for j >= 0 && src[j] > v {
src[j+1] ... | package main
import "fmt"
func printSlice(src []int) {
for i, v := range src {
if i == len(src)-1 {
fmt.Printf("%d\n", v)
} else {
fmt.Printf("%d ", v)
}
}
}
func insertionSort(src []int, len int) []int {
for i := 1; i < len; i++ {
v := src[i]
j := i - 1
for j >= 0 && src[j] > v {
src[j+1] = ... | [["-", 0, 7, 0, 430, 15, 16, 12, 16, 17, 33], ["-", 0, 7, 0, 430, 15, 16, 12, 16, 12, 433], ["-", 0, 436, 12, 432, 0, 2, 3, 4, 0, 25], ["-", 36, 36, 0, 434, 0, 435, 8, 196, 0, 165], ["-", 0, 435, 8, 196, 0, 1, 0, 2, 63, 22], ["-", 8, 196, 0, 1, 0, 2, 3, 4, 0, 24], ["-", 8, 196, 0, 1, 0, 2, 3, 4, 0, 22]] | 7 | 231 | 7 |
var input = require('fs').readFileSync('/dev/stdin', 'utf8');
var arr = input.split(" ").map(Number);
var a = arr[0];
var b = arr[1];
if (x === y) {
console.log(x);
return;
}
var x = Math.max(a, b);
var y = Math.min(a, b);
var c = x % y;
if (c === 0) {
console.log(y);
return;
}
for (var i = c; i >= 1; i--) {
... | var input = require('fs').readFileSync('/dev/stdin', 'utf8');
var arr = input.split(" ").map(Number);
var a = arr[0];
var b = arr[1];
if (a === b) {
console.log(a);
return;
}
var x = Math.max(a, b);
var y = Math.min(a, b);
var c = x % y;
if (c === 0) {
console.log(y);
return;
}
for (var i = c; i >= 1; i--) {
... | [["-", 0, 493, 0, 57, 15, 23, 0, 16, 31, 22], ["+", 0, 493, 0, 57, 15, 23, 0, 16, 31, 22], ["-", 0, 493, 0, 57, 15, 23, 0, 16, 12, 22], ["+", 0, 493, 0, 57, 15, 23, 0, 16, 12, 22], ["-", 64, 556, 0, 1, 0, 2, 3, 3, 0, 22], ["+", 64, 556, 0, 1, 0, 2, 3, 3, 0, 22]] | 2 | 158 | 6 |
<?php
list($A,$B)=explode(' ',trim(fgets(STDIN)),2);
if($A<$B) list($A,$B)=[$B,$A];
while($B) list($A,$B)=[$B,$A%$B];
print $B; | <?php
list($A,$B)=explode(' ',trim(fgets(STDIN)),2);
if($A<$B) list($A,$B)=[$B,$A];
while($B) list($A,$B)=[$B,$A%$B];
print $A;
?> | [["-", 0, 493, 0, 1, 0, 619, 0, 606, 0, 141], ["+", 0, 493, 0, 1, 0, 619, 0, 606, 0, 141], ["+", 36, 36, 36, 36, 36, 36, 0, 493, 0, 611]] | 6 | 81 | 3 |
<?php
fscanf(STDIN,'%d %d',$x,$y);
if($x < $y)
{
$z = $x;
$x = $y;
$y = $z;
}
while($y < 0)
{
$r = $x % $y;
$x = $y;
$y = $r;
}
echo $x . "\n"; | <?php
fscanf(STDIN,'%d %d',$x,$y);
if($x < $y)
{
$z = $x;
$x = $y;
$y = $z;
}
while($y > 0)
{
$r = $x % $y;
$x = $y;
$y = $r;
}
echo $x . "\n"; | [["-", 0, 493, 0, 52, 15, 23, 0, 16, 17, 18], ["+", 0, 493, 0, 52, 15, 23, 0, 16, 17, 47]] | 6 | 82 | 2 |
import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args)
throws NumberFormatException, IOException {
BufferedRea... | import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args)
throws NumberFormatException, IOException {
BufferedRea... | [["-", 8, 196, 0, 52, 15, 15, 0, 16, 17, 60], ["+", 0, 52, 15, 15, 0, 16, 31, 16, 17, 109], ["+", 8, 196, 0, 52, 15, 15, 0, 16, 17, 79], ["+", 8, 196, 0, 52, 15, 15, 0, 16, 12, 499], ["-", 8, 498, 0, 195, 8, 196, 0, 37, 0, 22], ["+", 8, 498, 0, 195, 8, 196, 0, 37, 0, 22]] | 3 | 196 | 6 |
import static java.lang.Math.*;
import static java.util.Arrays.*;
import static java.util.Collections.*;
import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) {
// TODO ?????????????????????????????????????????????
int a, b, c;
Scanner scan = new Scanner(Syste... | import static java.lang.Math.*;
import static java.util.Arrays.*;
import static java.util.Collections.*;
import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) {
// TODO ?????????????????????????????????????????????
int a, b, c;
Scanner scan = new Scanner(Syste... | [["+", 8, 196, 0, 52, 8, 196, 0, 57, 0, 95]] | 3 | 153 | 1 |
import java.io.BufferedReader;
import java.io.InputStreamReader;
public class Main {
static void gcd(int a, int b) {
int x = Math.max(a, b);
int y = Math.min(a, b);
int t = 0;
while (x % y > 1) {
t = x;
x = y;
y = t % y;
}
System.out.println(y);
}
public static void main... | import java.io.BufferedReader;
import java.io.InputStreamReader;
public class Main {
static void gcd(int a, int b) {
int x = Math.max(a, b);
int y = Math.min(a, b);
int t = 0;
while (y > 0) {
t = x;
x = y;
y = t % y;
}
System.out.println(x);
}
public static void main(Str... | [["-", 0, 52, 15, 15, 0, 16, 31, 16, 31, 22], ["-", 0, 52, 15, 15, 0, 16, 31, 16, 17, 109], ["-", 8, 196, 0, 52, 15, 15, 0, 16, 12, 499], ["+", 8, 196, 0, 52, 15, 15, 0, 16, 12, 499], ["-", 8, 196, 0, 1, 0, 492, 3, 4, 0, 22], ["+", 8, 196, 0, 1, 0, 492, 3, 4, 0, 22]] | 3 | 178 | 6 |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String[] strArray = br.readLine().split(" ");
int a = Int... | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String[] strArray = br.readLine().split(" ");
int a = Int... | [["-", 75, 37, 0, 492, 3, 4, 0, 16, 31, 22], ["-", 75, 37, 0, 492, 3, 4, 0, 16, 17, 109], ["+", 75, 37, 0, 492, 3, 4, 0, 16, 31, 22], ["+", 75, 37, 0, 492, 3, 4, 0, 16, 17, 109]] | 3 | 192 | 4 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long a, b;
a = sc.nextLong();
b = sc.nextLong();
long tmp = 0;
if (a < b) {
tmp = a;
a = b;
b = a;
}
while (a % b != 0) {
tmp = a;
... |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long a, b;
a = sc.nextLong();
b = sc.nextLong();
long tmp = 0;
if (a < b) {
tmp = a;
a = b;
b = tmp;
}
while (a % b != 0) {
tmp = a;
... | [["-", 0, 57, 64, 196, 0, 1, 0, 11, 12, 22], ["+", 0, 57, 64, 196, 0, 1, 0, 11, 12, 22]] | 3 | 114 | 2 |
import java.io.IOException;
import java.util.Scanner;
class Main {
public static void main(String[] args)
throws NumberFormatException, IOException {
// System.out.println(" ");
Scanner scan = new Scanner(System.in);
int x = scan.nextInt();
int y = scan.nextInt();
int jy = -1;
int keisa... | import java.io.IOException;
import java.util.Scanner;
class Main {
public static void main(String[] args)
throws NumberFormatException, IOException {
// System.out.println(" ");
Scanner scan = new Scanner(System.in);
int x = scan.nextInt();
int y = scan.nextInt();
int jy = -1;
int keisa... | [["-", 0, 57, 64, 196, 0, 1, 0, 11, 31, 22], ["-", 0, 57, 64, 196, 0, 1, 0, 11, 17, 32], ["+", 0, 57, 64, 196, 0, 1, 0, 11, 17, 32], ["+", 0, 57, 64, 196, 0, 1, 0, 11, 12, 22]] | 3 | 126 | 4 |
import java.util.Scanner;
/**
* @author kawakami
*
*/
class Main {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
StringBuilder sb = new StringBuilder();
Scanner as = new Scanner(System.in);
int x, y, ama;
int i = 0;
int big = 0;
... | import java.util.Scanner;
/**
* @author kawakami
*
*/
class Main {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
StringBuilder sb = new StringBuilder();
Scanner as = new Scanner(System.in);
int x, y, ama;
int i = 0;
int big = 0;
... | [["-", 8, 196, 0, 57, 15, 15, 0, 16, 17, 79], ["+", 8, 196, 0, 57, 15, 15, 0, 16, 17, 60], ["-", 0, 57, 64, 196, 0, 1, 0, 11, 12, 22], ["+", 0, 57, 64, 196, 0, 1, 0, 11, 12, 22], ["-", 0, 57, 75, 196, 0, 7, 502, 11, 12, 22], ["+", 0, 57, 75, 196, 0, 7, 502, 11, 12, 22]] | 3 | 222 | 6 |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Scanner;
class Main {
public static void main(String[] args) throws Exception {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
Scanner scanner = new Scanner(System.in);
int a = scanner.nextInt();
... | import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Scanner;
class Main {
public static void main(String[] args) throws Exception {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
Scanner scanner = new Scanner(System.in);
int a = scanner.nextInt();
... | [["+", 8, 498, 0, 195, 8, 196, 0, 57, 0, 95], ["+", 0, 195, 8, 196, 0, 57, 75, 196, 0, 45], ["+", 0, 195, 8, 196, 0, 57, 75, 196, 0, 46]] | 3 | 158 | 3 |
import java.io.*;
import java.util.*;
class Main {
public static void main(String[] args) { solve(); }
public static void solve() {
Scanner sc = new Scanner(System.in);
int x = sc.nextInt();
int y = sc.nextInt();
if (x < y) {
int tmp = x;
x = y;
y = x;
}
while (true) {
... |
import java.io.*;
import java.util.*;
class Main {
public static void main(String[] args) { solve(); }
public static void solve() {
Scanner sc = new Scanner(System.in);
int x = sc.nextInt();
int y = sc.nextInt();
if (x < y) {
int tmp = x;
x = y;
y = tmp;
}
while (true) ... | [["-", 0, 57, 64, 196, 0, 1, 0, 11, 12, 22], ["+", 0, 57, 64, 196, 0, 1, 0, 11, 12, 22]] | 3 | 132 | 2 |
#include <stdio.h>
void swap(int *, int *);
int main(void) {
int x, y;
int t;
scanf("%d%d", &x, &y);
if (y > x) {
swap(&x, &y);
}
if (x > y) {
while (y > 0) {
t = x % y;
x = y;
y = t;
}
printf("%d\n", x);
}
return 0;
}
void swap(int *x, int *y) {
int temp;
t... | #include <stdio.h>
void swap(int *, int *);
int main(void) {
int x, y;
int t;
scanf("%d%d", &x, &y);
if (y > x) {
swap(&x, &y);
}
if (x >= y) {
while (y > 0) {
t = x % y;
x = y;
y = t;
}
printf("%d\n", x);
}
return 0;
}
void swap(int *x, int *y) {
int temp;
... | [["-", 8, 9, 0, 57, 15, 23, 0, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 20]] | 0 | 132 | 2 |
#include <stdio.h>
int main() {
int a, b, c = 100;
scanf("%d%d", &a, &b);
if (a < b) {
c = a;
a = b;
b = a;
}
while (c != 0) {
c = a % b;
a = b;
b = c;
}
printf("%d\n", a);
return 0;
} |
#include <stdio.h>
int main() {
int a, b, c = 100;
scanf("%d%d", &a, &b);
if (a < b) {
c = a;
a = b;
b = c;
}
while (c != 0) {
c = a % b;
a = b;
b = c;
}
printf("%d\n", a);
return 0;
} | [["-", 0, 57, 64, 9, 0, 1, 0, 11, 12, 22], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 12, 22]] | 0 | 85 | 2 |
#include <stdio.h>
main() {
int a, b, n;
scanf("%d %d", &a, &b);
if (a < b) {
n = a;
a = b;
b = a;
}
while (b > 0) {
n = a % b;
a = b;
b = n;
}
printf("%d\n", a);
return 0;
} | #include <stdio.h>
main() {
int a, b, n;
scanf("%d %d", &a, &b);
if (a < b) {
n = a;
a = b;
b = n;
}
while (b > 0) {
n = a % b;
a = b;
b = n;
}
printf("%d\n", a);
return 0;
} | [["-", 0, 57, 64, 9, 0, 1, 0, 11, 12, 22], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 12, 22]] | 0 | 83 | 2 |
#include <math.h>
#include <stdio.h>
int gcd(int x, int y) {
if (x < y) {
int temp = x;
y = x;
y = temp;
}
while (y > 0) {
int r = x % y;
x = y;
y = r;
}
return x;
}
int main() {
int x, y;
scanf("%d%d", &x, &y);
int ans = gcd(x, y);
printf("%d\n", ans);
return 0;
} | #include <math.h>
#include <stdio.h>
int gcd(int x, int y) {
if (x < y) {
int temp = x;
x = y;
y = temp;
}
while (y > 0) {
int r = x % y;
x = y;
y = r;
}
return x;
}
int main() {
int x, y;
scanf("%d%d", &x, &y);
int ans = gcd(x, y);
printf("%d\n", ans);
return 0;
} | [["-", 0, 57, 64, 9, 0, 1, 0, 11, 31, 22], ["-", 0, 57, 64, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 12, 22]] | 0 | 109 | 4 |
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
if (x < y) {
swap(x, y);
}
while (1) {
if (x % y == 0)
break;
y = x % y;
if (x < y) {
swap(x, y);
}
}
cout << y << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
if (x < y) {
swap(x, y);
}
while (1) {
if (x % y == 0)
break;
x = x % y;
if (x < y) {
swap(x, y);
}
}
cout << y << endl;
return 0;
}
| [["-", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22]] | 1 | 86 | 2 |
#include <algorithm>
#include <cstdio>
using namespace std;
int euclid(int a, int b) {
if (b > a) {
swap(a, b);
}
if (a % b == 0)
return b;
return euclid(a, a % b);
}
int main() {
int x, y;
int ans;
scanf("%d %d", &x, &y);
ans = euclid(x, y);
printf("%d\n", ans);
return 0;
}
| #include <algorithm>
#include <cstdio>
using namespace std;
int euclid(int a, int b) {
if (b > a) {
swap(a, b);
}
if (a % b == 0)
return b;
return euclid(b, a % b);
}
int main() {
int x, y;
int ans;
scanf("%d %d", &x, &y);
ans = euclid(x, y);
printf("%d\n", ans);
return 0;
}
| [["-", 8, 9, 0, 37, 0, 2, 3, 4, 0, 22], ["+", 8, 9, 0, 37, 0, 2, 3, 4, 0, 22]] | 1 | 104 | 2 |
#include <iostream>
using namespace std;
long euclidean(long n, long m) {
if (n == m)
return n;
if (n > m)
swap(n, m);
return euclidean(m % n, n);
}
int main() {
long n, m;
cin >> n >> m;
cout << euclidean(n, m) << endl;
}
| #include <iostream>
using namespace std;
long euclidean(long n, long m) {
if (n == m)
return m;
if (n > m)
swap(n, m);
return euclidean(m - n, n);
}
int main() {
long n, m;
cin >> n >> m;
cout << euclidean(n, m) << endl;
}
| [["-", 0, 14, 8, 9, 0, 57, 64, 37, 0, 22], ["+", 0, 14, 8, 9, 0, 57, 64, 37, 0, 22], ["-", 0, 37, 0, 2, 3, 4, 0, 16, 17, 109], ["+", 0, 37, 0, 2, 3, 4, 0, 16, 17, 33]] | 1 | 77 | 4 |
#include <cmath>
#include <iostream>
using namespace std;
int gcd(int a, int b) {
int n = (a < b) ? a : b;
if (a % n == 0 && b & n == 0) {
return n;
}
for (int i = n / 2; i > 0; --i) {
if (a % i == 0 && b % i == 0) {
return i;
}
}
}
int main(void) {
int a, b;
cin >> a >> b;
cout <<... | #include <cmath>
#include <iostream>
using namespace std;
int gcd(int a, int b) {
int n = (a < b) ? a : b;
if (a % n == 0 && b % n == 0) {
return n;
}
for (int i = n / 2; i > 0; --i) {
if (a % i == 0 && b % i == 0) {
return i;
}
}
}
int main(void) {
int a, b;
cin >> a >> b;
cout <<... | [["-", 0, 57, 15, 339, 51, 16, 12, 16, 17, 67], ["+", 15, 339, 51, 16, 12, 16, 31, 16, 17, 109]] | 1 | 120 | 2 |
#include <stdio.h>
int main() {
int x, y;
scanf("%d %d", &x, &y);
if (x == y)
printf("%d\n", x);
else {
int z, Z, n, k;
if (x < y)
z = x, Z = y;
else {
z = y, Z = x;
int r;
for (;;) {
r = Z % z;
if (r == 0)
break;
Z = z;
z = r;
... | #include <stdio.h>
int main() {
int x, y;
scanf("%d %d", &x, &y);
if (x == y)
printf("%d\n", x);
else {
int z, Z, n, k;
if (x < y)
z = x, Z = y;
else
z = y, Z = x;
int r;
for (;;) {
r = Z % z;
if (r == 0)
break;
Z = z;
z = r;
}
printf(... | [["-", 0, 9, 0, 57, 75, 76, 0, 9, 0, 45], ["-", 0, 9, 0, 57, 75, 76, 0, 9, 0, 46]] | 1 | 124 | 2 |
#include <iostream>
using namespace std;
// x > y ??§??????x, y???GCD????±???????
int gcd(long int x, long int y) {
if (y == 0)
return x;
else
return gcd(x, x % y);
}
int main() {
long int x, y;
cin >> x >> y;
if (y > x)
swap(x, y);
cout << gcd(x, y) << endl;
} | #include <iostream>
using namespace std;
// x > y ??§??????x, y???GCD????±???????
int gcd(long int x, long int y) {
if (y == 0)
return x;
else
return gcd(y, x % y);
}
int main() {
long int x, y;
cin >> x >> y;
if (y > x)
swap(x, y);
cout << gcd(x, y) << endl;
} | [["-", 75, 76, 0, 37, 0, 2, 3, 4, 0, 22], ["+", 75, 76, 0, 37, 0, 2, 3, 4, 0, 22]] | 1 | 82 | 2 |
#include <stdio.h>
int main() {
int a, b, c;
scanf("%d %d", &a, &b);
if (a < b) {
c = a;
a = b;
b = c;
}
while (b) {
c = b;
b = a % b;
}
printf("%d\n", a);
return 0;
} | #include <stdio.h>
int main() {
int a, b, c;
scanf("%d %d", &a, &b);
if (a < b) {
c = a;
a = b;
b = c;
}
while (b) {
c = b;
b = a % b;
a = c;
}
printf("%d\n", a);
return 0;
} | [["+", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 12, 22], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]] | 1 | 77 | 4 |
#include <algorithm>
#include <iostream>
int main() {
long long a, b, c, d;
std::cin >> a >> b;
c = a, d = b;
if (a < b)
std::swap(a, b);
while (b != 0) {
int r = a % b;
a = b;
b = r;
}
std::cout << c * d / a << "\n";
return 0;
} | #include <algorithm>
#include <iostream>
int main() {
int a, b, c, d;
std::cin >> a >> b;
c = a, d = b;
if (a < b)
std::swap(a, b);
while (b != 0) {
int r = a % b;
a = b;
b = r;
}
std::cout << a << "\n";
return 0;
} | [["-", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["-", 0, 16, 31, 16, 12, 16, 31, 16, 31, 22], ["-", 0, 16, 31, 16, 12, 16, 31, 16, 17, 48], ["-", 0, 16, 31, 16, 12, 16, 31, 16, 12, 22], ["-", 0, 1, 0, 16, 31, 16, 12, 16, 17, 85]] | 1 | 91 | 7 |
#include <bits/stdc++.h>
using namespace std;
int sorts(int *x, int *y) {
if (*x < *y) {
int temp = *x;
*x = *y;
*y = temp;
}
}
int main() {
int x, y;
int ans;
cin >> x >> y;
while (x != y) {
sorts(&x, &y);
ans = x - y;
x = ans;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int sorts(int *x, int *y) {
if (*x < *y) {
int temp = *x;
*x = *y;
*y = temp;
}
}
int main() {
int x, y;
int ans;
cin >> x >> y;
while (x != y) {
sorts(&x, &y);
ans = x - y;
x = ans;
}
cout << x << endl;
} | [["-", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22]] | 1 | 99 | 2 |
n = int(input())
A = list(map(int,input().split()))
for i in range(1,len(A)):
print(*A)
key = A[i]
j = i - 1
while j >= 0 and A[j] > key :
A[j+1] = A[j]
j -= 1
A[j+1] = key
print(A) | n = int(input())
A = list(map(int,input().split()))
for i in range(1,len(A)):
print(*A)
key = A[i]
j = i - 1
while j >= 0 and A[j] > key :
A[j+1] = A[j]
j -= 1
A[j+1] = key
print(*A) | [["+", 0, 1, 0, 652, 3, 4, 0, 661, 0, 48]] | 5 | 92 | 1 |
import sys, re
def echo(A):
for i, a in enumerate(A):
if i < len(A) - 1:
sys.stdout('%d ' % a)
else:
sys.stdout('%d\n' % a)
def insertionSort(A, N):
echo(A)
for i in range(1, N):
v = A[i]
j = i - 1
while j >= 0 and A[j] > v:
A[j +... | import sys, re
def echo(A):
for i, a in enumerate(A):
if i < len(A) - 1:
sys.stdout.write('%d ' % a)
else:
sys.stdout.write('%d\n' % a)
def insertionSort(A, N):
echo(A)
for i in range(1, N):
v = A[i]
j = i - 1
while j >= 0 and A[j] > v:
... | [["+", 64, 196, 0, 1, 0, 652, 63, 319, 0, 131], ["+", 64, 196, 0, 1, 0, 652, 63, 319, 319, 22], ["+", 8, 196, 0, 1, 0, 652, 63, 319, 0, 131], ["+", 8, 196, 0, 1, 0, 652, 63, 319, 319, 22]] | 5 | 181 | 4 |
def insertionSort(N,A):
for i in range(0,N):
innum = A[i]
j = i - 1
while j>=0 and innum < A[j]:
A[j+1] = A[j]
j = j -1
A[j+1] = innum
for j in range(0,N):
if j < 5:
print(A[j], end=" ")
else:
pr... | def insertionSort(N,A):
for i in range(0,N):
innum = A[i]
j = i - 1
while j>=0 and innum < A[j]:
A[j+1] = A[j]
j = j -1
A[j+1] = innum
for j in range(0,N):
if j < N-1:
print(A[j], end=" ")
else:
... | [["-", 0, 7, 8, 196, 0, 57, 15, 666, 0, 612], ["+", 8, 196, 0, 57, 15, 666, 0, 657, 31, 22], ["+", 8, 196, 0, 57, 15, 666, 0, 657, 17, 33], ["+", 8, 196, 0, 57, 15, 666, 0, 657, 12, 612]] | 5 | 162 | 4 |
N = int(input())
A = (input()).split()
for i in range(0,N):
A[i] = int(A[i])
for i in range(0,N):
innum = A[i]
j = i - 1
while j>=0 and innum < A[j]:
A[j+1] = A[j]
j = j -1
A[j+1] = innum
for j in range(0,N):
if j < 5:
print(A[j], end=" ")
else:
... | N = int(input())
A = (input()).split()
for i in range(0,N):
A[i] = int(A[i])
for i in range(0,N):
innum = A[i]
j = i - 1
while j>=0 and innum < A[j]:
A[j+1] = A[j]
j = j -1
A[j+1] = innum
for j in range(0,N):
if j < N-1:
print(A[j], end=" ")
else:
... | [["-", 0, 7, 8, 196, 0, 57, 15, 666, 0, 612], ["+", 8, 196, 0, 57, 15, 666, 0, 657, 31, 22], ["+", 8, 196, 0, 57, 15, 666, 0, 657, 17, 33], ["+", 8, 196, 0, 57, 15, 666, 0, 657, 12, 612]] | 5 | 135 | 4 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.