C :

#include<stdio.h>
#include<stdlib.h>
#define ElemType int
typedef struct LNode{
	ElemType data;
	struct LNode *next;
}LNode,*LinkList;
void initial(LinkList L){
	char temp;
	ElemType data;
	LNode *p = L;
	while(scanf("%d",&data)!=NULL){
		LNode *s = (LNode *)malloc(sizeof(LNode));
		s->data = data;
		p->next = s;
		p = p->next;
		temp=getchar();
		if(temp=='\n'||temp==NULL)
			break;
	}
	p->next = NULL;
}

int find(LinkList L,ElemType data){
	int no = 0;
	LNode *p = L->next;
	while(p){
		no++;
		if(p->data==data)
			break;
		else
			p=p->next;
	}
	return no;
}

int main(){
	ElemType data;
	LinkList L = (LNode *)malloc(sizeof(LNode));
	initial(L);
	scanf("%d",&data);
	printf("%d",find(L,data));
	return 0;
}

C++ :

#include<iostream>
#include<stdlib.h>
using namespace std;
//定义一个链表节点 


typedef struct BNode{
	int data;
	struct BNode *next;
}BNode;
int Sort(int e,BNode *C);
int main(){
	BNode *s,*r;
	BNode *C;
	int e;
	int a[9];
	C=(BNode*)malloc(sizeof(BNode));
	C->next=NULL;
	r=C;
	for(int i=1;i<=8;i++){
		s=(BNode*)malloc(sizeof(BNode));
		cin>>a[i];
		s->data=a[i];
		r->next=s; 
		r=r->next;
		
	}
	r->next=NULL;
	cin>>e;
	int t=Sort(e,C);
	cout<<t<<endl;
	return 0;
} 

int Sort(int e,BNode *C){
	BNode *r;
	//C->next=NULL;
	r=C;
	int i=1;
	while(r->next!=NULL){
		r=r->next;
		if(r->data==e){
			return i;
		}
		i++;
	} 
}

Python :

# coding=utf-8
list1 = input().split(" ")
num = input()
if num not in list1:
    print(0)
else:
    for i in list1:
        if i == num:
            print(list1.index(i) + 1)
            break