prime factorisation

[kpatry]

Hi! Could sommeone help me? I wrote a program that counts prime factors of numbers, do you know what could I do to print only numbers with odd prime factors? I would be grateful for any suggestion :).

  #include<iostream>
#include<fstream>
using namespace std;
int primefactor(int x)
{
    if(x==1){return 1;}
    int num=2;
    while(x%num!=0)
    {
        num++;
    }
    cout<<num<<" ";
    primefactor(x/num);
}
bool read_file(char name[])
{
    ifstream plik;
    int x;
    plik.open(name,ios::in);
    while(true)
    {
        if(!plik.good()) {break;}
        else
        {
         plik>>x;
         cout<<x;
        cout<<" :";
         primefactor(x);
         cout<<"|";
          }
        }

        plik.close();
    }

int main()
{
 read_file("liczby2.txt");
}

[kbw]

n mod 2 is 1 for odd numbers, and 0 for even numbers.

You have another problem though. But first, have you heard of RAII?
https://en.wikipedia.org/wiki/Resource_Acquisition_Is_Initialization