1
#include <stdio.h>
2
int main(void) {
3
  int n, m;
4
  scanf("%d", &n);
5
    int left = 0, right = n-1, mid, result=-1;
6
  int num[n];
7
  for (int i = 0; i < n; i++) {
8
    scanf("%d", &num[i]);
9
  }
10
  scanf("%d", &m);
11
    //先用冒泡排序确保大小顺序
12
    int temp;
13
    for (int i=0;i<n;i++){
14
        for (int j=0;j<n-i;j++){
15
            if (num[j]>num[j+1]){
16
                temp = num[j];
17
                num[j]=num[j+1];
18
                num[j+1]=temp;
19
            }
20
        }
21
    }
22
    //二分查找
23
    while (left<=right){
24
        mid = left+(right-left)/2;
25
        if (num[mid]==m){
26
            result = mid;
27
            right = mid - 1;
28
        }
29
        else if(num[mid]<m){
30
            left = mid + 1;
31
        }
32
        else{
33
            right = mid - 1;
34
        }
35
    }
36
    if (result!=-1){
37
        printf("%d\n",result+1);
38
    }
39
    else{
40
        printf("None\n");
41
    }
42
    return 0;
43
}

1
#include <stdio.h>
2

3
int main(void) {
4
    int n, i, count = 0, step = 0, j = 0;
5
    scanf("%d", &n);
6
    int arr[n];
7
    for (i = 0; i < n; i++) arr[i] = i + 1;
8
    while (count < n - 1) {
9
        if (arr[j] != 0) {
10
            step++;
11
            if (step == 3) {
12
                arr[j] = 0;
13
                count++;
14
                step = 0;
15
            }
16
        }
17
        j = (j + 1) % n;//环形数组
18
    }
19
    //查找剩余序号
20
    for (i = 0; i < n; i++) {
21
        if (arr[i] != 0)
22
            printf("%d\n", arr[i]);
23
    }
24
    return 0;
25
}