#include <bits/stdc++.h> using namespace std; #include "books.h" void solve(int N,int K,long long A,int S){ int l = 1 , r = N-K+1; while(l<=r){ int mid = (l+r)/2; long long val = 0; for(int i = mid;i<mid+K;i++){ val+=skim(i); } if(val<A){ l = mid+1; }else if(val>2*A){ r = mid-1; }else { vector<int> v; for(int i = mid;i<mid+K;i++)v.push_back(i); answer(v); return ; } } impossible(); }