-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path622-diagonals.cpp
More file actions
38 lines (36 loc) · 881 Bytes
/
Copy path622-diagonals.cpp
File metadata and controls
38 lines (36 loc) · 881 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
/*
* Diagonals [1995A]
* Problem: https://codeforces.com/problemset/problem/1995/A
* Verdict: ACCEPTED Solved: 2025-03-15
* Language: C++17 (GCC 7-32)
* Runtime: 46 ms Memory: 100 KB
* Tags: brute force, greedy, implementation, math
* Author: BidoTeima
* Source: https://codeforces.com/contest/1995/submission/310793528
*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t;
cin>>t;
while(t--){
int n,k;
cin>>n>>k;
vector<int>dags;
for(int i = 1; i < n; i++)dags.push_back(i),dags.push_back(i);
dags.push_back(n);
int ans = 0;
while(k){
k -= min(k, dags.back());
dags.pop_back();
++ans;
}
cout<<ans<<'\n';
}
return 0;
}