Cod sursa(job #1398031)
| Utilizator | Data | 23 martie 2015 22:16:46 | |
|---|---|---|---|
| Problema | Fractii | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.53 kb |
#include <stdio.h>
bool prime(long a,long b)
{
if(a%b!=0 and b%a!=0)
return true;
return false;
}
int main()
{
long N,K;
FILE *fp;
fp=fopen("fractii.in","r");
fscanf(fp,"%ld",&N);
K=2*N-1;
fclose(fp);
fp=fopen("fractii.out","w");
for(long i=1 ; i<=N ; i++)
{
for(long j=1;j<=N;j++)
if(i!=j && prime(i,j)==true)
{
K++;
// printf("%ld/%ld\n",i,j);
}
}
fprintf(fp,"%ld",K);
fclose(fp);
}
