Pagini recente » Cod sursa (job #324779) | Cod sursa (job #2675550) | Cod sursa (job #3217783) | Cod sursa (job #2888416) | Cod sursa (job #1616799)
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.PrintWriter;
public class Main {
public static boolean checkForCoPrime(int a, int b) {
if((a > 1) && (b > 1)) {
if(a == b) {
return false;
}
if((a > b)) {
if(a % b == 0) {
return false;
}
for(int i = 2; i <= Math.floor(b/2); i++) {
if((a % i == 0) && (b % i ==0)) {
return false;
}
}
}
if((b > a)) {
if(b % a == 0) {
return false;
}
for(int i = 2; i <= Math.floor(a/2); i++) {
if((b % i == 0) && (a % i == 0)) {
return false;
}
}
}
}
return true;
}
public static void main(String[] args) {
BufferedReader br = null;
PrintWriter writer = null;
int n = 0;
try {
br = new BufferedReader(new FileReader("fractii.in"));
String sCurrentLine = br.readLine();
n = Integer.parseInt(sCurrentLine);
br.close();
} catch(Exception e) {
try {
if (br != null) br.close();
} catch (Exception ex) {
ex.printStackTrace();
}
}
int counter = 0;
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= n; j++) {
if(checkForCoPrime(i, j)) {
counter++;
}
}
}
try {
writer = new PrintWriter("fractii.out", "UTF-16");
writer.print(counter);
writer.close();
} catch(Exception e) {
writer.close();
}
}
}