src stringlengths 95 64.6k | complexity stringclasses 7
values | problem stringlengths 6 50 | from stringclasses 1
value |
|---|---|---|---|
/**
* Created by IntelliJ IDEA.
* User: Nick
* Date: 08.08.2010
* Time: 20:44:02
* To change this template use File | Settings | File Templates.
*/
import java.io.*;
import java.util.*;
import java.util.regex.*;
public class B {
public static void main(String[] args) {
Scanner input = new Scanner (Sy... | linear | 1_B. Spreadsheets | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
import java.awt.geom.*;
import java.util.regex.*;
public class Main implements Runnable {
StreamTokenizer ST;
PrintWriter out;
BufferedReader br;
int inf = 1000000000;
int nextInt() throws IOException{
... | linear | 1_B. Spreadsheets | CODEFORCES |
import java.io.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.InputStreamReader;
import java.io.PrintStream;
import java.io.PrintWriter;
import java.io.StringReader;
import java.util.ArrayList;
import java.util.Arrays... | linear | 1_B. Spreadsheets | CODEFORCES |
import java.util.Scanner;
import java.util.regex.Matcher;
import java.util.regex.Pattern;
public class Main {
public static void main(String[] args) {
Scanner scn = new Scanner(System.in);
int t = scn.nextInt();
while(t-- >0){
String str = scn.next();
Pattern p = Pattern.compile("R[0-9]+C[0-9]+");
... | linear | 1_B. Spreadsheets | 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.util.*;
import java.util.regex.*;
public class Main {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
Pattern rc_style = Pattern.compile("R[0-9]+C[0-9]+");
int n = input.nextInt();
while(n-- > 0) {
String str = input.next();
Matcher m = rc_style.matcher(... | linear | 1_B. Spreadsheets | CODEFORCES |
import java.util.Scanner;
public class B {
public static String toB(String str){
String row,col;
int i=0;
while(i<str.length() && str.charAt(i)<='Z'&&str.charAt(i)>='A')i++;
col = str.substring(0,i);
row = str.substring(i,str.length());
StringBuffer sb = new StringB... | linear | 1_B. Spreadsheets | CODEFORCES |
import java.io.*;
import java.util.regex.*;
public class Main {
private static String encode(long rowNum) {
if(rowNum<=26) {
return String.valueOf((char)('A'+rowNum-1));
}
else {
if(rowNum%26==0){
return encode((long)Math.floor((double)rowNum/26)-1)
+ String.valueOf((char)('A'+26-1))... | linear | 1_B. Spreadsheets | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Scanner;
import java.util.regex.Matcher;
import java.util.regex.Pattern;
public class Round1B {
public static void main(String[] args) throws Exception {
new Round1B().run();
}
private void run() throws Exception {
BufferedReade... | linear | 1_B. Spreadsheets | CODEFORCES |
import java.io.PrintWriter;
import java.util.*;
/*
10
R1C1
A1
R1C26
Z1
R1C27
AA1
R1C28
AB1
R1C52
AZ1
*/
public class Main {
Scanner in;
PrintWriter out;
boolean isFirst(String line){
int pos = 0;
while( pos<line.length() && Character.isLetter(line.charAt(pos))){
pos++;
}
while( pos<line.length() && ... | linear | 1_B. Spreadsheets | CODEFORCES |
import java.io.FileNotFoundException;
import java.util.Scanner;
/**
* Date: 19.02.2010
* Time: 14:56:28
*
* @author Sergey Bankevich (Sergey.Bankevich@gmail.com)
*/
public class B1 {
static Scanner in;
public static void main( String[] args ) throws FileNotFoundException {
in = new Scanner( Syste... | linear | 1_B. Spreadsheets | CODEFORCES |
import java.io.BufferedReader;
import java.io.BufferedWriter;
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.io.StreamTokenizer;
import java.util.HashMap;
public class B {
/... | linear | 1_B. Spreadsheets | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.regex.Matcher;
import java.util.regex.Pattern;
public class RoundOneProblemB {
/**
* @param args
*/
public static void main(String[] args) {
int n=1;
BufferedReader input = new BufferedReader(new InputStreamReader(Sys... | linear | 1_B. Spreadsheets | CODEFORCES |
import java.io.*;
import java.util.*;
public class Elektronnietablici {
static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
static StringTokenizer in;
static PrintWriter out = new PrintWriter(System.out);
public static String nextToken() throws IOException{
while (in == null || !in... | linear | 1_B. Spreadsheets | CODEFORCES |
import java.util.Scanner;
public class MSpreadSheet {
public int toNum(String x)
{
int result = 0;
int pow = 0;
for (int i = x.length()-1; i >=0; i--)
{
result+=(x.charAt(i)-'A'+1)*Math.pow(26, pow);
pow++;
}
return result;
}
... | linear | 1_B. Spreadsheets | CODEFORCES |
import java.util.*;
import java.io.*;
public class Solution extends Thread {
final static int MAXNUM = 1 << 20;
public void run() {
try {
in = new BufferedReader(new InputStreamReader(System.in));
st = new StringTokenizer("");
int tests = nextInt();
int num = 1;
for (int test = 0; test < tests; te... | linear | 1_B. Spreadsheets | CODEFORCES |
import java.io.*;
public class B {
public static void main (String[] args) throws IOException {
BufferedReader b = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(b.readLine());
while (n-- > 0) {
String s = b.readLine();
if (s.matches("... | linear | 1_B. Spreadsheets | CODEFORCES |
import java.util.Scanner;
import java.util.regex.Matcher;
import java.util.regex.Pattern;
public class B1 {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int testCount = in.nextInt();
for (int test = 0; test < testCount; test++) {
String src = in.... | linear | 1_B. Spreadsheets | CODEFORCES |
import java.io.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;
public class ProbB implements Runnable {
private boolean _ReadFromFile = false;
private boolean _WriteToFile = false;
static final String T... | linear | 1_B. Spreadsheets | CODEFORCES |
import java.util.*;
import java.io.*;
import static java.lang.Math.*;
public class Round1TaskB implements Runnable {
static PrintWriter pw = null;
static BufferedReader br = null;
StringTokenizer st = null;
public static void main(String[] args) throws IOException {
pw = new PrintWriter(new Ou... | linear | 1_B. Spreadsheets | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
public class Task1b {
static int[] fromRC (String data) {
int pos = data.indexOf('C');
int res[] = new int[2];
res[0] = Integer.parseInt(data.substring(1, pos));
res[1] = Integer.parseInt(data.substring(pos + 1));
return res;
}
static in... | linear | 1_B. Spreadsheets | CODEFORCES |
// by kotb
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++) {
Stri... | linear | 1_B. Spreadsheets | CODEFORCES |
import java.io.*;
import java.lang.reflect.Array;
import java.util.*;
import java.util.regex.*;
//import java.math.*;
//import static java.lang.Math.*;
//import static java.util.Arrays.*;
public class Main{
public static void main(String[] args) throws IOException { //1-checker 2-console
//if (args.length... | linear | 1_B. Spreadsheets | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Scanner;
import java.util.StringTokenizer;
public class B {
public static void main(String[] args) {
Scanner sc = new Scanner(new BufferedReader(new InputStreamReader(
System.in)));
int nc = sc.nextInt();
while (nc-- > 0) {
... | linear | 1_B. Spreadsheets | 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 | 1_B. Spreadsheets | 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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
/**
* Problem solution template.
* @author Andrew Porokhin, andrew.porokhin@gmail.com
*/
public class Problem01B implements Runnable {
static final long[] x1... | linear | 1_B. Spreadsheets | CODEFORCES |
import java.util.Scanner;
public class TaxiDriversAndLyft2 {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
long n = scanner.nextLong();
long m = scanner.nextLong();
long[] people = new long[(int) (n+m)];
int[] taxiDrivers = new int[(int) (n+m)];
for(int i = 0;i< ... | linear | 1075_B. Taxi drivers and Lyft | CODEFORCES |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
int[] P = new int[n];
int[] check=new int[n];
for (int i = 1; i < n; i++) {
P[i] = scanner.nextInt();
... | linear | 913_B. Christmas Spruce | CODEFORCES |
import java.util.HashSet;
import java.util.Scanner;
public class Solution {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
HashSet<Integer> set = new HashSet<>();
for(int i = 0; i<n; i++){
int a = sc.nextInt();
... | linear | 992_A. Nastya and an Array | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main{
public static void main(String[] args){
Scanner s= new Scanner(System.in);
int n=s.nextInt();StringBuilder sb=new StringBuilder();
long[] a=new long[n/2];
for(int i=0;i<n/2;i++){
a[i]=s.nextLong();
}int j=0;long[] a2=new long[n/2];long[] a1... | linear | 1093_C. Mishka and the Last Exam | 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.io.*;
import java.util.*;
public class Main {
static Scanner in = new Scanner(System.in);
static PrintWriter out = new PrintWriter(System.out);
public static void main(String[] args) {
int n = in.nextInt();
int m = in.nextInt();
long boyMax = 0;
int NBoyMax = 0;
long sweets = ... | linear | 1159_C. The Party and Sweets | CODEFORCES |
import java.math.BigInteger;
import java.util.Scanner;
public class Main {
static Scanner sc = new Scanner (System.in);
public static void main(String[] args) {
int n = sc.nextInt();
int k = sc.nextInt();
char str[][] = new char[5][n];
for(int i = 0;i < 4;i ++){
for(int j = 0;j <... | linear | 980_B. Marlin | 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.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 Solution
{
public static void main(String [] args) throws IOException
{
PrintWriter pw=new PrintWriter(System.out);//use pw.println() not pw.write();
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
StringTokenize... | linear | 1011_A. Stages | CODEFORCES |
import java.util.*;
import java.io.*;
public class Solution
{
public static void main(String [] args) throws IOException
{
PrintWriter pw=new PrintWriter(System.out);//use pw.println() not pw.write();
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
StringTokenize... | linear | 1011_A. Stages | CODEFORCES |
import java.io.*;
import java.util.Scanner;
public class abc{
public static int check(StringBuilder s)
{
int countRemove=0;
if(!s.toString().contains("xxx")) return countRemove;
else{
for(int i=1;i<s.length()-1;i++)
{
if(s.charAt(i-1)=='x' && s.charAt(i)=='x' && s.charA... | linear | 978_B. File Name | CODEFORCES |
/**
* Created by Aminul on 3/14/2019.
*/
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
import static java.lang.Math.max;
public class E_2 {
public static void main(String[] args) throws Exception {
F... | linear | 1082_E. Increasing Frequency | CODEFORCES |
import java.util.Scanner;
public class Main {
public static void main(String args[]) {
Scanner in=new Scanner(System.in);
String str=in.next();
int cnt=0;
for(int i=0;i<str.length();++i) {
if(str.charAt(i)=='1') {
++cnt;
}
}
int i=0;
for(;i<str.length();++i) {
if(str.charAt(i)=='0') {
S... | linear | 1009_B. Minimum Ternary String | 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.util.ArrayList;
import java.util.Scanner;
/**
*
* @author Ahmed
*/
public class Watermelon {
static class Pas... | linear | 608_A. Saitama Destroys Hotel | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;
public class BOOL {
static char [][]ch;
static int n,m;
private static FastReader in =new FastReader();
public static void main(String[] args) {
int n=in.nextInt();
int a[]=new int[100000... | linear | 608_C. Chain Reaction | CODEFORCES |
import java.util.Scanner;
public class ChainReaction {
public static void main(String [] args) {
Scanner kb = new Scanner(System.in);
int num = kb.nextInt();
int[] beacons = new int[1000002];
for (int i=0; i<num; i++) {
beacons[kb.nextInt()] = kb.nextInt();
}
int [] dp = new int[1000002];
int... | linear | 608_C. Chain Reaction | 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 |
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 |
import java.io.*;
import java.util.*;
public class Solution {
static boolean canWinFromOneMove(char []s,int k) {
int prefix=0;
int n=s.length;
for(int i=0;i<n && s[i]==s[0];i++)
prefix++;
int suffix=0;
for(int i=n-1;i>=0 && s[i]==s[n-1];i--)
suffix++;
return s[0]==s[n-1] && prefix+suffix+k>=n ||... | linear | 1190_C. Tokitsukaze and Duel | CODEFORCES |
import java.util.*;
import java.io.*;
public class C{
static PrintWriter out;
static InputReader in;
public static void main(String args[]){
out = new PrintWriter(System.out);
in = new InputReader();
new C();
out.flush(); out.close();
}
C(){
int a = solve();... | linear | 1190_C. Tokitsukaze and Duel | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.OutputStream;
import java.util.SortedSet;
import java.util.Set;
import java.util.NavigableSet;
import java.io.IOException;
import java.util.InputMismatchException;
import java.io.InputStreamRe... | linear | 1190_C. Tokitsukaze and Duel | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
public class Main implements Runnable {
public InputReader in;
public PrintWriter out;
public void solve() throws Exception {
// solution goes here
int N = in.nextInt();
int[] houses = new int[N];
boolean[] exist = ... | linear | 701_C. They Are Everywhere | CODEFORCES |
import java.io.*;
import java.util.*;
/*
* And now I wonder if I should delete these comments cause they might throw me off.
* Lol who cares though?
*/
public class R364C {
public static void main(String[] args) throws NumberFormatException, IOException {
Scanner s = new Scanner(System.in);
BufferedReader f ... | linear | 701_C. They Are Everywhere | CODEFORCES |
import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;
import java.lang.*;
public class Third{
static long mod=1000000007;
public static void main(String[] args) throws Exception{
InputReader in = new InputReader(System.in);
PrintW... | linear | 701_C. They Are Everywhere | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.StringTokenizer;
public class C364 {
static HashMap<Character, Integer> freq;
static int unique = 0;
public static void main(String[] args) throws Exception {
FastScanner in = n... | linear | 701_C. They Are Everywhere | CODEFORCES |
import java.io.*;
import java.util.*;
public class C {
InputStream is;
int __t__ = 1;
int __f__ = 0;
int __FILE_DEBUG_FLAG__ = __f__;
String __DEBUG_FILE_NAME__ = "src/C4";
FastScanner in;
PrintWriter out;
int charToIndex(char c) {
if (Character.isLowerCase(c))
return c - 'a';
else if (Character.isU... | linear | 701_C. They Are Everywhere | CODEFORCES |
/**
* Created by Omar on 7/22/2016.
*/
import java.util.*;
import java.io.*;
public class CF364C {
public static void main(String[] args) throws Exception {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
PrintWriter pw = new PrintWriter(System.out);
int n=Integ... | linear | 701_C. They Are Everywhere | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashSet;
import java.util.Set;
/**
* @author Ran Bi (ran.bi@addepar.com)
*/
public class C {
public static void main(String[] arg) throws IOException {
BufferedReader in = new BufferedReader(new Input... | linear | 701_C. They Are Everywhere | CODEFORCES |
import java.io.*;
import java.util.*;
public final class round_364_c
{
static BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
static FastScanner sc=new FastScanner(br);
static PrintWriter out=new PrintWriter(System.out);
public static void main(String args[]) throws Exception
{
in... | linear | 701_C. They Are Everywhere | 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.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Iterator;
import java.util.List;
impo... | linear | 701_C. They Are Everywhere | CODEFORCES |
/*
* Code Author: Akshay Miterani
* DA-IICT
*/
import java.io.*;
import java.math.*;
import java.text.*;
import java.util.*;
public class A {
static double eps=(double)1e-15;
static long mod=(int)1e9+7;
public static void main(String args[]){
InputReader in = new InputReader(System.in);
OutputStream outpu... | linear | 701_C. They Are Everywhere | CODEFORCES |
import java.io.BufferedInputStream;
import java.util.Scanner;
public class Main{
public static void main(String[] args) {
Scanner in=new Scanner(new BufferedInputStream(System.in));
int n=in.nextInt();
char b[]=in.next().toCharArray();
int bb[]=new int [b.length];
int Mark[]=new int [26*2+1];
int Mark1[]=ne... | linear | 701_C. They Are Everywhere | CODEFORCES |
//package baobab;
import java.io.*;
import java.util.*;
public class C {
public static void main(String[] args) {
CIO io = new CIO();
try {
Csolver solver = new Csolver(io);
solver.solve();
} finally {
io.close();
}
}
}
class Csolver {
... | linear | 701_C. They Are Everywhere | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
public class theyareeverywhere {
public static void main(String[] args) throws Exception {
BufferedReader r = new BufferedReader(new InputStreamReader(System.in));
PrintWriter w = new PrintWriter(System.o... | linear | 701_C. They Are Everywhere | CODEFORCES |
/**
* Created by ankeet on 7/22/16.
*/
import java.io.BufferedReader;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class C701 {
static FastReader in = null;
static PrintWriter out = null;
public static void solve()
... | linear | 701_C. They Are Everywhere | CODEFORCES |
import java.io.BufferedInputStream;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.InputMismatchException;
public class Main
{
/********************************************** a list of common variables **********************************************/
private M... | linear | 701_C. They Are Everywhere | CODEFORCES |
import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
public class main {
public static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
public static PrintWriter pw = new PrintWriter(System.out);
public static String line;
public static StringTokenizer ... | 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.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual soluti... | linear | 701_C. They Are Everywhere | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.List;
import java.util.Queue;
/**
* Created by pallavi on 22/7/16.
*/
public class C701 {
public static int f(char c) {
if (c >= 'a' && c <=... | linear | 701_C. They Are Everywhere | 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.util.Arrays;
import java.util.StringTokenizer;
public class C {
static StringTokenizer st;
static BufferedReader br;... | linear | 701_C. They Are Everywhere | CODEFORCES |
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
public class Main {
FastScanner in;
PrintWriter out;
static final String FILE = "";
public void solve() {
int n = in.nextInt();
TreeMap<Character, Integer> map = new TreeMap<>();
ArrayList<Integer> list = ne... | linear | 701_C. They Are Everywhere | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.Comparator;
import java.util.StringTokenizer;
import java.util.TreeSet;
public class TheyAreEverywhere {
static StringTokenizer st;
static BufferedReader bf = new BufferedReade... | linear | 701_C. They Are Everywhere | CODEFORCES |
import java.io.*;
import java.util.HashMap;
import java.util.Map;
public class Round364_div2_C {
public static void main(String[] args) throws IOException {
FastReader in = new FastReader(System.in);
PrintWriter out = new PrintWriter(System.out);
solve(in, out);
out.flush();
}
... | linear | 701_C. They Are Everywhere | CODEFORCES |
import java.util.*;
import java.io.*;
public class C{
public static void main(String[] args) {
InputReader in = new InputReader(System.in);
PrintWriter out = new PrintWriter(System.out);
Solver solver = new Solver();
solver.solve(in, out);
out.close();
}
static class Solver{
public void solve(InputRead... | linear | 701_C. They Are Everywhere | CODEFORCES |
import java.util.*;
public class Q3a {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
in.nextLine();
String s = in.nextLine();
HashMap<Integer, Integer> seen = new HashMap<>();
for (int i = 0; i < n; i++) {
Character c = s.charAt(i);
int ci = (... | linear | 701_C. They Are Everywhere | CODEFORCES |
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.io.Writer;
import java.util.Arrays;
import java.util.InputMismatchException;
public class TestClass11 {
/**
* @param args... | linear | 701_C. They Are Everywhere | CODEFORCES |
import java.io.BufferedReader;
import java.io.File;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashMap;
import java.util.HashSet;
import java.util.StringTokenizer;
public class C {
public static void main(String[] args) throws IOException {
File in... | linear | 701_C. They Are Everywhere | CODEFORCES |
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.StringTokenizer;
public class Round364C {
public static void main(String[] args) throws NumberFormatException, IOException {
... | linear | 701_C. They Are Everywhere | CODEFORCES |
import com.sun.org.apache.xml.internal.utils.StringComparable;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.text.DecimalFormat;
import java.text.NumberFormat;
import java.util.*;
public class Main {
public static void main(String[] args) {
// Test.te... | linear | 701_C. They Are Everywhere | CODEFORCES |
import java.util.*;
public class C{
static String s;
static long val[];
static int N,size;
static int index(char c){
if(c <= 'Z'){
return c - 'A';
}else{
return c - 'a' + ('Z' - 'A' + 1);
}
}
static int l(int i){
return (i<<1)+1;
}
static int r(int i){
return (i<<1)+2;
}
static void setup(i... | linear | 701_C. They Are Everywhere | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintStream;
import java.util.HashMap;
import java.util.HashSet;
public class C {
private static BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
private static PrintStream out = Sys... | linear | 701_C. They Are Everywhere | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.*;
/**
* Created by Daniil on 5/29/2016.
*/
public class TaskB {
public static int strIndex;
public static void main(String[] args) throws IOException {
Scanner... | linear | 701_C. They Are Everywhere | CODEFORCES |
import java.io.*;
import java.math.*;
import java.util.*;
import java.util.stream.*;
@SuppressWarnings("unchecked")
public class P701A {
Map<Character, Integer> cc = new HashMap(72);
void add(char c) {
cc.put(c, cc.getOrDefault(c, 0) + 1);
}
void rem(char c) {
Integer cnt = cc.get(c) - 1;
if (cn... | linear | 701_C. They Are Everywhere | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.HashSet;
public class Main {
public static void main(String[] args) throws NumberFormatException, IOException {
// TODO Auto-generated method stub
BufferedReader in = new Buf... | linear | 701_C. They Are Everywhere | CODEFORCES |
import java.io.* ;
import java.util.* ;
public class Codeshefcode {
final static long r = 1000000007 ;
static FasterScanner ip = new FasterScanner() ;
static PrintWriter op = new PrintWriter(System.out) ;
public static void main(String[] args) throws IOException{
int n = ip.i() ;
TreeMap<Character,Integer... | linear | 701_C. They Are Everywhere | 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.util.Random;
import java.io.IOException;
i... | 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.HashMap;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.TreeSet;
import java.io.File;
import java.io.FileNotFoundException;
import java.util.StringTokenizer;
... | linear | 701_C. They Are Everywhere | CODEFORCES |
import java.util.*;
import java.io.*;
import java.math.*;
public class Main {
BufferedReader in;
StringTokenizer str = null;
PrintWriter out;
private String next() throws Exception{
while (str == null || !str.hasMoreElements())
str = new StringTokenizer(in.readLine());
return str.nextToken();
}
priva... | 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.Set;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.TreeSet;
import java.util.StringTokenizer;
import java.io.BufferedReader;
import java.io.InputStream;
/**... | linear | 701_C. They Are Everywhere | CODEFORCES |
import java.util.*;
import java.io.*;
public class C {
public static void main(String[] args) throws IOException {
BufferedReader in =
new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(in.readLine());
char[] ps = in.readLine().toCharArray();
HashMap<Character, TreeSet<Integer>... | linear | 701_C. They Are Everywhere | CODEFORCES |
import java.io.*;
import java.util.Arrays;
import java.util.Random;
public class ProblemC {
public static void main(String[] args) throws IOException {
init();
new ProblemC().run();
out.flush();
out.close();
}
static void init() throws IOException {
in = new StreamTokenizer(new Buffered... | 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.HashSet;
import java.util.Scanner;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*
* @author xwchen
*/
public class Main {
public static void main(String[] args... | linear | 701_C. They Are Everywhere | CODEFORCES |
import java.io.*;
import java.util.InputMismatchException;
public class Cf2207C {
private static InputReader in = new InputReader(System.in);
private static OutputWriter out = new OutputWriter(System.out);
private static void solve() throws Exception {
int n = in.readInt();
String s = in... | linear | 701_C. They Are Everywhere | CODEFORCES |
import java.util.StringTokenizer;
import java.io.BufferedReader;
import java.io.BufferedOutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.OutputStream;
import java.util.HashSet;
public class C {
public static void main(Str... | linear | 701_C. They Are Everywhere | CODEFORCES |
import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;
/**
* @author grozhd
*/
public class P3 {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
String s = "";
... | linear | 701_C. They Are Everywhere | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
void change(int [] all, char c, int val) {
if (Character.isUpperCase(c))
all[c - 'A' + 26] += val;
else
all[c - 'a'] += val;
}
int countDistinct(int [] a) {
int res = 0;
for (int i = 0 ; i< ... | linear | 701_C. They Are Everywhere | CODEFORCES |
import java.util.*;
public class Main {
private static Scanner in = new Scanner(System.in);
public static void main(String args[]){
int n = in.nextInt();
String s = in.next();
if(n==1)
System.out.println("1");
else{
int j=0,i=1,ans=s.length();
int h[]=new int[128];
h[(int)s.charAt(0)]=1;
whil... | linear | 701_C. They Are Everywhere | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.HashMap;
import java.util.StringTokenizer;
public class CTask {
public static void main(String[] args) throws IOException {
MyInputReader in = new MyInputReader(System... | 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.Arrays;
import java.util.Scanner;
import java.util.HashMap;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*
* @author Rene
*/
public class Main {
public static ... | linear | 701_C. They Are Everywhere | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashSet;
import java.util.Hashtable;
import java.util.Scanner;
import java.util.TreeSet;
public class Main3 {
public static void main(String[] args) throws IOException {
Scanner sc = new Scanner(Sy... | linear | 701_C. They Are Everywhere | CODEFORCES |
import java.io.*;
import java.util.*;
public class CF1009E {
static final int MD = 998244353;
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(br.readLine());
StringTokenizer st = new StringTokenizer(b... | linear | 1009_E. Intercity Travelling | CODEFORCES |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.