| 1 |
ios_base::sync_with_stdio(0); |
| 2 |
int main() |
| 3 |
using namespace std; |
| 4 |
return 0; |
| 5 |
res.push_back(x); |
| 6 |
for (auto& x : res) |
| 7 |
sort(a.begin(), a.end()); |
| 8 |
auto it = lower_bound(a.begin(), a.end(), x); |
| 9 |
ans = min(ans, x); |
| 10 |
cout << ans << endl; |
| 11 |
freopen("input.txt", "r", stdin); |
| 12 |
#define _CRT_SECURE_NO_WARNINGS |
| 13 |
#include <iostream> |
| 14 |
#include <algorithm> |
| 15 |
#include <iterator> |
| 16 |
#include <random> |
| 17 |
#include <queue> |
| 18 |
#include <iomanip> |
| 19 |
#include <functional> |
| 20 |
#include <fstream> |
| 21 |
const long double pi = acos(-1); |
| 22 |
template <typename T> |
| 23 |
cin.tie(0); |
| 24 |
cin >> n >> m >> k; |
| 25 |
int n, m, k; |
| 26 |
int x, y, z; |
| 27 |
cin >> x >> y >> z; |
| 28 |
return *this; |
| 29 |
const int mod = 998244353; |
| 30 |
#pragma GCC optimize("Ofast") |
| 31 |
#pragma GCC optimize("unroll-loops") |
| 32 |
#pragma GCC optimize("inline") |
| 33 |
return EOF; |
| 34 |
#ifdef _DEBUG |
| 35 |
#endif |
| 36 |
make_pair(x, y); |
| 37 |
for(int i = 1; i <= n; i++) |
| 38 |
for(int j = 1; j <= i; j++) |
| 39 |
scanf("%d", &n); |
| 40 |
cout.tie(0); |
| 41 |
solve(); |
| 42 |
continue; |
| 43 |
using type = long long; |
| 44 |
Type operator-() |
| 45 |
bool operator==(Type x) |
| 46 |
bool operator!=(Type x) |
| 47 |
cout << fixed << setprecision(20); |
| 48 |
return sqrtl(x * x + y * y); |
| 49 |
swap(x, y); |
| 50 |
vec.pop_back(); |
| 51 |
r = mid; |
| 52 |
l = mid; |
Комментарии