Showing posts with label Kattis Online Judge Problem Solutions In Java. Show all posts
Showing posts with label Kattis Online Judge Problem Solutions In Java. Show all posts

Friday, November 24, 2017

Aaah! Kattis Problem Solution In Java

// Nayeem Shahriar Joy , Applied Physics & Electronic Engineering , University of Rajshahi.
import java.util.Scanner;
public class Joy {
public static void main(String[] args) {
String s1,s2;
Scanner sc1=new Scanner(System.in);
s1=sc1.nextLine();
s2=sc1.nextLine();
int able=s1.length();
int say=s2.length();
if(able>=say)
{
System.out.print("go");
}
else
{
System.out.print("no");
}
}
}

Seven Wonders Kattis Problem Solution In Java

//Nayeem Shahriar Joy,Applied Physics & Electronic Engineering, University of Rajshahi.
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;
public class Joy{
public static void main(String[] args) {
Scanner io = new Scanner(System.in);
String s=io.nextLine();
long ans=0;
int C=0,T=0,G=0;
for(int i=0;i<s.length();i++)
{
char c=s.charAt(i);
if(c=='T')
{
T++;
}
else if(c=='G')
{
G++;
}
else if(c=='C')
{
C++;
}
}
int seven=Math.min(T, Math.min(C,G));
ans=(T*T)+(C*C)+(G*G)+(seven*7);
System.out.println(ans);
}
}

Apaxiaaaaaaaaaaaans! Kattis Problem Solution In Java





//Nayeem Shahriar Joy,Applied Physics & Electronic Engineering, University of Rajshahi.
 

import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;
import javax.swing.text.html.HTMLDocument.Iterator;
public class Joy{
public static void main(String[] args) {
Scanner io = new Scanner(System.in);
String s=io.nextLine();
int i;
for( i=0;i<s.length()-1;i++)
{
if(s.charAt(i)!=s.charAt(i+1))
{
System.out.print(s.charAt(i));
}
}
System.out.print(s.charAt(i));
System.out.println();
}
}

Cryptographer's Conundrum Kattis Problem Solution In Java





//Nayeem Shahriar Joy,Applied Physics & Electronic Engineering, University of Rajshahi.
 

import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;
import javax.swing.text.html.HTMLDocument.Iterator
 
public class Joy{
public static void main(String[] args) {
Scanner io = new Scanner(System.in);
String s=io.nextLine();
int count=0;
for(int i=0;i<s.length();i++) {
if(!((i%3==0&&s.charAt(i)=='P')||(i%3==1&&s.charAt(i)=='E')||(i%3==2&&s.charAt(i)=='R')))
{
count++;
}
}
System.out.println(count);
}
}

Speed Limit Kattis Problem Solution In Java


import java.util.ArrayList;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;
import javax.swing.text.html.HTMLDocument.Iterator;
public class Joy{
public static void main(String[] args) {
// Get input from the user w/ sentinel logic
Scanner reader = new Scanner(System.in);
int pairs = Integer.parseInt(reader.nextLine());
// Keep track of distances
ArrayList<Integer> distances = new ArrayList<Integer>();
while(pairs != -1){ // While still accepting input
int distance = 0;
int hours = 0;
for(int i = 0; i < pairs; i++){
String[] temp = reader.nextLine().split(" "); // Put input into a string
distance += Integer.parseInt(temp[0]) * (Integer.parseInt(temp[1]) - hours); // distance is mph times new hours - old hours
hours = Integer.parseInt(temp[1]); // keep track of current hours
}
distances.add(distance);
pairs = Integer.parseInt(reader.nextLine());
} // end while loop
// Output data to the user
for(int i = 0; i < distances.size(); i++){
System.out.println(distances.get(i) + " miles");
}
// Closed the reader
reader.close();
}// end main
}

Pet Kattis Problem Solution In Java


//Nayeem Shahriar Joy,Applied Physics & Electronic Engineering, University of Rajshahi.
 
import java.util.ArrayList;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;
import javax.swing.text.html.HTMLDocument.Iterator
 
public class Joy{
public static void main(String[] args) {
// Get input from the user w/ sentinel logic
Scanner io = new Scanner(System.in);
int index=0;
int sum=0,sum1 = 0;
for(int i=1;i<=5;i++)
{
int a=io.nextInt();
int b=io.nextInt();
int c=io.nextInt();
int d=io.nextInt();
sum=a+b+c+d;
if(sum1<=sum)
{
sum1=sum;
index=i;
}
}
System.out.println(index+" "+sum1);
}
}

Modulo Kattis Problem Solution In Java


//Nayeem Shahriar Joy,Applied Physics & Electronic Engineering, University of Rajshahi.
 
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set
 
public class Joy{
public static void main(String[] args) {
// Get input from the user w/ sentinel logic
Scanner io = new Scanner(System.in);
Set<Integer>s=new HashSet<Integer>();
for(int i=1;i<=10;i++)
{
int a=io.nextInt();
s.add(a%42);
}
System.out.println(s.size());
}
}

A Real Challenge Kattis Problem Solution In Java


//Nayeem Shahriar Joy,Applied Physics & Electronic Engineering, University of Rajshahi.
 
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set
public class Joy{
public static void main(String[] args) {
// Get input from the user w/ sentinel logic
Scanner io = new Scanner(System.in);
double a = io.nextDouble();
System.out.println(4*Math.sqrt(a));
}
}

Mixed Fractions Kattis Problem Solution In Java


//Nayeem Shahriar Joy,Applied Physics & Electronic Engineering, University of Rajshahi.
 
import java.util.ArrayList;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set
 
public class Joy{
public static void main(String[] args) {
// Get input from the user w/ sentinel logic
Scanner in = new Scanner(System.in);
String s=in.nextLine();
String[]values=s.split(" ");
int a=Integer.parseInt(values[0]);
int b=Integer.parseInt(values[1]);
ArrayList<String>answers=new ArrayList<String>();
while(!(s.trim().equals("0 0")))
{
String[] mixedFunction=s.split(" ");
int A=Integer.parseInt(mixedFunction[0]);
int B=Integer.parseInt(mixedFunction[1]);
int frac=A/B;
int num=A%B;
answers.add(""+frac+" "+num+" / "+B);
s=in.nextLine();
}
for(int i=0;i<answers.size();i++)
{
System.out.println(answers.get(i));
}
}
}

One Chicken Per Person! Kattis Problem Solution In Java


//Nayeem Shahriar Joy,Applied Physics & Electronic Engineering, University of Rajshahi.
import java.util.ArrayList;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;
public class Joy{
public static void main(String[] args) {
// Get input from the user w/ sentinel logic
Scanner in = new Scanner(System.in);
String s=in.nextLine();
String[]values=s.split(" ");
int a=Integer.parseInt(values[0]);
int b=Integer.parseInt(values[1]);
if(a<b&&(b-a)!=1)
{
System.out.println("Dr. Chaz will have "+(b-a)+" pieces of chicken left over!");
}
else if(a<b&&(b-a)==1)
{
System.out.println("Dr. Chaz will have "+(b-a)+" piece of chicken left over!");
}
else if(a>b&&(a-b)!=1)
{
System.out.println("Dr. Chaz needs "+(a-b)+" more pieces of chicken!");
}
else if(a>b&&(a-b)==1)
{
System.out.println("Dr. Chaz needs "+(a-b)+" more piece of chicken!");
}
}
}

Line Them Up Kattis Problem Solution In Java


//Nayeem Shahriar Joy,Applied Physics & Electronic Engineering, University of Rajshahi.
 
import java.util.ArrayList;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set
 
public class Joy{
public static void main(String[] args) {

Scanner in = new Scanner(System.in);
int a=Integer.parseInt(in.nextLine());
ArrayList<String>s1=new ArrayList<String>();
for(int i=0;i<a;i++)
{
String s=in.nextLine();
s1.add(s);
}
boolean decreasing=false;
boolean increasing=false;
for(int j=0;j<s1.size()-1;j++)
{
if(s1.get(j).compareTo(s1.get(j+1))<0)
{
decreasing=true;
}
else
{
increasing=true;
}
}
if(increasing&&decreasing)
{
System.out.println("NEITHER");
}
else if(!increasing)
{
System.out.println("INCREASING");
}
else
{
System.out.println("DECREASING");
}
}
}

Server Kattis Problem Solution In Java


//Nayeem Shahriar Joy,Applied Physics & Electronic Engineering, University of Rajshahi.
 
import java.util.ArrayList;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set
 
public class Joy{
public static void main(String[] args) {

Scanner in = new Scanner(System.in);
int i=0;
String s=in.nextLine();
String[]values=s.split(" ");
int a=Integer.parseInt(values[1]);
String d=in.nextLine();
String[]joy=d.split(" ");
int sum=0;
int count=0;
for( i=0;i<joy.length;i++)
{
int b=Integer.parseInt(joy[i]);
a=a-b;
if(a>=0) {
count++;
}
else
{
break;
}
}
System.out.println(count);
}
}

Tarifa Kattis Problem Solution In Java


//Nayeem Shahriar Joy, Applied Physics & Electronic Engineering, University of Rajshahi.
import java.util.Scanner;
public class JavaApplication1 {
/**
* @param args the command line arguments
*/
public static void main(String[] args) {
Scanner io=new Scanner(System.in);
int n=io.nextInt();
int x=io.nextInt();
int sum=0;
for(int i=0;i<x;i++)
{
int m=io.nextInt();
sum=sum+m;
}
System.out.println((n*(x+1)-sum));
// TODO code application logic here
}
}

Autori Kattis Problem Solution In Java




//Nayeem Shahriar Joy, Applied Physics & Electronic Engineering, University of Rajshahi.
import java.util.Scanner;
public class JavaApplication1 {
public static void main(String[] args) {
Scanner io=new Scanner(System.in);
String s=io.nextLine();
String[]values=s.split("-");
for(int i=0;i<values.length;i++)
{
System.out.print(values[i].charAt(0));
}
System.out.println();
// TODO code application logic here
}
}

Cetvrta Kattis Problem Solution In Java


//Nayeem Shahriar Joy, Applied Physics & Electronic Engineering, University of Rajshahi.
import java.util.Scanner;
public class JavaApplication1 {
/**
* @param args the command line arguments
*/
public static void main(String[] args) {
Scanner io=new Scanner(System.in);
String s1=io.nextLine();
String s2=io.nextLine();
String s3=io.nextLine();
String[]values1=s1.split(" ");
String[]values2=s2.split(" ");
String[]values3=s3.split(" ");
int A1,B1,A2,B2,A3,B3,A4=0,B4=0;
A1=Integer.parseInt(values1[0]);
B1=Integer.parseInt(values1[1]);
A2=Integer.parseInt(values2[0]);
B2=Integer.parseInt(values2[1]);
A3=Integer.parseInt(values3[0]);
B3=Integer.parseInt(values3[1]);
if(A1==A2)
{
if(B3==B2)
{
A4=A3;
B4=B1;
}
else
{
A4=A3;
B4=B2;
}
}
else if(A2==A3)
{
if(B1==B2)
{
A4=A1;
B4=B3;
}
else
{
A4=A1;
B4=B2;
}
}
else if(A1==A3)
{
if(B2==B3)
{
A4=A2;
B4=B1;
}
else
{
A4=A2;
B4=B3;
}
}
System.out.println(A4+" "+B4);
// TODO code application logic here
}
}