Skip to content

Commit c2a2778

Browse files
Added all Competitive Programming Codes
1 parent 961484d commit c2a2778

File tree

147 files changed

+2376
-1
lines changed

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

147 files changed

+2376
-1
lines changed

Codechef/README.md

+3
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,3 @@
1+
## This repository contains codes for codechef problems
2+
3+
#### @author: Saurav Jaiswal(sauravjaiswalsj.github.io)

Codechef/beg/.Guddu.java.swp

12 KB
Binary file not shown.
12 KB
Binary file not shown.

Codechef/beg/AddNumber.java

+13
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,13 @@
1+
import java.util.Scanner;
2+
class AddNumeber{
3+
public static void main(String[] args){
4+
Scanner cin=new Scanner(System.in);
5+
int t=cin.nextInt();
6+
while(t!=0){
7+
int a=cin.nextInt();
8+
int b=cin.nextInt();
9+
System.out.println(a+b);
10+
t--;
11+
}
12+
}
13+
}

Codechef/beg/Addfstnlst.java

+24
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,24 @@
1+
import java.util.Scanner;
2+
3+
class Addfstnlst{
4+
public static void main(String[] args){
5+
Scanner cin=new Scanner(System.in);
6+
int t=cin.nextInt();
7+
while(t!=0){
8+
long num=cin.nextLong();
9+
System.out.println(addDigit(num));
10+
t--;
11+
}
12+
}
13+
public static long addDigit(long num){
14+
int sum=0,fst=0;
15+
int lst=(int)num%10;
16+
while(num!=0){
17+
if(num<10 && num>0){
18+
fst=(int)num;
19+
}
20+
num/=10;
21+
}
22+
return lst+fst;
23+
}
24+
}

Codechef/beg/BankAtm.java

+17
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,17 @@
1+
import java.util.Scanner;
2+
import java.text.DecimalFormat;
3+
class BankAtm{
4+
public static final Scanner cin=new Scanner(System.in);
5+
public static final DecimalFormat df=new DecimalFormat("#0.00");
6+
public static void main(String[] args){
7+
int amount=cin.nextInt();
8+
double balance=cin.nextDouble();
9+
if(amount%5==0 && amount<=balance-0.5){
10+
double bal=balance-(double)amount-0.50;
11+
System.out.println(df.format(bal));
12+
}else{
13+
System.out.println(df.format(balance));
14+
}
15+
}
16+
}
17+

Codechef/beg/EnormousInputTest.java

+20
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,20 @@
1+
import java.util.Scanner;
2+
class EnormousInputTest{
3+
public static void main(String[] args){
4+
Scanner cin=new Scanner(System.in);
5+
int n=cin.nextInt();
6+
int k=cin.nextInt();
7+
long[] num=new long[n];
8+
for(int i=0;i<n;i++){
9+
num[i]=cin.nextLong();
10+
}
11+
int count=0;
12+
for(int i=0;i<n;i++){
13+
if(num[i]%k==0){
14+
count++;
15+
}
16+
}
17+
System.out.println(count);
18+
}// main ends
19+
}//class ends
20+

Codechef/beg/FindRem.java

+13
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,13 @@
1+
import java.util.Scanner;
2+
class FindRem{
3+
public static void main(String[] args){
4+
Scanner cin=new Scanner(System.in);
5+
int t=cin.nextInt();
6+
while(t!=0){
7+
int a=cin.nextInt();
8+
int b=cin.nextInt();
9+
System.out.println(a%b);
10+
t--;
11+
}
12+
}
13+
}

Codechef/beg/LuckyFour.java

+24
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,24 @@
1+
import java.util.Scanner;
2+
3+
class LuckyFour{
4+
public static void main(String[] agrs){
5+
Scanner cin=new Scanner(System.in);
6+
int t=cin.nextInt();
7+
while(t!=0){
8+
long n=cin.nextLong();
9+
System.out.println(getCount(n));
10+
t--;
11+
}
12+
13+
}
14+
public static int getCount(long n){
15+
int count=0;
16+
while(n!=0){
17+
int rem=(int)n%10;
18+
if(rem==4){
19+
count++;
20+
}n/=10;
21+
}
22+
return count;
23+
}
24+
}

Codechef/beg/ReverseNumber.java

+23
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,23 @@
1+
import java.util.Scanner;
2+
3+
class ReverseNumber{
4+
public static final Scanner cin=new Scanner(System.in);
5+
public static void main(String[] args){
6+
int t=cin.nextInt();
7+
int num,rvalue;
8+
while(t!=0){
9+
num=cin.nextInt();
10+
System.out.println(reverse(num));
11+
}
12+
}
13+
public static int reverse(int num){
14+
int sum=0;
15+
while(num!=0){
16+
int rem=num%10;
17+
sum=sum*10+rem;
18+
num/=10;
19+
}
20+
return sum;
21+
}
22+
}
23+

Codechef/beg/SecondLargest.java

+35
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,35 @@
1+
import java.util.Scanner;
2+
3+
class SecondLargest{
4+
public static void main(String[] args){
5+
Scanner cin=new Scanner(System.in);
6+
int t=cin.nextInt();
7+
while(t!=0){
8+
long a=cin.nextLong();
9+
long b=cin.nextLong();
10+
long c=cin.nextLong();
11+
System.out.println(getSecondLargest(a,b,c));
12+
t--;
13+
}
14+
}
15+
public static long getSecondLargest(long a,long b, long c){
16+
if(a>b && a>c){
17+
if(b>c){
18+
return b;
19+
}else{
20+
return c;
21+
}
22+
}else if(b>a && b>c){
23+
if(a>c){
24+
return a;
25+
}else return c;
26+
}else if(c>a && c>b){
27+
if(a>b){
28+
return a;
29+
}else return b;
30+
}else{
31+
return a;
32+
}
33+
34+
}
35+
}

Codechef/beg/SmallFact.java

+20
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,20 @@
1+
import java.util.Scanner;
2+
import java.math.BigInteger;
3+
class SmallFact{
4+
public static void main(String[] args){
5+
Scanner cin=new Scanner(System.in);
6+
int t=cin.nextInt();
7+
while(t!=0){
8+
int n=cin.nextInt();
9+
System.out.println(fact(n));
10+
t--;
11+
}
12+
}
13+
public static BigInteger fact(int n){
14+
BigInteger bf=BigInteger.ONE;
15+
while(n!=1){
16+
bf=bf.multiply(BigInteger.valueOf(n));
17+
n--;
18+
}return bf;
19+
}
20+
}

Codechef/beg/SmallFactorial.java

+19
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,19 @@
1+
import java.util.Scanner;
2+
class SmallFactorial{
3+
public static void main(String[] args){
4+
Scanner cin=new Scanner(System.in);
5+
int t=cin.nextInt();
6+
while(t!=0){
7+
int c=cin.nextInt();
8+
System.out.println(fact(c));
9+
t--;
10+
}
11+
}
12+
public static long fact(int n){
13+
long fc=1;
14+
for(int i=2;i<=n;i++){
15+
fc*=(long)i;
16+
}
17+
return fc;
18+
}
19+
}

Codechef/beg/SumofDigits.java

+22
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,22 @@
1+
import java.util.Scanner;
2+
3+
class SumofDigits{
4+
public static void main(String[] args){
5+
Scanner scan=new Scanner(System.in);
6+
int t=scan.nextInt();
7+
while(t!=0){
8+
int num=scan.nextInt();
9+
System.out.println(digitAdd(num));
10+
t--;
11+
}
12+
}
13+
static int digitAdd(int num){
14+
int sum=0;
15+
while(num!=0){
16+
int rem=num%10;
17+
sum=sum+rem;
18+
num/=10;
19+
}
20+
return sum;
21+
}
22+
}

Codechef/beg/TurboSort.java

+16
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,16 @@
1+
import java.util.*;
2+
3+
class TurboSort{
4+
public static void main(String[] args){
5+
Scanner cin=new Scanner(System.in);
6+
int t=cin.nextInt();
7+
int[] arr=new int[t];
8+
for(int i=0;i<t;i++){
9+
arr[i]=cin.nextInt();
10+
}
11+
Arrays.sort(arr);
12+
for(int i=0;i<t;i++){
13+
System.out.println(arr[i]);
14+
}
15+
}
16+
}
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,19 @@
1+
import java.util.*;
2+
3+
public class FriendorGirlfriend{
4+
public static void main(String[] args){
5+
Scanner cin=new Scanner(System.in);
6+
int n=cin.nextInt();
7+
while(n!=0){
8+
int t=cin.nextInt();
9+
String s=cin.nextLine();
10+
cin.next();
11+
String c=cin.next();
12+
System.out.println(checkLetters(s,c));
13+
n--;
14+
}
15+
}
16+
public static int checkLetters(String s, String c){
17+
18+
}
19+
}
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,15 @@
1+
import java.util.*;
2+
3+
class MaximumRemaining{
4+
public static void main(String[] args){
5+
Scanner cin=new Scanner(System.in);
6+
int n=cin.nextInt();
7+
int[] arr=new int[n];
8+
for(int i=0;i<n;i++){
9+
arr[i]=cin.nextInt();
10+
}
11+
Arrays.sort(arr);
12+
int j=arr[n-1];
13+
System.out.println(arr[n-2]%j);
14+
}
15+
}

Codechef/contest/AprilLong/maxrem.cpp

+28
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,28 @@
1+
#include<iostream>
2+
#include <bits/stdc++.h>
3+
int main(void){
4+
int n;
5+
std::cin>>n;
6+
int arr[n];
7+
for(int i=0;i<n;i++){
8+
std::cin>>arr[i];
9+
}
10+
std::sort(arr,arr+n);
11+
int j=arr[n-1],max=0,mod;
12+
try{
13+
for(int i=0;i<n;i++){
14+
if(arr[i]==0)
15+
throw arr[i];
16+
mod=arr[i]%j;
17+
if(mod>=max){
18+
max=mod;
19+
}
20+
}
21+
std::cout<<max;
22+
}
23+
catch(int x){
24+
std::cout<<max;
25+
}
26+
}
27+
28+

Codechef/contest/IcL/FlatLand.java

+48
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,48 @@
1+
import java.util.*;
2+
import java.lang.*;
3+
class FlatLand{
4+
public static void main(String[] args){
5+
Scanner cin=new Scanner(System.in);
6+
int t=cin.nextInt();
7+
while(t!=0){
8+
int n=cin.nextInt();
9+
System.out.println(numSquare(n));
10+
11+
t--;
12+
}
13+
}
14+
static int numSquare(int n){
15+
int su=n;
16+
boolean cond=true;
17+
int count=0;
18+
if(su>1){
19+
while(cond){
20+
int sqr=floorSqrt(su);
21+
int sub=su-(sqr*sqr);
22+
if(sub==1 || sub<1){
23+
count+=1;
24+
cond=false;
25+
}
26+
su=sub;
27+
count+=1;
28+
29+
}
30+
return count;
31+
}else{return su;
32+
}
33+
34+
}
35+
static int floorSqrt(int x)
36+
{
37+
if (x == 0 || x == 1)
38+
return x;
39+
int i = 1, result = 1;
40+
41+
while (result <= x) {
42+
i++;
43+
result = i * i;
44+
}
45+
return i - 1;
46+
}
47+
}
48+

Codechef/contest/IcL/candies.java

+21
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,21 @@
1+
import java.util.*;
2+
class candies{
3+
public static void main(String[] args){
4+
Scanner cin=new Scanner(System.in);
5+
int t=cin.nextInt();
6+
while(t!=0){
7+
long n=cin.nextLong();
8+
long m=cin.nextLong();
9+
long k=cin.nextLong();
10+
long can=n/m;
11+
long tcan=n-(can*m);
12+
if(tcan%k!=0){
13+
System.out.println((tcan/k)+1);
14+
}else if(tcan%k==0){
15+
System.out.println(tcan/k);
16+
}else
17+
System.out.println("-1");
18+
t--;
19+
}
20+
}
21+
}

0 commit comments

Comments
 (0)