Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,020 | (eval-when (:compile-toplevel :load-toplevel :execute)
(sb-int:defconstant-eqx opt
#+swank '(optimize (speed 3) (safety 2))
#-swank '(optimize (speed 3) (safety 0) (debug 0))
#'equal)
#+swank (ql:quickload '(:cl-debug-print :fiveam) :silent t)
#-swank (set-dispatch-macro-character
#\# #\> (... | 1,755 |
Project_CodeNet | 2,020 | #-swank
(unless (member :child-sbcl *features*)
"I refered from https://competitive12.blogspot.com/2020/03/common-lisp.html thank you!"
(quit
:unix-status
(process-exit-code
(run-program *runtime-pathname*
`("--control-stack-size" "128MB"
"--noinform" "--disable-ldb" "-... | 1,688 |
Project_CodeNet | 2,020 | import java.util.ArrayList;
import java.util.Collections;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
// write your code here
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
long[] A = new long[N];
ArrayList<PairInt> p ... | 469 |
Project_CodeNet | 2,020 | import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.io.BufferedWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.Writer;
import java.io.OutputStreamWri... | 1,204 |
Project_CodeNet | 2,020 |
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.*;
public class Main {
long MOD = (long) 1e9 + 7;
InputStream in;
OutputStream out;
public Main() {
this(System.in, System.out);
}
public Main(InputStream in, OutputStream out) {
... | 632 |
Project_CodeNet | 2,020 | import java.util.Arrays;
import java.util.Scanner;
class Main {
static Long[][] dp;
static int INF = (int) 1e9 + 7;
static Integer[][] arr;
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
int N = s.nextInt();
arr = new Integer[N][2];
for(int ... | 284 |
Project_CodeNet | 2,020 | import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Comparator;
import java.util.InputMismatchException;
public class Main {
InputStream is;
PrintWriter out;
String INPUT = "";
private static final long... | 1,337 |
Project_CodeNet | 2,020 | import java.util.*;
public class Main {
public static void main(String [] args) {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
ArrayList<Tuple> A = new ArrayList<>();
for(int i=1;i<=N;i++){
int value = sc.nextInt();
Tuple T = new Tuple();
... | 380 |
Project_CodeNet | 2,020 | import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int N = scanner.nextInt();
Number[] numbers = new Number[N];
for (int i = 0; i < N; i++) numbers[i] = new Number(i, scanner.nextInt());
Arrays... | 360 |
Project_CodeNet | 2,020 | import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Arrays;
public class Main {
public static void main(String[] args) throws Exception {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(br.readLine());
String[] line = br.re... | 375 |
Project_CodeNet | 2,020 | import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.List;
import java.util.StringTokenizer;
import java.io.BufferedReader;
impo... | 1,023 |
Project_CodeNet | 2,020 | import java.util.*;
import java.io.*;
public class Main {
static int N;
static long[][] memo;
static ArrayList<Infant> infants;
public static void main(String[] args) {
FastScanner sc = new FastScanner();
PrintWriter out = new PrintWriter(System.out);
N =sc.nextInt();
long[] A = new long[N];
for(in... | 964 |
Project_CodeNet | 2,020 | import java.util.*;
public class Main{
static final int MOD = (int)1e9+7;
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int n = Integer.parseInt(sc.next());
int[] a = new int[n];
long[] b = new long[n];
for(int i=0; i<n; i++){
... | 355 |
Project_CodeNet | 2,020 | import java.util.*;
public class Main {
Scanner sc = new Scanner(System.in);
List<Pair> list = new ArrayList<>();
public static void main(String[] args) {
new Main().run();
}
void run() {
int n = sc.nextInt();
long[][] dp = new long[n+1][n+1];
long[] arr = new l... | 364 |
Project_CodeNet | 2,020 | import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.PrintStream;
import java.util.Arrays;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Objects;
import java.util.StringTokenizer;
import java.io.BufferedReader;
i... | 1,118 |
Project_CodeNet | 2,020 | import java.util.*;
public class Main {
static long mod = 1000000007;
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
long[] a = new long[n];
List<P> list = new ArrayList<>();
for (int i = 0; i < n; i++) {
a... | 356 |
Project_CodeNet | 2,020 | //--- pE ---//
import java.util.*;
import java.lang.*;
import java.io.*;
public class Main {
public static void main (String[] args) throws java.lang.Exception {
new Solution();
}
}
class Solution {
Reader reader;
PrintWriter out;
public Solution() {
reader = new Reader();
out = new PrintWriter(System.out);
... | 592 |
Project_CodeNet | 2,020 | import java.util.Arrays;
import java.util.Scanner;
public class Main {
static class P implements Comparable<P>{
int idx;
long val;
public P(int i , long v) {
idx = i;
val = v;
}
@Override
public int compareTo(P o) {
return Long.compare(o.val, val);
}
}
public static void main(String[] args) {... | 393 |
Project_CodeNet | 2,020 |
import java.io.*;
import java.math.BigInteger;
import java.util.*;
class Main {
static long sx = 0, sy = 0, mod = (long) (1e9 + 7);
static ArrayList<Integer>[] a;
static long[][] dp;
static long[] fa;
static long[] farr;
public static PrintWriter out;
static ArrayList<pair> pa = new ArrayList<>();
static l... | 1,883 |
Project_CodeNet | 2,020 |
import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int n = Integer.parseInt(scan.next());
AObj[] a = new AObj[n];
for (int i = 0; i < n; i++) {
a[i] = new AObj(i, Integ... | 370 |
Project_CodeNet | 2,020 | import java.io.*;
import java.util.*;
import java.util.function.*;
class Child {
Child(int x, int a) {
this.x = x;
this.a = a;
}
int x;
int a;
long happiness(long moveTo) {
return a * Math.abs(moveTo - x);
}
}
final class Solver {
static final Solver INSTANCE = new Solver();
void solve(Supplier<Strin... | 468 |
Project_CodeNet | 2,020 | import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Comparator;
import java.util.InputMismatchException;
import java.util.Iterator;
import java.util.NoSuchElementException;
import java.util.stream.IntStream;
public c... | 2,017 |
Project_CodeNet | 2,020 | import java.util.*;
public class Main
{
public static void main(String [] args)
{
Scanner sc = new Scanner(System.in);
int n = sc.nextInt(); Student[] a = new Student[n];
for (int i = 0; i < n; i++) a[i] = new Student(i, sc.nextInt());
Arrays.sort(a); long [][] dp = new long [n+1... | 420 |
Project_CodeNet | 2,020 |
import java.io.BufferedReader;
import java.io.Closeable;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Comparator;
import java.util.List;
import java.util.StringTokenizer;
public class Main implements ... | 591 |
Project_CodeNet | 2,020 | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
long a[] = new long[n];
List<P> ls = new ArrayList<>(n);
for (int i = 0; i < n; i++) {
a[i] = sc.nextInt();
ls.add(new P(i, a[i]));
}
sc.... | 430 |
Project_CodeNet | 2,020 | import java.util.*;
public class Main {
public static void main (String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
Person[] persons = new Person[n];
for (int i = 0; i < n; i++) {
persons[i] = new Person(i, sc.nextInt());
}
Arrays.sort(persons);
long[][] dp = new long[n + ... | 383 |
Project_CodeNet | 2,020 | import java.util.*;
public class Main{
public static List<Integer> P;
public static void main(String args[]){
Scanner scanner = new Scanner(System.in);
int N = scanner.nextInt();
ArrayList<int[]> a = new ArrayList<>();
for(int i=0; i<N; i++){
int[] in = new int[2];
... | 327 |
Project_CodeNet | 2,020 | import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.util.Arrays;
import java.util.stream.LongStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.BufferedOutputStream;
import java.io.UncheckedIOException;
import ja... | 2,155 |
Project_CodeNet | 2,020 | import java.io.*;
import java.util.*;
public class Main {
public static final long mod = (long)1e9+7;
public static final long INF = Long.MAX_VALUE/2;
public static final int inf = Integer.MAX_VALUE/2;
static void solve(InputReader in, PrintWriter out){
int n = in.ni();
long a;
... | 784 |
Project_CodeNet | 2,020 | import java.io.*;
import java.util.*;
class Child{
int id;
long a;
public Child(int id, long a) {
super();
this.id = id;
this.a = a;
}
}
public class Main {
static InputStream is;
static PrintWriter out;
static String INPUT = "";
static final long mod = (long) 1e9 + 7;
static final int dx[] = { -1, 0,... | 4,998 |
Project_CodeNet | 2,020 | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Comparator;
import java.util.StringJoiner;
import java.util.StringTokenizer;
import java.util.function.IntUnaryOperator;
import java.util.function.LongUnaryO... | 1,137 |
Project_CodeNet | 2,020 | import java.io.*;
import java.util.*;
class Child implements Comparable<Child> {
final long a;
final int index;
Child(long a, int index) {
this.a = a;
this.index = index;
}
public int compareTo(Child child) {
return Long.compare(child.a, this.a);
}
}
public class Main {
private static long... | 2,126 |
Project_CodeNet | 2,020 | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
long[][] a = new long[n][2];
for(int i = 0; i < n; i++) {
a[i][0] = (long)(i + 1);
a[i][1] = sc.nextLong();
}
... | 417 |
Project_CodeNet | 2,020 | import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Arrays;
public class Main {
public static void main(String[] args) throws Exception {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String[] sa = br.readLine().split(" ");
int n = Integer.parseInt(sa[0]... | 431 |
Project_CodeNet | 2,020 | import java.io.*;
import java.util.*;
public class Main{
static long [][] memo;
public static void main(String[] args) {
MyScanner sc = new MyScanner();
out = new PrintWriter(new BufferedOutputStream(System.out));
// Start writing your solution here. ----------------------------------... | 587 |
Project_CodeNet | 2,020 | import java.util.*;
import java.io.*;
public class Main {
public static void main(String[] args) throws Exception{
int num = 998244353;
// TODO Auto-generated method stub
BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
PrintWriter out = new PrintWriter(System.out);
int n = Inte... | 563 |
Project_CodeNet | 2,020 | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int[] A = new int[N];
ArrayList<int[]> list = new ArrayList<int[]>();
for (int i=0;i<N;i++) {
A[i] = sc.nextInt();
int[] add = {i, A[i]};
list.add(add);
}
... | 325 |
Project_CodeNet | 2,020 |
import java.awt.Point;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintStream;
import java.io.PrintWriter;
import java.io.Serializable;
import java.math.BigInteger;... | 30,544 |
Project_CodeNet | 2,020 | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class Main
{
public static void main(String[] args) {
new Thread(null, new Runnable() {
public void run() {
solve();
}
... | 1,146 |
Project_CodeNet | 2,020 | import java.lang.reflect.Array;
import java.util.Arrays;
import java.util.Scanner;
import java.util.TreeSet;
public class Main {
class Student implements Comparable<Student>{
long A, X;
Student(long A, long X){
this.A = A;
this.X = X;
}
@Override
p... | 426 |
Project_CodeNet | 2,020 | import java.util.Arrays;
public class Main {
private static void solve() {
int n = ni();
int[] a = na(n);
int[][] b = new int[n][2];
for (int i = 0; i < n; i++) {
b[i][0] = i;
b[i][1] = a[i];
}
Arrays.sort(b, (o1, o2) -> o2[1] - o1[1]);
... | 928 |
Project_CodeNet | 2,020 | import java.util.*;
import java.io.*;
import java.math.*;
public class Main {
static boolean DEBUG;
public static void main(String[] args) {
DEBUG = args.length > 0 && args[0].equals("-DEBUG");
Solver solver = new Solver();
solver.solve();
solver.exit();
}
static class FastScanner {
private final InputSt... | 12,283 |
Project_CodeNet | 2,020 | import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Comparator;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args) throws IOException {
Main mainObj = new Main();
mainObj.solve();
}
... | 738 |
Project_CodeNet | 2,020 | /*
If you want to aim high, aim high
Don't let that studying and grades consume you
Just live life young
******************************
If I'm the sun, you're the moon
Because when I go up, you go down
*******************************
I'm working for the day I will surpass you
https://www.a2oj.com/Ladder16.html
*/
impor... | 457 |
Project_CodeNet | 2,020 | import java.io.*;
import java.util.*;
import java.util.function.*;
public class Main {
static MyReader sc = new MyReader();
static PrintWriter out = new PrintWriter(System.out);
public static void main(String[] args) throws IOException {
solve();
out.close();
}
static void solve() throws IOException {
in... | 2,001 |
Project_CodeNet | 2,020 | import java.io.*;
import java.util.*;
import java.math.*;
public class Main {
static class Pair implements Comparable<Pair>{
long a;
int b;
public Pair(long x,int y){a=x;b=y;}
public Pair(){}
public int compareTo(Pair p){
return Long.compare(p.a, a);
}
}
static class TrieNode{
TrieNode... | 956 |
Project_CodeNet | 2,020 | import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.NoSuchElementException;
import java.util.function.DoubleUnaryOperator;
import java.util.function.IntUnaryOperator;
import java.util.function.LongUnaryOperator;
public class Main {
public s... | 3,275 |
Project_CodeNet | 2,020 | import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.*;
public class Main {
static final long MOD=998244353;//1000000007;
public static void main(String[] args) {
PrintWriter out = new PrintWriter(System.out);
InputReader sc=new InputReader(System.in);
int N=sc.n... | 1,343 |
Project_CodeNet | 2,020 | import java.io.*;
import java.text.*;
import java.util.*;
public class Main {
static InputReader sc = new InputReader(System.in);
static PrintWriter out = new PrintWriter(System.out);
public static void main(String[] args) throws IOException {
solver s = new solver();
int t = 1;
w... | 1,056 |
Project_CodeNet | 2,020 | //make sure to make new file!
import java.io.*;
import java.util.*;
public class Main{
public static void main(String[] args)throws IOException{
BufferedReader f = new BufferedReader(new InputStreamReader(System.in));
PrintWriter out = new PrintWriter(System.out);
int n = Integer.parseI... | 501 |
Project_CodeNet | 2,020 | //master
import java.io.*;
import java.util.*;
class Child {
int index;
int power;
public Child(int index, int power) {
this.index = index;
this.power = power;
}
}
public class Main {
static int MOD = 1000000000 + 7;
public static int MAX = 1000000;
public static long[] fac... | 1,313 |
Project_CodeNet | 2,020 |
import java.util.Arrays;
import java.util.Collections;
import java.util.Objects;
import java.util.Scanner;
class Pair implements Comparable<Pair> {
int pos;
long value;
Pair(int pos, long value) {
this.pos = pos;
this.value = value;
}
@Override
public boolean equals(Object o) ... | 501 |
Project_CodeNet | 2,020 | import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.stream.IntStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.AbstractCollection;
import java.util.stream.Stream;
import java.util.StringTokenizer;
import ... | 1,183 |
Project_CodeNet | 2,020 | import java.io.*;
import java.math.*;
import java.util.*;
import java.lang.*;
public class Main implements Runnable {
static class InputReader {
private InputStream stream;
private byte[] buf = new byte[1024];
private int curChar;
private int numChars;
private SpaceCharFilte... | 1,371 |
Project_CodeNet | 2,020 |
import java.util.Arrays;
import java.util.Collections;
import java.util.Scanner;
public class Main {
static class Pair implements Comparable<Pair> {
long a, b;
Pair(long a, long b) {
this.a = a;
this.b = b;
}
public int compareTo(Pair p) {
if (a > p.a)
return 1;
else if (a < p.a)
retu... | 455 |
Project_CodeNet | 2,020 | import java.util.*;
import java.io.*;
public class Main {
public static void main(String[] args) throws Exception {
FastScanner sc = new FastScanner(System.in);
PrintWriter pw = new PrintWriter(System.out);
int n = sc.nextInt();
Node[] a = new Node[n];
for(int i = 0; i < n;... | 840 |
Project_CodeNet | 2,020 | import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.net.ConnectException;
import java.rmi.dgc.Lease;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Deque;
import java.util.HashMap;
import java.u... | 1,484 |
Project_CodeNet | 2,020 | import java.util.*;
import java.util.Arrays;
import java.util.ArrayList;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
int[] A = new int[N];
ArrayList<int[]> list = new ArrayList<>();
for(int i = 0; i... | 371 |
Project_CodeNet | 2,020 | //package AtCoder_163;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Collections;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args)throws IOException {
BufferedReader br=n... | 369 |
Project_CodeNet | 2,020 | import java.io.IOException;
import java.io.InputStream;
import java.util.Arrays;
import java.util.Comparator;
import java.util.NoSuchElementException;
public class Main {
public static void main(String[] args) {
new Main().run();
}
final long MOD=(long)1e9+7;
long pow(long a,long n) {
return n==0?1:(pow(a*... | 995 |
Project_CodeNet | 2,020 | import java.io.*;
import java.util.Arrays;
import java.util.InputMismatchException;
public class Main implements Runnable
{
final static int mod = (int) (1e9 + 7);
@Override
public void run() {
InputReader in = new InputReader(System.in);
PrintWriter w = new PrintWriter(System.out);
... | 1,438 |
Project_CodeNet | 2,020 | import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.InputStream;
... | 613 |
Project_CodeNet | 2,020 | import java.io.*;
import java.math.BigDecimal;
import java.math.BigInteger;
import java.util.*;
public class Main {
static Input in = new Input(System.in);
static PrintWriter out = new PrintWriter(System.out);
public static void main(String[] args) {
int N = in.nextInt();
... | 545 |
Project_CodeNet | 2,020 | import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
long[][] a = new long[n][2];
for(int i = 0; i < n; i++) {
a[i][0] = (long)(i + 1);
a[i][1] = sc.nextLong();
}
Arrays.sort(a, new Comparator<l... | 450 |
Project_CodeNet | 2,020 | import java.util.*;
public class Main {
void run() {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[][] arr = new int[n][2];
for (int i = 0; i < n; i++) {
arr[i] = new int[]{i, sc.nextInt()};
}
Arrays.sort(arr, (a1, a2) -> a2[1] - a1[1]);... | 433 |
Project_CodeNet | 2,020 | import java.util.*;
import java.io.*;
public class Main {
static List<int[]> list;
static long find(int s,int l,int n,long [][] dp){
if(s+l==n)return 0;
if(dp[s][l]!=-1)return dp[s][l];
int currIndex=s+l;
int currElement=list.get(currIndex)[1];
int elementIndex=list.g... | 1,231 |
Project_CodeNet | 2,020 |
import java.util.Comparator;
import java.util.List;
import java.util.Scanner;
import java.util.stream.Collectors;
import java.util.stream.IntStream;
import java.util.stream.LongStream;
public class Main {
public static void main(final String[] args) {
final Scanner scanner = new Scanner(System.in);
... | 402 |
Project_CodeNet | 2,020 |
import java.io.*;
import java.util.*;
public class Main {
private void solve() {
int n = sc.nextInt();
List<int[]> a = new ArrayList<>();
for (int i = 0; i < n; i++) {
int[] p = new int[2];
p[0] = sc.nextInt();
p[1] = i;
a.add(p);
}
... | 634 |
Project_CodeNet | 2,020 | import java.util.Comparator;
import java.util.Scanner;
import java.util.TreeSet;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int a[] = new int[n];
for(int i=0;i<n;i++) {
a[i] = sc.nextInt();
}
TreeSet<Integer> ts = new TreeSet<... | 379 |
Project_CodeNet | 2,020 | type SortDataType=Longint;
function SortCmp(const x,y:SortDataType):Boolean;forward;
procedure SortImpl(var A:Array of SortDataType;L,R:Longint);
var
tmp:SortDataType;
mid,il,ir:Longint;
begin
if R-L<20 then begin
for ir:=R-1 downto L+1 do for il:=L to ir-1 do if SortCmp(A[il+1],A[il])then begin
tmp:=A[il];
... | 692 |
Project_CodeNet | 2,020 | import strutils,sequtils
import algorithm,sets,lists,critbits,sequtils,intsets,strutils,tables,math,heapqueue,future,deques
let read = iterator: string {.closure.} =
while true:
for s in stdin.readLine.split:
yield s
let
N = read().parseInt
ai = stdin.readLine.split.map parseInt
a_set = ai.toHashSet... | 372 |
Project_CodeNet | 2,020 | #{{{ header
{.hints:off warnings:off optimization:speed.}
import algorithm, sequtils, tables, macros, math, sets, strutils, future
when defined(MYDEBUG):
import header
import streams
proc scanf(formatstr: cstring){.header: "<stdio.h>", varargs.}
#proc getchar(): char {.header: "<stdio.h>", varargs.}
proc nextInt(): ... | 952 |
Project_CodeNet | 2,020 | import algorithm, macros, math, sequtils, strutils
# import bitops, lenientops, deques,
# heapqueue, sets, tables, sugar
let read* = iterator: string {.closure.} =
while true: (for s in stdin.readLine.split: yield s)
template input*(T: static[typedesc]): untyped =
when T is int: read().parseInt
elif T is floa... | 767 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep_(i, n, m) for (int i = n; i < (int)(m); i++)
#define all(v) v.begin(), v.end()
#define int long long
#define stoi stoll
//#define _GLIBCXX_DEBUG
signed main() {
int N; cin >> N;
vector<pair<int,int>> A(... | 380 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i,s,n) for(int i=s;i<n;i++)
#define NUM 2520
#define INF (1LL<<50)
#define DEBUG 0
#define mp(a,b) make_pair(a,b)
#define SORT(V) sort(V.begin(),V.end())
#define PI (3.141592653589794)
#define TO_STRING(VariableName) # VariableName
#de... | 642 |
Project_CodeNet | 2,020 | #include "bits/stdc++.h"
#define _USE_MATH_DEFINES
#include <math.h>
using namespace std;
using LL = long long;
using VLL = std::vector<LL>;
using VVLL = std::vector<VLL>;
using VVVLL = std::vector<VVLL>;
using LD = long double;
using VLD = std::vector<LD>;
using VVLD = std::vector<VLD>;
using VVVLD = std::vector<VVL... | 7,425 |
Project_CodeNet | 2,020 | #define _CRT_SECURE_NO_WARNINGS
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <func... | 3,765 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
// #define int long long // intで書いたけど心配なときにlong longに変換する
struct Fast {Fast(){std::cin.tie(0);ios::sync_with_stdio(false);}} fast;
/* short */
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define Fi first
#define Se second
#define ALL(v) begin(v), end... | 1,138 |
Project_CodeNet | 2,020 | #include<iostream>
#include<string>
#include<vector>
#include<queue>
#include<algorithm>
#include<map>
#include<set>
#include<cmath>
#include<iomanip>
#include<stack>
typedef long long ll;
#define rep(i,n) for(int i=0;i<(n);i++)
#define pb push_back
#define sz(a) (int)a.size()
using namespace std;
int main() {
int n;... | 322 |
Project_CodeNet | 2,020 | // cpp219 - the 712534
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define pb push_back
#define fs first
#define sc second
#define mp make_pair
using namespace std;
const ll base = 7;
const ll N = 2e3 + 9;
const ll mod = 1e9 + 7;
typedef pair<ll,ll> LL;
ll n,dp[N][N],i,j;
LL a[N];
bool lf(LL x... | 461 |
Project_CodeNet | 2,020 | /* ****TCIITB**** */
#include<bits/stdc++.h>
#define io ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ll int long long
#define pb push_back
#define endl '\n'
#define pii pair<int long long,int long long>
#define vi vector<int long long>
#define ... | 398 |
Project_CodeNet | 2,020 | #include "bits/stdc++.h"
#define hhh cerr<<"hhh"<<endl
#define see(x) cerr<<(#x)<<'='<<(x)<<endl
using namespace std;
typedef long long ll;
typedef pair<int,int> pr;
inline int read() {int x=0,f=1;char c=getchar();while(c!='-'&&(c<'0'||c>'9'))c=getchar();if(c=='-')f=-1,c=getchar();while(c>='0'&&c<='9')x=x*10+c-'0',c=ge... | 421 |
Project_CodeNet | 2,020 | #define _USE_MATH_DEFINES
#include<iostream>
#include<vector>
#include<set>
#include<queue>
#include<map>
#include<algorithm>
#include<cstring>
#include<string>
#include<cassert>
#include<cmath>
#include<climits>
#include<iomanip>
#include<stack>
#include<unordered_map>
#include<bitset>
#include<limits>
#include<comple... | 4,969 |
Project_CodeNet | 2,020 | #include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <ctime>... | 505 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define ll long long
#define pll pair<ll, ll>
#define ull unsigned long long
using namespace std;
const int maxx = 2007;
const ll mod1 = 1e7;
const ll mod = 1e9 + 7;
const ll base = 311;
const ll base1 = 113;
const ll maxn = 1e6 + 7;
bool check;
ll t, T, n, a[maxn], b[maxn], m1, m, tong, r, ans,... | 735 |
Project_CodeNet | 2,020 | #include"bits/stdc++.h"
#include<unordered_set>
#include<unordered_map>
#include<random>
using namespace std;
typedef long long ll;
const ll MOD = (ll)(1e9+7);
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for(int (i)=0; (i)<(int)(n); (i)++)
int dx[4]={ 1,0,-1,0 };
in... | 315 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
typedef int64_t Int;
int main(){
Int N;
cin >> N;
vector<pair<Int,Int>> infant;
rep(i,N) {
Int A;
cin >> A;
infant.push_bac... | 330 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0;i<(n);i++)
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
using vint=vector<int>;
using pint=pair<int,int>;
using vpint=vector<pint>;
template<typenam... | 490 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#ifdef DEBUG
#define FPEN freopen("in.txt", "r", stdin);
#define TEST(...) \
{ printf("! "), printf(__VA_ARGS__); }
#else
#define TEST(...)
#define FPEN
#endif
const int maxn = 200009;
typedef long long i64;
t... | 700 |
Project_CodeNet | 2,020 | #define rep(i, n) for(ll i = 0; i < n; i++)
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using P = pair<int, int>;
ll dp[2001][2001];
inline void chmax(ll& a, ll b) {
a = max(a,b);
}
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i,n) cin >> a[i];
dp[0][0] = 0;
vector<P> p;
rep(i,n... | 253 |
Project_CodeNet | 2,020 | // https://atcoder.jp/contests/abc163/tasks/abc163_e
#include "algorithm"
#include "bitset"
#include "cmath"
#include "functional"
#include "iomanip"
#include "iostream"
#include "map"
#include "numeric"
#include "queue"
#include "set"
#include "string"
#include "unordered_map"
#include "vector"
#define rep(i, to) for... | 1,963 |
Project_CodeNet | 2,020 | #include <algorithm>
#include <array>
#include <iostream>
#include <utility>
int main()
{
int n;
std::cin >> n;
constexpr int size = 2001;
std::array<std::pair<long long, long long>, size> score = {std::make_pair(0, 0)};
for (int i = 0; i < n; ++i)
{
... | 354 |
Project_CodeNet | 2,020 | #include<iostream>
#include<algorithm>
#include<numeric>
#include<cstdint>
int const MAXN = 2000;
int64_t A[MAXN], dp[MAXN+1][MAXN+1];
int N, ix[MAXN];
int64_t iabs(int64_t i) { return std::max(i, -i); }
int main() {
std::cin >> N;
for(int i = 0; i < N; ++i) std::cin >> A[i];
std::iota(ix, ix+N, 0);
std::sor... | 339 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
typedef long long lli;
#define mod 1000000007
#define mod2 998244353
#define fori(n) for (int i = 0; i < n; i++)
#define forj(n) for (int j = 0; j < n; j++)
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define fast ios::sync_with_stdio(0), cin.... | 629 |
Project_CodeNet | 2,020 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, m, n) for(int(i) = (int)(m); i < (int)(n); ++i)
#define rep2(i, m, n) for(int(i) = (int)(n)-1; i >= (int)(m); --i)
#define REP(i, n) rep(i, 0, n)
#define REP2(i, n) rep2(i, 0, n)
#define all(hoge) (hoge).begin(), (hoge).end()
#define en '\n'
using ll = long ... | 766 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
int main() {
int64_t n,i,j,m=0;
cin>>n;
vector<vector<int64_t>> a(n,vector<int64_t>(2));
vector<vector<int64_t>> dp(n+1,vector<int64_t>(n+1));
for(i=0;i<n;i++) {
cin>>a.at(i).at(0);
a.at(i).at(1)=i+1;
}
sort(a.begin(),a.end());
reverse(a.begin(),a.end... | 377 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
using namespace std;
/// ----------------------------- (Debug) ------------------------------
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct r... | 887 |
Project_CodeNet | 2,020 | #include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <deque>
#include <queue>
#include <array>
#include <set>
#include <map>
#include <cmath>
#include <complex>
#include <algorithm>
#include <numeric>
#include <utility>
#include <tuple>
#include <bitset>
#include <cstdint>
#include <casse... | 460 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#define god dimasi5eks
#pragma GCC optimize("O3")
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define mod 1000000007
#define dancila 3.14159265359
#define eps 1e-9
// #define fisier 1
using namespace std;
typedef long long ll;
int add(int a, int b)
{
in... | 578 |
Project_CodeNet | 2,020 | #include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define ll long long int
#define fio ios_base::sync_with_stdio(false); cin.tie(NULL);
#de... | 2,465 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.