# Data Structure and Algorithm | Functions and Recursions | Codewindow.in

#### Solution: In C

``````import java.io.*;
import java.util.*;

class GFG {
static int KthLargestFactor(int n, int k)
{
for (int i = n; i>0; i--) {
if (n % i == 0)
k--;
if (k == 0)
return i;
}
return 1;
}

public static void main(String[] args) throws Exception
{
int N = Integer.parseInt(str[0]);
int K = Integer.parseInt(str[1]);
System.out.println(KthLargestFactor(N, K));
}
}``````

#### Solution: In Java

``````import java.io.*;
import java.util.*;

class GFG {
static int KthLargestFactor(int n, int k)
{
for (int i = n; i>0; i--) {
if (n % i == 0)
k--;
if (k == 0)
return i;
}
return 1;
}

public static void main(String[] args) throws Exception
{
int N = Integer.parseInt(str[0]);
int K = Integer.parseInt(str[1]);
System.out.println(KthLargestFactor(N, K));
}
}``````

#### Solution: In Python 3

``````def KthLargestFactor(n, k):
for i in range(n, 0, -1):
if n % i == 0:
k -= 1
if k == 0:
return i
return 1

st = str(input()).split(",")
N = int(st[0])
K = int(st[1])
print(KthLargestFactor(N, K))``````

#### Solution: In C

``````if a>b:
print("Hi")``````

#### Solution: In Java

``````import java.util.Scanner;

class Main {
static int prime(int b) {
int j,cnt;
cnt=1;
for (j = 2; j &lt;= b/2; j++) {
if(b%j==0)
cnt=0;
}
if(cnt==0)
return 1;
else
return 0;
}

public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int i,j,n=0,cnt,c=0,sum=0,count=0,k=0;
Main t = new Main();
int[] a = new int[25];
n = sc.nextInt();

for (i = 2; i &lt;=n ; i++) {
cnt=1;
for (j = 2; j &lt;= n/2; j++) {
if(i%j==0)
cnt=0;
}

if(cnt==1) {
a[k]=i;
k++;
}
}

for (i = 0; i &lt; k; i++) {
sum=sum+a[i];
c=t.prime(sum);
if(c==1)
count++;
}
System.out.println(count);
}
}``````

#### Solution: In Python 3

``````num = int(input())
arr = []
sum = 0
count = 0
if num &gt; 1:
for i in range(2, num + 2):
for j in range(2, i):
if i % j == 0:
break
else:
arr.append(i)

def is_prime(sum):
for i in range(2, (sum // 2) +2):
if sum % i == 0:
return False
return True
for i in range(0, len(arr)):
sum = sum + arr[i]
if sum &lt;= num:
if is_prime(sum):
count = count + 1
print(count)``````