src stringlengths 95 64.6k | complexity stringclasses 7
values | problem stringlengths 6 50 | from stringclasses 1
value |
|---|---|---|---|
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*
* @author an... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*
* @author ZYCSwing
*/
public class Main {
public static void main(String[] arg... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.util.*;
import java.io.*;
public class p3sol{
static char[] c;
static int[][] dp;
static int mod = (int)1e9 + 7;
public static void main(String[] args) throws Exception{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(br.readLine());
c = new... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*/
public class Main {
public static... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.util.*;
public class GFG {
static int count=0;
public static void main (String[] args) {
Scanner ob=new Scanner(System.in);
int n;
long MOD=(long)(1e9+7);
int f=0,s=0;
n=ob.nextInt();
long dp[][]=new long[n+2][n+2];
dp[0][1]=1;
char ch='s';
char p;
for(int i=1;i<=n;i++)
{
... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.awt.*;
import java.io.*;
import java.math.*;
import java.util.*;
public class TaskC {
public static void main(String[] args) {
new TaskC().run();
}
void solve(){
int n = in.nextInt();
String s[] = new String[n];
for(int i = 0; i < n; i++) s[i] = in.next();
if(s[n-1].compareTo("f") == 0)... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.io.*;
import java.util.*;
import java.io.IOException;
import java.io.InputStream;
public class Main {
public static void main(String[] args) {
File file = new File("in.txt");
File fileOut = new File("out.txt");
InputStream inputStream = null;
OutputStream outputStream =... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.*;
import java.io.BufferedReader;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args) {
InputStream inputStream = System.in;
Ou... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.PrintStream;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;
/**
* Built using CHe... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;
/*
*/
public class C455 {
static int N;
static final int mod = 1_000_000_007;
static int[][] memo;
static int[] list;
public static... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.io.*;
import java.math.*;
import java.util.*;
public class Main {
private static final int MAX = 5000 + 10,mod = 1000000007;
private static char [] S;
private static int n;
private static Integer [] [] dp = new Integer[MAX][MAX];
private static int solve(int pos,int open){
if... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
/**
* Created by Jarek on 2017-12-30.
*/
public class PhytonIndenter {
private static Scanner scanner = new Scanner(System.in);
private static int lineCount;
private static String[] commands;
public static void main(Strin... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.util.*;
import java.io.*;
/* spar5h */
public class codeforces implements Runnable {
final static long mod = (long)1e9 + 7;
public void run() {
InputReader s = new InputReader(System.in);
PrintWriter w = new PrintWriter(System.out);
int n = s.nextInt();
char[] c = new char[n];
... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*
* @author Pradyumn
*/
public class M... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.List;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.util.Collections;
import java.io.InputStreamReader;
import java.util.ArrayList;... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.io.*;
import java.nio.file.Files;
import java.nio.file.Paths;
import java.util.*;
public class Main {
public static void main(String[] args) {
solve(System.in,System.out);
}
static void solve(InputStream inStream, PrintStream printStream) {
Scanner in = new Scanner(inStream)... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.util.*;
import java.io.*;
public class C {
static InputReader in = new InputReader(System.in);
static PrintWriter out = new PrintWriter(System.out);
public static void main(String[] args) {
int n = in.nextInt();
int[] sol = new int[n];
sol[0] = 1;
int mod = 1000000007;
int ma... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.util.Scanner;
/*
* To change this license header, choose License Headers in Project Properties.
* To change this template file, choose Tools | Templates
* and open the template in the editor.
*/
/**
*
* @author EndUser
*/
public class R455D2PC {
public static void main(String[] args) {
... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
public class C {
static int [][] memo;
static int n;
static char [] c;
static int mod = (int)1e9+7;
static... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
import java.util.concurrent.*;
public final class py_indent
{
static BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
static FastScanner sc=new FastScanner(br);
static PrintWriter out=new PrintWriter(System.out);
static Random r... | quadratic | 909_C. Python Indentation | CODEFORCES |
//package round455;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
public class C {
InputStream is;
PrintWriter out;
String INPUT = "";
void solve()
{
int n = ni();
int... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.io.BufferedReader;
import java.io.Closeable;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;
public class C {
public static void main(String[] args){
try(Scanner sc = new Scanner(System.in)){
final ... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.util.* ;
import java.io.* ;
public class PythonIndentation
{
public static void main(String args[])
{
Scanner in = new Scanner(System.in) ;
int n = in.nextInt() ;
boolean[] lst = new boolean[n] ;
for(int i=0;i<n;i++)
{
lst[i] = (in.next().equals("s"))?false:true ;
}
System.out.println(dp... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
import java.io.Writer;
import java.io.OutputStreamW... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.util.Scanner;
public class Main {
public static void main(String[] args){
long MOD = 1000000007;
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
long[][]dp = new long[n][5010];
char[] program = new char[n];
for(int i = 0; i < n; i++){
program[i] = sc.next().charAt(0);
}
... | quadratic | 909_C. Python Indentation | CODEFORCES |
/*
* Institute DA-IICT
*/
import java.io.*;
import java.math.*;
import java.util.*;
public class C
{
InputStream in;
PrintWriter out;
void solve()
{
int n=ni();
long dp[]=new long[n+1];
dp[0]=1;
for (int i=0;i<n;)
{
i++;
if (nc()=='f')
{
//boolean flag=i==1;
i++;
int k=1;
... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.io.*;
import java.util.*;
public class A{
InputStream is;
PrintWriter out;
String INPUT = "";
public void solve(){
int n=ni();
char[] arr=new char[n];
for(int i=0;i<n;i++){
arr[i]=ns().charAt(0);
}
long mod=1000000007;
long[][] memo=new long[n][n];
memo[0][0]=1L;
int k=0;
for(in... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
public class C {
static int N;
static char[... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.util.*;
import java.io.*;
import java.math.*;
public class C{
static long mod=1000000007;
static int n;
static long w[][];
static void MainMethod()throws Exception{
n=reader.nextInt();
w=new long[n+2][n+2];
for (int i=0;i<=(n+1);i++)
Arrays.fill(w[i], 0);
w[1][0]=1;
String prev,next;
p... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.io.PrintWriter;
import java.util.*;
/**
* Created by trung.pham on 28/12/17.
*/
public class C_Round_455_Div2 {
static long[][]dp;
static long MOD =(long) 1e9 + 7;
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
PrintWriter out = new PrintWriter... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.BufferedWriter;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.Input... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.io.BufferedInputStream;
import java.io.BufferedOutputStream;
import java.io.PrintWriter;
import java.util.Scanner;
public class _909C {
private static final int MOD = 1000000007;
private static void solve(Scanner scan, PrintWriter pw) {
int n = scan.nextInt();
scan.nextLine();
... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.util.Scanner;
public class C {
private static final int MOD = (int) 1e9 + 7;
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int[][] DP = new int[n][n + 1];
DP[0][0] = 1;
for (int i = 0; i < n - 1; i++) ... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;
public class C {
//dp[firstInLoop][index][indentLevel]
private static int[][][] dp;
private static boolean[] wasLoop;
private static... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.BufferedWriter;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.Input... | quadratic | 909_C. Python Indentation | CODEFORCES |
//package educational.round35;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
public class D {
InputStream is;
PrintWriter out;
String INPUT = "";
void solve()
{
int n = ... | quadratic | 911_D. Inversion Counting | CODEFORCES |
/**
* @author: Mehul Raheja
*/
import java.util.*;
import java.io.*;
public class p4 {
/*
Runtime = O()
*/
static int N, M, K;
static String s;
static StringTokenizer st;
static int[] d;
public static void main(String[] args) throws Exception {
BufferedReader br = new ... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.util.*;
import java.text.*;
import java.io.*;
import java.math.*;
public class code5 {
InputStream is;
PrintWriter out;
static long mod=pow(10,9)+7;
static int dx[]={0,0,1,-1},dy[]={1,-1,0,0};
String arr[];
long dp[][];
void solve() throws IOException
{
int n=ni();
int a[]=na(n);
int q=ni();
... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.util.*;
public class A {
public static void main(String args[]) {
Scanner sc = new Scanner (System.in);
int n = sc.nextInt();
int a[] = new int[n+1];
for(int i=1 ; i<=n ; i++) a[i] = sc.nextInt();
int cnt = 0;
for(int i=1 ; i<=n ; i++) {
for(int j=i-1 ; j>=1 ; j--) {
if(a[i]<a[j])
+... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
import java.lang.*;
import static java.lang.Math.*;
public class Main implements Runnable
{
static class InputReader
{
private InputStream stream;
private byte[] buf = new byte[1024];
private int curChar;
private int numChars;
private SpaceCharF... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.io.*;
import java.util.*;
public class Problem911D {
public static void main(String args[]) throws IOException {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt(), i, j;
int ar[] = new int[n];
int inv = 0;
... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual soluti... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
public class InversionCounting {
public static void main(String[] args) throws IOException{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
br.readLine();
int[] a = Arrays.... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual soluti... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;
public class Main {
static PrintWriter out;
static InputReader ir;
static void solve() {
int n=ir.nextInt();
int[] a=ir.nextIntArray(n);
int m... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;
import java.util.stream.Stream;
public class Main implements Runnable {
static final double time = 1e9;
static final int MOD = (int) 1e9 + 7;
static final long mh = Long.MAX_... | quadratic | 911_D. Inversion Counting | CODEFORCES |
//>>>BaZ<<<//
import java.util.*;
import java.io.*;
import static java.lang.Math.*;
public class Main
{
static int dx[] = {-1,1,0,0};
static int dy[] = {0,0,1,-1};
static long MOD = 1000000007;
static int INF = Integer.MAX_VALUE/10;
static PrintWriter pw;
static Reader scan;
//static MyFil... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.util.*;
public class maestro{
public static long inversions(long[] arr) {
long x = 0;
int n = arr.length;
for (int i = n - 2; i >= 0; i--) {
for (int j = i + 1; j < n; j++) {
if (arr[i] > arr[j]) {
x++;
//temp++;... | quadratic | 911_D. Inversion Counting | CODEFORCES |
//package educational35;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class ProblemD {
public static PrintWriter out = new PrintWriter(new OutputStreamWriter(Syste... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.io.PrintWriter;
import java.util.Scanner;
public class D {
public void solve(Scanner in, PrintWriter out) {
int n = in.nextInt();
int[] a = new int[n + 1];
for(int i = 1; i <= n; ++i) a[i] = in.nextInt();
int[] rangeInv = new int[n + 1];
BIT bit = new BIT(n + 1);
for(int i = 1; i <= n; +... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import javafx.util.Pair;
import java.util.*;
import static java.lang.Math.floor;
import static java.lang.Math.min;
public class Main {
private static Scanner scanner = new Scanner(System.in);
public static void main(String[] args) {
int n = scanInt();
List<Integer> a = scanList(n);
... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.*;
public class Main {
static int bit[];
static int array[];
public static void main(String[] args) throws Exception {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = Integer... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual soluti... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*
* @author Pradyumn
*/
public class M... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) throws IOException {
Reader.init(System.in);
int n = Reader.nextInt();
int[] arr = new int[n];
int initial = 0;
for (int i = 0; i < n; i++) arr[i] = Reader.nextInt();
... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.BufferedWriter;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.Input... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.io.*;
import java.util.*;
public class utkarsh{
BufferedReader br;
PrintWriter out;
int game(int s, int mid, int e, int[] a){
int i, j, n, m;
n = mid - s + 1;
m = e - mid;
int b[] = new int[n];
int c[] = new int[m];
for(i = 0; i < n; i++) b[i] = a[s + i];
for(j = 0; j < m; j++) c[j] = a[m... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.io.*;
import java.util.*;
public class CODEFORCES
{
@SuppressWarnings("rawtypes")
static InputReader in;
static PrintWriter out;
static void solve()
{
int n = in.ni();
int arr[] = new int[n];
for (int i = 0; i < n; i++)
arr[i] = in.ni();
int cnt = 0;
for (int i = 0; i < n; i++)
{
fo... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Scanner;
public class D911 {
public static long total = 0;
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
ArrayList<Integer> temp = new ArrayList<>();
int[... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.util.*;
import java.io.*;
public class P911d {
private static void solve() {
int n = nextInt();
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = nextInt();
}
int cnt = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
if (a[i] > a[... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.awt.geom.*;
import java.io.*;
import java.math.*;
import java.text.*;
import java.util.*;
import java.util.regex.*;
/*
br = new BufferedReader(new FileReader("input.txt"));
pw = new PrintWriter(new BufferedWriter(new FileWriter("output.txt")));
br = new BufferedReader(new InputStreamReader(Sys... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
import java.io.Writer;
import java.io.OutputStreamW... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.io.*;
import java.util.*;
public class Mainn {
public static class InputReader {
public BufferedReader reader;
public StringTokenizer tokenizer;
public InputReader() {
reader = new BufferedReader(new InputStreamReader(System.in), 32768);
tokenizer = null;
}
public InputReader(InputStrea... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.io.BufferedReader;
import java.io.Closeable;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.math.BigInteger;
import java.util.Arrays;
import java.util.HashMap;
import java.util.LinkedList;
import java.util.Scanner;
import java.util.StringTokenizer;
pub... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.io.*;
import java.util.*;
public class A{
InputStream is;
PrintWriter out;
String INPUT = "";
public void solve(){
int n=ni();
int ans=0;
int[] arr=na(n);
for(int i=0;i<n;i++){
for(int j=i+1; j<n; j++){
if(arr[i] > arr[j]){
ans^=1;
}
}
}
int m=ni();
while(m-->0){
i... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual soluti... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;
public class Main {
public static void main(St... | quadratic | 911_D. Inversion Counting | CODEFORCES |
/**
p * @author prakhar28
*
*/
import java.io.*;
import java.util.*;
import java.util.Map.Entry;
import java.text.*;
import java.math.*;
import java.util.regex.*;
import java.io.IOException;
import java.nio.file.Files;
import java.nio.file.Paths;
public class Main{
static class Reader
{
final priva... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.io.BufferedReader;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Bit... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.util.Scanner;
/*
* To change this license header, choose License Headers in Project Properties.
* To change this template file, choose Tools | Templates
* and open the template in the editor.
*/
/**
*
* @a... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner in=new Scanner(System.in);
int n=in.nextInt();
int a[]=new int[n];
for(int i=0; i<n; i++)
a[i]=in.nextInt();
long no=0;
for(int i=0; i<n-1; i++)
{
for(int j=i+1; j<n; j++)
... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Scanner;
public class CE35D {
public static void main(String[] args) throws NumberFormatException, IOException {
//Scanner sc = new Scanner(System.in);
... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.PriorityQueue;
import java.util.StringTokenizer;
public class Main {
final static int mod = 1_000_000_007;
public static void main(String[] args) throws Exception {
STDIN scan ... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*/
public class Main {
public static... | quadratic | 911_D. Inversion Counting | CODEFORCES |
/*
* PDPM IIITDM Jabalpur
* Asutosh Rana
*/
import java.util.*;
import java.io.*;
import java.math.*;
public class Main {
long MOD = 1000000007;
InputReader in;
BufferedReader br;
PrintWriter out;
public static void main(String[] args) throws java.lang.Exception {
Main solver = new Main();
solver.in = ne... | quadratic | 911_D. Inversion Counting | CODEFORCES |
//~~~~~~~~~~~~~~~~~~~~~~~@@@@@@@@@@@@@@@_____________K_____S_____J__________@@@@@@@@@@@@@@@@@@@@@@@@@@@@~~~~~~~~~~~~~~~~~~~~~~~~~~
//Date:00/00/17
//-------------
import java.util.*;
import java.io.*;
/*
[[[[[[[[[[[[[[[ ]]]]]]]]]]]]]]]
[:::::::::::::: ::::::::::::::]
[::::::::::::... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.util.Scanner;
public class D2 {
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int array[] =new int[n];
for(int i=0; i<=n-1; i++) {
array[i] = sc.nextInt();
}
int m = sc.nextInt();
int result = count(array);
for(int i=1; i<=m; i++) {
... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.io.InputStream;
import java.io.PrintStream;
import java.util.Scanner;
/**
*/
public class Main911D {
public static void main(String[] args) {
run(System.in, System.out);
}
public static void run(InputStream in, PrintStream out) {
try (Scanner sc = new Scanner(in)) {
int n = sc.nextInt();
i... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.util.Scanner;
public class inversion__count {
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
int n=s.nextInt();
int[] a = new int[n+1];
for(int i=1;i<=n;i++){
a[i]=s.nextInt();
}
int m=s.nextInt();
int count=0;
for(int i=1;i<=n;i++){
f... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.io.* ;
import java.util.* ;
import java.text.* ;
import java.math.* ;
import static java.lang.Math.min ;
import static java.lang.Math.max ;
public class Codeshefcode{
public static void main(String[] args) throws IOException{
// Solver Machine = new Solver() ;
// Machine.Solve() ;
// Machine.Finish()... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.util.*;
import java.io.*;
public class ProblemD
{
static int mod = (int) (1e9+7);
static InputReader in;
static PrintWriter out;
static void update(int i, int val, int[] bit){
for(; i < bit.length; i += (i&-i))
bit[i] += val;
}
static int query(int i, ... | quadratic | 911_D. Inversion Counting | CODEFORCES |
//package codeforces.Educational35;
import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class ... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.util.*;
import java.io.*;
import java.math.BigInteger;
public class D {
FastScanner in;
PrintWriter out;
boolean systemIO = true;
public void solve() {
int n = in.nextInt();
int[] a = new int[n];
for (int i = 0; i < a.length; i++) {
a[i] = in.nextInt();
}
int x = 0;
for (int i = 0; i < ... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
// import java.awt.Point;
public class Main {
InputStream is;
PrintWriter out;
String INPUT = "";
long MOD = 1_000_000_007;
int inf = Integer.MAX_VALUE;
void solve()
{
int n = ni();
int[] a = new int[n];
f... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class D {
public static void solve(FastScanner fs) {
int n=fs.nextInt();
int[] a=fs.readArray(n);
boolean even=((countInversions(a)&1)==0);
int ... | quadratic | 911_D. Inversion Counting | CODEFORCES |
//package Educational35;
//import FastScanner.Competitive;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
public class D {
String INPUT = "4\n" +
"1 2 4 ... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.awt.Checkbox;
import java.awt.Point;
import java.io.*;
import java.math.*;
import java.util.*;
import java.util.Map.Entry;
import javax.print.attribute.SetOfIntegerSyntax;
import javax.swing.plaf.FontUIResource;
public class CODE2{... | quadratic | 911_D. Inversion Counting | CODEFORCES |
// discussed with rainboy
import java.io.*;
import java.util.*;
public class CF911D {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
PrintWriter pw = new PrintWriter(System.out);
int n = Integer.parseInt(br.readLine());
Str... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
public class D911{
void solve()
{
int n = ni();
int[] a = ia(n);
int Q = ni();
String[] ans = {"even", "odd"};
int cur = merge(a, 0, n - 1) % 2;
while(Q--... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
// import java.awt.Point;
public class Main {
InputStream is;
PrintWriter out;
String INPUT = "";
long MOD = 1_000_000_007;
int inf = Integer.MAX_VALUE;
void solve()
{
int n = ni();
int[] a = new int[n];
f... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
int n = s.nextInt();
int[] arr = new int[n];
for(int i = 0; i < n; i++) {
arr[i] = s.nextInt();
}
int parity = 0;
for(int i = 0; i < n; i++) {
int count = 0;
for(int j = ... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.util.Scanner;
public class d {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int size = in.nextInt();
int[] vals = new int[size];
long[] cum = new long[size];
for(int i=0; i<size; i++){
vals[i] = in.nextInt();
int c = 0;
for(int j=0; j<i; j++)
... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.io.*;
import java.util.*;
public class DD {
public static void main(String[] args)throws Throwable {
MyScanner sc=new MyScanner();
PrintWriter pw=new PrintWriter(System.out);
int n=sc.nextInt();
int [] a=new int [n];
for(int i=0;i<n;i++)
a[i]=sc.nextInt();
int c=0;
for(int i=0;i<n;i++)
... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.util.*;
import java.io.*;
public class InversionCounting {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
PrintWriter pw = new PrintWriter(System.out);
int n = Integer.parseInt(sc.nextLine());
int inversions = 0;
int[] data = new int[n];
StringTokenizer st ... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.util.*;
public class inversioncounting {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] permutation = new int[n];
for (int i = 0; i < n; i++) {
permutation[i] = sc.nextInt();
}
int m = sc.nextInt();
int[][] reverse = new int[m][2... | quadratic | 911_D. Inversion Counting | CODEFORCES |
//package Educational35;
//import FastScanner.Competitive;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
public class D {
String INPUT = "4\n" +
"1 2 4 ... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class P911D
{
public static void main(String[] args)
{
FastScanner scan = new FastScanner();
PrintWriter pw = new PrintWriter(System.out);
int n = scan.nextInt();
int[] arr = ... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.util.*;
import java.io.*;
import java.math.*;
public class A{
void solve(){
int n=ni();
int P[]=new int[n+1];
for(int i=1;i<=n;i++) P[i]=ni();
a=new int[n+1];
BIT=new long[n+1];
long cnt=0;
long p=0;
for(int i=n;i>=1;i--){
p+... | quadratic | 911_D. Inversion Counting | CODEFORCES |
import java.util.*;
import java.io.*;
public class P911d {
private static void solve() {
int n = nextInt();
int[] a = new int[n];
for (int i = 0; i < n; i++) {
a[i] = nextInt();
}
int cnt = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
if (a[i] > a[... | quadratic | 911_D. Inversion Counting | CODEFORCES |
//app.は全部けす
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.Scanner;
//流す前にfinalにする
public final class EcRound35DApplication {
public static void main(String[] args) {
Input input = new Input();
input = SystemInput();
List<String> resultList = run(input);
for(... | quadratic | 911_D. Inversion Counting | CODEFORCES |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.