q-kv

double ans[]={.33066404772027283E3,1<<0xA};main(){--1[ans]?*ans/=2,main():puts(ans);}	

q-kv

q-kv

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;

const int MAX = 200000;
typedef long double ld;
struct point {
	ll x,y;ld p;
	point(ll x, ll y,ld p=0):x(x),y(y),p(p){}

q-kv

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAX = 50'000;

ll ten[10]={1};
char s[MAX+5];
int n, k, m, sz;
int ub[MAX*10+5];
int t[MAX*41], lazy[MAX*41];

q-kv

#include <bits/stdc++.h>
using namespace std;
const int INF = 987654321;

int N, K;
queue<int> q[1500];
int ans[1500][1500];
void solve() {
	int m;
	scanf("%d %d %d", &N, &K, &m);

q-kv

#include <bits/stdc++.h>
using namespace std;
const int INF = 987654321;

int N, K;
queue<int> q[1500];
int ans[1500][1500];
void solve() {
	int m;
	scanf("%d %d %d", &N, &K, &m);

q-kv

#include <bits/stdc++.h>
using namespace std;
int X[3001], Y[3001], N, K;
int xl[3001], yl[3001];
int xpsum[3001][3001], ypsum[3001][3001];

int getx(int i, int j) {
	if (i < 0) return 0;
	return xpsum[i][j];
}

q-kv

#include <bits/stdc++.h>
using namespace std;
const int MAX = 20000;

int A[MAX], B[MAX];
void solve() {
	int N, K; scanf("%d %d", &N, &K);
	for (int i = 0; i < N; i++) 
		scanf("%d", A+i);
	for (int i = 0; i < N; i++)

q-kv

#include <bits/stdc++.h>
using namespace std;
using ll=long long;

ll a[1000007];
int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);

	ll n, k; cin >> n >> k;

q-kv

#include <bits/stdc++.h>
using namespace std;

int a[1000000];
int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	int N; cin >> N;
	int mn = INT_MAX, mn2 = INT_MAX;
	int xsum = 0;