Cod sursa(job #585593)
Utilizator | Data | 30 aprilie 2011 09:56:39 | |
---|---|---|---|
Problema | NumMst | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Algoritmiada 2011, Runda Finală, Clasele 10-12 | Marime | 0.37 kb |
#include <fstream>
using namespace std;
ifstream in("nummst.in");
ofstream out("nummst.out");
void Print(int n, int i)
{
n /= i;
for (int j = 0; j < i; ++j)
out << n << " ";
out << "\n";
}
int main()
{
int n;
in >> n;
int i = 2;
while (i <= n)
{
if (n % i == 0)
{
Print(n, i);
return 0;
}
++i;
}
return 0;
}