#include<bits/stdc++.h> using namespace std; int main(){ /** int a[101],b,c=0,s=0; cin>>b; for(int i=1;i<=b;i++){ cin>>a[i]; if(a[i]>c){ c=a[i]; } } for(int i=1;i<=b;i++){ if(a[i]!=c) s+=a[i]; } cout<<s; int n,a[100000]={0},b; cin>>n; for(int i =1;i<=n*3;i++){ cin>>b; a[b]++; } int max=0,x; for(int i =1;i<=n;i++){ if(a[i]>max){ max=a[i]; x=i; } } cout<<x; int a=0,b[4]={0},n=0; while(a!=-1){ cin>>a; if(a>=1 and a<=3){ b[a]++; } n++; } cout<<"A="<<b[1]<<endl; cout<<"B="<<b[2]<<endl; cout<<"C="<<b[3]<<endl; cout<<"Tot="<<n-1<<endl; if(b[1]>(n-1)/2){ cout<<"A-yes"; }else if(b[2]>(n-1)/2){ cout<<"B-yes"; }else if(b[3]>(n-1)/2){ cout<<"C-yes"; }else{ cout<<"all-NO"; } int n,m,a[1000],j=1;//n代表数的个数，m代表查找的次数 cin>>n>>m; for(int i =1;i<=n;i++){ cin>>a[i]; } for(int i =1;i<=m;i++){ j=a[j]; cout<<j<<" "; }**/ cout<<1993; return 0; }