src stringlengths 95 64.6k | complexity stringclasses 7
values | problem stringclasses 256
values | from stringclasses 1
value |
|---|---|---|---|
import java.util.Scanner;
public class Problem_8C {
private static int dis(int x1, int y1, int x2, int y2) {
return (x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2);
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int ox = sc.nextInt();
int oy = sc.nextInt();
int... | np | 8_C. Looking for Order | CODEFORCES |
/**
* BaZ :D
*/
import java.util.*;
import java.io.*;
import static java.lang.Math.*;
public class Main
{
static MyScanner scan;
static PrintWriter pw;
static long MOD = 1_000_000_007;
static long INF = 1_000_000_000_000_000_000L;
static long inf = 2_000_000_000;
public static void main(Strin... | np | 1209_E2. Rotate Columns (hard version) | CODEFORCES |
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.Scanner;
public class Main {
public static void main(final String[] args) throws IOException {
try(Scanner scan = new Scanner(System.in);
PrintWr... | cubic | 387_D. George and Interesting Graph | CODEFORCES |
import java.io.*;
import java.util.*;
public class B {
final String filename = new String("B").toLowerCase();
int n;
int r, c;
void solve() throws Exception {
n = nextInt();
r = nextInt() - 1;
c = nextInt() - 1;
long count = nextLong();
long left = -1, right = n * 2L;
while (left < right - 1) {
... | logn | 256_B. Mr. Bender and Square | CODEFORCES |
import java.util.Scanner;
public class codef8 {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc = new Scanner(System.in);
int num = sc.nextInt();
int beacon[] = new int[1000001];
int pos[] = new int[num];
for (int i = 0; i < num; i++) {
int position = sc.nextInt... | linear | 608_C. Chain Reaction | CODEFORCES |
// package contest;
import java.io.*;
import java.util.Stack;
import java.util.StringTokenizer;
public class teama {
static int mod = 2_000_000_007;
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
PrintWrit... | cubic | 1523_C. Compression and Expansion | CODEFORCES |
import java.util.*;
import java.io.*;
import java.lang.*;
import java.math.*;
import java.util.Map.*;
public class codeforces {
static int count =0;
static boolean f=false;
static int [] arr;
static PrintWriter pw=new PrintWriter(System.out);
static void solve(int index , int mask) {
if(index==arr.l... | nlogn | 994_B. Knights of a Polygonal Table | CODEFORCES |
import java.util.*;
import java.io.*;
public class b {
public static void main(String[] args) throws IOException
{
input.init(System.in);
PrintWriter out = new PrintWriter(System.out);
int n = input.nextInt(), a = input.nextInt(), b = input.nextInt();
Num[] data = new Num[n];
for(int i = 0; i<n; i++... | linear | 468_B. Two Sets | CODEFORCES |
import java.io.*;
import java.math.BigInteger;
import java.util.*;
public class A {
static MyScanner sc;
static PrintWriter pw;
public static void main(String[] args) throws Throwable {
sc = new MyScanner();
pw = new PrintWriter(System.out);
n = sc.nextInt();
int m = sc.ne... | np | 1102_F. Elongated Matrix | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
public class Main
{
public static void main(String args[])
{
Scanner scan=new Scanner(System.in);
int n=scan.nextInt();
System.out.println((n%4==0||n%7==0||n%47==0||n%74==0||n%447==0||n%474==0||n%477==0||n%744==0||n%747==0||n%774==0... | constant | 122_A. Lucky Division | CODEFORCES |
import java.io.*;
import java.util.*;
/**
* @author def
* @version 1.0
*/
public class B {
public static void main(String[] args) throws IOException {
new B().solve();
}
void solve() throws IOException {
in = new BufferedReader(new InputStreamReader(System.in));
out = new Print... | linear | 1_B. Spreadsheets | CODEFORCES |
import java.util.*;
import java.lang.*;
import java.io.*;
import java.math.*;
/*
* Author : joney_000[jaswantsinghyada007@gmail.com]
* Algorithm : N/A
* Platform : Codeforces
* Ref :
*/
public class A{
private InputStream inputStream ;
private OutputStream outputStream ;
private FastReader i... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
public class MAIN
{
public static void main(String args[])
{
Scanner sn=new Scanner(System.in);
int n,n1,n2,n3;
int arr[]={0,1,1,2,3,5,8,13,21,34,55,89,144,233,377,610,987,1597,2584,4181,6765,10946,17711,28657,46368,75025,121393... | constant | 199_A. Hexadecimal's theorem | CODEFORCES |
import java.util.*;
import java.io.*;
import java.awt.Point;
import java.math.BigInteger;
import static java.lang.Math.*;
// Solution is at the bottom of code
public class ProblemC_008 implements Runnable{
final boolean ONLINE_JUDGE = System.getProperty("ONLINE_JUDGE") != null;
BufferedReader in;
OutputWrit... | np | 8_C. Looking for Order | CODEFORCES |
import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.HashSet;
import java.util.Set;
import java.util.StringTokenizer;
import java.util.TreeSet;
//basically tried to unders... | nlogn | 274_A. k-Multiple Free Set | CODEFORCES |
/*
bts songs to dance to:
I need U
Run
ON
Filter
I'm fine
*/
import static java.lang.Math.max;
import static java.lang.Math.min;
import static java.lang.Math.abs;
import static java.lang.System.out;
import java.util.*;
import java.io.*;
import java.math.*;
public class x1515E
{
static long MOD;
public static ... | cubic | 1515_E. Phoenix and Computers | 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 C {
static int MOD = 1_000_000_007;
public static void main(String[] args) {
MyScanner in = new MyScanner();
... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.util.*;
import java.io.*;
import static java.lang.Math.*;
import java.math.*;
public class Main implements Runnable {
BufferedReader in;
PrintStream out;
StringTokenizer st = new StringTokenizer("");
static boolean local = false;
public static void main(String [] args) throws Exception {
if (arg... | linear | 46_C. Hamsters and Tigers | CODEFORCES |
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
public class incendio {
void dbg(Object...os) { System.err.println(Arrays.deepToString(os)); }
static StringTokenizer _stk; static BufferedReader input; static PrintWriter output;
static String next(){return _stk.nextToken();} static i... | cubic | 35_C. Fire Again | CODEFORCES |
import java.io.BufferedOutputStream;
import java.io.Closeable;
import java.io.DataInputStream;
import java.io.Flushable;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.util.InputMismatchException;
import java.util.function.Function;
/**
* Built using CHelper plug-in
... | np | 1238_E. Keyboard Purchase | CODEFORCES |
import java.util.Scanner;
public class A122 {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
if (n % 4 == 0 || n % 7 == 0 || n % 44 == 0 || n % 47 == 0
|| n % 74 == 0 || n % 77 == 0 || n % 444 == 0 || n % 447 == 0
|| n % 474 == 0 || n % 477 == 0 ||... | constant | 122_A. Lucky Division | CODEFORCES |
import java.io.*;
import java.util.*;
public class a{
static int a;
static Scanner sc = new Scanner(System.in);
public static void main(String[] args) throws IOException{
int n = sc.nextInt();
int p = n;
int m = sc.nextInt();
int k = sc.nextInt();
int a[] = new int[n]... | nlogn | 257_A. Sockets | CODEFORCES |
import java.io.PrintWriter;
import java.util.Scanner;
public class Solution {
private static int n;
private static PrintWriter writer;
private static int maxstep;
private static void g(int src, int step) {
if (step != 0 && n % src == 0) {
writer.print("YES");
writer... | constant | 122_A. Lucky Division | CODEFORCES |
import java.util.*;
public class TaskB {
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
int n = s.nextInt();
int k = s.nextInt();
int[] nums = new int[100000 + 10];
int first = -1, last = -1;
Set<Integer> dif = new Tre... | linear | 224_B. Array | CODEFORCES |
import java.io.*;
import java.lang.*;
import java.util.*;
public class alex
{
public static void main(String[] args)throws IOException
{
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();int sum=1;
for(int i=1;i<=n;i++)
{
sum=sum+(4*(i-1));
}
Syste... | linear | 1180_A. Alex and a Rhombus | CODEFORCES |
import java.util.Scanner;
public class A {
public static void main(String[] args){
Scanner in = new Scanner(System.in);
long n = in.nextLong();
System.out.println(25);
}
} | constant | 630_A. Again Twenty Five! | CODEFORCES |
import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.function.*;
import java.util.regex.*;
import java.util.stream.*;
import static java.util.stream.Collectors.joining;
import static java.util.stream.Collectors.toList;
pu... | linear | 1515_B. Phoenix and Puzzle | CODEFORCES |
import java.awt.Point;
import java.io.*;
import java.lang.Integer;
import java.math.BigInteger;
import java.util.*;
public class Main {
final boolean ONLINE_JUDGE = !new File("input.txt").exists();
BufferedReader in;
PrintWriter out;
StringTokenizer tok = new StringTokenizer("");
void init() thr... | linear | 701_C. They Are Everywhere | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.util.HashMap;
import java.math.BigInteger;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStrea... | nlogn | 903_D. Almost Difference | CODEFORCES |
//make sure to make new file!
import java.io.*;
import java.util.*;
public class EG14{
public static long MOD;
public static int MAX = 405;
public static long[] fac;
public static long[] ifac;
public static void main(String[] args)throws IOException{
BufferedReader f = new BufferedReader(... | cubic | 1515_E. Phoenix and Computers | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Set;
import java.util.Stack;
import java.util.StringTokenizer;
public class Main {
InputStreamReader ... | linear | 46_C. Hamsters and Tigers | CODEFORCES |
import java.util.*;
import java.math.*;
import java.io.*;
public class b implements Runnable{
PrintWriter out = null;
public int toint(String s){
int res = 0;
for (int i = 0; i < s.length(); i++){
res *= 10;
res += s.charAt(i)-'0';
}
return res;
}
public void tostr(int k){
if (k == 0) return;
to... | linear | 1_B. Spreadsheets | 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 Andrew Porokhin, andrew.porokhin@gmail.com
*/
public class Problem111A implements Runnable {
void solve() throws Numbe... | nlogn | 160_A. Twins | CODEFORCES |
import java.io.*;
import java.util.*;
public class A {
public static void main(String[] args) throws Exception {
new A().solve();
// new FileInputStream(new File("input.txt")),
// new PrintStream(new FileOutputStream(new File("output.txt"))));
}
void solve() throws IOException {
... | nlogn | 274_A. k-Multiple Free Set | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
static InputReader in = new InputReader(System.in);
static PrintWriter out = new PrintWriter(System.out);
static int oo = (int)1e9;
static int mod = 1000000007;
public static void main(String[] args) throws IOException {
int n = in.nextInt()... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import static java.util.Arrays.*;
import static java.lang.Math.*;
import java.util.*;
import java.io.*;
public class Main implements Runnable
{
public static void main(String [] args) throws IOException
{
new Thread(null, new Main(), "", 1 << 20).start();
}
String file = "input";
BufferedReader input;
Print... | np | 8_C. Looking for Order | CODEFORCES |
import javax.print.attribute.standard.RequestingUserName;
import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) throws NumberFormatException, IOException
{
InputStream inputStream = System.in;
OutputStream outputStream = System.out;
InputReade... | quadratic | 1086_C. Vasya and Templates | CODEFORCES |
import java.util.*;
import java.io.*;
import java.text.*;
public class CF_1523_C{
//SOLUTION BEGIN
void pre() throws Exception{}
void solve(int TC) throws Exception{
int N = ni();
int[] A = new int[N];
for(int i = 0; i< N; i++)A[i] = ni();
// Stack<Integer> stack = new Stack... | cubic | 1523_C. Compression and Expansion | 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.util.Arr... | cubic | 1185_G2. Playlist for Polycarp (hard version) | 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.*;
public class Main {
public static void main(String[] args) throws Exception {
MScanner sc=new MScanner(System.in);
PrintWriter pw=new PrintWriter(System.out);
int n=sc.nextInt();HashSet<Integer>nums=new HashSet<Integer>();
int[]in=new int[n];for(int i=0;i<n;i++)in[i]=s... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.FileNotFoundException;
import java.util.StringTokenizer;
import java.io.Writer;
import java.io.Buffer... | linear | 1004_A. Sonya and Hotels | 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
* @author sheep
*/
public class Main ... | constant | 343_A. Rational Resistance | CODEFORCES |
import java.io.*;
import java.util.*;
public class A {
BufferedReader br;
PrintWriter out;
StringTokenizer st;
boolean eof;
void solve() throws IOException {
String s = nextToken();
int res = Integer.parseInt(s);
String s1 = s.substring(0, s.length() - 1);
res = Math.max(res, Integer.parseInt(s1));
... | constant | 313_A. Ilya and Bank Account | CODEFORCES |
import java.util.Scanner;
public class Subtractions {
public static void main(String args[]) {
Scanner scan = new Scanner(System.in);
int t = scan.nextInt();
while (t-- > 0) {
int a = scan.nextInt();
int b = scan.nextInt();
int res = 0;
while... | constant | 267_A. Subtractions | CODEFORCES |
import java.io.*;
public class n5D
{
public static void main(String[] args)
{
double a = 0, v = 0, l = 0, d = 0, w = 0;
try
{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String[] str = br.readLine().split(" ");
a = Double... | constant | 5_D. Follow Traffic Rules | CODEFORCES |
import java.io.*;
import java.util.*;
public class C {
static class FastReader {
BufferedReader br;
StringTokenizer st;
public FastReader() {
br = new BufferedReader(new
InputStreamReader(System.in));
}
String next() {
while (st ... | cubic | 1523_C. Compression and Expansion | CODEFORCES |
import java.util.*;
import java.io.*;
public class R489C {
static long m = (long)(1e9+7);
/*
1000000000000000000
*/
public static void main(String[] args) {
JS scan = new JS();
long n = scan.nextLong();
long k = scan.nextLong();
if(n == 0) {
System.out.println(0);
return;
}
if(k == 0) {
l... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.io.*;
import java.util.LinkedList;
public class Solution {
public static void main(String[] args) throws IOException {
BufferedReader in = new BufferedReader(new FileReader("input.txt"));
PrintWriter out = new PrintWriter("output.txt");
String[] raw = in.readLine().split(" ");
... | cubic | 35_C. Fire Again | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class Berland implements Runnable {
private void solve() throws IOException {
double a = nextInt();
double v = nextInt();
double ... | constant | 5_D. Follow Traffic Rules | 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 CFD {
BufferedReader br;
PrintWriter out;
StringTokenizer st;
boolean eof;
final long MOD = 1000L * 1000L * 1000L +... | nlogn | 903_D. Almost Difference | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main implements Runnable
{
Scanner in;
PrintWriter out; //= new PrintWriter(System.out);
public static void main(String[] args) throws FileNotFoundException, IOException
{
new Thread(new Main()).start();
}
public class Pair
{
public long last;... | cubic | 23_A. You're Given a String... | CODEFORCES |
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] arr = new int[n];
arr[0] = sc.nextInt();
for (int i = 1; i < n; i++) {
arr[i] = arr[i - 1] + sc.nextInt();
... | quadratic | 1141_F2. Same Sum Blocks (Hard) | CODEFORCES |
import java.io.File;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;
public class C {
Scanner in;
PrintWriter out;
// String INPUT = "3 3 1 1 1";
String INPUT = "";
void solve()
{
int n = ni();
int m = ni();
int k = ni();
int[][] f=new int[k][2];
f... | cubic | 35_C. Fire Again | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class SFly {
public static void main(String[] args) throws IOException {
BufferedReader lector = new BufferedReader(new InputStreamReader(System.in));
int planet = Integer.parseInt(lector.readLine());
int ini... | linear | 1010_A. Fly | 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
*/
public cla... | nlogn | 257_A. Sockets | CODEFORCES |
import java.util.*;
import java.io.*;
public class Fish
{
public static void main(String[] args) throws Exception { new Fish(); }
public Fish() throws Exception
{
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
double[][] P = new double[N][N];
for(int i = 0; i... | np | 16_E. Fish | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class problemB185 {
public static void main(String[] args) throws IOException{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
StringBuffer sb=new StringBuffer();
int n=Integer.parseInt... | constant | 313_A. Ilya and Bank Account | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Random;
import java.util.StringTokenizer;
public class Test {
static BufferedReader reader;
static StringTokenizer ... | nlogn | 160_A. Twins | CODEFORCES |
//package pack;
import java.util.*;
public class first
{
public static long power(long x, long y, long p)
{
long res = 1;
x = x % p;
while (y > 0)
{ if((y & 1)==1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return... | logn | 992_C. Nastya and a Wardrobe | CODEFORCES |
import java.awt.*;
import java.io.*;
import java.sql.Array;
import java.util.*;
import java.util.List;
public class Main {
static class FastReader {
BufferedReader br;
StringTokenizer st;
public FastReader()
{
br = new BufferedReader(
new InputStream... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.io.*;
import java.util.*;
// :%s/Cbeta35/"name"/
// if (debug)
public class Cbeta35 {
public static void main(String[] args) { new Cbeta35(); }
Scanner in;
PrintWriter out;
int t;
int n, m, k, oo;
int[][] grid;
boolean debug = !true, multi = !true;
Cbeta35() {
if (multi) t = in.nextInt();
... | cubic | 35_C. Fire Again | CODEFORCES |
import java.awt.Point;
import java.io.*;
import java.text.*;
import java.util.*;
import java.util.regex.*;
public class Main{
static class Run implements Runnable{
//TODO parameters
final boolean consoleIO = false;
final String inFile = "input.txt";
... | cubic | 35_C. Fire Again | CODEFORCES |
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.io.BufferedWriter;
import java.util.InputMismatchException;
import java.io.FileOutputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.FileInputStream;
import java.util.NoSuchElementException;
import java.io.Writer;... | cubic | 35_C. Fire Again | CODEFORCES |
import java.util.Arrays;
import java.util.HashSet;
import java.util.Set;
public class Main {
private static void solve() {
int n = ni();
int d = ni();
int[] a = na(n);
Arrays.sort(a);
Set<Integer> set = new HashSet<>();
for (int i = 0; i < n; i ++) {
int cand1 = a[i] - d;
int ... | linear | 1004_A. Sonya and Hotels | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class Bag implements Runnable {
private void solve() throws IOException {
int xs = nextInt();
int ys = nextInt();
int n = nextInt... | np | 8_C. Looking for Order | CODEFORCES |
import java.io.IOException;
import java.util.Arrays;
import java.util.Iterator;
import java.util.Scanner;
import java.util.TreeSet;
public class Test {
int readInt() {
int ans = 0;
boolean neg = false;
try {
boolean start = false;
for (int c = 0; (c = System.in.read(... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;
public class Code {
public static void main(String[] args) throws IOException{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(br.readLine());
Ha... | linear | 958_D1. Hyperspace Jump (easy) | CODEFORCES |
import java.util.*;
import java.io.*;
public class code {
public static void main(String[] args) throws Exception {
Scanner sc = new Scanner(System.in);
int q = sc.nextInt();
long[] d = new long[30];
d[0] = 1;
for(int i=1;i<30;i++) d[i] = d[i-1]*4;
for(int z=0;z<q;z++){
long r = 0;
long n = sc... | logn | 1080_D. Olya and magical square | CODEFORCES |
import java.io.OutputStream;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.FileInputStream;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.BufferedWriter;
import java.util.Collection;
import java.util.InputMismatchException;
import java.... | cubic | 35_C. Fire Again | CODEFORCES |
import java.util.*;
import java.io.*;
public class CF911D {
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; i++){
array[i] = sc.nextInt();
}
int count = 0;
for(... | quadratic | 911_D. Inversion Counting | CODEFORCES |
//package codeforces;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;
public class D {
BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
PrintWriter writer = new PrintWriter(System.out);
... | cubic | 387_D. George and Interesting Graph | 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.*;
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.util.*;
import java.io.*;
import java.lang.*;
import java.math.*;
public class E {
public static void main(String[] args) throws Exception {
BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
... | np | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
import java.util.*;
import java.lang.*;
import java.io.*;
import java.awt.*;
// U KNOW THAT IF THIS DAY WILL BE URS THEN NO ONE CAN DEFEAT U HERE................
//JUst keep faith in ur strengths ..................................................
// ASCII = 48 + i ;// 2^28 = 268,435,456 > 2* 10^8 // log 10 base 2 ... | quadratic | 1141_F2. Same Sum Blocks (Hard) | CODEFORCES |
import java.util.*;
public class A
{
public static void main(String args[])
{
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
int[] a = new int[n];
for(int i=0;i < n;i++)
a[i] = scan.nextInt();
Arrays.sor... | nlogn | 22_A. Second Order Statistics | CODEFORCES |
import java.util.*;
import java.io.*;
import java.lang.*;
import java.math.*;
public class B {
public static void main(String[] args) throws Exception {
BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
... | constant | 1028_B. Unnatural Conditions | CODEFORCES |
import java.io.*;
import java.math.BigInteger;
import java.util.*;
public class Main {
public static void main(String[] args) throws IOException {
(new Main()).solve();
}
public Main() {
}
MyReader in = new MyReader();
PrintWriter out = new PrintWriter(System.out);
void solve() throws IOException {
// ... | logn | 287_B. Pipeline | CODEFORCES |
import java.util.Scanner;
public class C {
static long n = 0;
static void R (long a,long b){
n += a/b;
a = a%b;
if(a==0) return;
R(b,a);
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long a = sc.nextLong();
long b = sc.nextLong();
R(a,b);
System.out.printl... | constant | 343_A. Rational Resistance | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class CF1197B {
public static void main(String[] args) {
FastReader input = new FastReader();
int n = input.nextInt();
int[] arr = new int[n];
int ma... | linear | 1197_B. Pillars | CODEFORCES |
import java.util.Scanner;
public class D {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int m = sc.nextInt();
int[][]a = new int[n][n];
for (int i = 1; i <= m; i++) {
int v1 = sc.nextInt();
int ... | np | 11_D. A Simple Task | CODEFORCES |
import java.util.*;
import java.io.*;
import java.math.*;
public class loser
{
static class InputReader {
public BufferedReader br;
public StringTokenizer token;
public InputReader(InputStream stream)
{
br=new BufferedReader(new InputStreamReader(stream),32768);
... | constant | 965_A. Paper Airplanes | CODEFORCES |
import java.io.*;
import java.util.Locale;
import java.util.StringTokenizer;
public class B implements Runnable {
private static final boolean ONLINE_JUDGE = true;//System.getProperty("ONLINE_JUDGE") != null;
private BufferedReader in;
private PrintWriter out;
private StringTokenizer tok = new String... | logn | 713_B. Searching Rectangles | CODEFORCES |
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.math.BigInteger;
import java.nio.charset.Charset;
import java.util.*;
public class CFContest {
public static void main(String[] args) throws Exception {
boolean local = System... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import com.sun.org.apache.xpath.internal.operations.Bool;
import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) throws Exception {
MyScanner scan = new MyScanner();
out = new PrintWriter(new BufferedOutputStream(System.out));
int n = scan.nextIn... | nlogn | 1033_C. Permutation Game | CODEFORCES |
import java.io.*;
import java.util.*;
public class F {
public static void main(String[] args) throws IOException {
BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
PrintWriter writer = new PrintWriter(System.out);
StringTokenizer st = new StringTokenizer(reader.... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.io.OutputStreamWriter;
import java.util.NoSuchElementException;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.Iterator;
import ja... | nlogn | 528_B. Clique Problem | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main
{
static final boolean _DEBUG = false;
private static class MyScanner {
BufferedReader br;
StringTokenizer st;
public MyScanner(BufferedReader _br) {
br = _br;
}
String next() {
while (st == null || !st.hasMoreElements()) {
try {
st ... | np | 111_C. Petya and Spiders | CODEFORCES |
import java.util.Scanner;
public class Sub
{
public static void main(String[] args)
{
Scanner scan=new Scanner(System.in);
int noOfPairs=scan.nextInt();
while(noOfPairs-->0)
{
int x=scan.nextInt();
int y=scan.nextInt();
int res=0;
while(x!=0&&y!=0)
{
if(x>y)
{
res+=x/y;
x=... | constant | 267_A. Subtractions | CODEFORCES |
import java.io.*;
import java.util.*;
public class cfe {
static DataReader input;
static int LARGE_INT = 1000000007;
//static int MAXN = 300000;
//static int[] len = new int[300000];
//static int[] price = new int[300000];
static final int[] BM = {1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8192, 1... | np | 1238_E. Keyboard Purchase | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) throws IOException {
Main m = new Main();
m.run();
m.out.close();
}
void run() throws IOException {
int n = nextInt();
int m = nextInt();
int k = nextInt();
... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.io.FilterInputStream;
import java.io.BufferedInputStream;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*
* @author J... | np | 1238_E. Keyboard Purchase | CODEFORCES |
import java.io.*;
import java.util.*;
/**
*
* @author Jishnu_T
*/
public class ReallyBigNums {
private static long[] factorArray(long s)
{
int d=0;
long n=s;
long f=1;
while(n>0)
{
n=n/10;
d++;
f = f*10;
}
... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.io.*;
import java.lang.*;
import java.util.*;
public class Solver {
public static void main(String[] args) {
FastReader in = new FastReader();
PrintWriter out = new PrintWriter(System.out);
TaskC solver = new TaskC(in, out);
solver.solve();
out.close();
}
... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution ... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.util.*;
import java.lang.*;
import java.math.*;
import java.io.*;
import static java.lang.Math.*;
import static java.util.Arrays.*;
import static java.util.Collections.*;
public class P111C{
Scanner sc=new Scanner(System.in);
int INF=1<<28;
double EPS=1e-9;
int h, w;
void run(){
h=sc.nextInt();
... | np | 111_C. Petya and Spiders | CODEFORCES |
import java.util.*;
import java.io.*;
import java.math.*;
public class Solution{
public static void main(String[] args) throws Exception {
int n=nextInt();
int r=nextInt();
int x[]=new int[n];
double y[]=new double[n];
for(int i=0;i<n;i++)
x[i]=nextInt();
... | quadratic | 908_C. New Year and Curling | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class AAA {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTok... | constant | 1028_B. Unnatural Conditions | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
public class TemplateBuf implements Runnable{
private void solve() throws Exception {
long n = nextUnsignedLong();
out.println(n... | constant | 84_A. Toy Army | CODEFORCES |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.