src stringlengths 95 64.6k | complexity stringclasses 7
values | problem stringclasses 256
values | from stringclasses 1
value |
|---|---|---|---|
import java.io.*;
import static java.lang.Math.*;
import java.util.*;
import java.util.function.*;
import java.lang.*;
public class Main {
final static boolean debug = false;
final static String fileName = "";
final static boolean useFiles = false;
public static void main(String[] args) throws FileNot... | np | 8_C. Looking for Order | CODEFORCES |
public class Main {
private static void solve() {
int n = ni();
double r = ni();
double[][] p = new double[n][2];
double EPS = 0.0000000000001;
for (int i = 0; i < n; i ++) {
double x = ni();
double y = r;
for (int j = 0; j < i; j ++) {
double dx = Math.abs(p[j][0] - x);
if (dx <= r * 2 ... | quadratic | 908_C. New Year and Curling | CODEFORCES |
import java.util.ArrayList;
import java.util.Collections;
import java.util.Scanner;
import static java.lang.System.out;
public class Flatville
{
public static void main( String args[] )
{
class SquareHouse implements Comparable<SquareHouse>
{
public SquareHouse( double posLeft, doub... | nlogn | 15_A. Cottage Village | CODEFORCES |
import java.util.Map;
import java.io.IOException;
import java.util.InputMismatchException;
import java.util.TreeMap;
import java.io.PrintStream;
import java.io.OutputStream;
import java.util.ArrayDeque;
import java.io.PrintWriter;
import java.util.Deque;
import java.math.BigInteger;
import java.util.Queue;
import java.... | linear | 468_B. Two Sets | CODEFORCES |
import java.util.Scanner;
import java.util.regex.Matcher;
import java.util.regex.Pattern;
public class SpreadSheet {
public void run() {
try {
Scanner s = new Scanner(System.in);
int tests = s.nextInt();
for (int i = 0; i < tests; i++) {
String line = s.next();
String regex = "R[\\d]+C[\\d]+";
... | linear | 1_B. Spreadsheets | CODEFORCES |
import java.util.Scanner;
public class A {
static long l, r, A, B, C;
static long GCD(long a, long b) {
if (b == 0)
return a;
return GCD(b, a % b);
}
static boolean gcd(long a, long b) {
return GCD(a, b) == 1;
}
static boolean found(long a, long b, long c... | constant | 483_A. Counterexample | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;
public class A {
public static void main(String[] args) throws IOException {
InputReader in = new InputReader();
int n = in.nextInt();
long k = in.nextInt();
... | nlogn | 274_A. k-Multiple Free Set | CODEFORCES |
import java.io.*;
import java.util.*;
public class Replacement {
public static void main(String[] args) throws IOException {
// TODO Auto-generated method stub
BufferedReader r=new BufferedReader(new InputStreamReader(System.in));
String s=r.readLine();
int n=new Integer(s);
int[]arr=new int[n];
String... | nlogn | 135_A. Replacement | CODEFORCES |
import java.util.*;
import java.math.*;
public class Main {
public static void main(String[] args) throws Exception{
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
int k = scan.nextInt() - 1;
int[] arr = new int[n];
for (int i = 0; i < n; i++) {
... | nlogn | 166_A. Rank List | CODEFORCES |
import java.io.*;
import java.util.*;
public class A
{
String line;
StringTokenizer inputParser;
BufferedReader is;
FileInputStream fstream;
DataInputStream in;
String FInput="";
void openInput(String file)
{
if(file==null)is = new BufferedReader(new InputStreamReader(System.in));//stdin
else
{
try... | nlogn | 160_A. Twins | CODEFORCES |
import java.util.Scanner;
public class A {
public static void main(String[] args){
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int a[] = new int[100];
for (int i = 0;i<n;i++) a[i] = in.nextInt()%2;
if (a[0]==a[1] || a[0]==a[2]){
for (int i = 1;i<n;i++)
if (a[i] != a[0]) {
... | linear | 25_A. IQ test | CODEFORCES |
//package Demo;
//import java.io.Console;
import java.util.Scanner;
//import javax.swing.plaf.basic.BasicInternalFrameTitlePane.MaximizeAction;
public class Main {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner scanner = ne... | constant | 267_A. Subtractions | CODEFORCES |
import java.util.*;
import java.io.*;
public class A
{
public static void main(String ar[]) throws Exception
{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
String s1[]=br.readLine().split(" ");
int n=Integer.parseInt(s1[0]);
int m=In... | nlogn | 1061_B. Views Matter | CODEFORCES |
import java.util.*;
public class G {
static int n,t;
static int[]a;
static int[]g;
static long[][][]dp;
static final long MOD=1000000007;
public static void main(String[]args){
Scanner sc=new Scanner(System.in);
n=sc.nextInt();
t=sc.nextInt();
a=new int[n];
... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class ProblemA {
public static void main(String [] args) throws NumberFormatException, IOException{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(br.readLine()... | constant | 472_A. Design Tutorial: Learn from Math | CODEFORCES |
import java.io.*;
import java.util.*;
public class Codeforces908C {
public static void main(String[] args) throws IOException {
BufferedReader f = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer(f.readLine());
int n = Integer.parseInt(st.nextToken());
int r = In... | quadratic | 908_C. New Year and Curling | CODEFORCES |
import java.util.*;
import java.io.*;
public class uo{
public static void main(String[] args) throws IOException{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer(br.readLine());
int testcases = Integer.parseInt(st.nextToken());
for(int lmn=0;... | cubic | 1523_C. Compression and Expansion | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashSet;
/**
* Created by Tejas on 18-10-2018.
*/
public class Main {
static HashSet<Integer> adjList[];
public static void main(String[]args)throws IOException{
BufferedReader bufferedReade... | np | 11_D. A Simple Task | 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.Collections;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
public class ProblemA {
public static ... | cubic | 23_A. You're Given a String... | 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.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*/
public class Main {
public static ... | constant | 472_A. Design Tutorial: Learn from Math | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
FastReader scn;
PrintWriter out;
String INPUT = "";
void solve() {
long n = scn.nextLong(), k = scn.nextLong(), mod = (int)1e9 + 7;
if(n == 0) {
out.println(0);
return;
}
n %= mod;
long x = (pow(2, k + 1, mod) * n) % mod;
long y = (pow(2,... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.io.*;
import java.util.*;
public class G1_PlaylistForPolycarp {
public static void main(String[] args) {
InputStream inputStream = System.in;
OutputStream outputStream = System.out;
InputReader inp = new InputReader(inputStream);
PrintWriter out = new PrintWriter(outputS... | np | 1185_G1. Playlist for Polycarp (easy version) | 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.util.HashMap;
import java.util.InputMismatchException;
import java.io.IOException;
import java.util.Map;
import java.util.Map.Entry;
im... | linear | 1000_A. Codehorses T-shirts | CODEFORCES |
//package round85;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;
public class C2 {
Scanner in;
PrintWriter out;
String INPUT = "";
void solve()
{
int n = ni();
int m = ni();
boolean[][] f = new boolean[99][99];
cache = new ... | np | 111_C. Petya and Spiders | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.Comparator;
public class ProblemA {
public static class Team {
int solved;
int penalty;
Team(int s, int p) {
solved = s;
penalty = p... | nlogn | 166_A. Rank List | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class A {
static class Scanner{
BufferedReader br=null;
StringTokenizer tk=null;
public Scanner(){
br=new BufferedReader(new InputStreamReader(System.in));
}
public Str... | constant | 313_A. Ilya and Bank Account | CODEFORCES |
import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.PriorityQueue;
import java.util.Queue;
import java.util.Scanner;
public class R035CRetry {
public void debug(Object... objects) { System.err.println(Arrays.deepToString(objects)); }
... | cubic | 35_C. Fire Again | CODEFORCES |
import java.io.*;
public class Main {
private StreamTokenizer in;
private PrintWriter out;
public static void main(String[] args) throws IOException {
//long time = System.currentTimeMillis();
new Main().run();
//time = System.currentTimeMillis() - time;
//System.out.pri... | constant | 630_A. Again Twenty Five! | CODEFORCES |
import java.awt.*;
import java.io.*;
import java.math.BigDecimal;
import java.math.BigInteger;
import java.util.*;
import java.util.List;
import static java.lang.Math.max;
import static java.lang.Math.min;
public class B implements Runnable{
private final static Random rnd = new Random();
// SOLUTION!!!
... | logn | 713_B. Searching Rectangles | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.Random;
import java.util.StringTokenizer;
import java.util.concurrent.ThreadLocalRandom;
public class Main2 {
static int mod = 1000000007;
static FastScanner scanner;
pu... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
/**
* May 13, 2011
* @author parisel
*/
public class ToyArmy {
int N;
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String[] tok;
String s;
private String[] getTok() throws ... | constant | 84_A. Toy Army | CODEFORCES |
import static java.lang.Integer.parseInt;
import static java.lang.Long.parseLong;
import static java.lang.System.arraycopy;
import static java.lang.System.exit;
import static java.util.Arrays.copyOf;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter... | cubic | 1523_C. Compression and Expansion | CODEFORCES |
import java.io.*;
import java.util.*;
public class CF_468B {
public static void main(String[] args) throws IOException {
new CF_468B().solve();
}
int root(int[] father, int a){
if (father[a]==a) return a;
else return father[a]=root(father, father[a]);
}
void unite(int[] ... | linear | 468_B. Two Sets | 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.io.*;
import java.util.*;
public class lcm {
static int n;
public static void main(String[] args) throws IOException {
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
//BufferedReader in = new BufferedReader(new FileReader("lcm.in"));
n = Integer.parseInt(in.readLine());... | constant | 235_A. LCM Challenge | CODEFORCES |
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.math.BigDecimal;
import java.math.RoundingMode;
import java.util.Scanner;
public class A1 {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
long size = scan.nextLong();
int numberOfSpecial = scan.nextInt();
long pageSize = scan.nextLong... | linear | 1190_A. Tokitsukaze and Discard Items | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.OutputStream;
import java.util.List;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;
import java.util.ArrayList;
/**
... | linear | 1067_B. Multihedgehog | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class MicroWorld {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = ne... | nlogn | 990_B. Micro-World | CODEFORCES |
import java.util.Scanner;
public class CF{
public static void main(String[] args)
{
Scanner scan = new Scanner(System.in);
long n = scan.nextLong();
TaskA t = new TaskA();
System.out.println(t.solve(n));
}
}
class TaskA{
public long solve(long n)
{
if(n < 3)
return n;
else if(n % 2 == 1)
return... | constant | 235_A. LCM Challenge | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Collection;
import java.util.LinkedList;
import java.util.Locale;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] ar... | np | 8_C. Looking for Order | CODEFORCES |
import java.util.*;
import java.math.*;
public class Split {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n= sc.nextInt();
int k= sc.nextInt();
int a[] = new int[n];
int d[] = new int[n-1];
for(int i=0;i<n;i++) {
a[i] = sc.nextInt();
if(i>0)
d[i-1] = a[i-1] -... | nlogn | 1197_C. Array Splitting | CODEFORCES |
import java.io.IOException;
import java.io.InputStreamReader;
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 dudkamaster
*/
public class... | constant | 343_A. Rational Resistance | CODEFORCES |
import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
public class Main {
public static void main(String[] args)
{
Scanner s=new Scanner(System.in);
int n=s.nextInt();
long[] arr=new long[n];
... | quadratic | 1141_F2. Same Sum Blocks (Hard) | CODEFORCES |
import java.io.*;
import java.util.*;
public class solution {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
boolean ok = (n % 4 == 0) || (n % 7 == 0) || (n % 47 == 0) || (n % 74 == 0) || (n % 447 == 0) || (n % 474 == 0) || (n % 477 == 0) || ... | constant | 122_A. Lucky Division | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.HashSet;
import java.util.Set;
public class PaintColor {
public static void main(String[] args) throws Exception {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int... | quadratic | 1209_A. Paint the Numbers | 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.awt.Rectangle;
import java.awt.geom.Rectangle2D;
import java.io.*;
import java.math.BigInteger;
import java.util.*;
public class C
{
String line;
StringTokenizer inputParser;
BufferedReader is;
FileInputStream fstream;
DataInputStream in;
String FInput="";
void openInput(String file)
{
if(fi... | logn | 338_A. Quiz | CODEFORCES |
import java.awt.Point;
import java.awt.geom.Point2D;
import java.util.Arrays;
import java.util.Scanner;
public class A
{
public static void main(String[] args)
{
Scanner in=new Scanner(System.in);
int n=in.nextInt();
int t=in.nextInt();
pt[] P=new pt[n];
for (int i=0; i<n; ++i)
P[i]=new pt(in.nextInt(... | nlogn | 15_A. Cottage Village | CODEFORCES |
import static java.lang.Math.*;
import static java.util.Arrays.*;
import static java.util.Collections.*;
import java.util.*;
import java.io.*;
import java.math.*;
import java.awt.geom.Line2D;
import java.awt.Point;
import static java.lang.reflect.Array.*;
public class LittleElephantAndProblem {
boolean DEBUG = tr... | nlogn | 220_A. Little Elephant and Problem | CODEFORCES |
import java.io.*;
import java.util.*;
public class cf35c {
public static void main(String[] args) throws Exception {
Scanner in = new Scanner(new File("input.txt"));
PrintWriter out = new PrintWriter(new File("output.txt"));
int[] dx = {0,0,1,-1};
int[] dy = {1,-1,0,0};
int n = in.nextInt();
int m = in.ne... | cubic | 35_C. Fire Again | CODEFORCES |
import java.io.*;
import java.util.*;
public class HamstersAndTigers
{
Scanner in;
PrintWriter out;
HamstersAndTigers()
{
in = new Scanner(System.in);
out = new PrintWriter(System.out);
}
HamstersAndTigers(String i, String o) throws FileNotFoundException
{
in = new Scanner(new File(i));
out = new P... | linear | 46_C. Hamsters and Tigers | CODEFORCES |
import java.io.*;
import java.util.*;
public class ProblemF_2 {
public static InputStream inputStream = System.in;
public static OutputStream outputStream = System.out;
public static void main(String[] args) {
MyScanner scanner = new MyScanner(inputStream);
PrintWriter out = new PrintWri... | quadratic | 1141_F2. Same Sum Blocks (Hard) | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class E {
static int n;
static int m;
static int[][][] DP;
static int[] dx = { 0, 0, 1, -1 };
static int[] dy = { 1, -1, 0, 0 };
static int inf = 1000000;
public static int get(int x, int current, int last) {
if (x == n) {
... | np | 111_C. Petya and Spiders | CODEFORCES |
/*
* 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.
*/
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.u... | cubic | 1517_D. Explorer Space | CODEFORCES |
/*
If you want to aim high, aim high
Don't let that studying and grades consume you
Just live life young
******************************
What do you think? What do you think?
1st on Billboard, what do you think of it
Next is a Grammy, what do you think of it
However you think, I’m sorry, but shit, I have no fcking inter... | cubic | 35_C. Fire Again | CODEFORCES |
import java.io.*;
import java.math.*;
import java.util.*;
public class Main1
{
private InputStream is;
private PrintWriter out;
static int MOD = (int)(1e9+7);
ArrayList<Integer>[] amp;
public static void... | nlogn | 903_D. Almost Difference | CODEFORCES |
import java.util.Scanner;
public class subtractions {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
while(n-->0){
int a=sc.nextInt();
int b=sc.nextInt();
int c=0;
while(a... | constant | 267_A. Subtractions | CODEFORCES |
//Author: net12k44
import java.io.*;
import java.util.*;
public
class Main{//}
static PrintWriter out;
static int c[][];
static int x[] , y[] , n;
static int degIn[];
static ArrayList< ArrayList<Integer> >a = new ArrayList< ArrayList<Integer> >();
static int cnt = 0;
static boolean b[];
private static boolean dfs(i... | cubic | 387_D. George and Interesting Graph | CODEFORCES |
//package deltix2021;
import java.io.*;
import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.Queue;
public class C {
InputStream is;
FastWriter out;
String INPUT = "";
void solve()
{
for(int T = ni();T > 0;T--)go();
}
void go()
{
int n = ni();
... | cubic | 1523_C. Compression and Expansion | CODEFORCES |
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
public class CFFF {
static PrintWriter out;
static final int oo = 987654321;
static final long mod = (long)(1e9)+9;
public static void main(String[] args) {
MScanner sc = new MScanner();
... | logn | 338_A. Quiz | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String [] line = br.readLine().split(" ");
long l = Long.parseLo... | constant | 483_A. Counterexample | CODEFORCES |
import java.util.*;
import java.lang.*;
import java.math.*;
import java.io.*;
import static java.lang.Math.*;
import static java.util.Arrays.*;
public class _P015A{
Scanner sc=new Scanner(System.in);
int INF=1<<28;
double EPS=1e-9;
int n, t;
int[][] a;
void run(){
n=sc.nextInt();
... | nlogn | 15_A. Cottage Village | CODEFORCES |
import java.math.*;
import java.util.*;
public class Main {
public static void main(String[] args) throws Exception {
Scanner scan = new Scanner(System.in);
long n = scan.nextLong();
long k = scan.nextLong();
long total = k * (k - 1) / 2 + 1;
if (total < n) {
System.out.println(-1);
return;
}
l... | logn | 287_B. Pipeline | CODEFORCES |
import java.util.*;
import java.io.*;
public class Main {
public static void main(String [] args) throws IOException{
Scanner in = new Scanner(new FileInputStream("input.txt"));
//Scanner in = new Scanner(System.in);
File file = new File("output.txt");
FileOutputStream fos = new FileOutputStream(file);
if (... | cubic | 35_C. Fire Again | CODEFORCES |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.