1 #include <cstdio>
 2 #include <algorithm>
 3 using namespace std;
 4
 5 const int maxn = 100 +10;
 6 int a[maxn], r[maxn], ans[maxn];
 7
 8 int cmp(int i, int j) { return a[i] < a[j]; }
 9
10 int main()
11 {
12     //freopen("in.txt", "r", stdin);
13
14     int n, k;
15     scanf("%d%d", &n, &k);
16     for(int i = 0; i < n; ++i) r[i] = i;
17     for(int i = 0; i < n; ++i) scanf("%d", &a[i]);
18     sort(r, r + n, cmp);
19     int sum = 0, cnt = 0;
20     for(int i = 0; sum + a[r[i]] <= k && cnt < n; ++i)
21     {
22         sum += a[r[i]];
23         ans[cnt++] = r[i];
24     }
25
26     printf("%d\n", cnt);
27     for(int i = 0; i < cnt - 1; ++i) printf("%d ", ans[i]+1);
28     if(cnt) printf("%d\n", ans[cnt-1]+1);
29
30     return 0;
31 }

 1 #include <cstdio>
 2 #include <cmath>
 3
 4 int main()
 5 {
 6     //freopen("in.txt", "r", stdin);
 7
 8     int r, x1, y1, x2, y2, ans;
 9     scanf("%d%d%d%d%d", &r, &x1, &y1, &x2, &y2);
10     double d = sqrt((long long)(x1-x2)*(x1-x2) + (long long)(y1-y2)*(y1-y2));
11     ans = (int)ceil(d / 2.0 / r);
12     printf("%d\n", ans);
13
14     return 0;
15 }

 1 #include <cstdio>
 2 #include <vector>
 3 #include <algorithm>
 4 using namespace std;
 5
 6 typedef long long LL;
 7
 8 LL h, n, sum[55], ans = 0;
 9 vector<LL> anc1;
10
11 int main()
12 {
13     //freopen("in.txt", "r", stdin);
14
15     for(int i = 0; i <= 50; ++i) sum[i] = (1LL << (i+1)) - 1;
16     scanf("%I64d%I64d", &h, &n);
17     n += sum[h-1];  //转化成整个二叉树中的编号
18     LL x = n;
19     anc1.push_back(x);  //目标节点的所有祖先
20     while(x != 1)
21     {
22         x /= 2;
23         anc1.push_back(x);
24     }
25     //for(int i = 0; i < anc1.size(); ++i) printf("%I64d  ", anc1[i]);
26
27     LL node = 1;
28     bool choice = false;    //遍历防线(L or R)
29
30     while(node != n)
31     {
32         vector<LL> anc2;    //当前叶子节点X的祖先
33         for(int i = 0; i < h; ++i)
34         {
35             anc2.push_back(node);
36             if(!choice) node = node * 2; else node = node * 2 + 1;
37             choice = !choice;
38         }
39         if(n == node) { ans += h; break; }
40         anc2.push_back(node);
41         reverse(anc2.begin(), anc2.end());
42         //for(int i = 0; i < anc2.size(); ++i) printf("%I64d  ", anc2[i]);
43
44         for(int i = 1; i <= h; ++i) if(anc1[i] == anc2[i])
45         {//find LCA
46             ans += sum[i-1] + h - i + 1;
47             h = i - 1;      //更新树高
48             node = anc2[i-1];
49             if((anc2[i]<<1) == node)    //更新根节点的编号 及 遍历方向
50             {
51                 node = anc2[i] * 2 + 1;
52                 choice = false;
53             }
54             else
55             {
56                 node = (anc2[i] << 1);
57                 choice = true;
58             }
59             break;
60         }
61     }
62
63     printf("%I64d\n", ans);
64
65     return 0;
66 }