Cod sursa(job #2432097)
Utilizator | Data | 22 iunie 2019 01:23:35 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.5 kb |
#include <iostream>
using namespace std;
int main(){
int cp ,p ,k ,f, n ;
cin >> n;
cin >> p;
for ( int i=1; i <= n; i++ ){
p = cp;
while(cp!=0){
while(i!=cp){
if(cp>i){
cp=cp-i;}
else{
i=i-cp;
}
}
if(i!=1){
k=k+1;
}
cp=cp-1;
}
}
cout << k;
return 0;
}