Problem hidden
|This problem was hidden by Editorial Board member probably because it has incorrect language|version or invalid test data, or description of the problem is not clear.|
Бодолт илгээх Бүх бодолтууд Шилдэг бодолтууд PDF Жагсаалт руу буцах

RGB7509 - Массивт байгаа эсэх

Өгагдсөн нэг хэмжээст бүхэл тоон массивт өгөгдсөн тоо байвал YES үгүй бол NO гэж хэвлэ. Таарангуут давталтыг зогсоох.

Input

Эхний мөрөнд массивын элементийн тоо. n<=100.

Хоёр дахь мөрөнд массивын элементүүд зайгаар тусгаарлагдан өгөгдөнө. Int төрөл

Гурав дахь мөрөнд хайх бүхэл тоо.

Output

Байвал YES үгүй бол NO.

Example

Input:
5
1 2 3 4 5
2
Output:
YES
Submit solution!
Нэмсэн:Bataa
Огноо:2013-01-15
Хугацааны хязгаарлалт:1s
Эх кодын хэмжээний хязгаарлалт:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Програмчлалын хэлүүд:ADA95 ASM32 BASH BF C NCSHARP CSHARP C++ 4.3.2 CPP C99 CLPS LISP sbcl LISP clisp D ERL FORTRAN HASK ICON ICK JAVA JS-RHINO JULIA LUA NEM NICE OCAML PAS-GPC PAS-FPC PERL PHP PIKE PRLG-swi PYTHON PYPY3 PYTHON3 RUBY SCALA SCM guile ST TCL WHITESPACE
hide comments
Өмнөх 1  2  3  4  5 Дараагийн >
2024-12-09 05:46:11
choi gmo
2024-11-27 03:37:16
#include<iostream>
using namespace std;
int main(){
int i,n,a[1000],c,s=0;
cin>>n;
for(i=0; i<n; i++){
cin>>a[i];
}
cin>>c;
for (i=0; i<n; i++){
if(a[i]==c) s++;
}
if(s==0) cout<<"NO";
else cout<<"YES";
} //namuun kk
2024-11-27 02:46:07
#include <iostream>
using namespace std;
int main() {
int i,n,a[100],x,s=0;
cin>>n;
for(i=1;i<=n;i++){
cin>>a[i];
}
cin>>x;
i=1;
while(s==0 && i<=n){ if(a[i]==x) s++;
else i++;
}
if(s==1) cout<<("YES");
else cout<<("NO");
return 0;
} //huul suguud
2024-11-22 03:07:42
#include<stdio.h>
int main(){
int i,n,a[100],x,s=0;
scanf("&d",&n);
for(i=1;i<=n;i++){
scanf("%d",&a[i]);
}
scanf("%d",&x);
i=1;
while(s==0 && i<=n){ if(a[i]==x) s++;
else i++;
}
if(s==1) printf("YES");
else printf("NO");
return 0;
}
2024-11-22 03:03:56
#include<stdio.h>
int main(){
int i,n,a[100],x,s=0;
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%d",&a[i]);
}
scanf("%d",&x);
i=1;
while(s==0 && i<=n){ if(a[i]==x) s++;
else i++;
}
if(s==1) printf("YES");
else printf("NO");
return 0;
}

2024-08-14 07:58:57


Last edit: 2024-08-14 07:59:07
2024-07-02 10:45:20
#include <iostream>
using namespace std;

int main() {
int n;
cin >> n; // ???????? ?????????? ???
int arr[n];

// ???????? ???????
for (int i = 0; i < n; ++i) {
cin >> arr[i];
}

// ???? ????? ???
int x;
cin >> x;

// ????? ?????????? ????? ????? ???? ?????
bool found = true;
for (int i = 0; i < n; ++i) {
if (arr[i] == x) {
found = true;
break;
} else {
found = false;
}
}

// ????? ?????? ????? ??? ???????? ??? "NO" ??? ???????
if (found) {
cout << "YES\n";
} else {
cout << "NO\n";
}

return 0;
}

men jazdm kotaktar
2024-07-02 10:27:32
#include<stdio.h>
int main(){
int i,n,a[1000],c,s=0;
scanf("%d",&n);
for(i=0; i<n; i++){
scanf("%d",&a[i]);
}
scanf("%d",&c);
for (i=0; i<n; i++){
if(a[i]==c) s++;
}
if(s==0) printf("NO");
else printf("YES");
} MEN JAZDM
2024-05-20 07:42:36
khanbogd was cry baby but hes my ppopy freind
2024-05-10 05:47:38
tselmeg gomo tselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomo tselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomo tselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomo tselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomo tselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomo tselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomotselmeg gomo
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.