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 |
|---|---|---|---|---|
#include <algorithm>
#include <cstdio>
#include <limits>
#include <vector>
int infty = std::numeric_limits<int>::max();
int main(void) {
int V, E, s, t, d;
scanf("%d %d", &V, &E);
std::vector<std::vector<int>> A;
A.resize(V);
for (int i = 0; i < V; i++) {
A[i].resize(V);
for (int j = 0; j < V; j++) ... | #include <algorithm>
#include <cstdio>
#include <limits>
#include <vector>
int infty = std::numeric_limits<int>::max();
int main(void) {
int V, E, s, t, d;
scanf("%d %d", &V, &E);
std::vector<std::vector<int>> A;
A.resize(V);
for (int i = 0; i < V; i++) {
A[i].resize(V);
for (int j = 0; j < V; j++) ... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22]] | 1 | 430 |
#include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
const long long int INF = 100100100100;
const int MOD = (int)1e9 + 7;
using ll = long long;
using namespace std;
typedef pair<int, int> P;
struct edge {
... | #include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
const long long int INF = 6000000000;
const int MOD = (int)1e9 + 7;
using ll = long long;
using namespace std;
typedef pair<int, int> P;
struct edge {
i... | [["-", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["+", 36, 36, 0, 30, 0, 43, 49, 50, 51, 13], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 421 |
//ワーシャルフロイド
#include <bits/stdc++.h>
using namespace std;
const int MAX = 100;
const long long INF = (1LL << 32);
int n;
long long dp[MAX][MAX];
void floyd() {
for (int k = 0; k < n; k++) {
for (int i = 0; i < n; i++) {
if (dp[i][k] == INF)
continue;
for (int j = 0; j < n; j++) {
i... | //ワーシャルフロイド
#include <bits/stdc++.h>
using namespace std;
const int MAX = 100;
const long long INF = (1LL << 32);
int n;
long long dp[MAX][MAX];
void floyd() {
for (int k = 0; k < n; k++) {
for (int i = 0; i < n; i++) {
if (dp[i][k] == INF)
continue;
for (int j = 0; j < n; j++) {
i... | [["-", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6], ["+", 0, 1, 0, 16, 31, 16, 12, 5, 0, 6]] | 1 | 401 |
#include <bits/stdc++.h>
using namespace std;
int n, m, s[10000], e[10000], w[10000];
long long d[150][150];
int main() {
cin >> n >> m;
long long inf = 1e18;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
d[i][j] = inf;
}
}
for (int i = 0; i < m; i++) {
cin >> s[i] >> e[i] >>... | #include <bits/stdc++.h>
using namespace std;
int n, m, s[10000], e[10000], w[10000];
long long d[150][150];
int main() {
cin >> n >> m;
long long inf = 1e18;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
d[i][j] = inf;
}
}
for (int i = 0; i < m; i++) {
cin >> s[i] >> e[i] >>... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 406 |
#include <iostream>
using namespace std;
long long b[102][102], v, e;
int main() {
cin >> v >> e;
for (int i = 1; i <= v; i++) {
for (int j = 1; j <= v; j++) {
if (i == j) {
b[i][j] = 0;
} else {
b[i][j] = 1e18;
}
}
}
for (int i = 0; i < e; i++) {
int x, y, z;
c... | #include <iostream>
using namespace std;
long long b[102][102], v, e;
int main() {
cin >> v >> e;
for (int i = 1; i <= v; i++) {
for (int j = 1; j <= v; j++) {
if (i == j) {
b[i][j] = 0;
} else {
b[i][j] = 1e18;
}
}
}
for (int i = 0; i < e; i++) {
int x, y, z;
c... | [["-", 64, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 64, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["-", 0, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["-", 0, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 0, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 0, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 373 |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll inf = 0x3f3f3f3f3f3f3f3f;
ll d[105][105];
int main() {
int v, e;
cin >> v >> e;
for (int i = 0; i < v; i++)
for (int j = 0; j < v; j++)
d[i][j] = inf;
for (int i = 0; i < e; i++) {
int a, b, w;
cin >> a >> b >> w;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll inf = 0x3f3f3f3f3f3f3f3f;
ll d[105][105];
int main() {
int v, e;
cin >> v >> e;
for (int i = 0; i < v; i++)
for (int j = 0; j < v; j++)
d[i][j] = inf;
for (int i = 0; i < e; i++) {
int a, b, w;
cin >> a >> b >> w;
... | [["+", 12, 23, 0, 41, 15, 16, 12, 16, 17, 85], ["+", 12, 23, 0, 41, 15, 16, 12, 16, 12, 13]] | 1 | 334 |
#include <iostream>
#include <vector>
using namespace std;
const long long INF = 1e18;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<vector<long long>> g(n, vector<long long>(n, INF));
for (int i = 0; i < n; i++) {
g[i][i] = 0ll;
}
for (int i = 0; i < m; i+... | #include <iostream>
#include <vector>
using namespace std;
const long long INF = 1e18;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<vector<long long>> g(n, vector<long long>(n, INF));
for (int i = 0; i < n; i++) {
g[i][i] = 0ll;
}
for (int i = 0; i < m; i+... | [["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13]] | 1 | 350 |
#include <bits/stdc++.h>
using namespace std;
int const MAX_E = 100;
int const INF = INT_MAX;
int edge[MAX_E][MAX_E];
int main() {
int V, E;
cin >> V >> E;
fill(edge[0], edge[MAX_E], INF);
for (int i = 0; i < V; i++)
edge[i][i] = 0;
for (int i = 0; i < E; i++) {
int s, t, d;
cin >> s >> t ... | #include <bits/stdc++.h>
using namespace std;
int const MAX_E = 100;
int const INF = INT_MAX;
int edge[MAX_E][MAX_E];
int main() {
int V, E;
cin >> V >> E;
fill(edge[0], edge[MAX_E], INF);
for (int i = 0; i < V; i++)
edge[i][i] = 0;
for (int i = 0; i < E; i++) {
int s, t, d;
cin >> s >> t ... | [["+", 0, 57, 64, 9, 0, 1, 0, 2, 63, 22], ["+", 64, 9, 0, 1, 0, 2, 3, 4, 0, 24], ["+", 64, 9, 0, 1, 0, 2, 3, 4, 0, 13], ["+", 64, 9, 0, 1, 0, 2, 3, 4, 0, 25], ["+", 8, 9, 0, 57, 64, 9, 0, 1, 0, 35]] | 1 | 347 |
class FordFulkerson:
"""Ford-Fulkerson Algorithm: find max-flow
complexity: O(FE) (F: max flow)
"""
def __init__(self, V, E, source, sink):
""" V: the number of vertexes
E: adjacency list
source: start point
sink: goal point
"""
self.V = V
... | class FordFulkerson:
"""Ford-Fulkerson Algorithm: find max-flow
complexity: O(FE) (F: max flow)
"""
def __init__(self, V, E, source, sink):
""" V: the number of vertexes
E: adjacency list
source: start point
sink: goal point
"""
self.V = V
... | [["-", 12, 658, 0, 659, 12, 652, 3, 4, 0, 22], ["+", 12, 658, 0, 659, 12, 652, 3, 4, 0, 22]] | 5 | 376 |
from collections import deque
class Dinic:
"""Dinic Algorithm: find max-flow
complexity: O(EV^2)
"""
class edge:
def __init__(self, to, cap, rev):
self.to, self.cap, self.rev = to, cap, rev
def __init__(self, V, E, source, sink):
""" V: the number of vertexes
... | from collections import deque
class Dinic:
"""Dinic Algorithm: find max-flow
complexity: O(EV^2)
"""
class edge:
def __init__(self, to, cap, rev):
self.to, self.cap, self.rev = to, cap, rev
def __init__(self, V, E, source, sink):
""" V: the number of vertexes
... | [["-", 0, 7, 12, 652, 3, 4, 0, 206, 206, 22], ["+", 0, 7, 12, 652, 3, 4, 0, 206, 206, 22], ["-", 8, 196, 0, 1, 0, 662, 31, 206, 206, 22], ["+", 8, 196, 0, 1, 0, 662, 31, 206, 206, 22], ["+", 64, 196, 0, 1, 0, 677, 31, 319, 0, 131], ["+", 64, 196, 0, 1, 0, 677, 31, 319, 319, 22]] | 5 | 584 |
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < ((int)b); ++i)
#define RFOR(i, a) for (int i = (a); i >= 0; --i)
#define FOE(i, a) for (auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define DUMP(x) cerr << #x << " = " << (x) << endl;
#define SUM(x) std::... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < ((int)b); ++i)
#define RFOR(i, a) for (int i = (a); i >= 0; --i)
#define FOE(i, a) for (auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define DUMP(x) cerr << #x << " = " << (x) << endl;
#define SUM(x) std::... | [["+", 64, 9, 0, 43, 49, 50, 51, 91, 17, 33]] | 1 | 2,776 |
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < ((int)b); ++i)
#define RFOR(i, a) for (int i = (a); i >= 0; --i)
#define FOE(i, a) for (auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define DUMP(x) cerr << #x << " = " << (x) << endl;
#define SUM(x) std::... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < ((int)b); ++i)
#define RFOR(i, a) for (int i = (a); i >= 0; --i)
#define FOE(i, a) for (auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define DUMP(x) cerr << #x << " = " << (x) << endl;
#define SUM(x) std::... | [["-", 0, 7, 8, 9, 0, 1, 0, 11, 17, 110], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 17, 107], ["-", 0, 7, 8, 9, 0, 1, 0, 11, 17, 107], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 17, 110]] | 1 | 1,473 |
#include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
static const int MAX_V = 110;
static const int INF = (1 << 30);
typedef pair<int, int> P;
struct edge {
int to, cap, cost, rev;
};
int V;
vector<edge> G[MAX_V];
int h[MAX_V], dist[MAX_V], prevv[MAX_V], preve[MAX_V];
... | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
static const int MAX_V = 110;
static const int INF = (1 << 30);
typedef pair<int, int> P;
struct edge {
int to, cap, cost, rev;
};
int V;
vector<edge> G[MAX_V];
int h[MAX_V], dist[MAX_V], prevv[MAX_V], preve[MAX_V];
... | [["-", 0, 52, 8, 9, 0, 7, 15, 16, 17, 18], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 17, 79]] | 1 | 684 |
#include <algorithm>
#include <queue>
#include <stdio.h>
#include <vector>
using namespace std;
namespace MCF {
const int MAXN = 120;
const int MAXM = 2100;
int to[MAXM];
int next[MAXM];
int first[MAXN];
int c[MAXM];
long long w[MAXM];
long long pot[MAXN];
int rev[MAXM];
long long ijk[MAXN];
int v[MAXN];
long long toc;... | #include <algorithm>
#include <queue>
#include <stdio.h>
#include <vector>
using namespace std;
namespace MCF {
const int MAXN = 120;
const int MAXM = 2100;
int to[MAXM];
int next[MAXM];
int first[MAXN];
int c[MAXM];
long long w[MAXM];
long long pot[MAXN];
int rev[MAXM];
long long ijk[MAXN];
int v[MAXN];
long long toc;... | [["-", 51, 16, 12, 16, 12, 16, 31, 16, 17, 72], ["+", 51, 16, 12, 16, 12, 16, 31, 16, 17, 33], ["-", 15, 339, 51, 16, 12, 16, 12, 16, 17, 33], ["+", 15, 339, 51, 16, 12, 16, 12, 16, 17, 72], ["-", 0, 1, 0, 11, 12, 16, 31, 16, 17, 72], ["+", 0, 1, 0, 11, 12, 16, 31, 16, 17, 33], ["-", 8, 9, 0, 1, 0, 11, 12, 16, 17, 33],... | 1 | 828 |
#include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
#define MAX 101
#define inf 1 << 29
using namespace std;
typedef pair<int, int> P;
struct edge {
int to, cap, cost, rev;
};
int v;
vector<edge> e[MAX];
int h[MAX];
int dist[MAX];
int prevv[MAX], preve[MAX];
void add_edge(int from, int to,... | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
#define MAX 101
#define inf 1 << 29
using namespace std;
typedef pair<int, int> P;
struct edge {
int to, cap, cost, rev;
};
int v;
vector<edge> e[MAX];
int h[MAX];
int dist[MAX];
int prevv[MAX], preve[MAX];
void add_edge(int from, int to,... | [["-", 0, 2, 3, 4, 0, 191, 51, 83, 0, 22], ["+", 0, 2, 3, 4, 0, 191, 51, 83, 0, 13], ["+", 3, 4, 0, 191, 51, 83, 0, 91, 17, 33]] | 1 | 658 |
#include "bits/stdc++.h"
using namespace std;
//?????????
#pragma region MACRO
#define putans(x) \
std::cerr << "[ answer ]: "; \
cout << (x) << endl
#define dputans(x) ... | #include "bits/stdc++.h"
using namespace std;
//?????????
#pragma region MACRO
#define putans(x) \
std::cerr << "[ answer ]: "; \
cout << (x) << endl
#define dputans(x) ... | [["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 22]] | 1 | 787 |
#include <bits/stdc++.h>
using namespace std;
#define MAX_V 10000
#define INF 1000000001
typedef pair<int, int> P;
struct edge {
int to, cap, cost, rev;
};
int V;
vector<edge> G[MAX_V];
int h[MAX_V];
int dist[MAX_V];
int prevv[MAX_V], preve[MAX_V];
void init_edge() {
for (int i = 0; i < V; i++)
G[i].clear();
}
... | #include <bits/stdc++.h>
using namespace std;
#define MAX_V 10000
#define INF 1000000001
typedef pair<int, int> P;
struct edge {
int to, cap, cost, rev;
};
int V;
vector<edge> G[MAX_V];
int h[MAX_V];
int dist[MAX_V];
int prevv[MAX_V], preve[MAX_V];
void init_edge() {
for (int i = 0; i < V; i++)
G[i].clear();
}
... | [["+", 0, 52, 8, 9, 0, 57, 64, 9, 0, 45], ["+", 0, 52, 8, 9, 0, 57, 64, 9, 0, 46], ["+", 0, 52, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46]] | 1 | 683 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include... | [["-", 0, 52, 8, 9, 0, 43, 49, 50, 51, 22], ["+", 0, 52, 8, 9, 0, 43, 49, 50, 51, 22]] | 1 | 602 |
#include <bits/stdc++.h>
#define VARNAME(x) #x
#define show(x) cerr << #x << " = " << x << endl
using namespace std;
using ll = long long;
using ld = long double;
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "sz=" << v.size() << "\n[";
for (const auto &p : v) {
os << p ... |
#include <bits/stdc++.h>
#define VARNAME(x) #x
#define show(x) cerr << #x << " = " << x << endl
using namespace std;
using ll = long long;
using ld = long double;
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "sz=" << v.size() << "\n[";
for (const auto &p : v) {
os << p ... | [["-", 8, 123, 0, 360, 39, 77, 39, 86, 0, 133], ["+", 0, 353, 8, 123, 0, 360, 39, 77, 39, 40], ["+", 8, 9, 0, 57, 64, 9, 0, 37, 0, 38], ["+", 8, 9, 0, 57, 64, 9, 0, 37, 0, 13], ["+", 8, 9, 0, 57, 64, 9, 0, 37, 0, 35]] | 1 | 1,260 |
import java.util.Scanner;
public class Main {
private static Scanner sc = new Scanner(System.in);
private static double x1 = sc.nextInt();
private static double y1 = sc.nextInt();
private static double x2 = sc.nextInt();
private static double y2 = sc.nextInt();
private static double ans;
public static vo... | import java.util.Scanner;
public class Main {
private static Scanner sc = new Scanner(System.in);
private static double x1 = sc.nextDouble();
private static double y1 = sc.nextDouble();
private static double x2 = sc.nextDouble();
private static double y2 = sc.nextDouble();
private static double ans;
publ... | [["-", 8, 498, 0, 124, 49, 200, 51, 492, 141, 22], ["+", 8, 498, 0, 124, 49, 200, 51, 492, 141, 22]] | 3 | 126 |
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);
double x1 = scan.nextInt();
double y1 = scan.nextInt();
double x2 = scan.ne... | 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);
double x1 = scan.nextDouble();
double y1 = scan.nextDouble();
double x2 = s... | [["-", 8, 196, 0, 503, 49, 200, 51, 492, 141, 22], ["+", 8, 196, 0, 503, 49, 200, 51, 492, 141, 22]] | 3 | 128 |
import static java.lang.System.out;
import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
double x = scan.nextInt();
double y = scan.nextInt();
double x2 = scan.nextInt();
double y2 = scan.nextInt();
double ans = Math.sqrt((x2 ... | import static java.lang.System.out;
import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
double x = scan.nextDouble();
double y = scan.nextDouble();
double x2 = scan.nextDouble();
double y2 = scan.nextDouble();
double ans = Ma... | [["-", 8, 196, 0, 503, 49, 200, 51, 492, 141, 22], ["+", 8, 196, 0, 503, 49, 200, 51, 492, 141, 22], ["-", 0, 195, 8, 196, 0, 1, 0, 492, 141, 22], ["+", 0, 195, 8, 196, 0, 1, 0, 492, 141, 22]] | 3 | 119 |
import java.math.BigDecimal;
import java.util.Scanner;
public class Main {
public static void main(String[] arges) {
Scanner sc = new Scanner(System.in);
String line = sc.nextLine();
String[] k = line.split(" ");
int[] v = new int[k.length];
for (int i = 0; i < v.length; i++) {
v[i] = Inte... | import java.math.BigDecimal;
import java.util.Scanner;
public class Main {
public static void main(String[] arges) {
Scanner sc = new Scanner(System.in);
String line = sc.nextLine();
String[] k = line.split(" ");
Double[] v = new Double[k.length];
for (int i = 0; i < v.length; i++) {
v[i] ... | [["-", 8, 196, 0, 503, 39, 224, 468, 506, 0, 507], ["+", 0, 195, 8, 196, 0, 503, 39, 224, 468, 78], ["-", 0, 503, 49, 200, 51, 227, 39, 506, 0, 507], ["+", 8, 196, 0, 503, 49, 200, 51, 227, 39, 78], ["-", 8, 196, 0, 1, 0, 11, 12, 492, 500, 22], ["+", 8, 196, 0, 1, 0, 11, 12, 492, 500, 22], ["-", 8, 196, 0, 1, 0, 11, 12... | 3 | 202 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int x1, y1, x2, y2, x, y;
double r;
x1 = sc.nextInt();
y1 = sc.nextInt();
x2 = sc.nextInt();
y2 = sc.nextInt();
x = Math.abs(x1 - x2);
y = Math.abs(y1 - y2);... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
double x1, y1, x2, y2, x, y;
double r;
x1 = sc.nextDouble();
y1 = sc.nextDouble();
x2 = sc.nextDouble();
y2 = sc.nextDouble();
x = Math.abs(x1 - x2);
y = Mat... | [["-", 0, 195, 8, 196, 0, 503, 39, 506, 0, 507], ["+", 0, 195, 8, 196, 0, 503, 39, 511, 0, 512], ["-", 8, 196, 0, 1, 0, 11, 12, 492, 141, 22], ["+", 8, 196, 0, 1, 0, 11, 12, 492, 141, 22]] | 3 | 137 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scan = new java.util.Scanner(System.in);
double x1 = scan.nextInt();
double y1 = scan.nextInt();
double x2 = scan.nextInt();
double y2 = scan.nextInt();
double dx = x2 - x1;
double dy = y2 - y1;
... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scan = new java.util.Scanner(System.in);
double x1 = scan.nextDouble();
double y1 = scan.nextDouble();
double x2 = scan.nextDouble();
double y2 = scan.nextDouble();
double dx = x2 - x1;
double dy... | [["-", 8, 196, 0, 503, 49, 200, 51, 492, 141, 22], ["+", 8, 196, 0, 503, 49, 200, 51, 492, 141, 22]] | 3 | 114 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
double x1 = sc.nextInt();
double y1 = sc.nextInt();
double x2 = sc.nextInt();
double y2 = sc.nextInt();
sc.close();
System.out.println(
Math.pow((x2 - x1... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
double x1 = sc.nextDouble();
double y1 = sc.nextDouble();
double x2 = sc.nextDouble();
double y2 = sc.nextDouble();
sc.close();
System.out.println(
Math.... | [["-", 8, 196, 0, 503, 49, 200, 51, 492, 141, 22], ["+", 8, 196, 0, 503, 49, 200, 51, 492, 141, 22]] | 3 | 115 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
double x1 = sc.nextInt();
double y1 = sc.nextInt();
double x2 = sc.nextInt();
double y2 = sc.nextInt();
double sum = Math.abs(x2 - x1) * Math.abs(x2 - x1) +
... |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
double x1 = sc.nextDouble();
double y1 = sc.nextDouble();
double x2 = sc.nextDouble();
double y2 = sc.nextDouble();
double sum = Math.abs(x2 - x1) * Math.abs(x2 - x1)... | [["-", 8, 196, 0, 503, 49, 200, 51, 492, 141, 22], ["+", 8, 196, 0, 503, 49, 200, 51, 492, 141, 22]] | 3 | 129 |
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
double x1 = sc.nextDouble();
double y1 = sc.nextDouble();
double x2 = sc.nextDouble();
double y2 = sc.nextDouble();
double a = x1 - y2;
double b = y1 - y2;
System.o... | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
double x1 = sc.nextDouble();
double y1 = sc.nextDouble();
double x2 = sc.nextDouble();
double y2 = sc.nextDouble();
double a = x1 - x2;
double b = y1 - y2;
System.o... | [["-", 8, 196, 0, 503, 49, 200, 51, 16, 12, 22], ["+", 8, 196, 0, 503, 49, 200, 51, 16, 12, 22]] | 3 | 105 |
import java.math.BigDecimal;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
double ans = 0;
Scanner sc = new Scanner(System.in);
double x1 = Double.parseDouble(sc.next());
double y1 = Double.parseDouble(sc.next());
double x2 = Double.parseDouble(sc.next())... | import java.math.BigDecimal;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
double ans = 0;
Scanner sc = new Scanner(System.in);
double x1 = Double.parseDouble(sc.next());
double y1 = Double.parseDouble(sc.next());
double x2 = Double.parseDouble(sc.next())... | [["-", 8, 196, 0, 1, 0, 492, 3, 4, 0, 22], ["+", 8, 196, 0, 1, 0, 492, 3, 4, 0, 22]] | 3 | 174 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
double p1_x, p1_y, p2_x, p2_y, dis;
p1_x = scan.nextDouble();
p1_y = scan.nextDouble();
p2_x = scan.nextDouble();
p2_y = scan.nextDouble();
dis = Math.pow((p2_x ... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
double p1_x, p1_y, p2_x, p2_y, dis;
p1_x = scan.nextDouble();
p1_y = scan.nextDouble();
p2_x = scan.nextDouble();
p2_y = scan.nextDouble();
dis = Math.pow((p2_x ... | [["-", 0, 195, 8, 196, 0, 1, 0, 11, 17, 90], ["+", 0, 195, 8, 196, 0, 1, 0, 11, 17, 32], ["+", 8, 196, 0, 1, 0, 11, 12, 492, 500, 22], ["+", 8, 196, 0, 1, 0, 11, 12, 492, 0, 131], ["+", 8, 196, 0, 1, 0, 11, 12, 492, 141, 22], ["+", 0, 1, 0, 11, 12, 492, 3, 4, 0, 24], ["+", 0, 1, 0, 11, 12, 492, 3, 4, 0, 25]] | 3 | 125 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
double x1 = sc.nextInt();
double y1 = sc.nextInt();
double x2 = sc.nextInt();
double y2 = sc.nextInt();
System.out.println(
Math.sqrt(Math.pow((x1 - x2), 2) + M... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
double x1 = sc.nextDouble();
double y1 = sc.nextDouble();
double x2 = sc.nextDouble();
double y2 = sc.nextDouble();
System.out.println(
Math.sqrt(Math.pow((x1 - ... | [["-", 8, 196, 0, 503, 49, 200, 51, 492, 141, 22], ["+", 8, 196, 0, 503, 49, 200, 51, 492, 141, 22]] | 3 | 109 |
package icpc;
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
double x1 = sc.nextDouble();
double y1 = sc.nextDouble();
double x2 = sc.nextDouble();
double y2 = sc.nextDouble();
double a = x1 - x2;
double b = y1 - y2;
... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
double x1 = sc.nextDouble();
double y1 = sc.nextDouble();
double x2 = sc.nextDouble();
double y2 = sc.nextDouble();
double a = x1 - x2;
double b = y1 - y2;
Sys... | [["-", 36, 36, 36, 36, 0, 493, 0, 501, 0, 483], ["-", 36, 36, 36, 36, 0, 493, 0, 501, 0, 22], ["-", 36, 36, 36, 36, 0, 493, 0, 501, 0, 35], ["-", 36, 36, 0, 493, 0, 454, 0, 525, 0, 48], ["+", 36, 36, 0, 493, 0, 454, 0, 522, 141, 22], ["-", 0, 1, 0, 492, 3, 4, 0, 5, 0, 491], ["+", 0, 1, 0, 492, 3, 4, 0, 5, 0, 491]] | 3 | 112 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
double x1 = sc.nextDouble(), x2 = sc.nextDouble();
double y1 = sc.nextDouble(), y2 = sc.nextDouble();
double l = (x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2);
System.out.p... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
double x1 = sc.nextDouble(), y1 = sc.nextDouble();
double x2 = sc.nextDouble(), y2 = sc.nextDouble();
double l = (x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2);
System.out.p... | [["-", 0, 195, 8, 196, 0, 503, 49, 200, 141, 22], ["+", 0, 195, 8, 196, 0, 503, 49, 200, 141, 22]] | 3 | 114 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc = new Scanner(System.in);
double x1 = sc.nextInt();
double y1 = sc.nextInt();
double x2 = sc.nextInt();
double y2 = sc.nextInt();
double xy = (x1 - x2) * ... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc = new Scanner(System.in);
double x1 = sc.nextDouble();
double y1 = sc.nextDouble();
double x2 = sc.nextDouble();
double y2 = sc.nextDouble();
double xy = ... | [["-", 8, 196, 0, 503, 49, 200, 51, 492, 141, 22], ["+", 8, 196, 0, 503, 49, 200, 51, 492, 141, 22]] | 3 | 118 |
import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int x1, y1, x2, y2;
double d;
x1 = scanner.nextInt();
y1 = scanner.nextInt();
x2 = scanner.nextInt();
y2 = scanner.nextInt();
x1 -= x2;
y1 -= y2;
d = Math... | import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
double x1, y1, x2, y2;
double d;
x1 = scanner.nextDouble();
y1 = scanner.nextDouble();
x2 = scanner.nextDouble();
y2 = scanner.nextDouble();
x1 -= x2;
y1 -= y2... | [["-", 0, 195, 8, 196, 0, 503, 39, 506, 0, 507], ["+", 0, 195, 8, 196, 0, 503, 39, 511, 0, 512], ["-", 8, 196, 0, 1, 0, 11, 12, 492, 141, 22], ["+", 8, 196, 0, 1, 0, 11, 12, 492, 141, 22]] | 3 | 110 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
double x1 = sc.nextInt();
double y1 = sc.nextInt();
double x2 = sc.nextInt();
double y2 = sc.nextInt();
double x = 0, y = 0;
double result = 0;
x = Math.pow(x1 -... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
double x1 = sc.nextDouble();
double y1 = sc.nextDouble();
double x2 = sc.nextDouble();
double y2 = sc.nextDouble();
double x = 0, y = 0;
double result = 0;
x = M... | [["-", 8, 196, 0, 503, 49, 200, 51, 492, 141, 22], ["+", 8, 196, 0, 503, 49, 200, 51, 492, 141, 22]] | 3 | 141 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
double x1 = sc.nextInt();
double y1 = sc.nextInt();
double x2 = sc.nextInt();
double y2 = sc.nextInt();
double result = 0;
result = Math.sqrt(Math.pow(x1 - x2, 2) + ... | import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
double x1 = sc.nextDouble();
double y1 = sc.nextDouble();
double x2 = sc.nextDouble();
double y2 = sc.nextDouble();
double result = 0;
result = Math.sqrt(Math.pow(x1... | [["-", 8, 196, 0, 503, 49, 200, 51, 492, 141, 22], ["+", 8, 196, 0, 503, 49, 200, 51, 492, 141, 22]] | 3 | 124 |
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
double x1 = sc.nextInt();
double y1 = sc.nextInt();
double x2 = sc.nextInt();
double y2 = sc.nextInt();
System.out.printf("%.8f\n",
Math.sqrt((x1 - x2) *... | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
double x1 = sc.nextDouble();
double y1 = sc.nextDouble();
double x2 = sc.nextDouble();
double y2 = sc.nextDouble();
System.out.printf("%.8f\n",
Math.sqrt... | [["-", 8, 196, 0, 503, 49, 200, 51, 492, 141, 22], ["+", 8, 196, 0, 503, 49, 200, 51, 492, 141, 22]] | 3 | 112 |
import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
double x1 = sc.nextInt();
double y1 = sc.nextInt();
double x2 = sc.nextInt();
double y2 = sc.nextInt();
System.out.println(Math.hypot(Math.abs(x2 - x1), Math.abs(y2 - y1)));
... | import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
double x1 = sc.nextDouble();
double y1 = sc.nextDouble();
double x2 = sc.nextDouble();
double y2 = sc.nextDouble();
System.out.println(Math.hypot(Math.abs(x2 - x1), Math.abs(y2... | [["-", 8, 196, 0, 503, 49, 200, 51, 492, 141, 22], ["+", 8, 196, 0, 503, 49, 200, 51, 492, 141, 22]] | 3 | 100 |
#include <math.h>
#include <stdio.h>
int main(void) {
double a, x1, x2, y1, y2;
scanf("%lf,%lf,%lf,%lf", &x1, &x2, &y1, &y2);
a = sqrt((y1 - x1) * (y1 - x1) + (y2 - x2) * (y2 - x2));
printf("%f\n", a);
return 0;
}
| #include <math.h>
#include <stdio.h>
int main(void) {
double a, x1, x2, y1, y2;
scanf("%lf%lf%lf%lf", &x1, &x2, &y1, &y2);
a = sqrt((y1 - x1) * (y1 - x1) + (y2 - x2) * (y2 - x2));
printf("%f\n", a);
return 0;
}
| [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 83 |
#include <math.h>
#include <stdio.h>
int main() {
double x1, x2, y1, y2;
double len;
scanf("%lf %lf", &x1, &y1);
scanf("%lf %lf", &x2, &y2);
x2 -= x1;
y2 -= y1;
len = sqrt(x2 * x2 + y2 * y2);
printf("%.3f\n", len);
return 0;
}
| #include <math.h>
#include <stdio.h>
int main() {
double x1, x2, y1, y2;
double len;
scanf("%lf %lf", &x1, &y1);
scanf("%lf %lf", &x2, &y2);
x2 -= x1;
y2 -= y1;
len = sqrt(x2 * x2 + y2 * y2);
printf("%.4f\n", len);
return 0;
}
| [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 82 |
#include <math.h>
#include <stdio.h>
int main() {
double x[2], y[2], l;
scanf("%lf %lf %lf %lf", &x[0], &y[0], &x[1], &y[1]);
l = hypotl(x[1] - x[0], x[1] - x[0]);
printf("%f\n", l);
return 0;
}
| #include <math.h>
#include <stdio.h>
int main() {
double x[2], y[2], l;
scanf("%lf %lf %lf %lf", &x[0], &y[0], &x[1], &y[1]);
l = hypotl(x[1] - x[0], y[1] - y[0]);
printf("%f\n", l);
return 0;
}
| [["-", 12, 2, 3, 4, 0, 16, 31, 69, 28, 22], ["+", 12, 2, 3, 4, 0, 16, 31, 69, 28, 22], ["-", 12, 2, 3, 4, 0, 16, 12, 69, 28, 22], ["+", 12, 2, 3, 4, 0, 16, 12, 69, 28, 22]] | 0 | 92 |
#include <math.h>
#include <stdio.h>
int main(void) {
int x1, y1, x2, y2;
scanf("%d", &x1);
scanf("%d", &y1);
scanf("%d", &x2);
scanf("%d", &y2);
printf("%f\n", sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)));
return 0;
} | #include <math.h>
#include <stdio.h>
int main(void) {
double x1, y1, x2, y2;
scanf("%lf", &x1);
scanf("%lf", &y1);
scanf("%lf", &x2);
scanf("%lf", &y2);
printf("%f\n", sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)));
return 0;
} | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 98 |
#include <math.h>
#include <stdio.h>
int main() {
int x1, y1, x2, y2;
scanf("%lf%lf%lf%lf", &x1, &y1, &x2, &y2);
printf("%f", sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)));
return 0;
} | #include <math.h>
#include <stdio.h>
int main() {
double x1, y1, x2, y2;
scanf("%lf%lf%lf%lf", &x1, &y1, &x2, &y2);
printf("%f", sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)));
return 0;
} | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40]] | 0 | 75 |
#include <math.h>
#include <stdio.h>
int main() {
double a, b, c, d;
scanf("%lf%lf%lf%lf", &a, &b, &c, &d);
printf("%.8lf\n", (sqrt((b - a) * (b - a) + (d - c) * (d - c))));
return 0;
} | #include <math.h>
#include <stdio.h>
int main() {
double a, b, c, d;
scanf("%lf%lf%lf%lf", &a, &b, &c, &d);
printf("%.8lf\n", (sqrt((c - a) * (c - a) + (d - b) * (d - b))));
return 0;
} | [["-", 0, 16, 31, 16, 31, 23, 0, 16, 31, 22], ["+", 0, 16, 31, 16, 31, 23, 0, 16, 31, 22], ["-", 0, 16, 31, 16, 12, 23, 0, 16, 31, 22], ["+", 0, 16, 31, 16, 12, 23, 0, 16, 31, 22], ["-", 0, 16, 12, 16, 31, 23, 0, 16, 12, 22], ["+", 0, 16, 12, 16, 31, 23, 0, 16, 12, 22], ["-", 0, 16, 12, 16, 12, 23, 0, 16, 12, 22], ["+"... | 0 | 78 |
#include <stdio.h>
double D(double a) {
a *= a;
return a;
}
int main(void) {
double x1, y1, x2, y2, sum;
double len;
scanf("% lf %lf %lf %lf", &x1, &y1, &x2, &y2);
sum = D(x1 - x2) + D(y1 - y2);
len = sqrt(sum);
printf("%f\n", len);
return 0;
} | #include <stdio.h>
double D(double a) {
a *= a;
return a;
}
int main(void) {
double x1, y1, x2, y2, sum;
double len;
scanf("%lf %lf %lf %lf", &x1, &y1, &x2, &y2);
sum = D(x1 - x2) + D(y1 - y2);
len = sqrt(sum);
printf("%f\n", len);
return 0;
} | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 93 |
#include <math.h>
#include <stdio.h>
int main() {
double x1, x2, y1, y2;
scanf("%lf %lf %lf %lf", &x1, &y1, &x2, &y2);
printf("%f\n", sqrt(pow((x2 - x1), 2) - pow((y2 - y1), 2)));
return 0;
} | #include <math.h>
#include <stdio.h>
int main() {
double x1, x2, y1, y2;
scanf("%lf %lf %lf %lf", &x1, &y1, &x2, &y2);
printf("%f\n", sqrt(pow((x2 - x1), 2) + pow((y2 - y1), 2)));
return 0;
} | [["-", 3, 4, 0, 2, 3, 4, 0, 16, 17, 33], ["+", 3, 4, 0, 2, 3, 4, 0, 16, 17, 72]] | 0 | 74 |
#include <math.h>
#include <stdio.h>
int main(void) {
double x1, y1, x2, y2;
scanf("%lf%lf%lf%lf", &x1, &y1, &x2, &y2);
printf("%.8ld\n", (sqrt((x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1))));
return 0;
} | #include <math.h>
#include <stdio.h>
int main(void) {
double x1, y1, x2, y2;
scanf("%lf%lf%lf%lf", &x1, &y1, &x2, &y2);
printf("%.8lf\n", (sqrt((x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1))));
return 0;
} | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 79 |
#include <math.h>
#include <stdio.h>
int main(void) {
double x1, y1, x2, y2, ans = 0;
scanf("%lf %lf %lf %lf", &x1, &y1, &x2, y2);
ans = (x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1);
printf("%f\n", sqrt(ans));
return 0;
} | #include <math.h>
#include <stdio.h>
int main(void) {
double x1, y1, x2, y2, ans = 0;
scanf("%lf %lf %lf %lf", &x1, &y1, &x2, &y2);
ans = (x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1);
printf("%f\n", sqrt(ans));
return 0;
} | [["+", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67]] | 0 | 84 |
#include <math.h>
#include <stdio.h>
int main(void) {
double x1, y1, x2, y2;
scanf("%lf %lf %lf %lf", &x1, &y1, &x2, &y2);
printf("%f", hypot(x1 - x2, y1 - y1));
return 0;
} | #include <math.h>
#include <stdio.h>
int main(void) {
double x1, y1, x2, y2;
scanf("%lf %lf %lf %lf", &x1, &y1, &x2, &y2);
printf("%f", hypot(x1 - x2, y1 - y2));
return 0;
} | [["-", 3, 4, 0, 2, 3, 4, 0, 16, 12, 22], ["+", 3, 4, 0, 2, 3, 4, 0, 16, 12, 22]] | 0 | 60 |
#include <math.h>
#include <stdio.h>
int main() {
float x1, x2, y1, y2 = 0;
scanf("%lf %lf %lf %lf", &x1, &y1, &x2, &y2);
float x, y = 0;
x = (x2 - x1);
x = x * x;
y = (y2 - y1);
y = y * y;
x = x + y;
x = sqrt(x);
printf("%lf\n", x);
return 0;
} | #include <math.h>
#include <stdio.h>
int main() {
double x1, x2, y1, y2 = 0;
scanf("%lf %lf %lf %lf", &x1, &y1, &x2, &y2);
double x, y = 0;
x = (x2 - x1);
x = x * x;
y = (y2 - y1);
y = y * y;
x = x + y;
x = sqrt(x);
printf("%lf\n", x);
return 0;
} | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40]] | 0 | 101 |
#include <math.h>
#include <stdio.h>
#define sqr(x) ((x) * (x))
typedef struct point {
double x;
double y;
} Point;
int main(void) {
Point p1, p2;
scanf("%if %lf %lf %lf", &p1.x, &p1.y, &p2.x, &p2.y);
printf("%f\n", sqrt(sqr(p2.x - p1.x) + sqr(p2.y - p1.y)));
return 0;
} | #include <math.h>
#include <stdio.h>
#define sqr(x) ((x) * (x))
typedef struct point {
double x;
double y;
} Point;
int main(void) {
Point p1, p2;
scanf("%lf %lf %lf %lf", &p1.x, &p1.y, &p2.x, &p2.y);
printf("%f\n", sqrt(sqr(p2.x - p1.x) + sqr(p2.y - p1.y)));
return 0;
} | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 98 |
/*
* a.c
*
* Created on: 2017/06/13
* Author: AWV060608
*/
#include <math.h>
#include <stdio.h>
int main(void) {
int x1, y1, x2, y2;
int x, y;
double dst;
scanf("%d", &x1);
scanf("%d", &y1);
scanf("%d", &x2);
scanf("%d", &y2);
if (x1 == x2) {
dst = abs(y2 - y1);
} else if (y1 == y2)... | /*
* a.c
*
* Created on: 2017/06/13
* Author: AWV060608
*/
#include <math.h>
#include <stdio.h>
int main(void) {
double x1, y1, x2, y2;
double x, y;
double dst;
scanf("%lf", &x1);
scanf("%lf", &y1);
scanf("%lf", &x2);
scanf("%lf", &y2);
if (x1 == x2) {
dst = abs(y2 - y1);
} else if ... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 0 | 147 |
#include <math.h>
#include <stdio.h>
int main(int argc, const char *argv[]) {
double xa, xb, ya, yb, distance = 0;
scanf("%lf %lf %lf %lf", &xa, &ya, &xb, &yb);
distance = sqrt((xb - xa) * (xb - xa) + (yb - ya) * (yb - ya));
printf("%f\n", &distance);
return 0;
} | #include <math.h>
#include <stdio.h>
int main(int argc, const char *argv[]) {
double xa, xb, ya, yb, distance = 0;
scanf("%lf %lf %lf %lf", &xa, &ya, &xb, &yb);
distance = sqrt((xb - xa) * (xb - xa) + (yb - ya) * (yb - ya));
printf("%f\n", distance);
return 0;
} | [["-", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67]] | 0 | 94 |
#include <iostream>
#include <vector>
using namespace std;
const int MAX_V = 205;
vector<int> G[MAX_V];
vector<int> match(MAX_V);
vector<bool> used(MAX_V);
void add_edge(const int &u, const int &v) {
G[u].emplace_back(v);
G[v].emplace_back(u);
}
bool dfs(const int &v) {
used[v] = true;
for (int i = 0; i < G... | #include <iostream>
#include <vector>
using namespace std;
const int MAX_V = 205;
vector<int> G[MAX_V];
vector<int> match(MAX_V);
vector<bool> used(MAX_V);
void add_edge(const int &u, const int &v) {
G[u].emplace_back(v);
G[v].emplace_back(u);
}
bool dfs(const int &v) {
used[v] = true;
for (int i = 0; i < G... | [["-", 0, 14, 8, 9, 0, 37, 0, 16, 17, 33], ["-", 0, 14, 8, 9, 0, 37, 0, 16, 12, 13], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 12, 22]] | 1 | 351 |
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
vector<int> list[100000];
int N, M, E;
int match[100000];
bool used[100000];
int x, y;
bool DFS(int V) {
used[V] = true;
for (int i = 0; i < list[V].size(); i++) {
int u = list[V][i];
int w = match[u];
if (w < 0 || !used[u] &... | #include <cstring>
#include <iostream>
#include <vector>
using namespace std;
vector<int> list[100000];
int N, M, E;
int match[100000];
bool used[100000];
int x, y;
bool DFS(int V) {
used[V] = true;
for (int i = 0; i < list[V].size(); i++) {
int u = list[V][i];
int w = match[u];
if (w < 0 || !used[w] &... | [["-", 12, 16, 31, 91, 28, 69, 341, 342, 0, 22], ["+", 12, 16, 31, 91, 28, 69, 341, 342, 0, 22]] | 1 | 289 |
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(a) (a).begin(), (a).end()
#define vi vector<int>
#define pb push_back
#define INF 999999999
//#define INF (1LL<<59)
//?????§2??¨??????????????° verified AOJ GRL... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(a) (a).begin(), (a).end()
#define vi vector<int>
#define pb push_back
#define INF 999999999
//#define INF (1LL<<59)
//?????§2??¨??????????????° verified AOJ GRL... | [["+", 0, 1, 0, 2, 3, 4, 0, 16, 31, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["-", 0, 16, 31, 16, 12, 2, 3, 4, 0, 22], ["+", 31, 16, 12, 2, 3, 4, 0, 16, 31, 22], ["+", 31, 16, 12, 2, 3, 4, 0, 16, 17, 72], ["+", 31, 16, 12, 2, 3, 4, 0, 16, 12, 22]] | 1 | 326 |
#include <bits/stdc++.h>
#define INF 1000000000
#define MAX_V 202
#define MAX_E 1000
using namespace std;
struct edge {
int to, cap, rev;
edge(int to_, int cap_, int rev_) : to(to_), cap(cap_), rev(rev_){};
};
int V, E;
vector<edge> G[MAX_V];
int level[MAX_V];
int iter[MAX_V];
void AddEdge(int from, int to, int c... | #include <bits/stdc++.h>
#define INF 1000000000
#define MAX_V 202
#define MAX_E 1000
using namespace std;
struct edge {
int to, cap, rev;
edge(int to_, int cap_, int rev_) : to(to_), cap(cap_), rev(rev_){};
};
int V, E;
vector<edge> G[MAX_V];
int level[MAX_V];
int iter[MAX_V];
void AddEdge(int from, int to, int c... | [["+", 0, 1, 0, 2, 3, 4, 0, 16, 31, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72]] | 1 | 645 |
#include "bits/stdc++.h"
#include <fstream>
#include <sys/timeb.h>
using namespace std;
#define repl(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define replrev(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)
#define reprev(i, n) replrev(i, 0, n)
#define repi(itr, ds) for ... | #include "bits/stdc++.h"
#include <fstream>
#include <sys/timeb.h>
using namespace std;
#define repl(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define replrev(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)
#define reprev(i, n) replrev(i, 0, n)
#define repi(itr, ds) for ... | [["-", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 36, 36, 36, 36, 0, 30, 0, 58, 51, 59], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 31, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 16, 17, 72]] | 1 | 893 |
#include <bitset>
#include <stdio.h>
#include <utility>
#include <vector>
using namespace std;
typedef vector<int> vi;
typedef vector<pair<int, int>> vpi;
typedef pair<int, int> pi;
#define R return
#define W while
#define FOR(i, a) for (int i = 0; i < a; i++)
#define MP make_pair
#define PB push_back
#define F first
#... | #include <bitset>
#include <stdio.h>
#include <utility>
#include <vector>
using namespace std;
typedef vector<int> vi;
typedef vector<pair<int, int>> vpi;
typedef pair<int, int> pi;
#define R return
#define W while
#define FOR(i, a) for (int i = 0; i < a; i++)
#define MP make_pair
#define PB push_back
#define F first
#... | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 334 |
<?php
fscanf(STDIN, '%f %f %f %f', $x1, $y1, $x2, $y2);
$x = abs($x1 - $x2);
$y = abs($y1 = $y2);
echo sqrt(pow($x, 2) + pow($y, 2)), PHP_EOL; | <?php
fscanf(STDIN, '%f %f %f %f', $x1, $y1, $x2, $y2);
$x = abs($x1 - $x2);
$y = abs($y1 - $y2);
echo sqrt(pow($x, 2) + pow($y, 2)), PHP_EOL; | [["-", 12, 613, 3, 3, 0, 28, 0, 11, 0, 32], ["+", 12, 613, 3, 3, 0, 28, 0, 16, 17, 33]] | 6 | 68 |
import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
double x1 = scan.nextDouble();
double x2 = scan.nextDouble();
double y1 = scan.nextDouble();
double y2 = scan.nextDouble();
double a;
double b;
a = x2 - x1;
b ... |
import java.util.Scanner;
class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
double x1 = scan.nextDouble();
double y1 = scan.nextDouble();
double x2 = scan.nextDouble();
double y2 = scan.nextDouble();
double a;
double b;
a = x2 - x1;
b ... | [["-", 0, 195, 8, 196, 0, 503, 49, 200, 141, 22], ["+", 0, 195, 8, 196, 0, 503, 49, 200, 141, 22]] | 3 | 117 |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
double a = scanner.nextInt();
double b = scanner.nextInt();
double x = scanner.nextInt();
double y = scanner.nextInt();
double c = x - a;
double z = y - b;
... |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
double a = scanner.nextDouble();
double b = scanner.nextDouble();
double x = scanner.nextDouble();
double y = scanner.nextDouble();
double c = x - a;
double z... | [["-", 8, 196, 0, 503, 49, 200, 51, 492, 141, 22], ["+", 8, 196, 0, 503, 49, 200, 51, 492, 141, 22], ["-", 0, 1, 0, 492, 3, 4, 0, 5, 0, 491], ["+", 0, 1, 0, 492, 3, 4, 0, 5, 0, 491]] | 3 | 124 |
import java.util.Scanner;
class Main {
public static void main(String[] args) {
double x1, y1, x2, y2;
Scanner sc = new Scanner(System.in);
x1 = sc.nextDouble();
y1 = sc.nextDouble();
x2 = sc.nextDouble();
y2 = sc.nextDouble();
System.out.printf("%.9f¥n",
Math.sqrt((... | import java.util.Scanner;
class Main {
public static void main(String[] args) {
double x1, y1, x2, y2;
Scanner sc = new Scanner(System.in);
x1 = sc.nextDouble();
y1 = sc.nextDouble();
x2 = sc.nextDouble();
y2 = sc.nextDouble();
System.out.printf("%.9f\n",
Math.sqrt((... | [["-", 0, 1, 0, 492, 3, 4, 0, 5, 0, 491], ["+", 0, 1, 0, 492, 3, 4, 0, 5, 0, 491], ["+", 0, 1, 0, 492, 3, 4, 0, 5, 0, 44]] | 3 | 115 |
import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) throws Exception {
Scanner sc = new Scanner(System.in);
double x1 = sc.nextInt();
double y1 = sc.nextInt();
double x2 = sc.nextInt();
double y2 = sc.nextInt();
double dis = Math.sqrt((x2 - x1) * (... | import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) throws Exception {
Scanner sc = new Scanner(System.in);
double x1 = sc.nextDouble();
double y1 = sc.nextDouble();
double x2 = sc.nextDouble();
double y2 = sc.nextDouble();
double dis = Math.sqrt((... | [["-", 8, 196, 0, 503, 49, 200, 51, 492, 141, 22], ["+", 8, 196, 0, 503, 49, 200, 51, 492, 141, 22]] | 3 | 121 |
import java.util.Scanner;
public class Main {
static char[] k = {'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i',
'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r',
's', 't', 'u', 'v', 'w', 'x', 'y', 'z'};
public static void main(String[] args) {
Scanner stdIn = new Scanner(Sys... | import java.util.Scanner;
public class Main {
static char[] k = {'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i',
'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r',
's', 't', 'u', 'v', 'w', 'x', 'y', 'z'};
public static void main(String[] args) {
Scanner stdIn = new Scanner(Sys... | [["-", 8, 196, 0, 503, 49, 200, 51, 492, 141, 22], ["+", 8, 196, 0, 503, 49, 200, 51, 492, 141, 22]] | 3 | 172 |
import java.util.*;
public class Main {
public static void main(String args[]) {
int[] r = new int[4];
Scanner scn = new Scanner(System.in);
String inl = scn.nextLine();
String[] part = inl.split(" ");
for (int i = 0; i < 4; i++) {
r[i] = Integer.parseInt(part[i]);
}
System.out.pri... | import java.util.*;
public class Main {
public static void main(String args[]) {
double[] r = new double[4];
Scanner scn = new Scanner(System.in);
String inl = scn.nextLine();
String[] part = inl.split(" ");
for (int i = 0; i < 4; i++) {
r[i] = Double.parseDouble(part[i]);
}
System... | [["-", 8, 196, 0, 503, 39, 224, 468, 506, 0, 507], ["+", 8, 196, 0, 503, 39, 224, 468, 511, 0, 512], ["-", 0, 503, 49, 200, 51, 227, 39, 506, 0, 507], ["+", 0, 503, 49, 200, 51, 227, 39, 511, 0, 512], ["-", 8, 196, 0, 1, 0, 11, 12, 492, 500, 22], ["+", 8, 196, 0, 1, 0, 11, 12, 492, 500, 22], ["-", 8, 196, 0, 1, 0, 11, ... | 3 | 150 |
import java.util.*;
class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
double x1 = sc.nextInt(), y1 = sc.nextInt(), x2 = sc.nextInt(),
y2 = sc.nextInt();
double a = x2 - x1;
double b = y2 - y1;
double c = a * a + b * b;
c = Math.sqrt(c);
... | import java.util.*;
class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
double x1 = sc.nextDouble(), y1 = sc.nextDouble(), x2 = sc.nextDouble(),
y2 = sc.nextDouble();
double a = x2 - x1;
double b = y2 - y1;
double c = a * a + b * b;
c = Ma... | [["-", 8, 196, 0, 503, 49, 200, 51, 492, 141, 22], ["+", 8, 196, 0, 503, 49, 200, 51, 492, 141, 22]] | 3 | 110 |
import java.io.IOException;
import java.util.Scanner;
public class Main {
public static void main(String[] args) throws Exception {
// TODO ?????????????????????????????????????????????
Scanner sc = new Scanner(System.in);
double a = sc.nextInt();
double b = sc.nextInt();
double c = sc.nextInt();... | import java.io.IOException;
import java.util.Scanner;
public class Main {
public static void main(String[] args) throws Exception {
// TODO ?????????????????????????????????????????????
Scanner sc = new Scanner(System.in);
double a = sc.nextDouble();
double b = sc.nextDouble();
double c = sc.next... | [["-", 8, 196, 0, 503, 49, 200, 51, 492, 141, 22], ["+", 8, 196, 0, 503, 49, 200, 51, 492, 141, 22]] | 3 | 117 |
import java.io.IOException;
import java.util.Scanner;
class Main {
public static void main(String[] args) throws IOException {
Scanner scane = new Scanner(System.in);
double px1 = scane.nextLong();
double py1 = scane.nextLong();
double p2x1 = scane.nextLong();
double p2y1 = scane.nextLong()... | import java.io.IOException;
import java.util.Scanner;
class Main {
public static void main(String[] args) throws IOException {
Scanner scane = new Scanner(System.in);
double px1 = scane.nextDouble();
double py1 = scane.nextDouble();
double p2x1 = scane.nextDouble();
double p2y1 = scane.next... | [["-", 8, 196, 0, 503, 49, 200, 51, 492, 141, 22], ["+", 8, 196, 0, 503, 49, 200, 51, 492, 141, 22]] | 3 | 103 |
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int x1 = scan.nextInt(), y1 = scan.nextInt(), x2 = scan.nextInt(),
y2 = scan.nextInt();
double dx = Math.abs(x2 - x1), dy = Math.abs(y2 - y1);
double distance = Math.sqrt(Ma... | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
double x1 = scan.nextDouble(), y1 = scan.nextDouble(),
x2 = scan.nextDouble(), y2 = scan.nextDouble();
double dx = Math.abs(x2 - x1), dy = Math.abs(y2 - y1);
double dista... | [["-", 0, 195, 8, 196, 0, 503, 39, 506, 0, 507], ["+", 0, 195, 8, 196, 0, 503, 39, 511, 0, 512], ["-", 8, 196, 0, 503, 49, 200, 51, 492, 141, 22], ["+", 8, 196, 0, 503, 49, 200, 51, 492, 141, 22]] | 3 | 126 |
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int x1, x2, y1, y2;
double ans, sax, say;
cin >> x1 >> y1 >> x2 >> y2;
sax = x1 - x2;
say = y1 - y2;
sax = pow(sax, 2);
say = pow(say, 2);
ans = sqrt(sax + say);
cout << setprecision(12) << ans << endl;
r... | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
double x1, x2, y1, y2;
double ans, sax, say;
cin >> x1 >> y1 >> x2 >> y2;
sax = x1 - x2;
say = y1 - y2;
sax = pow(sax, 2);
say = pow(say, 2);
ans = sqrt(sax + say);
cout << setprecision(12) << ans << endl;
... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40]] | 1 | 95 |
#include <cmath>
#include <cstdio>
int main() {
double x1, y1, x2, y2, d, dx, dy;
scanf("%d", &x1);
scanf("%d", &y1);
scanf("%d", &x2);
scanf("%d", &y2);
dx = x1 - x2;
dy = y1 - y2;
d = sqrt(dx * dx + dy * dy);
printf("%.5lf", d);
return 0;
} | #include <cmath>
#include <cstdio>
int main() {
double x1, y1, x2, y2, d, dx, dy;
scanf("%lf", &x1);
scanf("%lf", &y1);
scanf("%lf", &x2);
scanf("%lf", &y2);
dx = x1 - x2;
dy = y1 - y2;
d = sqrt(dx * dx + dy * dy);
printf("%.5lf", d);
return 0;
} | [["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6]] | 1 | 102 |
#include <cmath>
#include <iostream>
using namespace std;
int main(void) {
double x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
cout << sqrt(pow(x1 - x2, 2.0) + pow(y1 - y2, 2.0));
return 0;
} | #include <cmath>
#include <iostream>
using namespace std;
int main(void) {
double x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
cout << fixed << sqrt(pow(x1 - x2, 2.0) + pow(y1 - y2, 2.0));
return 0;
} | [["+", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 151]] | 1 | 60 |
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ctype.h>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ctype.h>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#includ... | [["+", 0, 16, 31, 16, 31, 16, 12, 2, 63, 22], ["+", 31, 16, 31, 16, 12, 2, 3, 4, 0, 24], ["+", 31, 16, 31, 16, 12, 2, 3, 4, 0, 13], ["+", 31, 16, 31, 16, 12, 2, 3, 4, 0, 25], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 17, 151]] | 1 | 142 |
#include <cmath>
#include <iomanip>
#include <iostream>
using std::cin;
using std::cout;
using std::endl;
using std::fixed;
using std::setprecision;
int main() {
int x1, x2, y1, y2;
cin >> x1 >> y1 >> x2 >> y2;
cout << fixed << setprecision(8);
cout << sqrt(pow((x2 - x1), 2) + pow((y2 - y1), 2)) << endl;
ret... | #include <cmath>
#include <iomanip>
#include <iostream>
using std::cin;
using std::cout;
using std::endl;
using std::fixed;
using std::setprecision;
int main() {
double x1, x2, y1, y2;
cin >> x1 >> y1 >> x2 >> y2;
cout << fixed << setprecision(8);
cout << sqrt(pow((x2 - x1), 2) + pow((y2 - y1), 2)) << endl;
... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40]] | 1 | 97 |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#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 <queue>
#include ... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#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 <queue>
#include ... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40]] | 1 | 110 |
#include <iostream>
using namespace std;
#include <cstdio>
#include <math.h>
int main() {
double dis = 0.0;
int x1, x2, y1, y2, f = 0;
cin >> x1 >> y1 >> x2 >> y2;
if (x1 >= x2 && y1 >= y2)
f = (x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2);
else if (x1 <= x2 && y1 <= y2)
f = (x2 - x1) * (x2 - x1) +... | #include <iostream>
using namespace std;
#include <cstdio>
#include <math.h>
int main() {
double dis = 0.0, x1, x2, y1, y2, f = 0.0;
cin >> x1 >> y1 >> x2 >> y2;
if (x1 >= x2 && y1 >= y2)
f = (x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2);
else if (x1 <= x2 && y1 <= y2)
f = (x2 - x1) * (x2 - x1) + (y2... | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["-", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 50, 51, 13]] | 1 | 212 |
#include <math.h>
#include <stdio.h>
int main() {
double x1, y1, x2, y2;
double dis;
scanf("%lf %lf %lf %lf", &x1, &y2, &x2, &y2);
printf("%f\n", sqrt(pow(x2 - x1, 2) + pow(y2 - y1, 2)));
return 0;
} | #include <math.h>
#include <stdio.h>
int main() {
double x1, y1, x2, y2;
double dis;
scanf("%lf %lf %lf %lf", &x1, &y1, &x2, &y2);
printf("%f\n", sqrt(pow(x2 - x1, 2) + pow(y2 - y1, 2)));
return 0;
} | [["-", 0, 1, 0, 2, 3, 4, 0, 66, 28, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 66, 28, 22]] | 0 | 73 |
#include <math.h>
#include <stdio.h>
int main(void) {
int x1, y1, x2, y2;
double X, Y;
scanf("%lf %lf %lf %lf", &x1, &y1, &x2, &y2);
X = pow((x2 - x1), 2);
Y = pow((y2 - y1), 2);
printf("%.8f\n", sqrt(X + Y));
return 0;
}
| #include <math.h>
#include <stdio.h>
int main(void) {
double x1, y1, x2, y2;
double X, Y;
scanf("%lf %lf %lf %lf", &x1, &y1, &x2, &y2);
X = pow((x2 - x1), 2);
Y = pow((y2 - y1), 2);
printf("%.8f\n", sqrt(X + Y));
return 0;
}
| [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40]] | 0 | 88 |
#include <cmath>
#include <cstdio>
int main(void) {
float x1, y1, x2, y2;
scanf("%lf%lf%lf%lf", &x1, &y1, &x2, &y2);
printf("%f\n", sqrt(pow(x1 - x2, 2) + pow(y1 - y2, 2)));
return (0);
}
| #include <cmath>
#include <cstdio>
int main(void) {
double x1, y1, x2, y2;
scanf("%lf%lf%lf%lf", &x1, &y1, &x2, &y2);
printf("%f\n", sqrt(pow(x1 - x2, 2) + pow(y1 - y2, 2)));
return (0);
}
| [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40]] | 1 | 73 |
#include <bits/stdc++.h>
using std::cin;
using std::cout;
using std::endl;
int main() {
long long x1, y1, x2, y2;
double d;
cin >> x1 >> y1 >> x2 >> y2;
d = (double)sqrt(pow(x1 - x2, 2) + pow(y1 - y2, 2));
cout << std::fixed << std::setprecision(8) << d << endl;
return 0;
}
| #include <bits/stdc++.h>
using std::cin;
using std::cout;
using std::endl;
int main() {
double x1, y1, x2, y2;
double d;
cin >> x1 >> y1 >> x2 >> y2;
d = sqrt(pow(x1 - x2, 2) + pow(y1 - y2, 2));
cout << std::fixed << std::setprecision(8) << d << endl;
return 0;
}
| [["-", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["-", 8, 9, 0, 1, 0, 11, 12, 74, 0, 24], ["-", 0, 1, 0, 11, 12, 74, 39, 77, 39, 40], ["-", 8, 9, 0, 1, 0, 11, 12, 74, 0, 25]] | 1 | 92 |
#include <cmath>
#include <cstdio>
using namespace std;
int main(void) {
double x1, y1, x2, y2;
scanf("%lf %lf %lf %lf", &x1, &y2, &x2, &y2);
printf("%0lf\n", sqrt(pow(x1 - x2, 2) + pow(y1 - y2, 2)));
return 0;
}
| #include <cmath>
#include <cstdio>
using namespace std;
int main(void) {
double x1, y1, x2, y2;
scanf("%lf %lf %lf %lf", &x1, &y1, &x2, &y2);
printf("%0lf\n", sqrt(pow(x1 - x2, 2) + pow(y1 - y2, 2)));
return 0;
}
| [["-", 0, 1, 0, 2, 3, 4, 0, 66, 28, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 66, 28, 22]] | 1 | 75 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
long x = (x1 - x2);
long y = (y1 - y2);
double l = sqrt(x * x + y * y);
printf("%.8f\n", l);
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
double x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
double x = (x1 - x2);
double y = (y1 - y2);
double l = sqrt(x * x + y * y);
printf("%.8f\n", l);
}
| [["-", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40]] | 1 | 73 |
#include <cstdio>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
int x1, x2, y1, y2;
double ans;
cin >> x1 >> x2 >> y1 >> y2;
ans = sqrt(((x1 - y1) * (x1 - y1) + (x2 - y2) * (x2 - y2)));
printf("%8lf\n", ans);
return 0;
}
| #include <cstdio>
#include <iostream>
#include <math.h>
using namespace std;
int main() {
double x1, x2, y1, y2;
double ans;
cin >> x1 >> x2 >> y1 >> y2;
ans = sqrt(((x1 - y1) * (x1 - y1) + (x2 - y2) * (x2 - y2)));
printf("%8lf\n", ans);
return 0;
}
| [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40]] | 1 | 82 |
#include <cmath>
#include <iostream>
using namespace std;
int main(void) {
double x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
cout << sqrt(pow(fabs(x1 - x2), 2) + pow(fabs(y1 - y2), 2)) << endl;
return 0;
}
| #include <cmath>
#include <iostream>
using namespace std;
int main(void) {
double x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
cout << fixed << sqrt(pow(fabs(x1 - x2), 2) + pow(fabs(y1 - y2), 2)) << endl;
return 0;
}
| [["+", 0, 1, 0, 16, 31, 16, 31, 16, 12, 22], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 17, 151]] | 1 | 68 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
double dis;
dis = sqrt((x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1));
printf("%f10\n", dis);
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
int main() {
double x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
double dis;
dis = sqrt((x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1));
printf("%f10\n", dis);
}
| [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40]] | 1 | 81 |
#include <cmath>
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
long double x1, x2, y1, y2;
cin >> x1 >> y1 >> x2 >> y2;
cout << sqrt((x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1)) << endl;
}
| #include <cmath>
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
double x1, x2, y1, y2;
cin >> x1 >> y1 >> x2 >> y2;
cout << fixed << sqrt((x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1)) << endl;
}
| [["-", 0, 14, 8, 9, 0, 43, 39, 86, 0, 96], ["+", 0, 1, 0, 16, 31, 16, 31, 16, 17, 151], ["+", 0, 1, 0, 16, 31, 16, 31, 16, 12, 22]] | 1 | 67 |
#include <iostream>
#include <math.h>
#include <stdio.h>
using namespace std;
main() {
int x1, y1, x2, y2, x = 0, y = 0;
double kekka;
cin >> x1 >> y1 >> x2 >> y2;
x = x2 - x1;
y = y2 - y1;
kekka = sqrt(x * x + y * y);
printf("%.8f\n", kekka);
} | #include <iostream>
#include <math.h>
#include <stdio.h>
using namespace std;
main() {
double x1, y1, x2, y2, x = 0, y = 0;
double kekka;
cin >> x1 >> y1 >> x2 >> y2;
x = x2 - x1;
y = y2 - y1;
kekka = sqrt(x * x + y * y);
printf("%.8f\n", kekka);
} | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40]] | 1 | 80 |
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define INF 2147483647
using namespace std;
int main() {
double x1, y1, x2, y2;
... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define INF 2147483647
using namespace std;
int main() {
double x1, y1, x2, y2;
... | [["+", 0, 16, 31, 16, 31, 16, 31, 16, 12, 22], ["+", 0, 1, 0, 16, 31, 16, 31, 16, 17, 151], ["-", 0, 16, 12, 2, 3, 4, 0, 16, 31, 22], ["+", 0, 16, 12, 2, 3, 4, 0, 16, 31, 22], ["-", 0, 16, 12, 2, 3, 4, 0, 16, 12, 22], ["+", 0, 16, 12, 2, 3, 4, 0, 16, 12, 22]] | 1 | 91 |
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
int x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
double ans = sqrt(pow((x2 - x1), 2) + pow((y2 - y1), 2));
printf("%.8f\n", ans);
return 0;
} | #include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
int main() {
double x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
double ans = sqrt(pow((x2 - x1), 2) + pow((y2 - y1), 2));
printf("%.8f\n", ans);
return 0;
} | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40]] | 1 | 76 |
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string.h>
using namespace std;
int main() {
int x1, y1, x2, y2;
int r2;
cin >> x1 >> y1 >> x2 >> y2;
r2 = (x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1);
printf("%.8f\n", sqrt((double)r2));
return 0;
} | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <string.h>
using namespace std;
int main() {
double x1, y1, x2, y2;
double r2;
cin >> x1 >> y1 >> x2 >> y2;
r2 = (x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1);
printf("%.8f\n", sqrt((double)r2));
return 0;
} | [["-", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40]] | 1 | 85 |
#!/usr/bin/env ruby
numbers = gets.split.map(&:to_i)
puts ((numbers[0]-numbers[2])**2.0 + (numbers[1]-numbers[3])**2.0)**0.5
| #!/usr/bin/env ruby
numbers = gets.split.map(&:to_f)
puts ((numbers[0]-numbers[2])**2.0 + (numbers[1]-numbers[3])**2.0)**0.5
| [["-", 0, 662, 12, 652, 3, 4, 0, 752, 0, 753], ["+", 0, 662, 12, 652, 3, 4, 0, 752, 0, 753]] | 4 | 44 |
x1, y1, x2, y2 = gets.chomp.split(' ').map(&:to_i)
print Math.sqrt((x2-x1)**2 + (y2 - y1)**2).round(6) | x1, y1, x2, y2 = gets.chomp.split(' ').map(&:to_f)
print Math.sqrt((x2-x1)**2 + (y2 - y1)**2).round(6) | [["-", 0, 662, 12, 652, 3, 4, 0, 752, 0, 753], ["+", 0, 662, 12, 652, 3, 4, 0, 752, 0, 753]] | 4 | 50 |
x1,y1,x2,y2 = gets.chomp.split.map(&:to_i)
d = Math.sqrt((x2-x1)**2 + (y2-y1)**2)
puts d | x1,y1,x2,y2 = gets.chomp.split.map(&:to_r)
d = Math.sqrt((x2-x1)**2 + (y2-y1)**2)
puts d | [["-", 0, 662, 12, 652, 3, 4, 0, 752, 0, 753], ["+", 0, 662, 12, 652, 3, 4, 0, 752, 0, 753]] | 4 | 43 |
x1, y1, x2, y2 = gets.split(" ").map{|x| x.to_i}
puts Math::sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) | x1, y1, x2, y2 = gets.split(" ").map{|x| x.to_f}
puts Math::sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) | [["-", 12, 652, 196, 196, 8, 734, 0, 652, 735, 22], ["+", 12, 652, 196, 196, 8, 734, 0, 652, 735, 22]] | 4 | 47 |
(x1,y1,x2,y2)=gets.split.map(&:to_i)
x=x2-x1
y=y2-y1
puts Math.sqrt(x**2+y**2) | (x1,y1,x2,y2)=gets.split.map(&:to_f)
x=x2-x1
y=y2-y1
puts Math.sqrt(x**2+y**2) | [["-", 0, 662, 12, 652, 3, 4, 0, 752, 0, 753], ["+", 0, 662, 12, 652, 3, 4, 0, 752, 0, 753]] | 4 | 42 |
#http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ITP1_10_A
x1,y1,x2,y2 = gets.split.map(&:to_i)
puts Math.sqrt( (x2-x1)**2 + (y2-y1)**2 ) | #http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ITP1_10_A
x1,y1,x2,y2 = gets.split.map(&:to_f)
puts Math.sqrt( (x2-x1)**2 + (y2-y1)**2 ) | [["-", 0, 662, 12, 652, 3, 4, 0, 752, 0, 753], ["+", 0, 662, 12, 652, 3, 4, 0, 752, 0, 753]] | 4 | 39 |
x1, y1, x2, y2 = gets.split.map(&:to_i)
puts sprintf("%.5f", ((x2-x1)**2 + (y2-y1)**2)**(1/2.0)) | x1, y1, x2, y2 = gets.split.map(&:to_f)
puts sprintf("%f", ((x2-x1)**2 + (y2-y1)**2)**(1/2.0)) | [["-", 0, 662, 12, 652, 3, 4, 0, 752, 0, 753], ["+", 0, 662, 12, 652, 3, 4, 0, 752, 0, 753], ["-", 3, 4, 0, 652, 3, 4, 0, 557, 0, 6], ["+", 3, 4, 0, 652, 3, 4, 0, 557, 0, 6]] | 4 | 48 |
x1, y1, x2, y2 = gets.split( " " ).map { |val| val.to_i }
puts( Math.sqrt( ( x1 - x2 )**2 + ( y1 - y2 )**2 ) ) | x1, y1, x2, y2 = gets.split( " " ).map { |val| val.to_f }
puts( Math.sqrt( ( x1 - x2 )**2 + ( y1 - y2 )**2 ) ) | [["-", 12, 652, 196, 196, 8, 734, 0, 652, 735, 22], ["+", 12, 652, 196, 196, 8, 734, 0, 652, 735, 22]] | 4 | 49 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.