| 1 |
return 0; |
| 2 |
for (int i = 0; i < n; i++) |
| 3 |
#include <cstdio> |
| 4 |
int main() |
| 5 |
#include <cstdlib> |
| 6 |
using namespace std; |
| 7 |
#include <iostream> |
| 8 |
else |
| 9 |
#include <algorithm> |
| 10 |
#include <vector> |
| 11 |
#include <cstring> |
| 12 |
return false; |
| 13 |
return true; |
| 14 |
continue; |
| 15 |
return; |
| 16 |
#include <string> |
| 17 |
#include <cmath> |
| 18 |
for (int s = 0; s < n; s++) |
| 19 |
#ifdef LOCAL |
| 20 |
#endif |
| 21 |
int n; |
| 22 |
break; |
| 23 |
public: |
| 24 |
for (int i = 0; i < 4; i++) |
| 25 |
#else |
| 26 |
void scan() |
| 27 |
scanf("%d", &n); |
| 28 |
#define eprintf(...) fprintf(stderr, __VA_ARGS__) |
| 29 |
throw; |
| 30 |
#include <map> |
| 31 |
#define eprintf(...) 42 |
| 32 |
for (int i = 0; i < CNT; i++) |
| 33 |
int cnt = 0; |
| 34 |
return Point(x - a.x, y - a.y); |
| 35 |
struct Point |
| 36 |
#include <set> |
| 37 |
return Point(x + a.x, y + a.y); |
| 38 |
typedef long long ll; |
| 39 |
if (a < 0) |
| 40 |
return 1; |
| 41 |
void print() |
| 42 |
return -1; |
| 43 |
puts(""); |
| 44 |
for (int i = 0; i < len; i++) |
| 45 |
for (int s = 0; s < m; s++) |
| 46 |
for (int i = 1; i <= n; i++) |
| 47 |
for (int i = 0; i < m; i++) |
| 48 |
return fabs(a - b) < eps; |
| 49 |
bool Eq(double a, double b) |
| 50 |
string toString() |
| 51 |
bool ok = true; |
| 52 |
return result; |
| 53 |
bool LsEq(double a, double b) |
| 54 |
cnt++; |
| 55 |
for (int i = 0; i < N; i++) |
| 56 |
return x * a.y - y * a.x; |
| 57 |
bool Ls(double a, double b) |
| 58 |
return x * a.x + y * a.y; |
| 59 |
const int N = (int)1e5 + 100; |
| 60 |
for (int i = 0; i < sz; i++) |
| 61 |
return a < b && !Eq(a, b); |
| 62 |
for (int s = 0; s < SZ; s++) |
| 63 |
for (int i = 0; i < SZ; i++) |
| 64 |
return a > b && !Eq(a, b); |
| 65 |
for (int s = 0; s < sz; s++) |
| 66 |
void read() |
| 67 |
bool Gr(double a, double b) |
| 68 |
bool GrEq(double a, double b) |
| 69 |
for (int i = 0; i < A; i++) |
| 70 |
double x, y; |
| 71 |
freopen ("input.txt", "r", stdin); |
| 72 |
scanf("%lf%lf", &x, &y); |
| 73 |
Point operator - (Point a) |
| 74 |
const double eps = 1e-8; |
| 75 |
return a; |
| 76 |
Point () {} |
| 77 |
if (Ls(a, 0)) |
| 78 |
cc++; |
| 79 |
return 2; |
| 80 |
return ""; |
| 81 |
scanf("%d%d", &n, &m); |
| 82 |
freopen ("output.txt", "w", stdout); |
| 83 |
bool operator == (const Point &a) const |
| 84 |
Point (double _x, double _y) : x(_x), y(_y) {} |
| 85 |
Point P1, P2; |
| 86 |
return i; |
| 87 |
int n, m; |
| 88 |
a += b; |
| 89 |
int x, y; |
| 90 |
Point operator + (Point a) |
| 91 |
for (int d = 0; d < 4; d++) |
| 92 |
return sqrt(a); |
| 93 |
return Point(x * k, y * k); |
| 94 |
scanf("%s", str); |
| 95 |
return ok; |
| 96 |
for (int a = 0; a < n; a++) |
| 97 |
const int N = (int)1e5 + 10; |
| 98 |
int k; |
| 99 |
for (int i = 0; i < q; i++) |
| 100 |
if (l >= a && r <= b) |
| 101 |
bool operator < (const Point &a) const |
| 102 |
puts("NO"); |
| 103 |
scanf("%d%d", &x, &y); |
| 104 |
for (int a = 0; a < 4; a++) |
| 105 |
return mySqrt(x * x + y * y); |
| 106 |
for (int b = 0; b < 4; b++) |
| 107 |
int a, b; |
| 108 |
int cc = 1; |
| 109 |
double mySqrt(double a) |
| 110 |
for (int i = 0; i < Size; i++) |
| 111 |
double length() |
| 112 |
for (int i = 0; i < k; i++) |
| 113 |
for (int i = l; i <= r; i++) |
| 114 |
if (ok) |
| 115 |
int type; |
| 116 |
printf("%d %d", x, y); |
| 117 |
int result = 0; |
| 118 |
for (int i = 0; i < 3; i++) |
| 119 |
printf("%lf %lf", x, y); |
| 120 |
Point () : x(), y() {} |
| 121 |
if (l == r) |
| 122 |
for (int i = 0; i <= n; i++) |
| 123 |
Point (int _x, int _y) : x(_x), y(_y) {} |
| 124 |
return Point(x * cosa - y * sina, x * sina + y * cosa); |
| 125 |
int v = 0; |
| 126 |
void init() |
| 127 |
for (int i = 0; i < 2; i++) |
| 128 |
const int INF = (int)1e9 + 10; |
| 129 |
for (int i = 0; i < T; i++) |
| 130 |
return res; |
| 131 |
int add(int a, int b) |
| 132 |
int len = strlen(str); |
| 133 |
const double pi = atan(1.) * 4; |
| 134 |
#define mp make_pair |
| 135 |
return Eq(x, a.x) && Eq(y, a.y); |
| 136 |
for (int b = 0; b < n; b++) |
| 137 |
cin >> n; |
| 138 |
Point operator + (const Point &a) const |
| 139 |
memset(coeff, 0, sizeof(coeff)); |
| 140 |
ok = false; |
| 141 |
puts("YES"); |
| 142 |
for (int s = 0; s < W; s++) |
| 143 |
#define X first |
| 144 |
Point norm() |
| 145 |
for (int a = 0; a < 10; a++) |
| 146 |
while (r - l > 1) |
| 147 |
struct Event |
| 148 |
int q; |
| 149 |
dfs(to); |
| 150 |
for (int i = 0; i < 5; i++) |
| 151 |
for (int i = 0; i < cnt; i++) |
| 152 |
init(); |
| 153 |
double operator % (const Point &a) const |
| 154 |
int operator * (Point a) |
| 155 |
cout << ans; |
| 156 |
scanf("%d", &k); |
| 157 |
if (k == 0) |
| 158 |
Point A, B; |
| 159 |
Point rotate(double sina, double cosa) |
| 160 |
for (int i = 0; i < rooms; i++) |
| 161 |
Event () {} |
| 162 |
void addSegment(Segment s) |
| 163 |
scanf("%d", &q); |
| 164 |
for (int i = 0; i < (int)a.size(); i++) |
| 165 |
#include <ctime> |
| 166 |
if (LessOrEqual(distance, remainDistance)) |
Комментарии