src stringlengths 95 64.6k | complexity stringclasses 7
values | problem stringlengths 6 50 | from stringclasses 1
value |
|---|---|---|---|
import java.io.*;
import java.util.*;
public class Main
{
class node{
int data;
node next;
public node(int val){
data=val;
next=null;
}
}
class linkedlist{
node start;
node end;
int size;
int turn;
public linkedlist(){
start=null;
end=null;
size=0;
}
void add(int val){
if(... | linear | 1179_A. Valeriy and Deque | CODEFORCES |
import java.io.*;
import java.util.*;
public class D999 {
public static void main(String args[])throws IOException
{
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
int m=sc.nextInt();
int req=n/m;
int arr[]=new int[n+1];
int size[]=new int[m];
Lis... | linear | 999_D. Equalize the Remainders | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
/**
* @author Don Li
*/
public class EhabAndAComponentChoosingProblem {
long INF = (long) 1e18;
int n;
int[] a;
... | linear | 1088_E. Ehab and a component choosing problem | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main implements Runnable {
public void _main() throws IOException {
int n = nextInt();
int k = nextInt();
boolean[] p = new boolean[n + 1];
Arrays.fill(p, true);
List<Integer> primes = new ArrayList<Integer>();
for (int i = 2; i <= n; i++)
if (p[i]) {... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
public class Main {
BufferedReader in;
PrintWriter out;
StringTokenizer st;
void solve() throws IOException {
int n=ni();
int k=ni();
boolean[] t = new boolean[n+1];
for(int i=2;i<=n;i++){
t[i]=false;
}
int p=2;
while(tr... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.util.*;
import java.lang.*;
import java.math.*;
import java.io.*;
public class a {
boolean[] isp;
ArrayList<Integer> primes;
private void solve() throws Exception {
int n = nextInt();
int k = nextInt();
int cnt = 0;
primes = new ArrayList<Integer>();
isp = new boolean[n + 1];
Arrays.fill(... | linear | 17_A. Noldbach problem | CODEFORCES |
//package round17;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.StreamTokenizer;
public class A {
static StreamTokenizer in =
new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
static int nextInt(... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.util.BitSet;
import java.util.Scanner;
public class A {
static Scanner sc = new Scanner(System.in);
public static void main(String[] args) throws Exception {
BitSet primes = primes(1001);
int N = sc.nextInt();
int K = sc.nextInt();
int count = 0;
for (int i = 2; i <= N; ++i) {
if (!primes.g... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.awt.*;
import java.math.*;
import java.util.regex.*;
import static java.util.Arrays.*;
import static java.util.Collections.*;
import static java.lang.Integer.parseInt;
import static java.util.AbstractMap.*;
import static java.lang.System.*;
import static java.lang.Math.*;
import java.awt.geom.*;
import java... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.io.*;
import java.math.BigInteger;
import java.util.*;
public class Main {
StreamTokenizer in;
PrintWriter out;
public static void main(String[] args) throws IOException
{
new Main().run();
}
public void run() throws IOException
{
// in =new StreamTokenizer(new Buff... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.util.*;
public class A
{
public static void main(String args[])
{
boolean[] b = new boolean[11000];
Arrays.fill(b, true);
b[0] = b[1] = false;
for(int i=2;i < b.length;i++)
{
if(!b[i])
continue;
for(int j=2;i*j<b.length;j++)
b[i*j] = false;
}
int[] p = new int[11000];
int... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;
public class A {
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
int N = s.nextInt();
int K = s.nextInt();
int[] primes = getPrimesFast(N);
Set<Integer> ints = new HashSet... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.util.ArrayList;
import java.util.Scanner;
public class primes {
public static void main(String [] args){
ArrayList<Integer> numb=new ArrayList<Integer>();
Scanner br1 = new Scanner(System.in);
int n=br1.nextInt();
int steps=br1.nextInt();
//if(n>2)numb.add(2);
if(n>=3)numb.add(3);
for(int j=4;j<=n;j+... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args) throws Excepti... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.io.*;
import java.util.*;
public class Solution {
Scanner in;
PrintWriter out;
boolean isPrime(int x) {
for (int i = 2; i * i <= x; ++i) {
if (x % i == 0) {
return false;
}
}
return true;
}
void solve() throws IOException {
in = new Scanner(System.in);
//in = new Scanner(new Fi... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.io.*;
import java.util.*;
public class Noldbach
{
public Scanner in = new Scanner(System.in);
public PrintStream out = System.out;
public boolean[] yes;
public int n, k;
public void main()
{
n = in.nextInt();
k = in.nextInt();
genPrime();
int i;
yes = new boolean[n+1];
int x;
... | linear | 17_A. Noldbach problem | CODEFORCES |
import static java.util.Arrays.*;
import static java.lang.Math.*;
import java.util.*;
import java.io.*;
public class A implements Runnable
{
public static void main(String [] args) throws IOException
{
new Thread(null, new A(), "", 1 << 20).start();
}
String file = "input";
BufferedReader input;
PrintWriter... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.util.*;
import java.io.*;
import java.math.*;
import javax.script.*;
public class Noldbach {
public static void main(String[] args) throws Exception {
Scanner sc = new Scanner(System.in);
int n=sc.nextInt();
int k=sc.nextInt();
boolean[] sieve=new boolean[1001];
sieve[2]=false;
ArrayList<Integ... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Locale;
import java.util.StringTokenizer;
public class Solution implements Runnab... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.io.*;
import java.awt.geom.Point2D;
import java.text.*;
import java.math.*;
import java.util.*;
public class Main implements Runnable {
final String filename="";
public void solve() throws Exception {
int n = iread(), k = iread();
boolean[] f = new boolean[10000];
... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.util.*;
public class Main
{
static int MAX = 1000;
static BitSet P = new BitSet(MAX + 1);
public static boolean Noldbach(int n)
{
n--;
int j;
for(int i=2; i<=n; i++)
{
if(!P.get(i))
{
j = i + 1;
while(P.get(j))
j++;
if(i+j == n)
{
if(!P.get(i... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.InputMismatchException;
/**
* @author Egor Kulikov (egor@egork.net)
* Created on 14.03.2010
*/
public class TaskA implements Runnable {
private InputReader in;
private PrintWri... | linear | 17_A. Noldbach problem | CODEFORCES |
import static java.lang.Math.*;
import static java.lang.System.currentTimeMillis;
import static java.lang.System.exit;
import static java.lang.System.arraycopy;
import static java.util.Arrays.sort;
import static java.util.Arrays.binarySearch;
import static java.util.Arrays.fill;
import java.util.*;
import java.io.*;
p... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.io.*;
import java.math.BigDecimal;
import java.math.BigInteger;
import java.util.*;
import static java.lang.Math.*;
public class Main {
StreamTokenizer in;
//BufferedReader in;
PrintWriter out;
public static void main(String[] args) throws IOException {
new Main().run();
}
i... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class Main {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner entrada = new Scanner (System.in);
int Primos []= {2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class A {
public static void main(String[] args) {
new A().run();
}
private void run() {
Scanner sc =new Scanner(System.in);
int n = sc.nextInt();
int k = sc.nextInt();
sc.close();
boolean[] isp = new boolean[n + 1];
Arrays.fill(isp, true);
... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.util.*;
import java.io.*;
/**
* Created by HREN_VAM.
*/
public class A implements Runnable{
BufferedReader in;
PrintWriter out;
StringTokenizer st;
public static final String filename = "";
public void solve() throws IOException{
int n = nextInt();
int[] a = new i... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
static Scanner in;
static PrintWriter out;
// static final String PROBLEM = "";
public static void main(String[] args) throws Exception {
in = new Scanner(System.in);
out = new PrintWriter(System.out);
int n = in.nextInt();
int k = in.nextInt();
... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.io.*;
import java.util.*;
public class Answer17A{
public static void main(String[] args){
try{
BufferedReader reader=new BufferedReader(new InputStreamReader(System.in));
String[] tmp=reader.readLine().split(" ");
int n=Integer.parseInt(tmp[0]);
int k=Integer.parseInt(tmp[1]);
... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.util.LinkedList;
import java.util.Locale;
import java.util.Scanner;
public class A{
void exe(){
LinkedList<Integer> list=new LinkedList<Integer>();
for(int i=2;i<=1000;i++)
if(isPrime(i))
list.add(i);
Object[] primes=list.toArray();
... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.StringTokenizer;
/**
* Problem solution template.
* @author Andrew Porokhin, andrew.porokhin@gmail.com
*/
public class Proble... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
public class Solution {
BufferedReader in;
PrintWriter out;
StringTokenizer st;
int n, k;
boolean[] prime;
int[] primes;
void sieve() {
prime = new boolean[n + 1];
Arrays.fill(prime, true);
pri... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.io.*;
import java.util.*;
public class ProblemaNoldbaha implements Runnable{
public static void main(String[] args) throws IOException {
new Thread(new ProblemaNoldbaha()).start();
}
BufferedReader br;
StringTokenizer in;
PrintWriter out;
public String nextToken() throws IOException{
while (i... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.io.*;
import java.util.*;
public class A {
private static Scanner sc = new Scanner(new InputStreamReader(System.in));
public static void main (String[] args) throws IOException {
BitSet b = new BitSet(1001);
BitSet p = primes(1001);
for (int i = 0; i < ps.length - 1; i++) {
... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
import static java.util.Arrays.fill;
import static java.util.Arrays.binarySearch;
import static java.util.Arrays.sort;
public class Main {
public static void main(String[] args) throws IOException {
try {
if (new File("input.txt").exists()) {
... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.io.*;
import java.util.Arrays;
import java.util.StringTokenizer;
public class Naldbah implements Runnable {
boolean isLocalMode = false;
public static void main(String[] args) {
new Naldbah().run();
}
BufferedReader reader;
StringTokenizer tokenizer;
PrintWriter writer;
... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.io.*;
import java.util.*;
public class A implements Runnable {
public static void main(String[] args) {
new A().run();
}
class FastScanner {
BufferedReader br;
StringTokenizer st;
boolean eof;
String buf;
public FastScanner(String fileName) throws FileNotFoundException {
br = new Buffer... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.util.*;
import java.io.*;
public class Main
{
public static void main(String args[]) throws IOException
{
Scanner sc = new Scanner(System.in);
int n = sc.nextInt(), k = sc.nextInt(), kol = 0, prev;
boolean ok;
ArrayList<Integer> al = new ArrayList<Integer>... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
public class A {
public static void main(String[] args) throws Exception {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
int k = scan.nextInt()-1;
PrimeGen p = new PrimeGen(n);
List<Integer> prims = new ArrayList<I... | linear | 17_A. Noldbach problem | CODEFORCES |
//package codeforces.br17;
import java.io.*;
import java.text.DecimalFormat;
public class ProblemA {
public void solve() {
boolean oj = true;
try {
Reader reader = oj ? new InputStreamReader(System.in) : new FileReader("A.in");
Writer writer = oj ? new OutputStreamWriter(S... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.util.*;
import java.io.*;
import static java.lang.Math.*;
import java.math.*;
public class Main implements Runnable {
BufferedReader in;
StringTokenizer st = new StringTokenizer("");
public static void main(String [] args) throws Exception {
new Thread(new Main()).start();
}
void printExit(Str... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.util.*;
import static java.util.Arrays.deepToString;
public class A {
private static int[] prime = new int[] {
2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43,
47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, ... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.util.*;
import java.io.*;
import java.math.*;
import javax.script.*;
public class Noldbach {
public static void main(String[] args) throws Exception {
Scanner sc = new Scanner(System.in);
int n=sc.nextInt();
int k=sc.nextInt();
boolean[] sieve=new boolean[1001];
sieve[2]=false;
ArrayList<Integ... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
public class Main implements Runnable {
//public static final String FileName = "test";
StreamTokenizer ST;
PrintWriter out;
BufferedReader br;
Scanner in;
static final int inf = 1000000000;
int nextInt() throws IO... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class A {
public static void main(String[] args) throws IOException {
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
String s = new String(in.readLine());
String[] t=s.split(" ");
... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.StreamTokenizer;
import java.util.Arrays;
import java.util.HashSet;
public class E17 {
static StreamTokenizer in;
static PrintWriter out;
static int nextInt() throws IOException... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
public class A {
public static void main(String[] args) throws Exception {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
int k = scan.nextInt()-1;
PrimeGen p = new PrimeGen(n);
List<Integer> prims = new ArrayList<I... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.io.*;
import java.util.*;
public class Solution {
private BufferedReader in;
private PrintWriter out;
private StringTokenizer st;
void solve() throws IOException {
int n = nextInt();
int k = nextInt();
ArrayList<Integer> ps = new ArrayList<Integer>();
boolean[] prime = new boolean[n + 1];
... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.util.*;
import java.util.regex.*;
import java.text.*;
import java.math.*;
public class Main
{
Scanner cin;
int []prime;
int top;
void work()
{
cin=new Scanner(System.in);
int n=cin.nextInt();
int k=cin.nextInt();
top=0;
prime=new int[2000];
... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.util.*;
public class Beta17PA {
boolean[] isPrime = new boolean[1001];
int[] prime = new int[200];
public static void main(String[] args) {
// TODO Auto-generated method stub
new Beta17PA().solve();
}
public void solve() {
Scanner scan = new Scanner(System.in);
int n, k;
n = scan.nextInt(... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.List;
import java.util.StringTokenizer;
public class A {
BufferedReader in;
StringTokenizer st;
PrintWriter out;
void solve() throws IOE... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.lang.*;
import java.io.*;
import java.util.*;
import java.math.*;
public class Solution implements Runnable{
private static BufferedReader br = null;
private static PrintWriter out = null;
private static StringTokenizer stk = null;
public static void main(String[] args) {
br = ... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.io.*;
import java.math.*;
import java.util.*;
public class Primes
{
static Scanner in = new Scanner( new BufferedReader( new InputStreamReader( System.in ) ) );
public static void main( String[] args )
{
int n = in.nextInt(), k = in.nextInt(), count = 0;
boolean[] isP = new boolean[n+1];
for( int... | linear | 17_A. Noldbach problem | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashSet;
import java.util.StringTokenizer;
public class B {
static ArrayList<Integer> [] adj;
static int [] num;
static int d... | linear | 1056_D. Decorate Apple Tree | CODEFORCES |
import static java.lang.Integer.parseInt;
import static java.lang.Long.parseLong;
import static java.lang.Math.min;
import static java.lang.System.exit;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public cla... | linear | 1091_F. New Year and the Mallard Expedition | CODEFORCES |
import java.util.*;
import java.io.*;
import java.math.BigInteger;
public class Main
{
static final long mod=(int)1e9+7;
public static void main(String[] args) throws Exception
{
FastReader in=new FastReader();
PrintWriter pw=new PrintWriter(System.out);
int n=in.nextInt();
long ans=0;
... | linear | 1062_D. Fun with Integers | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class C {
public static int mod = 1000000000 + 7;
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String n = br.readLine();
... | linear | 914_C. Travelling Salesman and Special Numbers | CODEFORCES |
import java.util.*;
import java.io.*;
public class A{
public static void main(String args[]){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int ans = 0;
for(int i = 1; i <= n; i++){
ans += ((i*2) <= n) ? i : n-i+1;
... | linear | 909_B. Segments | CODEFORCES |
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int[][] x = new int [200010][10];
String a = sc.nextLine();
String b = sc.nextLine();
int n = a.length();
int m = b.length();
for (int i = 1; i <= m; i++) {
... | linear | 608_B. Hamming Distance Sum | CODEFORCES |
import java.io.*;
import java.lang.reflect.Array;
import java.util.*;
import java.math.*;
import java.lang.*;
import static java.lang.Math.*;
public class TaskB implements Runnable {
boolean prime[] = new boolean[(int)1e6+10];
InputReader c;
PrintWriter w;
public void run() {
c = new InputRea... | linear | 608_B. Hamming Distance Sum | CODEFORCES |
import java.util.Scanner;
public class HammingDistancesSum {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String a = sc.nextLine(), b = sc.nextLine();
long sum = 0;
int frequency[][] = new int[200010][2];
for (int i = 1; i <= b.length(); i++) {
for (int j = 0; j < ... | linear | 608_B. Hamming Distance Sum | CODEFORCES |
/* package whatever; // don't place package name! */
import java.util.*;
import java.lang.*;
import java.io.*;
/* Name of the class has to be "Main" only if the class is public. */
public class Ideone
{
static int check(int temp)
{
int count1 = 0;
while (temp>0)
{
if(temp % 2 != 0)
cou... | linear | 608_B. Hamming Distance Sum | CODEFORCES |
import java.io.*;
import java.lang.*;
import java.util.*;
import static java.lang.Integer.*;
import static java.lang.Long.*;
import static java.lang.Math.*;
import static java.lang.System.*;
import static java.util.Arrays.*;
import static java.util.Collections.*;
public class Main {
Main() throws IOException {
... | linear | 608_B. Hamming Distance Sum | CODEFORCES |
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.io.StreamTokenizer;
import java.util.Arrays;
public class B {
// -- DEBUG switch --
static final boolean DBG = fals... | linear | 224_B. Array | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class Array {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int k = in.nextInt();
/*
if ( k == 1 ){
System.out.println("1 1"); return;
}
*/
int last[] = new int[100001];
int distinc... | linear | 224_B. Array | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Set;
import java.util.StringTokenizer;
public class C_138B {
private static BufferedReader i... | linear | 224_B. Array | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.HashSet;
import java.util.StringTokenizer;
public class Array {
void run() {
try {
BufferedReader bfd = new BufferedReader(new InputStreamReader(
System.in));
StringTokenizer tk = ... | linear | 224_B. Array | CODEFORCES |
import java.io.*;
import java.util.*;
public class B implements Runnable {
void Solution() throws IOException {
int n = nextInt(), k = nextInt();
int[] mas = new int[n];
for (int i = 0; i < n; i++)
mas[i] = nextInt();
int l = 0, r = 0;
HashMap<Integer, Integer> map = new HashMap<Integer, Integer>();
m... | linear | 224_B. Array | CODEFORCES |
import java.io.*;
import java.util.*;
public class B {
static int i(String s) { return Integer.parseInt(s); }
public static void main(String[] args) throws Exception {
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
String[] arr = in.readLine().split(" ");
int n = i(arr[0]);
int k = ... | linear | 224_B. Array | CODEFORCES |
import java.util.HashMap;
import java.util.HashSet;
import java.util.Scanner;
public class B {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int distinct = sc.nextInt();
HashMap<Integer, Integer> set = new HashMap<Integer, Intege... | linear | 224_B. Array | CODEFORCES |
import java.util.Scanner;
public class B {
/**
* @param args
*/
public static void main(String[] args) {
Scanner scr = new Scanner(System.in);
int n = scr.nextInt();
int k = scr.nextInt();
int[] a = new int[n+1];
int[] d = new int[100001];
int tk = 0;
int l = 1;
int r = -1;
boolean fi... | linear | 224_B. Array | CODEFORCES |
import java.util.*;
import java.io.*;
public class B {
public void solve() throws IOException {
int n = nextInt();
int k = nextInt();
int[] a = new int[n];
for(int i = 0; i < n; i++){
a[i] = nextInt();
}
int[] num = new int[n];
Set<Integer> set = new HashSet<Integer>();
int s = -1;
int l = -1;
f... | linear | 224_B. Array | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class PrB {
public static long time;
public static void main(String[] args) throws Exception {
time = System.currentTimeMillis();
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
... | linear | 224_B. Array | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Set;
import java.util.StringTokenizer;
public class B {
static BufferedReader in;
static StringTokenizer st;
... | linear | 224_B. Array | CODEFORCES |
import java.io.*;
import java.util.*;
public class B {
public static void main(String[] args) throws Exception {
new B().solve();
}
void solve() throws IOException {
BufferedReader in = new BufferedReader(new
InputStreamReader(System.in));
// Scanner sc = new S... | linear | 224_B. Array | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
public class Main {
static StringTokenizer st;
static PrintWriter out = new PrintWriter(System.out,true);
static BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
public static int nextInt() throws Exception {
if... | linear | 224_B. Array | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Set;
import java.util.StringTokenizer;
public class B {
static BufferedReader in;
static StringTokenizer st;
... | linear | 224_B. Array | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.*;
public class B {
private void solve() throws IOException {
int n = nextInt();
int k = nextInt();
int[] a = new ... | linear | 224_B. Array | CODEFORCES |
import java.util.*;
public class B138 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a[] = new int[100004];
int b[] = new int[100004];
int n, m, ans = 0, dau, cuoi=-1;
n = sc.nextInt();
m = sc.nextInt();
for(int i=0;i<1000... | linear | 224_B. Array | CODEFORCES |
import java.io.*;
import java.math.BigInteger;
import java.util.*;
public class Main {
static final double eps = 1e-8;
public static void main(String[] args) throws IOException {
try {
... | linear | 224_B. Array | CODEFORCES |
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.FileReader;
import java.io.BufferedWriter;
import java.util.Set;
import java.io.BufferedReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.Fi... | linear | 224_B. Array | CODEFORCES |
import java.io.InputStreamReader;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.util.HashSet;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
* @author Lo... | linear | 224_B. Array | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.LinkedList;
import java.util.List;
import java.util.Queue;
import java.util.StringTokenizer;
public... | linear | 224_B. Array | CODEFORCES |
import java.util.*;
import java.math.*;
public class Main {
static final long MOD = 1000000007L;
public static void main(String[] args) throws Exception {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
int k = scan.nextInt();
int res = -1;
int[] arr ... | linear | 224_B. Array | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
boolean eof;
public String nextToken() {
while (st == null || !st.hasMoreTokens()) {
try {
st = new StringTokenizer(br.readLine());
} catch (Exception e) {
eof = true;
return "-1";
}
}
return st.nextToken();
}
public int nextInt... | linear | 224_B. Array | CODEFORCES |
import java.util.Map;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.math.BigDecimal;
import java.io.BufferedWriter;
import java.util.Locale;
import java.util.InputMismatchException;
import java.util.HashMap;
import java.util.Set;
import java.io.OutputStream;
import java.io.PrintWriter;
impo... | linear | 224_B. Array | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.io.Reader;
import java.util.HashMap;
import java.util.HashSet;
import java.util.StringTokenizer;
public class Main {
static class MyReader{
pri... | linear | 224_B. Array | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Set;
import java.util.StringTokenizer;
import java.util.TreeMap;
public class B {
static class Scanner
{
BufferedReader rd;
StringTokenizer tk;
public Scanner() throws IOException
{
rd=new Buff... | linear | 224_B. Array | CODEFORCES |
import java.io.*;
import java.util.*;
public class CodeForces {
static boolean ONLINE_JUDGE = System.getProperty("ONLINE_JUDGE") != null;
void runCase(int caseNum) throws IOException {
int n = nextInt();
int k = nextInt();
int[] nums = new int[n];
int distinct = 0;
int ... | linear | 224_B. Array | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
/**
* Created with IntelliJ IDEA.
* User: Alexey
* Date: 16.09.12
* Time: 19:29
* To change this template use File | Settings | File Templates.
*/
public clas... | linear | 224_B. Array | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
public class Main{
/**
* @param args
*/
public static void main(String[] args) {
Parser p = new Parser(System.in);
PrintWri... | linear | 224_B. Array | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class B {
void run(){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt(), k = sc.nextInt();
int[] a = new int[n+1];
for(int i=1;i<=n;i++)a[i]=sc.nextInt();
int[] c = new int[100001];
int num = 0;
... | linear | 224_B. Array | CODEFORCES |
import java.io.InputStreamReader;
import java.io.IOException;
import java.util.Arrays;
import java.io.BufferedReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
* @author Sun... | linear | 224_B. Array | CODEFORCES |
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a[] = new int[100004];
int b[] = new int[100004];
int n, m, ans = 0, dau, cuoi=-1;
n = sc.nextInt();
m = sc.nextInt();
for(int i=0;i<1000... | linear | 224_B. Array | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
* @author George Marcus
*/
public class Main {
public static void main(String[] args) {
Inpu... | linear | 224_B. Array | CODEFORCES |
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.Scanner;
public class CF224B {
public static void main(String[] args) throws Exception {
new CF224B().solve();
}
private void solve() throws Exception {
Scanner sc = new Scanner(System.in);
... | linear | 224_B. Array | CODEFORCES |
import java.util.Scanner;
import java.util.TreeMap;
public class B {
static Scanner in;
static void put(TreeMap<Integer, Integer> m, int key) {
if (m.containsKey(key)) {
m.put(key, m.get(key) + 1);
} else {
m.put(key, 1);
}
}
static void remove(TreeMap... | linear | 224_B. Array | CODEFORCES |
import java.io.*;
import java.util.HashMap;
import java.util.Map;
import java.util.StringTokenizer;
public class Code implements Runnable {
public static void main(String[] args) throws IOException {
new Thread(new Code()).start();
}
private void solve() throws IOException {
taskB();
... | linear | 224_B. Array | CODEFORCES |
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintStream;
import java.util.*;
public class B
{
BufferedReader in;
PrintStream out;
StringTokenizer tok;
public B() throws NumberFormatException, IOException
{
in = new Buffe... | linear | 224_B. Array | CODEFORCES |
import java.io.*;
import java.util.*;
public class C138B
{
private static StringTokenizer st;
public static void nextLine(BufferedReader br) throws IOException
{
st = new StringTokenizer(br.readLine());
}
public static int nextInt()
{
return Integer.parseInt(st.nextTo... | linear | 224_B. Array | CODEFORCES |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.