1672E - notepadexe - CodeForces Solution


binary search constructive algorithms greedy interactive *2200

Please click on ads to support us..

C++ Code:

#include <bits/stdc++.h>
using namespace std;
const int W = 1e9;
const long long INF = 1e18;
int main(){
	long long n, poc=1, kon=W, mid, h;
	long long out=INF;
	cin >> n;
	while(poc<kon){
		mid=(poc+kon)/2;
		cout<<"? "<< mid << '\n';
		cout.flush();
		cin >> h;
		if(h==1) kon=mid;
		else poc=mid+1;
	}
	for(long long i=1; i<=n; i++){
		cout << "? "<< poc/i << '\n';
		cout.flush();
		cin >> h;
		if(h) out=min(out, (poc/i)*h);
	}
	cout << "! " << out;
	return 0;
}


Comments

Submit
0 Comments
More Questions

1002. Find Common Characters
1602A - Two Subsequences
1555A - PizzaForces
1607B - Odd Grasshopper
1084A - The Fair Nut and Elevator
1440B - Sum of Medians
1032A - Kitchen Utensils
1501B - Napoleon Cake
1584B - Coloring Rectangles
1562B - Scenes From a Memory
1521A - Nastia and Nearly Good Numbers
208. Implement Trie
1605B - Reverse Sort
1607C - Minimum Extraction
1604B - XOR Specia-LIS-t
1606B - Update Files
1598B - Groups
1602B - Divine Array
1594B - Special Numbers
1614A - Divan and a Store
2085. Count Common Words With One Occurrence
2089. Find Target Indices After Sorting Array
2090. K Radius Subarray Averages
2091. Removing Minimum and Maximum From Array
6. Zigzag Conversion
1612B - Special Permutation
1481. Least Number of Unique Integers after K Removals
1035. Uncrossed Lines
328. Odd Even Linked List
1219. Path with Maximum Gold