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

}

}

Odd Gnome 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 s1=Integer.parseInt(io.nextLine());

for(int i=0;i<s1;i++)

{

String s2=io.nextLine();

String[]values=s2.split(" ");

System.out.println(ans(values));

}

System.out.println();

// TODO code application logic here

}

public static int ans(String[]a)

{

int king=0;

for(int i=1;i<a.length-2;i++)

{

Integer A=Integer.parseInt(a[i]);

Integer B=Integer.parseInt(a[i+1]);

Integer C=Integer.parseInt(a[i+2]);

if(A<C && (A<B && B>C))

{

king=i+1;

break;

}

else if(A<C && (A>B && B<C) )

{

king=i+1;

break;

}

}

return king;

}

}

Quick Estimates 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);

int s1=Integer.parseInt(io.nextLine());

for(int i=0;i<s1;i++)

{

String s3=io.nextLine();

System.out.println(s3.length());

}

}

}

Quick Brown Fox 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 s1=Integer.parseInt(io.nextLine());

for(int i=0;i<s1;i++)

{

String s3=io.nextLine();

s3=s3.toLowerCase();

int[]a=new int[124];

for (int m = 0; m < a.length; m++) {

a[m] = 0;

}

boolean missing=false;

for(int j=0;j<s3.length();j++)

{

a[(int)s3.charAt(j)]++;

}

for(int k=97;k<=122;k++)

{

if(a[k]==0)

{

missing = true;

break;

}

}

if(missing)

{

System.out.print("missing ");

for(int f=97;f<=122;f++)

{

if(a[f]==0)

System.out.print((char)(f));

}

}

else

{

System.out.print("pangram");

}

System.out.println();

}

// TODO code application logic here

}

}

1070 - A Simple Calculation COJ Problem Solution

http://coj.uci.cu/24h/problem.xhtml?pid=1070

In C++..................

#include<iostream>
#include <cstdio>
#include<cmath>
#include<vector>
#include<algorithm>
#include<cstring>

using namespace std;

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

int main()

{
    cin.tie(0);

    ios::sync_with_stdio(0);

    int N;

    while(cin>>N)
    {
       cout<<(N*(N+1)*(2*N+1))/6<<" "<<(N*N*(N+1)*(N+1))/4<<endl;
    }
    return 0;
}

1051 - Div 3 COJ Problem Solution

http://coj.uci.cu/24h/problem.xhtml?pid=1051



In C++...........

#include <iostream>
#include <cmath>
using namespace std;

int main() {
    // your code goes here
    long long n,ans;
    cin>>n;
    ans=n-n/3;
    if(n%3!=0)
        ans--;
   
    cout<<ans<<endl;
    return 0;
}

1050 - Coprimes COJ Problem Solution

http://coj.uci.cu/24h/problem.xhtml?pid=1050

In C++............

#include<iostream>
#include<cstdio>

using namespace std;

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


int phie(int n)

{
    int result =n;
    for(int p=2;p*p<=n;++p)
    {
        if(n%p==0)
        {
            while(n%p==0)
            {
                n=n/p;
            }
            result=result-(result/p);
        }
    }
    if(n>1)
    {
        result=result-(result/n);
    }
    return result;
}

int main()

{
    int n;
    cin>>n;
    cout<<phie(n)<<endl;
}

1049 - Sum COJ Problem Solution

http://coj.uci.cu/24h/problem.xhtml?pid=1049

In C++..................

#include<iostream>
#include<cstdio>

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

using namespace std;

int main()

{
    int N,sum=0;

    cin>>N;
    if(N<=0)
    {
        for(int i=N;i<=1;i++)
        {
            sum=sum+i;
        }
    }
    else

    {
        for(int i=1;i<=N;i++)
        {
            sum=sum+i;
        }
    }
    cout<<sum<<endl;
    return 0;
}

1042 - Bamboo COJ Problem Solution

http://coj.uci.cu/24h/submission.xhtml?id=1107168

In C++..........................

#include<iostream>
#include<cstdio>
#include<cmath>
#include<iomanip>

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

using namespace std;

#define pi 3.14

int main()

{
    cin.tie(0);

    ios::sync_with_stdio(0);

    cout<<fixed<<setprecision(1);

    double a,b,c,k,sum1=0,sum2=0;

    double n;

    int i;

    cin>>i;

    n=(double)i;

    while(i--){


    cin>>a>>b;

    sum1=a-((pow(a,2)+pow(b,2))/(2*a));

    cout<<sum1<<endl;

    sum2=sum2+sum1;

    }
    cout<<sum2/n<<endl;

    return 0;
}

1035 - Sqrt Log Sin COJ Problem Solution

http://coj.uci.cu/24h/problem.xhtml?pid=1035



In C++..................................

#include <stdio.h>
#include <math.h>
#define mod 1000000

int x[1000005];

void calcula()
{
    int i;
    double d;

    x[0] = 1;
    for(i = 1; i <= 1000000; i++){
        d = i;
        x[i] = (x[(int)(d-sqrt(d))]%mod + x[(int)log(d)]%mod + x[(int)(d*sin(d)*sin(d))]%mod)%mod;
    }
}

int main()
{
    int n;

    calcula();
    while(1)
    {
        scanf("%d", &n);
        if(n == -1) break;
        printf("%d\n", x[n]);
    }
    return 0;
}

1023 - Financial Management COJ Problem Solution

In C++.......................

#include<iostream>
#include <cstdio>
#include<cmath>
#include<vector>
#include<algorithm>

using namespace std;

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

int main() {

    double a,sum=0;

        for(int i=0;i<12;i++)
        {
            cin>>a;
            sum=sum+a;
        }
        cout<<"$"<<sum/12.0<<endl;
    return 0;
}

1003 - General Election COJ Problem Solution

In C++................

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


#include <bits/stdc++.h>

using namespace std;

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);

  int n, m;

  int tc;

   cin >> tc;

  while (tc--)
   
    {
       
    cin >> n >> m;
 
    vector<int> tot(n);
   
    int t;
   
    while (m--)
       
        {
           
      for (int i = 0; i < n; ++i)
     
      {
        cin >> t;
       
        tot[i] += t;
      }
   
    }
    cout << (max_element(tot.begin(), tot.end()) - tot.begin()) + 1 << endl;
  }

  return 0;
}