Cod sursa(job #2463368)
Utilizator | Data | 28 septembrie 2019 11:33:36 | |
---|---|---|---|
Problema | Divizori Primi | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
using namespace std;
int k,t,n,ok,d,p,x;
ifstream f("divprim.in");
ofstream g ("divprim.out");
int main()
{
ok=1;
while(f>>t)
{
f>>n>>k;
p=0;
d=2;
while(x%d==0)
{
x/=d;
d++;
}
if(p==d)
g<<d;
}
g<<n;
return 0;
}