| 1 |
unordered_map<char, int> mm; |
| 2 |
for (int i = 0; i < n; i ++) { |
| 3 |
int n; |
| 4 |
cin >> n; |
| 5 |
vector<int> a(n); |
| 6 |
vector<pair<int, int> > vec(n + 1); |
| 7 |
char field[109][109]; |
| 8 |
ld a, b, c; |
| 9 |
vector<pair<ld, ld> > a; |
| 10 |
return 1; |
| 11 |
cout << answ; |
| 12 |
cin >> a >> b >> c; |
| 13 |
typedef long double ld; |
| 14 |
typedef long long ll; |
| 15 |
} |
| 16 |
if (x > 0) { |
| 17 |
else if (x < 0 && (a.size() > 0 || temp != 9)) { |
| 18 |
else { |
| 19 |
int xx = x ^ a; |
| 20 |
int xx = x & a; |
| 21 |
for (int mask = 0; mask < (1 << n); mask++) { |
| 22 |
for (int subm = mask; subm != 0; subm = (subm - 1) & mask) { |
| 23 |
int dp[100009]; |
| 24 |
used[i] = -1; |
| 25 |
void dfs(int v, int p) { |
| 26 |
sort(vec.begin(), vec.end(), cmp); |
| 27 |
bool operator < (const str& a, const str& b) { |
| 28 |
struct Node { |
| 29 |
unordered_map<int, int> mm; |
| 30 |
set<pair<int, int> > ss; |
| 31 |
for (int j = 0; j < m; j ++) { |
| 32 |
reverse(a.begin(), a.end()) |
| 33 |
for (auto it = a.rbegin(); it != a.rend(); it++) { |
| 34 |
for (auto u : answ) { |
| 35 |
if (u == -1) continue; |
| 36 |
break; |
| 37 |
auto it = ss.begin(); |
| 38 |
ss.erase(it); |
| 39 |
void update(int v, int tl, int tr, int l, int r, int x) { |
| 40 |
auto |
| 41 |
s.begin() |
| 42 |
s.end() |
| 43 |
ll |
| 44 |
while (t--) { |
| 45 |
; |
| 46 |
tree[v] = max(tree[v * 2 + 1], tree[v * 2 + 2]); |
| 47 |
string t = ""; |
| 48 |
getline(cin, s); |
| 49 |
unordered_set<int> out; |
| 50 |
freopen("frozen.in", "r", stdin); |
| 51 |
freopen("glasses.out", "w", stdout); |
| 52 |
stoi(s); |
| 53 |
stoll(s); |
| 54 |
to_string(x); |
Комментарии