Pagini recente » Cod sursa (job #392113) | Cod sursa (job #2068067) | Cod sursa (job #2516231) | Cod sursa (job #730510) | Cod sursa (job #1313507)
import java.io.*;
import java.util.Scanner;
class Clasa{
public boolean prime(int a,int b){
int d,aux;
if(a<b){
aux=a;
a=b;
b=aux;
}
for(d=2;d<=b;d++){
if(b%d==0){
if(a%d==0){
return false;
}
}
}
return true;
}
public int functia_recursiva(int numar){
int i,rezultat=0;
if(numar==1){
return 1;
}
else{
for(i=numar-1;i>=1;i--){
if(prime(numar,i)){
rezultat+=2;
}
}
return functia_recursiva(numar-1)+rezultat;
}
}
}
public class Main {
public static void main(String [] args){
try {
Clasa c = new Clasa();
Scanner s = new Scanner(new FileInputStream("fractii.in"));
PrintWriter p = new PrintWriter("fractii.out");
int n,raspuns;
n=s.nextInt();
// p.print(c.prime(13, 26));
// p.print(c.prime(2, 6));
// p.print(c.prime(3,6));
// p.print(c.prime(4, 6));
// p.print(c.prime(5, 6));
// p.print(c.prime(6, 6));
p.print(c.functia_recursiva(10));
s.close();
p.close();
} catch (FileNotFoundException e) {
// TODO Auto-generated catch block
e.printStackTrace();
}
}
}