src stringlengths 95 64.6k | complexity stringclasses 7
values | problem stringclasses 256
values | from stringclasses 1
value |
|---|---|---|---|
import java.io.*;
import java.util.*;
import java.math.*;
public class C implements Runnable {
BufferedReader in;
PrintWriter out;
StringTokenizer st;
Random rnd;
short[] qx, qy;
boolean[][] used;
final int[] dx = {1, -1, 0, 0};
final int[] dy = {0, 0, 1, -1};
void solve() throws IOException {
int n = n... | cubic | 35_C. Fire Again | CODEFORCES |
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
public class Code implements Runnable {
public static void main(String[] args) throws IOException {
new Thread(new Code()).start();
}
private void solve() throws IOException {
int n = nextInt(), m = nextInt();
... | np | 112_E. Petya and Spiders | CODEFORCES |
import java.util.*;
import java.io.*;
public class E584 {
public static void main(String[] args) {
MyScanner sc = new MyScanner();
PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));
int t = sc.nextInt();
while (t > 0) {
int n = sc.nextInt(); int m = ... | np | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
import java.util.Scanner;
public class C344C {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long a = sc.nextLong();
long b = sc.nextLong();
long count = a / b, c;
a = a % b;
while(true){
if (a <= 1 || b <= 1) break;
c = b - a;
b = a;
a = c;
count++;
if ... | constant | 343_A. Rational Resistance | CODEFORCES |
import java.util.*;
import java.io.*;
import java.math.*;
public class Main {
public static Scanner scan = new Scanner(System.in);
public static boolean bg = true;
public static void main(String[] args) throws Exception {
long n1 = Integer.parseInt(scan.next());
if (n1==1){
Sys... | constant | 235_A. LCM Challenge | CODEFORCES |
//package Round584;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;
public class typeA {
public static void main(String[] args) {
FastReader s = new FastReader();
int n = s.nextInt();
int[] arr = new int[n];
for(int i=0;i<n;i++) {
arr[i]=s.nex... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.util.*;
public class PC1229 {
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int r = sc.nextInt();
int[] x = new int[n];
for(int i = 0; i < n; i++){
x[i] = sc.nextInt();
}
double[] ans = new double[n];
for(int i = 0; i < n; i++){
d... | quadratic | 908_C. New Year and Curling | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.Reader;
import java.util.StringTokenizer;
public class MotherOfDragons {
public static void main(String[] args) {
FastScanner scanner = new FastScanner();
PrintWri... | np | 839_E. Mother of Dragons | 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.*;
public class A {
Scanner in = new Scanner(System.in);
public class Houses implements Comparable<Houses>{
double x;
double a;
public Houses(double xVal, double aVal){
x = xVal-aVal/2;
a = aVal;
}
@Override
public int compareTo(Houses o) {
return (int) (x - o.x);
}
}
... | nlogn | 15_A. Cottage Village | CODEFORCES |
import java.util.*;
import java.lang.*;
import java.math.*;
import java.io.*;
public class Main {
public static void deal(int n,int m,int k,int[][] d1,int[][] d2) {
if(k % 2 == 1) {
for(int i=0;i<n;i++) {
for(int j=0;j<m;j++) {
System.out.print("-1 ");
... | cubic | 1517_D. Explorer Space | CODEFORCES |
import java.io.*;
import java.util.*;
public class A{
public static BufferedReader k;
public static BufferedWriter z;
public static void main(String [] args)throws IOException{
k = new BufferedReader(new InputStreamReader(System.in));
z = new BufferedWriter(new OutputStreamWriter(System.out));
... | constant | 483_A. Counterexample | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at ... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.io.*;
import java.util.*;
public class CottageVillage
{
public Scanner in = new Scanner(System.in);
public PrintStream out = System.out;
public int n, t;
public Pair[] v;
public void main()
{
n = in.nextInt();
t = in.nextInt();
int i;
v = new Pair[n];
for(i=0;i<n;++i) v[i] = new Pair... | nlogn | 15_A. Cottage Village | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;
public class C {
void solve(){
int n = readInt();
int q = readInt();
int max = 0;
int[] a = new int[n];
Deque<Integer> deque = new ArrayDeque<>();
for(int i ... | linear | 1180_C. Valeriy and Deque | CODEFORCES |
import java.util.*;
import java.io.*;
import java.text.*;
import java.math.*;
import static java.lang.Integer.*;
import static java.lang.Double.*;
import java.lang.Math.*;
public class two_squares {
public static void main(String[] args) throws Exception {
new two_squares().run();
}
public void run() throws Exc... | constant | 994_C. Two Squares | CODEFORCES |
import java.io.*;
import java.io.IOException;
import java.util.Iterator;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;
import java.util.Stack;
import java.util.TreeSet;
public class ViewAngle{
private static int V,level[][],count=-1,lev_dfs[],degree=0,no_vert_conn_comp=0;
... | cubic | 35_C. Fire Again | CODEFORCES |
import java.awt.Point;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.PrintStream;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;
public class FireAgain {
Point coordinate;
Queue<Point> q = new Linke... | cubic | 35_C. Fire Again | 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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class Main {
public static void main(String args[]) {
InputStream intputStream = System.in;
Out... | constant | 630_A. Again Twenty Five! | 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]);
long x=L... | nlogn | 1061_D. TV Shows | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Iterator;
import java.io.BufferedWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.Writer;
imp... | np | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
import java.awt.Point;
import java.util.Arrays;
import java.util.Scanner;
public class C {
static int[] DP;
static Point[] Next;
static int[][] pair;
static int[] single;
static int n;
public static int get(int mask) {
if (mask + 1 == (1 << n))
return 0;
if (DP[mas... | np | 8_C. Looking for Order | CODEFORCES |
//package com.krakn.CF.D1159;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n, k;
n = sc.nextInt();
k = sc.nextInt();
int a = (n - k) / 2;
StringBuilder s = new StringBuilder();
... | linear | 1159_D. The minimal unique substring | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;
public class A {
static class Scanner{
BufferedReader br=null;
StringTokenizer tk=null;
public Scanner(){
br=new BufferedReader(new InputStreamReader(Syst... | nlogn | 257_A. Sockets | CODEFORCES |
import java.io.*;
public class Main
{
public static void main(String []args)throws Exception
{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
int n=0;
n=Integer.parseInt(br.readLine());
String inp="";
inp=br.readLine();
int no[]=new int[... | linear | 25_A. IQ test | CODEFORCES |
/**
*
* @author bossbelik
*/
import java.io.*;
import java.util.*;
import java.math.*;
public class Main{
static long N = 100;
static long CNT = 62;
static long INF = 1 << 62;
static long parsenum(long j, long l) {
String k = "";
long cur = 0;
for (int i = (int) j; i <= l;... | np | 839_E. Mother of Dragons | CODEFORCES |
import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.lang.reflect.Array;
import java.math.BigDecimal;
import java... | nlogn | 160_A. Twins | CODEFORCES |
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;
public class P023A {
public static void main(String[] args) {
Scanner inScanner = new Scanner(System.in);
String string = inScanner.next();
int n = string.length();
for (int l = n - 1; l > 0; l--) {
... | cubic | 23_A. You're Given a String... | 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... | np | 1209_E1. Rotate Columns (easy version) | CODEFORCES |
import java.util.*;
public class A {
public static void main(String args[]){
Scanner in = new Scanner(System.in);
int n=in.nextInt(),s=0;
int[] a= new int[n];
for (int i=0;i<n;i++) {a[i]=in.nextInt(); s+=a[i];}
Arrays.sort(a); int k=0,ans=0;
for (int i=n-1;i>=0;i--)
if (k<=s/2) {k+=a[i];ans++;}
System.ou... | nlogn | 160_A. Twins | CODEFORCES |
import java.util.Scanner;
/**
*
* @author msagimbekov
*/
public class Codeforces908C {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int r = sc.nextInt();
int[] x = new int[n];
double[] res = new double[n];
fo... | quadratic | 908_C. New Year and Curling | CODEFORCES |
import java.util.*;
public class F2 {
private static int n;
private static int[] a;
private static Collection<Segment> answer;
public static void main(String[] args) {
in();
solution();
out();
}
private static void in() {
Scanner in = new Scanner(System.in);... | quadratic | 1141_F2. Same Sum Blocks (Hard) | 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
*/
public class Main {
public static void main(String[] args) {
InputStrea... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.util.Scanner;
public class sub {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int num = in.nextInt();
while(num-->0) {
int a = in.nextInt();
int b = in.nextInt();
int res = 0;
while(a!=0 && b!=0) {
if(a>=b) {
res += a/b;
a %= b;
} els... | constant | 267_A. Subtractions | CODEFORCES |
import java.util.Scanner;
public class LuckySubstring {
static int[] luck;
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
int n = s.nextInt();
int i = -1;
boolean ehLuck = false;
preencheLucky();
while (n >= luck[+... | constant | 122_A. Lucky Division | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.io.BufferedWriter;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.util.InputMismatchException;
import java.io.IOExcept... | quadratic | 980_C. Posterized | CODEFORCES |
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;
public class Main {
public static void main(String args[]) throws IOException {
File f = new Fi... | cubic | 35_C. Fire Again | CODEFORCES |
import java.io.*;
import java.util.*;
public class C {
private static boolean marked[][] ;
public static void main(String[] args) throws Exception {
// BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
// InputStream inputStream = System.in;
// Outp... | cubic | 35_C. Fire Again | CODEFORCES |
import java.util.*;
public class algo_1802
{
public static void main(String args[])
{
Scanner ex=new Scanner(System.in);
int n=ex.nextInt();
int k=ex.nextInt();
int x=(int)((Math.sqrt(9.0+8.0*((double)n+(double)k))-3.0)/2.0);
System.out.println(n-x);
}
} | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.util.Scanner;
public class Main {
/**
* @param args
*/
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] nums = new int[n];
int kisu = 0;
int gusu = 0;
for(int i = 0 ; i < n ; i++){
... | linear | 25_A. IQ test | CODEFORCES |
import java.util.*;
import java.io.*;
import java.util.regex.*;
public class Codeforces{
static class MyScanner{
BufferedReader br;
StringTokenizer st;
MyScanner(FileReader fileReader){
br = new BufferedReader(fileReader);
}
MyScanner(){
br = new BufferedReader(new InputStreamReader(System.in)... | quadratic | 1141_F2. Same Sum Blocks (Hard) | CODEFORCES |
import java.util.InputMismatchException;
import java.io.*;
import java.util.Vector;
import java.util.Collections;
import java.util.Arrays;
/**
* Generated by Contest helper plug-in
* Actual solution is at the bottom
*/
public class Main {
public static void main(String[] args) {
InputReader in = new Str... | np | 8_C. Looking for Order | 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.io.Reader;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.ArrayList;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.BufferedReader;
import java.util.List;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.Writer;
import ... | cubic | 387_D. George and Interesting Graph | CODEFORCES |
import java.util.*;
public class Main{
private static final int MAX_SIZE = 100005;
public static void main(String args[]){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int m = sc.nextInt();
int a = sc.nextInt();
int b = sc.nextInt();
if(((m + 1) / ... | linear | 967_A. Mind the Gap | CODEFORCES |
import java.awt.Point;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.StringTokenizer;
import static java.lang.Math.*;
import static java.lang.Integer.*;
import static java.lang.Long.*;
import static java.lang.Character.*;
import s... | logn | 276_D. Little Girl and Maximum XOR | 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.Scanner;
public class Main{
public static void main(String args[]){
Scanner in = new Scanner(System.in);
int T = in.nextInt();
while(T!=0){
T--;
int a = in.nextInt();
int b = in.nextInt();
int ans=0;
while(a>0&&b>... | constant | 267_A. Subtractions | CODEFORCES |
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStream;
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.HashSet;
import ja... | constant | 915_B. Browser | CODEFORCES |
import java.util.*;
import java.io.*;
import java.text.*;
public class CF_1515_B{
//SOLUTION BEGIN
void pre() throws Exception{}
void solve(int TC) throws Exception{
long N = nl();
if(N%2 == 1){
pn("NO");
return;
}
N /= 2;
boolean yes = ps(N)... | linear | 1515_B. Phoenix and Puzzle | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;
public class Main{
static class FastScanner {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenize... | cubic | 1523_C. Compression and Expansion | CODEFORCES |
import java.math.BigInteger;
import java.util.*;
/**
* Created by IntelliJ IDEA.
* User: piyushd
* Date: 4/13/11
* Time: 8:07 PM
* To change this template use File | Settings | File Templates.
*/
public class TaskA1 {
void run(){
int n = nextInt();
int ans = 2 * n - (n / 2);
System.... | constant | 84_A. Toy Army | CODEFORCES |
import java.io.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Main {
public static void main(String [] args ) {
try{
String str;
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
BufferedOutputStrea... | constant | 313_A. Ilya and Bank Account | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
import java.awt.geom.*;
import static java.lang.Math.*;
public class Solution implements Runnable {
public void solve () throws Exception {
int n = sc.nextInt();
int k = sc.nextInt();
TreeSet<Integer> bad = new TreeSet<>();
int a [] = new int [n... | nlogn | 274_A. k-Multiple Free Set | CODEFORCES |
import java.util.*;
import java.io.*;
import java.awt.Point;
import java.math.BigDecimal;
import java.math.BigInteger;
import static java.lang.Math.*;
// Solution is at the bottom of code
public class B implements Runnable{
final boolean ONLINE_JUDGE = System.getProperty("ONLINE_JUDGE") != null;
BufferedReader... | linear | 468_B. Two Sets | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main implements Runnable {
class House implements Comparable<House> {
int x;
int a;
public House(int x, int a) {
this.x = x;
this.a = a;
}
@Override
public int compareTo(House other) {
return x - other.x;
}
}
// private void solution() thr... | nlogn | 15_A. Cottage Village | CODEFORCES |
import java.awt.*;
import java.awt.geom.*;
import java.io.*;
import java.math.*;
import java.text.*;
import java.util.*;
/*
br = new BufferedReader(new FileReader("input.txt"));
pw = new PrintWriter(new BufferedWriter(new FileWriter("output.txt")));
br = new BufferedReader(new InputStreamReader(System.in));
pw = new P... | constant | 267_A. Subtractions | CODEFORCES |
import java.io.*;
import java.util.*;
public class A
{
PrintWriter out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer tok;
public void go() throws IOException
{
ntok();
... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Scanner;
public class SolutionArch2 {
public static void main(String[] args) {
Scanner scanner = new Scann... | quadratic | 1141_F2. Same Sum Blocks (Hard) | CODEFORCES |
import java.io.*;
import java.math.BigInteger;
import java.util.*;
public class Main {
static int MOD = 1000000007;
// After writing solution, quick scan for:
// array out of bounds
// special cases e.g. n=1?
// npe, particularly in maps
//
// Big numbers arithmetic bugs:
// in... | cubic | 1523_C. Compression and Expansion | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
imp... | np | 1185_G1. Playlist for Polycarp (easy version) | CODEFORCES |
import java.io.*;
import java.math.BigInteger;
import java.util.*;
public class Main {
public static void main(String[] args) throws Exception {
InputReader in = new InputReader(System.in);
int n = in.readInt();
int m = in.readInt();
int k = in.readInt();
long wrong = n - m... | logn | 338_A. Quiz | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class A {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int []a = new int [n];
boolean []used = new boolean[n];
for (int i = 0; i < n; i++) {
a[i] = sc.nextInt();
}
Arrays.sort(a);
int a... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class A125D2 {
public static void main(String[] args) throws Exception {
InputReader in = new InputReader(System.in);
System.out.println(0 + " " + 0 + ... | constant | 199_A. Hexadecimal's theorem | CODEFORCES |
import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.*;
public class D {
static HashMap<Long, Integer> comp = new HashMap<Long, Integer>()... | nlogn | 903_D. Almost Difference | CODEFORCES |
import java.io.*;
import java.util.*;
public class practice {
public static void main(String[] args) throws Exception {
//Scanner in = new Scanner(new File("practice.in"));
Scanner in = new Scanner(System.in);
String str = in.nextLine();
long n = Long.parseLong(str.substring(0, str.indexOf(" ")));
long m =... | constant | 483_A. Counterexample | CODEFORCES |
import java.util.*;
public class ErrorCorrectSystem
{
public static void main(String[] args)
{
Scanner scan = new Scanner(System.in);
int n = scan.nextInt();
String a = scan.next();
String b = scan.next();
int[][] mismatch = new int[26][26];
for(int i = 0; i < 26; i++) Arrays.fill(mismatch[i], -1);
... | linear | 527_B. Error Correct System | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class AnnoyingPresent {
//UPSOLVED
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String... | linear | 1009_C. Annoying Present | CODEFORCES |
//package codeforces;
import java.io.PrintWriter;
import java.util.*;
public class codeforces {
public static void main(String[] args) {
PrintWriter out=new PrintWriter(System.out);
Scanner s=new Scanner(System.in);
int t=s.nextInt();
for(int tt=0;tt<t;tt++) {
long n=s.nextInt();
long x=... | linear | 1515_B. Phoenix and Puzzle | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.LinkedList;
import java.util.Map;
import java.util.StringTokenizer;
import javafx.util.Pair;
public class Solve6 {
public static void main(String[] ar... | quadratic | 1141_F2. Same Sum Blocks (Hard) | CODEFORCES |
import java.io.*;
public class First {
StreamTokenizer in;
PrintWriter out;
int nextInt() throws IOException {
in.nextToken();
return (int)in.nval;
}
long nextLong() throws IOException {
in.nextToken();
return (long) in.nval;
}
String nextString() throws ... | linear | 1011_A. Stages | CODEFORCES |
import java.util.*;
import java.io.*;
public class EdE {
static long[] mods = {1000000007, 998244353, 1000000009};
static long mod = mods[0];
public static MyScanner sc;
public static PrintWriter out;
static ArrayList<Integer> primes;
public static void main(String[] omkar) throws Exception{
// TODO Auto-... | cubic | 1497E2 | 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 C{
Scanner sc=new Scanner(System.in);
int INF=1<<28;
double EPS=1e-9;
int n, m;
void run(){
n=sc.nextInt();
m=sc.nextInt()... | np | 111_C. Petya and Spiders | 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.util.Scanner;
public class maestro{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int N = sc.nextInt();
long mod = (long)Math.pow(10,9)+7;
long[][] arr = new long[N][N];
arr[0][0]=1;
for (int i=1;i<N;i++){
char c ... | quadratic | 909_C. Python Indentation | CODEFORCES |
import java.io.*;
import java.util.*;
public class cf {
static class FastScanner {
BufferedReader br;
StringTokenizer st;
public FastScanner() {
try {
br = new BufferedReader(new InputStreamReader(System.in));
st = new StringTokenizer(br.readLine()... | constant | 964_A. Splits | 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();
arr=new String[n];
for(int i... | quadratic | 909_C. Python Indentation | CODEFORCES |
public class Main {
public static void main(String[] args){
System.out.println("25");
}
} | constant | 630_A. Again Twenty Five! | CODEFORCES |
import java.util.Scanner;
import java.util.Vector;
import java.util.HashMap;
import java.util.Comparator;
public class F2{
static class Pair{
int l;
int r;
Pair(int l, int r){
this.l = l;
this.r = r;
}
public String toString(){
return "(" + l + ", " + r + ")";
}
}
public static void main(Strin... | quadratic | 1141_F2. Same Sum Blocks (Hard) | CODEFORCES |
import java.io.*;
import java.util.*;
public class CF {
long getAns(long a, long b) {
if (a == b)
return 1;
if (a < b) {
return getAns(b, a);
}
// a > b
long cnt = (a - 1) / b;
return cnt + getAns(b, a - b * cnt);
}
void solve() {
long a = in.nextLong();
long b = in.nextLong();
out.println... | constant | 343_A. Rational Resistance | CODEFORCES |
import java.util.*;
public class Main {
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int m = sc.nextInt();
long totalBlocks = 0;
long a[] = new long[n];
for(int i = 0; i < n; ++i) {
a[i] = sc.nextLo... | nlogn | 1061_B. Views Matter | CODEFORCES |
import java.io.InputStreamReader;
import java.io.IOException;
import java.util.InputMismatchException;
import java.io.BufferedReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.Reader;
import java.io.Writer;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution ... | np | 105_B. Dark Assembly | 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 |
//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.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
public class Coder{
static class FastScanner{
BufferedReader s;
StringTokenizer... | constant | 267_A. Subtractions | CODEFORCES |
import java.io.BufferedOutputStream;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Scanner;
public class Main implements Runnable {
PrintWriter out;
Scanner in;
public static void main(String[] args) throws IOException {
new Thread(new Main()).start();
}
public... | constant | 313_A. Ilya and Bank Account | CODEFORCES |
import java.util.Scanner;
public class Main{
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
while(sc.hasNext()) {
int n=sc.nextInt();
String s=sc.next();
int sum=0;
for(int i=0;i<s.length();i++) {
if(s.charAt(i)=='+') {
sum++;
}
if(s.charAt(i)=='-'&&sum!=0... | linear | 1159_A. A pile of stones | CODEFORCES |
import java.util.*;
public class Main {
static int n=5;
static int[] arr=new int[5];
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n=sc.nextInt();
int arr[]=new int[n];
for (int i=0;i<n;i++)
{
arr[i]=sc.nextInt();
... | linear | 1180_B. Nick and Array | CODEFORCES |
import java.io.*;
import java.util.*;
public class Solution{
static class FastReader
{
BufferedReader br;
StringTokenizer st;
public FastReader()
{
br = new BufferedReader(new
InputStreamReader(System.in));
}
String next()
... | quadratic | 1011_B. Planning The Expedition | CODEFORCES |
import java.io.*;
import java.util.*;
import java.util.Map.Entry;
public class Main {
Scanner in;
static PrintWriter out;
static class Scanner {
StreamTokenizer in;
Scanner(InputStream is) {
in = new StreamTokenizer(new BufferedReader(new InputStreamReader(is)));
in.resetSyntax();
in.whitespac... | nlogn | 274_A. k-Multiple Free Set | 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... | constant | 267_A. Subtractions | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class A {
/**
* @param args
* @throws IOException
* @throws NumberFormatException
*/
public static void main(String[] args) throws NumberFormatException, IOException {
// TODO Auto-generated method stub
... | linear | 25_A. IQ test | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
Scanner cin = new Scanner(new BufferedInputStream(System.in));
long n;
long maxlcm;
void run(){
n = cin.nextInt();
if(n == 1 || n ==2)
maxlcm = n;
else if(n >= 3){
if(n % 2 != 0){
maxlcm = ... | constant | 235_A. LCM Challenge | CODEFORCES |
import java.util.Scanner;
public class P_1177B {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
long k = scan.nextLong();
long k2 = k - 10;
int cont = 1, pos;
String out; //System.out.println(getString((int)k));
if(k <= 9)
System.out.println(k);
else {
cont++;
... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.util.*;
public class Beta15PA {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
Beta15PA temp = new Beta15PA();
temp.solve();
}
public void solve() {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt(), t = scan.nextInt();
Ho... | nlogn | 15_A. Cottage Village | CODEFORCES |
import java.io.*;
import java.util.*;
import java.util.function.IntPredicate;
import static java.lang.Math.*;
public class Main {
FastScanner in;
PrintWriter out;
static final String FILE = "";
public static final int TEST = 0;
class Interact {
Rect a, b;
public Interact(int x1... | logn | 713_B. Searching Rectangles | CODEFORCES |
import java.util.Scanner;
public class Test {
private static long sum(long value) {
long ans = 0;
while (value > 0) {
ans += value % 10;
value /= 10;
}
return ans;
}
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
long n , s , ans = 0;
n = scan.nextLong();
... | logn | 817_C. Really Big Numbers | CODEFORCES |
import java.util.Scanner;
/**
*
* @author igor_kz
*/
public class C46 {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int number = in.nextInt();
String s = in.next();
int cH = 0;
int n = s.length();
for (int i = 0 ; i < n ; i++)
... | linear | 46_C. Hamsters and Tigers | 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 | 274_A. k-Multiple Free Set | CODEFORCES |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.