Cod sursa(job #3325805)
| Utilizator | Data | 26 noiembrie 2025 15:59:49 | |
|---|---|---|---|
| Problema | Fractii | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.58 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
int main()
{
int n, counter=0;
fin>>n;
int v[n][n];
for(int i=1; i<=n; i++){
for(int j=1; j<=n; j++){
v[i][j]=0;
if(i==j&&i>1){
v[i][j]=1;
}
else{
if((i<j&&i%j==0)||(i>j&&j%i==0)) v[i][j]=1;
}
if(v[i][j]==0){
counter++;
//cout<<i<<" "<<j<<endl;
}
}
}
fout<<counter;
return 0;
}