Cod sursa(job #2244017)
| Utilizator | Data | 21 septembrie 2018 21:00:34 | |
|---|---|---|---|
| Problema | Fractii | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.53 kb |
#include<fstream>
#include<iostream>
using namespace std;
int main(){
ifstream fin("flip.in");
ofstream fout("flip.out");
int N,count;
fin>>N;
count=0;
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= N; j++) {
if(j == 1 || i == 1 ){
//cout<<i<<"/"<<j<<" ";
count++;
}
if((i%2==0 && j%2==0) || (i%3==0 && j%3==0)){
}else if((i<=j && j%i!=0 ) || (i>j && i%j!=0)){
//cout<<i<<"/"<<j<<" ";
count++;
}
}
}
//cout<<endl;
fout<<count;
return 0;
}
