#define  _CRT_SECURE_NO_WARNINGS
#include<stdio.h>


int main()
{

    int flag = 0;
    int n, k, mid;

    int a[100];
    
    for (int i = 0; i < 15; i++) scanf("%d", &a[i]);
    scanf("%d", &k);
    int left = 1, right = 15;
    while (left <= right)
    {

        mid = (left + right) / 2;
        if (a[mid] == k)
        {

            flag = 1;
            break;
        }
        else if (a[mid] < k)
        {
            left = mid + 1;
        }
        else
            right = mid - 1;


    }
    if (flag)
    {

        printf("%d position is %d", k, mid + 1);
    }
    else
        printf("cannot find %d", k);
    return 0;







}

#define  _CRT_SECURE_NO_WARNINGS
#include <stdio.h>

int main()
{
    int a[11];
    /********** Begin *********/
    int n=10;
   

    for (int i = 0; i < n; i++) scanf("%d", &a[i]);
    for (int i = 0; i < n - 1; i++) {

        for (int j = i + 1; j < n; j++) {


            if (a[i] > a[j])
            {


                int t = a[i];
                a[i] = a[j];
                a[j] = t;

            }

        }
    }


    for (int i = 0; i < n; i++) printf("%d ",a[i]);


    /********** End **********/
    return 0;
}

#include <stdio.h>
int cnt = 0;
int sum_divisible_by_3_or_7(int numbers[], int n) {
    /********** Begin *********/
    for (int i = 0; i < n; i++) {
        if (numbers[i] % 3 == 0 || numbers[i] % 7 == 0) cnt+=numbers[i];

    }


    /********** End **********/
    return cnt ;
}

int main() {
    int numbers[] = { 3, 5, 6, 8, 9, 14, 25 };
    int n = 7;
    int s = sum_divisible_by_3_or_7(numbers, n);
    printf("%d", s);
}

#include <stdio.h>
 
int compute(int numbers[], int n) {
    // TODO 请在此处编写代码，完成题目要求
    int flag=1,sum=0;
    for(int i=0;i<n;i++)
    {
        sum=sum+flag*numbers[i];
        flag=-flag;
    }
    return sum;
}
 
int main() {
    int numbers[] = {1, 2, 3, 4, 5, 6};
    int n = 6;
    int s = compute(numbers, n);
    printf("%d", s);
}

#include<stdio.h>
int main()
{
int i,j,k,x,y,z,t,a[10],b[10];
for(i=0;i<10;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<10;i++)
{
for(j=2;j<a[i];j++)
if(a[i]%j==0)
{
b[i]=0;
break;
}
if(j>=a[i])
{
b[i]=a[i];
}
}
for(x=9,k=0;k<x;)
{
if(b[k]==0)
{k++;}
if(b[x]==0)
{x--;}
if(b[k]!=0 && b[x]!=0)
{
y=b[x];
b[x]=b[k];
b[k]=y;
k++;
x--;
}
}
for(z=0;z<10;z++)
{
if(b[z]!=0)
a[z]=b[z];
}
for(t=0;t<10;t++)
if(t==0)printf("%d",a[t]);
else printf(" %d",a[t]);
}

#include <stdio.h>
#define N 21
int main()
{
    int a[N][N];
    int n,i,j;
    int sum=0,count=0;
    scanf("%d",&n);
    for(i=0;i<n;i++)//输入矩阵元素
    {
        for(j=0;j<n;j++)
        {
            scanf("%d",&a[i][j]);
        }
    }
    for(i=0;i<n;i++)//访问元素，并且判断是否符合计算要求
    {
        for(j=0;j<n;j++)
        {
            if(i==j||i+j==n-1)
            {
                if(a[i][j])
                    count++;
                sum+=a[i][j];
            }
        }
    }
    printf("sum = %d, count = %d.",sum,count);
}

#include<iostream>
#include<cstdio>
using namespace std;
int dx = 0, dy = 1;
int v[10][10], a[10][10];
int n;
void dfs(int value,int x,int y) {
	
	v[x][y] = 1;
	a[x][y] = value;
	if (value == n * n)
		return;
	else{
		int nx = x + dx;
		int ny = y + dy;
		if (nx >= 0 && nx < n && ny >= 0 && ny < n && !v[nx][ny] && !a[nx][ny]) {
			dfs(value + 1, nx, ny);
		}
		else if (v[nx][ny] && dy == 1 || ny >= n) {
			dx = 1;
			dy = 0;
			dfs(value + 1, x + 1, y);
		}
		else if (nx >= n || v[nx][ny]&& dx == 1) {
			dx = 0;
			dy = -1;
			dfs(value + 1, x, y - 1);
		}
		else if (ny < 0 || v[nx][ny] && dy == -1) {
			dx = -1;
			dy = 0;
			dfs(value + 1, x - 1, y);
		}
		else{
			dx = 0;
			dy = 1;
			dfs(value + 1, x, y + 1);
		}
		
	}
 
}
int main(void) {
	
	cin >> n;
	dfs(1, 0, 0);
	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < n; j++)
			printf("%3d", a[i][j]);
		printf("\n");
	}
	return 0;
}

#include<iostream>
#include<math.h>
#include<algorithm>
using namespace std;
int main()
{
	int i,j,k,m,a[21][21],n;
	scanf("%d",&n);
	for(i=1;i<=n;i++){
		a[i][1]=a[i][i]=1;
	}
	if(n>=3){
		for(i=1;i<=n;i++){
			for(j=2;j<i;j++){
				a[i][j]=a[i-1][j]+a[i-1][j-1];
			}
		}
	}
	for(i=1;i<=n;i++){
			for(j=1;j<=i;j++){
				printf("%d ",a[i][j]);	
			}
			printf("\n");
		}
	
	return 0;
}

#include<iostream>
#include<bits/stdc++.h>
using namespace std;

int main()
{
	/********begin*********/
    
    int n=8;
    int a[10];
    for(int i=0;i<n;i++) cin>>a[i];
    sort(a,a+n);
    for(int i=0;i<n;i++) cout << a[i]<<" ";
    /********end***********/
	return 0;
}

10

#include <stdio.h>
int main()
{
    int n, z,j;
    scanf("%d", &n);
    scanf("%d",&z);
    int a[n][z];
    int  i;
    for(i=0; i<n; i++)
 {
        for(j=0; j<z; j++)
            scanf("%d",&a[i][j]);
    }
    int k=0, m=0, flag=1, h=0;
    if(n==1)
        printf("0 0");
    else
    {
        for(i=0; i<n; i++)
        {
            m=i;
            for(h=0; h<n; h++)
                if(a[i][k]<=a[i][h])
                    k=h;
            for(j=0; j<n; j++)
                if(a[m][k]>a[j][k])
                {
                 m=j;
                    break;
                }
            if(i==m)
            {
                flag=0;
                break;
            }
        }
        if(flag==0)
            printf("%d %d", i, k);
        else
   printf("NONE");
    }
    return 0;
}