paste bin
Author
Language
C++
Plain text
Accesslog
Action script
Ada
Apache
Arduino
Armasm
Autohotkey
Awk
Bash
Basic
Brainfuck
C
Clojure
Cmake
C#
css
D
Delphi
Dockerfile
Erlang
Fortran
F#
Gauss
Go
Gradle
Graphql
Groovy
Haskell
Ini
Java
JavaScript
json
Julia
Kotlin
Lasso
LaTeX
Leaf
lisp
llvm
Lua
Makefile
Markdown
Mathematica
Matlab
Nginx
Objective-C
Ocaml
Oxygene
Perl
PgSQL
php
Powershell
Processing
Profile
Properties
Puppet
Purebasic
Python
Q
QML
R
Ruby
Rust
Scala
Scheme
Scilab
Shell
Smalltalk
SQL
Swift
Typescript
VB.NET
VB Script
Verilog
Vim
Wasm
x86asm
Xml
Xquery
Yaml
source code:
#include <cstdio> #include <algorithm> using std::sort; using std::binary_search; int main(void) { int *a,i,N,K; scanf("%d",&N); a=new int [N]; for (i=0;i<N;i++) scanf("%d",a+i); sort(a,a+N); scanf("%d",&K); for(i=0;i<N-1;i++) { if(binary_search(a+i+1,a+N,K-a[i])) { printf("%d %d\n",a[i],K-a[i]); break; } } if(i==N-1) printf("No\n"); delete [] a; return 0; }
comment: