src stringlengths 95 64.6k | complexity stringclasses 7
values | problem stringlengths 6 50 | from stringclasses 1
value |
|---|---|---|---|
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 | 1209_A. Paint the Numbers | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.util.stream.IntStream;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.UncheckedIOException;
import java.nio.charset.Charset;
import j... | quadratic | 1209_A. Paint the Numbers | 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.Scanner;
import java.util.StringTokenizer;
public class Main1
{
static class Reader
{
final private int BUFFER_SIZE = 1 << ... | quadratic | 1209_A. Paint the Numbers | 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... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;
/**
* Built using CHelper... | quadratic | 1209_A. Paint the Numbers | CODEFORCES |
import java.util.*;
import java.io.*;
import java.util.Map.Entry;
public class Codeforces {
static int n;
static double max;
static int[] pre;
public static void findIntensity(int l){
for(int i = 0, j = i + l; j < n + 1; i++, j++){
double res = (pre[j] - pre[i]) / (double) l;
... | quadratic | 1003_C. Intense Heat | CODEFORCES |
//q4
import java.io.*;
import java.util.*;
import java.math.*;
public class q4 {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int query = in.nextInt();
while (query -- > 0) {
int n = in.nextInt();
int k = in.nextIn... | quadratic | 1196_D2. RGB Substring (hard version) | CODEFORCES |
//q4
import java.io.*;
import java.util.*;
import java.math.*;
public class q4 {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
PrintWriter out=new PrintWriter(new OutputStreamWriter(System.out));
int query = in.nextInt();
while (qu... | quadratic | 1196_D2. RGB Substring (hard version) | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.lang.reflect.Array;
import java.util.Arrays;
import java.util.Comparator;
import java.util.StringTokenizer;
import java.util.function.Function;
public class P1196D2 {
static boolea... | quadratic | 1196_D2. RGB Substring (hard version) | 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 pandusonu
*/
public class ... | quadratic | 983_B. XOR-pyramid | CODEFORCES |
import com.sun.org.apache.xerces.internal.util.SynchronizedSymbolTable;
import jdk.management.cmm.SystemResourcePressureMXBean;
import java.awt.*;
import java.io.*;
import java.lang.reflect.Array;
import java.text.DecimalFormat;
import java.util.*;
import java.util.List;
import java.math.*;
public class Newbie {
... | quadratic | 995_B. Suit and Tie | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
/**
* @author Don Li
*/
public class LogicalExpression {
int N = 256;
void solve() {
Expression[] E = new Expression[N];
for (in... | quadratic | 913_E. Logical Expression | 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.*;
import java.util.*;
public class Codeforces913F {
public static void main(String[] args) throws IOException {
Scanner input = new Scanner(System.in);
int n = input.nextInt();
int a = input.nextInt();
int b = input.nextInt();
input.close();
final int mod = 998244353;
int frac = multi... | quadratic | 913_F. Strongly Connected Tournament | CODEFORCES |
import java.util.*;
import java.lang.*;
import java.io.*;
public class java2 {
public static void main(String[] args) {
Scanner r = new Scanner(System.in);
int n=r.nextInt();
int []l=new int[1005];
int []ri=new int[1005];
int []candy=new int[1005];
for(int i=1;i<=n;+... | quadratic | 1054_C. Candies Distribution | 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.*;
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 |
//package codeforces;
import java.util.Scanner;
public class ex5 {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
String S [] = new String[3];
int m=0,s=0,p=0;
int temp=0;
for (int i = 0; i < S.length; i++) {
S[i]=scan.next();
if(S[i].indexOf('m')!=-1) m++;
if(S[i].indexO... | constant | 1191_B. Tokitsukaze and Mahjong | CODEFORCES |
import java.io.PrintWriter;
import java.util.*;
import java.util.Arrays ;
import java .lang.String.* ;
import java .lang.StringBuilder ;
public class Test{
static int pos = 0 ;
static int arr[] ;
static LinkedList l1 = new LinkedList() ;
static void find(int p ,char[]x,int put[],String s){
int ... | constant | 965_A. Paper Airplanes | CODEFORCES |
import java.util.*;
import java.io.*;
import java.math.*;
public class loser
{
static class InputReader {
public BufferedReader br;
public StringTokenizer token;
public InputReader(InputStream stream)
{
br=new BufferedReader(new InputStreamReader(stream),32768);
... | constant | 965_A. Paper Airplanes | CODEFORCES |
import java.io.*;
import java.util.*;
public class Lcm
{
public static void main(String args[])throws Exception
{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
PrintWriter pw=new PrintWriter(System.out);
long n=Long.parseLong(br.readLine());
if(n<=2)
pw.println(n);
else
{
if(n%6==0)
{
pw.p... | constant | 235_A. LCM Challenge | 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.ArrayList;
public class Task235A {
public static void main(String... args) throws NumberFormatException,
IOException {
... | constant | 235_A. LCM Challenge | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
public class Main
{
public static long gcd(long a, long b)
{
return b==0? a:gcd(b, a%b);
}
public static long lcm(long a, long b, long c)
{
long d=a/gcd(a, b)*b;
return c/gcd(c, d)*d;
}
public static long max(... | constant | 235_A. LCM Challenge | CODEFORCES |
import java.util.*;
/*Author LAVLESH*/
public class solution
{
static long gcd(long a,long b){
if(b==0) return a;
else
return gcd(b,a%b);
}
public static void main(String[]args){
Scanner in=new Scanner(System.in);
long n=in.nextLong();
long m1=0,m2=0;
if(n<3)m1=n;
else {
if((n&1)==1){
... | constant | 235_A. LCM Challenge | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Scanner;
public class Main {
public static long GCF(long a, long b) {
if(b == 0) return a;
else return GCF(b, a%b);
}
public static long LCM(long a, long b){
return a... | constant | 235_A. LCM Challenge | 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.
*/
//package NumberTheory;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
/**
*
* @autho... | constant | 235_A. LCM Challenge | CODEFORCES |
import java.math.BigInteger;
import java.util.Scanner;
public class A235 {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
long n = scan.nextInt();
BigInteger res = null;
if (n >= 3) {
if (n % 2 != 0) {
res = BigInteger.va... | constant | 235_A. LCM Challenge | CODEFORCES |
import java.util.Scanner;
public class LCM {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
long n = scan.nextLong();
if (n <= 2)
System.out.println(n);
else if (n % 2 == 1)
System.out.println(n * (n - 1) * (n - 2));
... | constant | 235_A. LCM Challenge | CODEFORCES |
import java.util.Scanner;
public class A235 {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc = new Scanner(System.in);
long n = sc.nextInt();
if (n == 1) {
System.out.println(1);
return;
} else if (n == 2) {
... | constant | 235_A. LCM Challenge | CODEFORCES |
import java.util.*;
public class Main
{
public static void main(String[]args)
{
Scanner input=new Scanner (System.in);
while(input.hasNext())
{
long n=input.nextLong();
if(n==1||n==2)
System.out.println(n);
else if(n%2==1)
... | constant | 235_A. LCM Challenge | CODEFORCES |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner in=new Scanner(System.in);
long num=in.nextLong();
long lcm=1;
if(num==2){
System.out.println(2);
System.exit(0);
}//End if
else if(num%2==0&&num%3!=... | constant | 235_A. LCM Challenge | CODEFORCES |
import java.util.Scanner;
public class Main{
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
long num = input.nextLong();
if(num==0){
System.out.println(num);
}else if(num==1||num==2){
System.out.println(num);}
else i... | constant | 235_A. LCM Challenge | CODEFORCES |
import java.io.BufferedInputStream;
import java.util.Scanner;
/**
* Created by jizhe on 2016/1/29.
*/
public class LCMChallenge {
public static void main(String[] args) {
Scanner in = new Scanner(new BufferedInputStream(System.in));
long N = in.nextLong();
if( N == 1 || N == 2 )
... | constant | 235_A. LCM Challenge | CODEFORCES |
import java.util.*;
public class maximus {
static long GCD(long a,long b){
if(b==0)return a;
return GCD(b,a%b);
}
public static void main(String [] args){
Scanner in=new Scanner(System.in);
long n=in.nextInt();
if(n<=2){
System.out.print(n);
return;
}
if(n%2==1){
System.out.print((n*(n-1)*(n-2)));... | constant | 235_A. LCM Challenge | 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 LCM {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
long n=sc.nextLong();
if(n < 3) {
System.out.println(n);
}
else if(n % 2 != 0) {
System.out.println(n * (n-1) * (n-2));
}
else if(n % 3 == 0) {
System.out.println((n-1) * (n... | constant | 235_A. LCM Challenge | CODEFORCES |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
long x = input.nextLong();
if(x==1||x==2){System.out.println(x);
}
else if(x%2==0&&x>2&&x%3!=0){
System.out.println((x)*(x-1)*(x-3));
}else if(x%2==0&&x%3==0){
System.... | constant | 235_A. LCM Challenge | CODEFORCES |
import java.io.*;
import java.util.*;
public class LCMChallenge {
public static void main(String[] args) throws IOException {
BufferedReader f = new BufferedReader(new InputStreamReader(System.in));
long n = Long.parseLong(f.readLine());
if (n == 1 || n == 2)
System.out.println(... | constant | 235_A. LCM Challenge | CODEFORCES |
import java.util.Scanner;
public class test5{
public static void main(String[] args){
Scanner in=new Scanner(System.in);
long x=in.nextLong();
if(x>=3){
if(x%2!=0)
System.out.println(x*(x-1)*(x-2));
else if(x%3==0)
... | constant | 235_A. LCM Challenge | CODEFORCES |
import java.util.*;
import java.lang.*;
import java.io.*;
public class LCM {
public static long gcd(long a,long b) {
while(true) {
a=a%b;
if (a==0) return b;
b=b%a;
if (b==0) return a;
}
}
public static void main (String[] args) throws java.lang.Exception {
Scanner in=new Scanner(Sys... | constant | 235_A. LCM Challenge | CODEFORCES |
import java.io.*;
import java.util.*;
import java.math.*;
import static java.lang.Math.*;
import static java.lang.Integer.parseInt;
import static java.lang.Long.parseLong;
import static java.lang.Double.parseDouble;
import static java.lang.String.*;
public class Main {
public static void main(String[] args) thro... | constant | 235_A. LCM Challenge | 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 |
import java.util.Scanner;
public class Prob235A {
public static void main(String[] Args) {
Scanner scan = new Scanner(System.in);
int x = scan.nextInt();
if (x < 3) {
if (x == 1)
System.out.println(1);
else
System.out.println(2);
} else {
long answer = x;
if (x % 2 == 1) {
answer *= x ... | constant | 235_A. LCM Challenge | CODEFORCES |
import java.io.InputStreamReader;
import java.io.IOException;
import java.util.InputMismatchException;
import java.io.PrintStream;
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... | constant | 235_A. LCM Challenge | CODEFORCES |
import java.io.*;
import java.util.*;
public class Lcm
{
public static void main(String args[])throws Exception
{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
long n=Long.parseLong(br.readLine());
if(n<=2)
System.out.println(n);
else
{
if(n%6==0)
{
System.out.println(((n-1)*(n-2)*(n-3)))... | constant | 235_A. LCM Challenge | CODEFORCES |
import java.util.*;
public class LCM235A
{
public static void main(String[] args)
{
// Set up scanner
Scanner sc = new Scanner(System.in);
// System.out.println("Enter n");
long n = sc.nextLong();
if (n==1)
{
System.out.println(1);
... | constant | 235_A. LCM Challenge | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.math.BigInteger;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
* @author walker
*/
public class Main {
public static void main(S... | constant | 235_A. LCM Challenge | CODEFORCES |
import java.io.BufferedInputStream;
import java.util.Scanner;
/**
* Created by jizhe on 2016/1/29.
*/
public class LCMChallenge {
public static void main(String[] args) {
Scanner in = new Scanner(new BufferedInputStream(System.in));
long N = in.nextLong();
if( N == 1 || N == 2 )
... | constant | 235_A. LCM Challenge | CODEFORCES |
import java.util.Arrays;
import java.util.Scanner;
public class Main{
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
Long N = sc.nextLong();
Long ans;
sc.close();
if(N <= 2)
System.out.println(N);
else{
if(N % 6 == 0){
... | constant | 235_A. LCM Challenge | CODEFORCES |
import java.util.Scanner;
public class Solution {
public static void main(String [] args){
Scanner stdin = new Scanner(System.in);
long n = stdin.nextLong();
if(n<3) System.out.println(n);
else {
if(n%2==0){
long a=0,b=0;
if(n%3!=0) a = (n*... | constant | 235_A. LCM Challenge | 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 Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
long n = in.nextLong();
if (n == 1 || n == 2) {
System.out.println(n);
} else if (n % 2 == 0) {
if (n % 3 == 0)
Syst... | constant | 235_A. LCM Challenge | CODEFORCES |
import java.io.PrintStream;
import java.util.Scanner;
/**
* @author Roman Elizarov
*/
public class Round_146_A {
public static void main(String[] args) {
new Round_146_A().go();
}
void go() {
// read input
Scanner in = new Scanner(System.in);
int n = in.nextInt();
// solve
long result = solve(n);
... | constant | 235_A. LCM Challenge | CODEFORCES |
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
//inputs
long n = in.nextLong();
if(n == 1)
System.out.println(1);
else if(n == 2)
System.out.println(2);
... | constant | 235_A. LCM Challenge | CODEFORCES |
import java.io.*;
import java.util.*;
public class lcm {
static int n;
public static void main(String[] args) throws IOException {
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
//BufferedReader in = new BufferedReader(new FileReader("lcm.in"));
n = Integer.parseInt(in.readLine());... | constant | 235_A. LCM Challenge | CODEFORCES |
import java.io.BufferedInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintStream;
/** Oct 21, 2012 **/
import java.util.InputMismatchException;
import java.util.LinkedList;
/**
* @author DOAN Minh Quy
* @email mquy.doan@gmail.com
*/
public class C236 {
/**
* @param arg... | constant | 235_A. LCM Challenge | CODEFORCES |
import java.util.*;
import java.io.*;
public class LCMChallenge
{
public static void main(String[] args)
{
Scanner in = new Scanner(System.in);
int n = in.nextInt();
if(n < 3)
{
System.out.println(n);
}
else if(n % 2 == 1)
{
System.out.println((long)n * (n - 1) * (n - 2));
}
else
{
... | constant | 235_A. LCM Challenge | CODEFORCES |
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.math.BigInteger;
public class A235 {
public static void main(String args[]) throws Exception{
BufferedReader ip = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(ip.readLine());
int a... | constant | 235_A. LCM Challenge | 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... | constant | 235_A. LCM Challenge | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;
///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
//////////////////////////////////////////// SOLUTION ///////////////////////////////... | constant | 235_A. LCM Challenge | CODEFORCES |
import java.util.Scanner;
public class A235 {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
long a = in.nextLong();
if (a % 2 == 0) {
long result = cal(a);
result = Math.max(result, cal(a + 1));
result = Math.max(result, cal2(a));
System.out.println(Math.max(result, ... | constant | 235_A. LCM Challenge | CODEFORCES |
import java.util.*;
import java.io.*;
public class Main {
boolean eof;
String nextToken() {
while (st == null || !st.hasMoreTokens()) {
try {
st = new StringTokenizer(br.readLine());
} catch (Exception e) {
eof = true;
return "-1";
}
}
return st.nextToken();
}
int nextInt() {
return ... | constant | 235_A. LCM Challenge | CODEFORCES |
import java.util.Scanner;
public class CF{
public static void main(String[] args)
{
Scanner scan = new Scanner(System.in);
long n = scan.nextLong();
TaskA t = new TaskA();
System.out.println(t.solve(n));
}
}
class TaskA{
public long solve(long n)
{
if(n < 3)
return n;
else if(n % 2 == 1)
return... | constant | 235_A. LCM Challenge | CODEFORCES |
import java.lang.*;
import java.util.*;
import java.io.*;
public class Challenge {
public static void main(String[] args) throws java.lang.Exception {
InputStream inputStream = System.in;
OutputStream outputStream = System.out;
InputReader in = new InputReader(inputStream);
PrintWriter out = new PrintWrite... | constant | 235_A. LCM Challenge | CODEFORCES |
import java.util.Scanner;
/**
* 2013.07.27 No.1 235A LCM Challenge
* 数论 n%2 == 0? n%3 == 0?
* @author Administrator *
*/
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
if (n < 3)
System.out.print... | constant | 235_A. LCM Challenge | CODEFORCES |
import java.util.*;
public class LCMChallenge {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
long n = in.nextInt();
if(n == 1l)
System.out.println(1);
else if(n == 2l)
System.out.println(2);
else
{
long c1 = n*(n-1)*(n-2);
long c2 = n*(n-1)*(n-3);
long c3 = (... | constant | 235_A. LCM Challenge | CODEFORCES |
import java.util.*;
import java.io.*;
public class LCMChallenge {
public static void main(String[] args) {
Scanner cin = new Scanner(System.in);
int n = cin.nextInt();
if (n < 3) {
System.out.println(n);
} else if (n % 2 == 1) {
System.out.println((long) n * ... | constant | 235_A. LCM Challenge | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
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 = n * (n-1) * (n - 2);
}
else if(n%3 != 0)... | constant | 235_A. LCM Challenge | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class A {
public static void main(String[] args) throws IOException {
InputReader sc = new InputReader(System.in);
PrintWri... | constant | 235_A. LCM Challenge | CODEFORCES |
import java.util.Scanner;
import java.io.OutputStream;
import java.io.IOException;
import java.io.PrintWriter;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
* @author BSRK Aditya (bsrkaditya@gmail.com)
*/
public class Main {
public static void main(String[] args) {
... | constant | 235_A. LCM Challenge | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class AAA {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTok... | constant | 1028_B. Unnatural Conditions | CODEFORCES |
import java.util.*;
import java.io.*;
import java.lang.*;
import java.math.*;
public class B {
public static void main(String[] args) throws Exception {
BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
... | constant | 1028_B. Unnatural Conditions | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class AAA {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTok... | constant | 1028_B. Unnatural Conditions | CODEFORCES |
import java.util.*;
import java.io.*;
public class A
{
public static void main(String ar[]) throws Exception
{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
String s1[]=br.readLine().split(" ");
int n=Integer.parseInt(s1[0]);
int S=In... | constant | 1061_A. Coins | CODEFORCES |
import java.io.*;
public class coins
{
public static void main(String args[])throws IOException
{
InputStreamReader read=new InputStreamReader(System.in);
BufferedReader in=new BufferedReader(read);
int i,k,n,v;
String a;
a=in.readLine();
for(i=0;i<a.length();i++)
{
if(a.charAt(i)==' ')
break;
}... | constant | 1061_A. Coins | CODEFORCES |
import java.util.*;
import java.io.*;
public class A
{
public static void main(String ar[]) throws Exception
{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
String s1[]=br.readLine().split(" ");
int n=Integer.parseInt(s1[0]);
int S=In... | constant | 1061_A. Coins | CODEFORCES |
import java.io.*;
import java.util.*;
public class A {
public static void main(String args[]) {
FastScanner scn = new FastScanner();
int n = scn.nextInt();
int s = scn.nextInt();
if (s <= n) {
System.out.println(1);
} else if (s > n) {
if(s%n == 0){
... | constant | 1061_A. Coins | CODEFORCES |
import java.util.*;
public class A912 {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner scan = new Scanner(System.in);
int A = scan.nextInt();
int B = scan.nextInt();
long x = scan.nextInt();
long y = scan.nextInt();
long z = scan.nextInt();
long requiredA =... | constant | 912_A. Tricky Alchemy | CODEFORCES |
import java.io.*;
import java.util.StringTokenizer;
public class A267 {
static public long _solve(long a,long b){
long result = -1;
while(a!=0 && b!=0){
if(a>b){
result +=(a/b);
a = a%b;
}
else{
result +=(b/a);
... | constant | 267_A. Subtractions | 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.util.*;
public class Solution{
public static void main(String[] args){
Scanner in = new Scanner(System.in);
int pairs = in.nextInt();
while (pairs > 0){
in.nextLine();
int a = in.nextInt();
int b = in.nextInt();
int count = 0;
... | constant | 267_A. Subtractions | CODEFORCES |
import java.io.*;
import java.util.*;
public class Mai {
public static void main(String[] args) throws IOException{
Scanner cin = new Scanner(System.in);
int t, n, m;
t = cin.nextInt();
while(t > 0) {
t--;
int sum = 0;
n = cin.nextInt();
m = cin.nextInt();
while(n > 0 && m > 0) {
... | constant | 267_A. Subtractions | CODEFORCES |
import java.util.Scanner;
/**
* Created by carolineshi on 3/30/17.
*/
public class Subtractions {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int t = scan.nextInt();
while(t != 0) {
int f = scan.nextInt();
int s = scan.nextInt()... | constant | 267_A. Subtractions | CODEFORCES |
import java.io.*;
import java.math.BigInteger;
import java.util.*;
public class CodeForces {
public static void main(String[] args) throws IOException,NumberFormatException{
try {
FastScanner sc=new FastScanner();
int t=sc.nextInt();
while(t-->0) {
int a=sc.nextInt(),b=sc.nextInt();
int count=0;
... | constant | 267_A. Subtractions | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class CF267A {
public static void main(String[] args) {
int n=0, a, b;
BufferedReader stdin = new BufferedReader(new InputStreamReader(System.in));
try {
n = Integer.parseInt(stdin.readLine());
} catch (IO... | constant | 267_A. Subtractions | CODEFORCES |
//package A;
import java.util.Scanner;
public class Solution {
Scanner in = new Scanner(System.in);
void run() throws Exception {
int tests = in.nextInt();
while (tests > 0) {
--tests;
int a = in.nextInt();
int b = in.nextInt();
int res = 0;
... | constant | 267_A. Subtractions | CODEFORCES |
import java.util.Scanner;
public class Question267A {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
int t=sc.nextInt();
while (t--!=0){
int x=sc.nextInt();
int y=sc.nextInt();
int max=Math.max(x,y);
int min=Math.m... | constant | 267_A. Subtractions | 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.IOException;
import java.io.InputStreamReader;
public class Subtraction {
static long c=0;
public static void main(String[] args) throws IOException {
BufferedReader reader=new BufferedReader(new InputStreamReader(System.in));
int n=Integer.parseInt... | constant | 267_A. Subtractions | CODEFORCES |
import java.util.*;
public class Subtractions {
public static void main(String[] args) {
Scanner kb = new Scanner(System.in);
int count = kb.nextInt();
while(count > 0) {
int smaller = kb.nextInt();
int larger = kb.nextInt();
int ops = 0;
while(smaller > 0 && larger > 0) {
if(smaller > larg... | constant | 267_A. Subtractions | CODEFORCES |
import java.util.Scanner;
public class Sub
{
public static void main(String[] args)
{
Scanner scan=new Scanner(System.in);
int noOfPairs=scan.nextInt();
while(noOfPairs-->0)
{
int x=scan.nextInt();
int y=scan.nextInt();
int res=0;
while(x!=0&&y!=0)
{
if(x>y)
{
res+=x/y;
x=... | constant | 267_A. Subtractions | CODEFORCES |
import java.util.Scanner;
public class Subtractions {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner s=new Scanner(System.in);
int t=s.nextInt();
while(t--!=0){
int a=s.nextInt();
int b=s.nextInt();
int min=Math.min(a, b);
int max=Math.max(a, b);
int ops=0;... | constant | 267_A. Subtractions | CODEFORCES |
//david alexander
import java.util.*;
public class Subtract {
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int a,b;
String answer = "";
while(n!=0){
a = sc.nextInt();
b = sc.nextInt();
answer += solve(a,b) + "\n";
n--;
}
System.out.printl... | constant | 267_A. Subtractions | CODEFORCES |
import java.io.*;
import java.util.*;
public class Main {
public static void main(String[] args) throws IOException{
Scanner cin = new Scanner(System.in);
int t, n, m;
t = cin.nextInt();
while(t > 0) {
t--;
int sum = 0;
n = cin.nextInt();
m = cin.nextInt();
while(n > 0 && m > 0) {
... | constant | 267_A. Subtractions | CODEFORCES |
/*
(7 10) 1 2 3
(3, 7)
(1, 3)
(3, 7)
(3, 4)
(3, 1)
(2, 1)
(1, 1)
1
*/
import java.util.*;
public class CodeForcesW8P2 {
public static void main(String [] args){
Scanner sc = new Scanner(System.in);
int tests = Integer.valueOf(sc.nextLine());
while(tests > 0){
int count = 0... | constant | 267_A. Subtractions | CODEFORCES |
import java.util.*;
import java.io.*;
public class Solution {
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
s.nextLine();
while(s.hasNext()) {
int first = s.nextInt();
int second = s.nextInt();
System.out.println(calculate(... | constant | 267_A. Subtractions | CODEFORCES |
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;
/**
* Built using CHelper plug-in
* Actual solution is at the top
*/
public class... | constant | 267_A. Subtractions | 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 Subtractions {
public static void main(String[]args){
Scanner sc=new Scanner(System.in);
int test=sc.nextInt();
while(test-->0){
long a=sc.nextLong();
long b=sc.nextLong();
long count=0;
long cnt=0;
while(a>0&&b>0){
count=0;
//System.out.pri... | constant | 267_A. Subtractions | CODEFORCES |
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
public class StrangeAddition {
public static void main(String[] args) throws IOException {
PrintWriter out = new PrintWriter(System.out);
sc = new StringToken... | constant | 267_A. Subtractions | CODEFORCES |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.