src stringlengths 95 64.6k | complexity stringclasses 7
values | problem stringlengths 6 50 | from stringclasses 1
value |
|---|---|---|---|
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class B {
public static void main(String[] args) throws IOException {
InputReader in = new InputReader();
int n = in.nextInt();
int k = in.nextInt();
... | linear | 224_B. Array | CODEFORCES |
import java.util.Scanner;
public class BB {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
int k=sc.nextInt();
int a[]=new int[n+1];
boolean used[]=new boolean[100009];
for (int i = 1; i <=n; i++) {
a[i]=sc.nextInt();
}
int cnt=0... | linear | 224_B. Array | CODEFORCES |
import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.InputStreamReader;
import java.util.HashMap;
public class B {
/**
* @param args
*/
public static void main(String[] args) throws Exception {
// System.setIn(new FileInputStream("b.in"));
BufferedReader bf = new BufferedReader(new ... | linear | 224_B. Array | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashMap;
import java.util.HashSet;
import java.util.StringTokenizer;
public class BT {
static BufferedReader in = new BufferedReader(new InputStreamReader(
System.in));
static StringToken... | linear | 224_B. Array | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Iterator;
import java.util.StringTokenizer;
import java.util.Vector;
public class B {
static Vector<Integer> primes;
public static void main(String[] args) throws IOException {
InputReader myScanner = new... | linear | 224_B. Array | CODEFORCES |
import java.io.DataInputStream;
import java.io.InputStream;
import java.util.Scanner;
import java.util.TreeMap;
import java.util.TreeSet;
public class B {
public static void main(String[] args) throws Exception {
Parserdoubt2333 s = new Parserdoubt2333(System.in);
int n = s.nextInt... | linear | 224_B. Array | 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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class B {
/**
* @param args
* @throws IOException
*/
public static void main(String[] args) throws IOException
{
BufferedReader br = new BufferedReader(new InputStreamRead... | linear | 224_B. Array | CODEFORCES |
import java.util.*;
public class b {
public static void main(String[] args)
{
Scanner input = new Scanner(System.in);
int n = input.nextInt(), k = input.nextInt();
int[] data = new int[n];
for(int i = 0; i<n; i++)
data[i] = input.nextInt();
int[] freq = new int[100001];
int count = 0;
... | linear | 224_B. Array | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.StreamTokenizer;
import java.util.HashMap;
import java.util.Map;
import java.util.Vector;
import java.util.logging.Level;
import java.util.logging.Logger;
/**
*
* @author Tibor
*... | linear | 224_B. Array | CODEFORCES |
import java.util.*;
import java.math.*;
import java.io.*;
import static java.lang.Math.*;
import static java.util.Arrays.*;
import static java.util.Collections.*;
public class test{
// ArrayList<Integer> lis = new ArrayList<Integer>();
// ArrayList<String> lis = new ArrayList<String>();
//
// static long su... | linear | 224_B. Array | CODEFORCES |
import java.io.*;
import java.util.*;
public class Array224B {
public static void main(String[] args) throws IOException {
BufferedReader f = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer(f.readLine());
int n = Integer.parseInt(st.nextToken());
int k = Integer.... | linear | 224_B. Array | CODEFORCES |
import java.io.*;
import java.util.HashMap;
import java.util.Locale;
import java.util.Map;
import java.util.StringTokenizer;
public class Array implements Runnable {
void solve() throws IOException {
int n = readInt();
int k = readInt();
int a[] = new int[n];
int startIdx = 0;
... | linear | 224_B. Array | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Scanner;
import java.util.StringTokenizer;
public class CF_1029E_Tree_with_Small_Distances {
static ArrayList<Integer> adj[];
... | linear | 1029_E. Tree with Small Distances | 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 pillar {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
int a[]=new int[200005];
for (int i=1;i<=n;i++)
a[i]=sc.nextInt();
for (int i=2;i<n;i++)
if (a[i-1]>a[i]&&a[i]<a[i+1]) {
System.out.println("NO");
retu... | linear | 1197_B. Pillars | CODEFORCES |
import java.util.*;
import java.io.*;
import java.math.*;
public class Solution{
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 StringTokeniz... | linear | 1197_B. Pillars | CODEFORCES |
import java.io.BufferedReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.io.ObjectInputStream.GetField;
import java.security.KeyStore.Entry;
import java.util.ArrayList;
import ... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.io.*;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args) throws IOException {
Scanner sc = new Scanner(System.in);
PrintWriter out = new PrintWriter(System.out);
int n = sc.nextInt(), k = sc.nextInt();
long rhs = 2l * (n + k);
... | logn | 1195_B. Sport Mafia | 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 solu... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
public class B {
static long n, k;
public static void main(String[] args) throws Exception {
Scanner in = new Scanner(System.in);
PrintWriter pw = new PrintWriter(System.out);
n = in.nextLong();
k = in.nextL... | logn | 1195_B. Sport Mafia | CODEFORCES |
//never leave a uncompleted question in this file, always remove the code after submitting it.
import java.io.*;
import java.util.*;
public class run{
public static void main(String args[]){
Scanner in = new Scanner(System.in);
long n = in.nextInt();
long k = in.nextInt();
long ans... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*
* @author Vaibhav Pulastya
*/
public... | logn | 1195_B. Sport Mafia | 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... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.StringTokenizer;
public class CF1195B {
private static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
private static BufferedWriter... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.util.*;
import java.io.*;
public class cf5722{
public static void main(String[] args) throws IOException{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st=new StringTokenizer(br.readLine());
long n=Long.parseLong(st.nextToken());
long k=Long.parseLong(st.ne... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.util.*;
import java.lang.Math;
public class Main{
public static void main(String[] args){
Scanner ak=new Scanner(System.in);
long n,k,x;
n=ak.nextLong();
k=ak.nextLong();
x=(long)((-3+Math.sqrt(9+8*(n+k)))/2);
System.out.println(n-x);
}
} | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.util.*;
import java.io.*;
public class candies {
public void run() throws Exception {
Scanner file = new Scanner(System.in);
int actions = file.nextInt();
int left = file.nextInt();
int start = 0;
int c = 1;
while (true) {
start += c;
if (c + (start - left) == actions) break;
c++;
}... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.io.*;
import java.lang.reflect.Array;
import java.math.BigInteger;
import java.net.Inet4Address;
import java.util.*;
import java.lang.*;
import java.util.HashMap;
import java.util.PriorityQueue;
public class templ implements Runnable{
static class pair implements Comparable
{
int f;
... | logn | 1195_B. Sport Mafia | CODEFORCES |
// CodeForces Round #914 B train done
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
public class SportMafia {
int n,k;
int nCand;
private void readData(BufferedReader bin) throws IOExceptio... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.io.*;
import java.math.BigInteger;
import java.util.*;
public class Main {
static int inf = (int) 1e9;
public static void main(String[] args) throws IOException {
br = new BufferedReader(new InputStreamReader(System.in));
pw = new PrintWriter(System.out);
int n = nextInt();
... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
long n = in.nextLong();
long k = in.nextLong();
long res = solve(n, k);
System.out.println(res);
}
private static long solve(long n, long k) {
return solveEq(1, -3... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.io.*;
import java.util.*;
public class b{
static class FastReader{
BufferedReader br;
StringTokenizer st;
public FastReader()
{
br = new BufferedReader(new
InputStreamReader(System.in));
}
String next()
{
while (st == null || !st.hasMoreElements())
{
try
... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
public class Main {
static int n, k;
public static void main(String[] args) throws IOException {
FastScanner sc = new FastScanner();
PrintWriter pw = new PrintWriter(System.out);
n = sc.nextInt();
k = sc.nex... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.util.*;
import java.io.*;
import java.text.*;
public class B1195 {
public static void main(String[] args) throws IOException {
Scanner sc = new Scanner(System.in);
PrintWriter pw = new PrintWriter(System.out);
long x =sc.nextInt();
long y =sc.nextInt();
long m = (-3+Math.round(Math.sqrt(9+8*(x+y... | logn | 1195_B. Sport Mafia | 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... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.StringTokenizer;
public class B {
static... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.util.*;
import java.lang.*;
import java.io.*;
public class Main
{
PrintWriter out = new PrintWriter(System.out);
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer tok = new StringTokenizer("");
String next() throws IOException {
if (!tok.hasMoreToke... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.util.*;
import java.io.*;
public class R574B
{
public static void main(String[] args)
{
JS scan = new JS();
long n = scan.nextInt();
long put = 1;
long k = scan.nextInt();
long have = 0;
long moves = 0;
while(have < k) {
have += put;
put++;
moves++;
}
long ans = 0;
moves ... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.util.*;
import java.io.*;
public class submitting {
public static void main(String[] args) throws IOException {
Scanner sc = new Scanner(System.in);
StringTokenizer st = new StringTokenizer(sc.nextLine());
long n = Integer.parseInt(st.nextToken());
long k = Integer.parseInt(st.nextToken());
lo... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.util.*;
public class Temppp {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long n = sc.nextLong();
long k = sc.nextLong();
long ans = (long) ((java.lang.Math.sqrt((9+(8*(n+k))))-3)/2);
System.out.println(n-ans... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.util.*;
import java.lang.*;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.*;
public class Main {
public static void main(String[] args) throws Exception{
FastReader sc=new FastReader();
Outp... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.List;
import java.util.StringTokenizer;
public class B {
final int INF = 1_000_000_000;
void solve() {
int n = readInt();
int k = readInt();
long l ... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
long n = scan.nextLong();
long k = scan.nextLong();
long D = 9 + 4 * (2 * k + 2 * n);
long y = (- 3 + (long)Math.sqrt(D)) / 2;
Sy... | logn | 1195_B. Sport Mafia | CODEFORCES |
/**
* @Author Tran Quang Loc (darkkcyan)
* BEFORE READING CODE:
* Java is really lengthy (at least for Java 8). So I used the advantage of initialization block.
* Basically, every initialization block run before the constructor and they run in the declaration order.
* And as I understand, every properties (or glob... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.io.*;
public class Alpha_Round {
public static void main(String[] args) throws IOException {
BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
BufferedWriter writer = new BufferedWriter(new OutputStreamWriter(System.out));
String[] in = reader.readLin... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.io.*;
import java.util.*;
public class B {
public static void main(String[] args) {
InputReader in = new InputReader();
int n = in.nextInt();
int k = in.nextInt();
long numCandies = 1;
int turns = 1, add = 2;
while (numCandies < k) {
++turns;
numCandies += add++;
}
int res = 0;
... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.io.*;
import java.util.*;
public class icpc
{
public static void main(String[] args) throws IOException
{
Reader in = new Reader();
// BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
long n = in.nextLong();
long k = in.nextLong();
lon... | logn | 1195_B. Sport Mafia | 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 B {
public static void main(String[] args) throws Exception {
new B().run();
}
public void run() throws Exception {
FastIO fi... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc =new Scanner(System.in);
long n = sc.nextLong(), k = sc.nextLong();
long ans = 0, sum = 0;
while(ans < n) {
if(sum - (n-ans) == k) break;
ans++;
sum += ans;
}
sc.close();
System.out.println(n-ans);
... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class Main
{
public static void main(String[] args)
{
FastReader fr =new FastReader();
PrintWriter op =new PrintWriter(System.out);
long n =fr.next... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.io.*;
import java.util.*;
public class A {
public static void main(String[] args) throws IOException {
Scanner sc = new Scanner();
PrintWriter out = new PrintWriter(System.out);
int n=sc.nextInt(),k=sc.nextInt();
for(int x=0;;x++) {
if(2*1L*x+x*1L*(x+1)==2L*(k+n)) {
out.println(n-x);
b... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.IOException;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*
* @author Aman Kumar Singh
*/
public class Main {
public static void main... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.io.*;
import java.util.StringTokenizer;
public class TaskB {
void run() {
FastReader in = new FastReader(System.in);
// FastReader in = new FastReader(new FileInputStream("input.txt"));
PrintWriter out = new PrintWriter(System.out);
// PrintWriter out = new PrintWriter(ne... | logn | 1195_B. Sport Mafia | CODEFORCES |
//package learning;
import java.util.*;
import java.io.*;
import java.lang.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;
public class NitsLocal {
static ArrayList<String> s1;
static boolean[] prime;
static int n = (int)1e7;
static void sieve() {
Arrays.fill(prime , true);
prime[... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.util.*;
import java.math.*;
// **** B. Sport Mafia ****
public class B {
static char [] in = new char [1000000];
public static void main (String [] arg) throws Throwable {
int n = nextInt();
int k = nextInt();
long ate = 0;
long ans = -1;
for (long i = 1; ans < 0; ++i) {
long test = (i *... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
static class FastScanner {
private BufferedReader bufferedReader;
private StringTokenizer stringTokenizer;
public FastScanner(InputStream inputStream) {
bufferedReader = new BufferedReader(new InputStreamReader(inputStre... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.io.*;
import java.lang.reflect.Array;
import java.math.BigInteger;
import java.util.*;
public class q5 {
public static void main(String[] args) throws IOException {
Reader.init(System.in);
PrintWriter out=new PrintWriter(System.out);
long n=Reader.nextInt();
long k=Reader.nextLo... | logn | 1195_B. Sport Mafia | 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.*;
import java.util.*;
public class zz{
static int mod=(int)1e9+7;
public static void main(String[] args) throws Exception{
//MScanner sc = new MScanner("chess.in");
MScanner sc = new MScanner(System.in);
PrintWriter pw=new PrintWriter(System.out);
int n=sc.nextInt(... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.io.BufferedInputStream;
import java.io.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.StreamTokenizer;
import java.util.Scanner;
public class Main {
static StreamTokenizer st = new StreamTokenize... | logn | 1195_B. Sport Mafia | CODEFORCES |
// Working program using Reader Class
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;
public class Main2
{
static class Reader
{
final private int BUFFER_SIZE = 1 << 16;
private DataInputStream din... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.util.*;
public class CFEdu66 {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
long n = in.nextLong();
long k = in.nextLong();
double tmp = Math.sqrt(9 + 8*(n+k));
if(Math.ceil(tmp)-tmp<0.001)
tmp = Math.ceil(tmp);
long root = (long)tmp;
long x = (-3+root)... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.util.*;
import java.io.*;
import java.math.*;
public class Main{
public static void main(String[] args) {
long n,k;
Scanner s= new Scanner(System.in);
n=s.nextInt();
k=s.nextInt();
System.out.println((int)(n-((-3+Math.sqrt(9+8*(n+k)))/2)));
}
}
| logn | 1195_B. Sport Mafia | CODEFORCES |
import java.util.Scanner;
public class Main {
public static void main(String[] args)
{
Scanner s=new Scanner(System.in);
double n=s.nextLong();
double k=s.nextLong();
double num=(-3+Math.sqrt(9+8*(n+k)))/2;
System.out.println((long)(n-num));
}
} | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.util.*;
import java.io.*;
public class B {
static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
static PrintWriter pw = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
public static void main(String[] args) throws Exception {
String[] split = br.r... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.util.*;
import java.io.*;
public class Solution{
public static Integer INT(String s){
return Integer.parseInt(s);
}
public static Long LONG(String s){
return Long.parseLong(s);
}
//==============================================================================================================... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.util.*;
import java.lang.*;
import java.io.*;
/* Name of the class has to be "Main" only if the class is public. */
public class Main
{
public static void main (String[] args) throws java.lang.Exception
{
// your code goes here
FastReader sc=new FastReader();
long n=sc.L();
long k=sc.L();
long ... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.FilterInputStream;
import java.io.BufferedInputStream;
import java.io.InputStream;
/**
* @author khokharnikunj8
*/
public class Main {
public static void main(String[] args) {
... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class Main {
static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
static StringTokenizer st = new StringTokenizer("");
... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.util.*;
import java.io.*;
public class B {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long n = sc.nextInt(), k = sc.nextInt();
long start = 1, end = n;
while(start <= end) {
long mid = (start + end) >> 1;
if(calc(mid) - (n - mid) == k) {
S... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.io.*;
import java.nio.CharBuffer;
import java.util.NoSuchElementException;
public class P1195B {
public static void main(String[] args) {
SimpleScanner scanner = new SimpleScanner(System.in);
PrintWriter writer = new PrintWriter(System.out);
int n = scanner.nextInt();
... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.util.Scanner;
public class CodeForces {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int k = sc.nextInt();
int ans = 0;
long x = n;
x = x*(x+1)/2;
while (x!=k) {
x-=n;
n--;
... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.math.BigInteger;
import java.util.*;
import java.util.concurrent.ThreadLocalRandom;
import java.util.stream.Collectors;
import java.util.stream.IntStream;
public class Main2 {
static int mod = 1000000007;
... | logn | 1195_B. Sport Mafia | CODEFORCES |
/*
Roses are red
Memes are neat
All my test cases time out
Lmao yeet
*/
import java.util.*;
import java.io.*;
public class B
{
public static void main(String args[]) throws Exception
{
BufferedReader infile = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.util.*;
import java.io.*;
import java.lang.*;
import java.math.*;
public class D {
public static void main(String[] args) throws Exception {
BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
PrintWriter out = new PrintWriter(new Out... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.nio.charset.Charset;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
import java.util.Random;
public class CFContest {
public static void main(String[] args) ... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.io.*;
import java.math.BigInteger;
import java.util.*;
import java.lang.*;
import static java.lang.Math.*;
public class Main implements Runnable {
public static void main(String[] args) {
new Thread(null, new Main(), "Check2", 1 << 28).start();// to increse stack size in java
}
static l... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class Cf2 {
static boolean ok(long n, long k, long eatten) {
long moves = n-eatten;
long ans = moves*(moves+1)/2;
ans -= eatten;
return ans <= k;
... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.util.Scanner;
public class SportMafia {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int k = sc.nextInt();
int next = 1;
int current = 0;
int result = 0;
for(int i = 0; i < n; i++) {
if(current < k) {
current += next++;
... | logn | 1195_B. Sport Mafia | 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.*;
import java.io.*;
public class Main
{
public static void main(String[] args)
{
FastReader reader = new FastReader();
PrintWriter writer = new PrintWriter(System.out);
long n = reader.nextLong();
long k = reader.nextLong();
long s=0;
long e=n;
long ans = -1;
while (s<=e) {
lo... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.io.*;
import java.util.*;
public class B {
public void solve() throws IOException {
long n = nextInt(), k = nextInt();
long c = 2 * (n + k);
long l = -1, r = 200000;
while (r - l > 1) {
long m = l + (r - l) / 2;
if (m * m + 3 * m >= c) {
... | logn | 1195_B. Sport Mafia | CODEFORCES |
// Created by Whiplash99
import java.io.*;
import java.util.*;
public class A
{
public static void main(String[] args) throws IOException
{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
long N,K,tmp,ans=0;
String s[]=br.readLine().trim().split(" ");
N=... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
long n = in.nextLong();
long k = in.nextLong();
long disc = (long)(Math.sqrt(9 - 4 * (-2 * n - 2 * k)));
long x = (-3 + disc) / 2;
System.out.println(... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
StringTokenize... | logn | 1195_B. Sport Mafia | 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... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class Codeforces {
static class FastReader
{
BufferedReader br;
StringTokenizer st;
public FastReader()
{
br = new Buff... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.*;
import static java.lang.Math.*;
import static java.util.Arrays.*;
import static java.util.Comparator.*;
public class Main {
FastScanner in;
P... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.io.*;
import java.math.*;
import java.text.*;
import java.util.*;
import java.util.regex.*;
public class Main {
public static void main(String[] args) throws IOException {
InputStreamReader r = new InputStreamReader(System.in);
BufferedReader f = new BufferedReader(r);
Sc... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.io.*;
import java.util.*;
public class l {
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
///... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Scanner;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*
* @author Xinyi Tao
*/
public class Main {
public static void main(String[] args) {
InputStream... | logn | 1195_B. Sport Mafia | 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;
import java.util.*;
import java.io.*;
imp... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class B_574 {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String[] input = br.readLine().split(" ");
... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.util.*;
import java.io.*;
public class template {
public static void main(String[] args) {
FastScanner sc = new FastScanner();
PrintWriter pw = new PrintWriter(new OutputStreamWriter(System.out));
int n = sc.nextInt();
int k = sc.nextInt();
long left = 0;
long right = n;
long mid = left+right... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.math.*;
import java.util.*;
import java.io.*;
public class Main{
static StreamTokenizer in=new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
static BufferedReader buffer=new BufferedReader(new InputStreamReader(System.in));
static Scanner sc=new Scanner(System.in);
... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.io.*;
import java.util.Arrays;
import java.util.HashSet;
import java.util.Set;
import java.util.StringTokenizer;
public class B {
static PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));
static MyScanner sc;
static {
try {
sc = new MyScanner();
... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.util.*;
public class B
{
static long sumN(long n)
{
return n * (n + 1) / 2;
}
static int binSearchPuts(int n, int k)
{
int L = 1;
int U = n;
int M = (L + U) / 2;
while(L <= U)
{
long left = sumN(M) - (n - M);
if(left < k)
{
L = M + 1;
}
else if(left > k)
{
U... | logn | 1195_B. Sport Mafia | CODEFORCES |
import java.io.*;
import java.math.*;
import java.util.*;
import java.util.stream.*;
import java.lang.management.*;
import static java.lang.Math.abs;
import static java.lang.Math.min;
import static java.lang.Math.max;
import static java.lang.Math.sqrt;
import static java.lang.Integer.signum;
@SuppressWarnings("uncheck... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
import java.util.*;
import java.io.*;
public class Main {
public static void main(String[] args) throws IOException {
FastScanner in = new FastScanner(System.in);
PrintWriter out = new PrintWriter(System.out);
new Main().run(in, out);
out.close();
}
public static long mod =... | logn | 1177_B. Digits Sequence (Hard Edition) | CODEFORCES |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.