HACKATHON 26.11.2020 by Georgescu Alice

2020-11-25 21:45:44 UTC

2020-11-26 06:10:27 UTC

onymous

denisa :))

2020-11-26 06:10:38 UTC

Doru

2020-11-26 06:10:58 UTC

#307 zerouri1

#include 

using namespace std;

int main()
{
    int n,x,nr2 = 0,nr5 = 0;
    cin >> n;
    long long produs = 1;
    for(; n; --n)
    {
        cin >> x;
        while(x % 2 == 0)
        {
            x /= 2;
            nr2++;
        }
        while(x % 5 == 0)
        {
            x /= 5;
            nr5++;
        }
        produs *= (x % 10);
        produs %= 10;
    }
    produs %= 10;
    if(nr2 > nr5)
    {
        nr2 -= nr5;
        switch(nr2 % 4)
        {
            case 1:
                produs <<= 1;
                break;
            case 2:
                produs <<= 2;
                break;
            case 3:
                produs <<= 3;
                break;
            case 0:
                produs <<= 4;
                break;
        }
    }
    else if(nr5 > nr2)
    {
        produs *= 5;
    }
    produs %= 10;
    cout << produs;
    return 0;
}
#440 factzero1
#include 

using namespace std;

int main()
{
    int n,cn;
    int nr2 = 0,nr5 = 0;
    long long produs = 1;
    cin >> n;
    for(; n; --n)
    {
        cn = n;
        while(!(cn % 2))
        {
            cn >>= 1;
            ++nr2;
        }
        while(!(cn % 5))
        {
            cn /= 5;
            ++nr5;
        }
        produs *= (cn % 10);
        produs %= 10;
    }
    if(nr2 > nr5)
    {
        nr2 -= nr5;
        switch(nr2 % 4)
        {
            case 1:
                produs <<= 1;
                break;
            case 2:
                produs <<= 2;
                break;
            case 3:
                produs <<= 3;
                break;
            case 0:
                produs <<= 4;
                break;
        }
    }
    else if(nr5 > nr2)
    {
        produs *= 5;
    }
    produs %= 10;
    cout << produs;
    return 0;
}

Anghel Rares

2020-11-26 06:11:05 UTC

#306
#include

using namespace std;
int n,i,a,exp2,exp5;
int main()
{ cin>>n;
for(i=1;i<=n;i++)
{
cin>>a;
while(a%2==0)
{
exp2++;
a=a/2;
}
while(a%5==0)
{
exp5++;
a=a/5;
}
}
cout< return 0;
}
#111

#include 

using namespace std;
int n,i,x,x1,nr,rez=0,Max=0,d=2,P=0;
int main()
{   cin>>n;
    rez=0;
    Max=0;
    for(i=1;i<=n;i++)
    {
        cin>>x;
        x1=x;
        nr=0;
        d=2;
        while(x>1)
        {
            P=0;
            while(x%d==0)
                {
                    P++;
                    x=x/d;
                }
            if(P) nr++;
            d++;
            if(d*d>x) d=x;
        }
        if(nr>Max)
            {
                Max=nr;
                rez=x1;
            }
        else if(nr==Max && x1

rares draghiceanu

2020-11-26 06:11:06 UTC

#include
using namespace std;

int main()
{
long long n,s=0,d=2;
cin>>n;
while(n>1)
{
int p=0;
while(n%d==0)
{
n/=d;
p++;
}
if(p>0)
{
s+=d;
}
d++;
if(d*d>n)
d=n;
}
cout< return 0;
}

#include
using namespace std;

int nrdiv(int x)
{
int d=2, p=0;
int cnt=0;
while(x>1)
{
p=0;
while(x%d==0)
{
p++;
x/=d;
}
if(p>0)
cnt++;
d++;
if(d*d>x)
d=x;
}
return cnt;
}

int main()
{
int a, b;
cin>>a;
int max=nrdiv(a) , nmax=a;
while(1)
{
cin >> b;
if(a==b)
break;
if(nrdiv(b) > max)
max=nrdiv(b) , nmax=b;
else
if(nrdiv(b) == max)
if(b > nmax)
nmax = b;
a=b;
}
cout << nmax << ' ' << max;
return 0;
}

Grigore

2020-11-26 06:11:17 UTC

#1409
#include
using namespace std;
int cmmdp(int x)
{
int divizor = 0;
for (int d=2;d*d<=x;d++){
if (x%d == 0){
divizor = d;
while(x%d == 0){
x/=d;
}
}
}
if (x>1)
divizor = x;
return divizor;
}
int main()
{
int n,x,i;
long long S = 0;
cin>>n;
for(i=0;i {
cin>>x;
S=S+cmmdp(x);
}
cout< return 0;
}
#3353

#include
using namespace std;

long long desc(long long n)
{
long long prod=1;
long long d=2;
while(n>1){
int p=0;
while(n%d==0)
n/=d,p++;
if(p)
prod*= d;
d++;
if(d*d>n)
d=n;
}
return prod;
}
int main()
{
long long a,b;
cin>>a>>b;
long long prod1=desc(a);
long long prod2=desc(b);
if(prod1>prod2)
cout<
else if(prod1 == prod2)

cout< else
cout< return 0;
}

andrei banu

2020-11-26 06:11:26 UTC

2821

#include

using namespace std;

int main()

{

int n;

cin>>n;

int m=1,d=2;

while(n>1)

{

int p=0;

while(n%d==0)

{

n/=d;

p++;

}

if(p!=0)m=m*d;

d++;

if(d*d>n)d=n;

}

cout<

return 0;

}

379

#include

using namespace std;

int n,d,i,x,cn,ok,e,s;

int main()

{

cin>>n;

cn=n;

d=2;

ok=1;

while (ok&&cn>1)

{

e=0;

while (cn%d==0)

{

cn=cn/d;

e++;

}

if(e>1) ok=0;

else if(e==1)

{

s++;

}

if(s>2) ok=0;

d++;

}

if(ok) cout<<"DA";

else cout<<"NU";

return 0;

}

Ana Bascau

2020-11-26 06:11:26 UTC

problema 3459-50 pct
#include 
#include 
using namespace std;
ifstream fin("countprime.in");
ofstream fout("countprime.out");
int main()
{
    int st,dr,cnt,i,ok,d;
    fin>>st>>dr;
    cnt=0;
    if(st<=dr)
    {for(i=st;i<=dr;i++)
    {
        ok=1;
        if(i<2) ok=0;
        for(d=2;d*d<=i;d++)
        {
            if(i%d==0)
            {
                ok=0;break;
            }
        }
        if(ok) cnt=cnt+1;
    }}
    else
        {for(i=dr;i<=st;i++)
    {
        ok=1;
        if(i<2) ok=0;
        for(d=2;d*d<=i;d++)
        {
            if(i%d==0)
            {
                ok=0;break;
            }
        }
        if(ok) cnt=cnt+1;
    }}
    fout<

problema 62-100 pct
#include 

using namespace std;

int main()
{
    int n,f,p;
    cin>>n;
    f=2;
    while(n>1 && f*f<=n)
    {
        p=0;
        while(n%f==0)
        {
            n=n/f;
            p++;
        }
        if(p) cout<1) cout <

Dorobantu Stefan

2020-11-26 06:11:30 UTC

adriana

2020-11-26 06:11:39 UTC

#include
using namespace std;

bool ok(int n){
int d = 2, cnt = 0;
while(n > 1){
int p = 0;
while(n % d == 0)
n/=d, p++;
if(p)
cnt++;
d++;
if(d * d > n)
d = n;
}
return cnt == 1;
}

int main(){
int n, x, mini = 1000000000;
cin >> n;
for(int i = 1; i <= n; ++i){
cin >> x;
if(ok(x) && x < mini)
mini = x;
}
if(mini < 1000000000)
cout << mini;
else
cout << "NU EXISTA";
return 0;
} 3355

Popescu Petru

2020-11-26 06:11:44 UTC

#1780

#include

using namespace std;

int main()

{

int n, m, x=0, num;

cin >> n >> m;

num=m;

while (num<=n)

{ x=x+n/num;

num*=m;

}

cout << x;

}

#2769

#include

using namespace std;

int main()

{

long long int x , y , n , m , p , q;

cin >> x >> y;

int d = 2;

while(x % d) d++;

n=x/d;

m=y/(d-1);

long long int delta = (n+1-m) * (n+1-m) - 4*n;

long long int r = sqrt(delta);

p = (n + 1 - m - r) / 2;

q = (n + 1 - m + r) / 2;

cout << d << ' ' << p << ' ' << q;

return 0;

}

Stefanita

2020-11-26 06:12:01 UTC

#380
#include 

using namespace std;

int main()
{
    int n;
    cin>>n;
    int nr=0;
    for(int i=1;i<=n;i++){
        int x;
        cin>>x;
        int d=2;
        int c=1;
        while(x>1){
            int p=0;
            while(x%d==0)
                p++, x/=d;
            d++;
            c=c*(p+1);
            if(d*d>x)
                d=x;
        }
        if(c==4)
            nr++;
    }
    cout <

using namespace std;
long long n,nr=1;
int main()
{ cin>>n;
    long long cn=n;
    long long d=2;
while(n>1)
{
    int p=0;
    while(n%d==0) p++,n=n/d;
    nr*=(cn*p+1);
    d++;
    if(d*d>n) d=n;
    while(nr>=59999)
        nr=nr%59999;
}
    cout << nr;
    return 0;
}

Nicolaie Rares

2020-11-26 06:12:03 UTC

#18
#include
#include
using namespace std;
ifstream f("nrdiv.in");
ofstream g("nrdiv.out");
int n,nrd,d;
int main()
{
f>>n;
for(d=1; d<=n/2;d++)
if(n%d==0)nrd++;
nrd=nrd+1;
g< return 0;
}
#63
#include
using namespace std;
int n,d=2,p,maxim=0,dmax=0;
int main()
{cin >> n;
while(n>1)
{ p=0;
while(n%d==0)
{p++;
n/=d;
}
if(p>0)
{if(p>=maxim && d>dmax)
maxim=p , dmax=d;
}
d++;
if(d*d>n)
d=n;
}
cout << dmax;
return 0;
}

Andrei Bazavan

2020-11-26 06:12:18 UTC

1437

#include

using namespace std;
ifstream fin("fractii4.in");
ofstream fout("fractii4.out");
int P,N,x,y,schimb;
int cmmdc(int a,int b)
{
if(b==0)return a;
else return cmmdc(b,a%b);
}
int main()
{
fin>>P>>N;
if(P==1)
{{
for(int i=1;i<=N;++i)
{
fin>>x>>y;
int nr=0,div=cmmdc(x,y);
for(int j=1;j*j<=div;j++)
{
if(div%j==0)nr+=2;
if(j*j==div)nr--;
}nr--;
if(nr)fout< else fout<<"-1"<<'\n';
}
}
return 0;
}
for(int i=1;i<=N;++i)
{
fin>>x>>y;
int div=cmmdc(x,y);
fout< }
return 0;
}
---------------------------------------------------------------
2697

#include

using namespace std;
int n;
long long x;
int main()
{
cin>>n;
for(int i=1;i<=n;++i)
{
cin>>x;
while(x%2==0)
{
x/=2;
}
cout< }
return 0;
}

2020-11-26 06:12:21 UTC

Stefania

Oana

oanastoica1 — 2020-11-26 06:12:30 UTC

Blanaru

2020-11-26 06:12:49 UTC

#2547
#include
#include
using namespace std;
bool prim(int n)
{
if(n == 1 || n == 0)
return 0;
if(n > 2 && n % 2 == 0)
return 0;
for(int i = 3 ; i * i <= n ; ++i)
if(n % i == 0)
return 0;
return 1;
}
int main()
{
int a , b;
cin >> a >> b;
int x = sqrt(a) , y = sqrt(b);
int cnt=0;
if(x * x == a)
x--;
for(int i = x + 1 ; i <= y ; ++i)
{
if(prim(i))
cnt++;
}
cout << cnt;
return 0;
}
#2608

#include
using namespace std;
int long long n,m,i;
    int main()
{cin>>n>>m;
 if(n%2==0)cout<<2<<" "<

Daria

2020-11-26 06:13:04 UTC

Adina Ilie

2020-11-26 06:13:14 UTC

#258
#include

#include

using namespace std;

int n,i,d,MIN=9999999999,ok,cnt=0,x,d1,a,b;

int main()

{

cin>>a>>b;

int c=a+b;

for(i=a;i<=b;i++)

{

ok=1;

for(d=2;d*d<=i;d++)

{if(i%d==0) ok=0;}

if(ok)

{if(MIN>abs(c-2*i))

{d1=i;

MIN=abs(c-2*i);}

cnt++;

} }

if(cnt==0) cout<<"NU EXISTA";

else cout<

return 0;

}
#3354
#include

using namespace std;

long long n,i,d,maxi=0,ok,x1,x,d1;

int main()

{

cin>>n;

for(i=1; i<=n; i++)

{

cin>>x;

x1=x;

if(x!=1)

{

for(d=2; d<=x; d++)

{

if(x%d==0)

{

while (x%d==0) x=x/d;

if(x==1)

{

if(maxi

break;

}

else break;

}

if(maxi==0) cout<<"NU EXISTA";

else cout<

return 0;

}

Liviu

2020-11-26 06:13:32 UTC

David

2020-11-26 06:13:58 UTC

#404
#include
using namespace std;
int main()
{
int n,i,nr,sum=0,j;
bool prim=true;
cin>>n;
for(i=1;i<=n;++i)
{ cin>>nr;
prim=true;
for(j=2;j*j<=nr;j++)
if(nr%j==0)prim=false;
if(prim)
{ while(nr)
{ sum++;
nr/=10; } }
}cout< return 0;}

#439
#include

using namespace std;

long long n,nr5,nr2;

int main()

{

cin>>n;

for(int i=5;i<=n;i *=5) nr5 += n/i;

for(int i=2;i<=n;i *=2) nr2 += n/i;

if(nr5<=nr2) cout<

else cout<

return 0;

}

2020-11-26 06:16:19 UTC

Andrei Georgescu

lydia

2020-11-26 06:16:40 UTC

Vlad

2020-11-26 06:18:48 UTC

#1422

#include
using namespace std;
ifstream fin("ograda.in");
ofstream fout("ograda.out");
int par(int n)
{ int cnt=0;
for(unsigned long long i=1;i<=n;++i)
{ if(n%i==0 && i%2==0)
cnt++;
}
return cnt;
}
int impar(int n)
{ int cnt=0;
for( unsigned long long i=1;i<=n;++i)
{ if(n%i==0 && i%2==1)
cnt++;
} return cnt;
}
int main()
{ unsigned long long c,p,g,v,cntc=0,cntp=0,x; fin>>x>>c>>p;
g=(c4-p)/2; v=(p-c2)/2; if(x==1)fout< else if(x==2)
{ fout< }

#63
#include
using namespace std;
int n,d=2,p,maxim=0,dmax=0;
int main()
{cin >> n;
while(n>1)
{ p=0;
while(n%d==0)
{p++;
n/=d;
}
if(p>0)
{if(p>=maxim && d>dmax)
maxim=p , dmax=d;
}
d++;
if(d*d>n)
d=n;
}
cout << dmax;
return 0;
}
#18
#include
#include
using namespace std;
ifstream f("nrdiv.in");
ofstream g("nrdiv.out");
int n,nrd,d;
int main()
{
f>>n;
for(d=1; d<=n/2;d++)
if(n%d==0)nrd++;
nrd=nrd+1;
g< return 0;
}

Ioan Mihai =))

2020-11-26 06:47:03 UTC

GRUPA 6
#971 Max

#include 

using namespace std;
int n,d,x,nrdiv,i,nec,ok;
int main()
{
    cin>>n;
    for (i=1;i<=n;i++)
    {
        cin>>x;
        nrdiv=1;
        for (d=2;d*d
using namespace std;
int task, n, s, c, x;
void task_1()
{
    bool ok = false;
    for (int i=1;i<=n;i++){
        scanf("%d", &x);
        ok = false;
        int cx = x;
        while(cx){
            if (cx%10 == c){
                ok = true;
                break;
            }
            cx /= 10;
        }
        if (ok)
            printf("%d ", x);
    }
    printf("\n");
}
void task_2()
{
    bool ok = false, ok1 = true;
    int d, cred = 0;
    long long sum = 0;
    for (int i=1;i<=n;i++){
        scanf("%d", &x);
        int inv = 0, cx = x;
        ok = false;
        while(x){
            if (x%10 == c){
                ok = true;
            }
            inv = inv*10 + x%10;
            x /= 10;
        }
            ok1 = true;
            for (d = 2; d * d <= inv; d++) {
                if (inv % d == 0) {
                    ok1 = false;
                    break;
                }
            }
            if (d * d == inv)
                ok1 = false;
            if (ok1 && ok){
                sum += (cx-s);
                cred ++;
            }else if (ok1){
                sum += (cx+s);
                cred ++;
            }
    }
    printf("%d ", cred);
    if (sum > 0){
        printf("%d\n", 1);
    }else if (sum == 0){
        printf("%d\n", 0);
    }else{
        printf("%d\n", -1);
    }
}
int main() {
    freopen("pozne.in", "r", stdin);
    freopen("pozne.out", "w", stdout);

    scanf("%d", &task);
    scanf("%d%d%d", &n, &s, &c);

    if (task == 1){
        task_1();
    }else {
        task_2();
    }
    return 0;
}

967 Denisa

2020-11-26 08:04:33 UTC

# include 
using namespace std;
int n, s, c, sum = 0, nc = 0, c1 = 0, c3 = 0, c5 = 0, c7 = 0, c9 = 0, i, d;
int main()
{
    cin >> n >> c;
    for(i = 1; i <= n ; i ++)
    {
        cin >> s;
        if(s % 10 == 1)
            c1 ++;
        if(s % 10 == 3)
            c3 ++;
        if(s % 10 == 5)
            c5 ++;
        if(s % 10 == 7)
            c7 ++;
        if(s % 10 == 9)
            c9 ++;
        bool prim = true;
        if(s < 2)
            prim = false;
        for(d = 2 ; d * d <= s && prim ;d ++)
            if(s % d == 0)
                prim = false;
        if(prim)
            sum += s;
        while(s)
        {
            if(s % 10 == c)
                nc ++;
            s /= 10;
        }
    }
    cout << sum << endl << nc << endl;
    int d = 1,j;
    for(j = 1 ; j <= n ; j++)
        if(c1 % j == 0 && c3 % j == 0 && c5 % j == 0 && c7 % j == 0 && c9 % j == 0)
            d = j;
    cout << (c1 + c3 + c5 + c7 + c9)/d << endl;
    return 0;
}

268 Denisa

2020-11-26 08:05:54 UTC

#include 
using namespace std;
ifstream fin("divk.in");
ofstream fout("divk.out");
long long n,x,k,nr,aux,i,d;
int main()
{

    fin>>n>>k;
    for(i=1;i<=n;i++)
    {
        fin>>x;
        nr=0;
        aux=x;
        for(d=1;d*d<=x;d++)
        {
            if(x%d==0) nr+=2;
            if(d*d==x) nr--;
        }
        if(nr>=k) fout<

Daria-1517

2020-11-26 08:07:23 UTC

#include

using namespace std;
ifstream f ("clatite.in");
ofstream g ("clatite.out");
int n,m,i,cio,gem,ing,zah,sim,j,ci,d,p,sd,num;
bool clatite[300002];
int main()
{
f>>n>>m;
g< clatite[1]=false;
for (i=2; i<=m; i++)
clatite[i]=true;
for (i=2; i*i<=m; i++)
{
if (clatite[i])
for (j=i*2; j<=m; j+=i)
clatite[j]=false;
}
cio=gem=ing=zah=sim=0;
for (i=n; i<=m; i++)
{
if (clatite[i]) cio++;
else
{
j=1;
while (j*j if (j*j==i) gem++;
else
{
j=1;
while (j*j*j if (j*j*j==i) gem++;
else
{
ci=i;
d=2;
p=0;
sd=1;num=0;
while (d*d<=ci && ci!=1)
{
p=0;num=d;
while (ci%d==0)
{
ci/=d;
num*=d;
p++;
}
if (p!=0) sd=sd*((num-1)/(d-1));
d++;
}
if (ci!=1) sd=sd*((ci*ci-1)/(ci-1));
sd-=i;
if (sd==i) ing++;
else {
if (i%2==0) zah++;
else sim++;
}
}
}
}
}
g< return 0;
}

Daria-1466

2020-11-26 08:07:47 UTC

#include
using namespace std;
ifstream fin("placare1.in");
ofstream fout("placare1.out");
int l,a,b,c,r,ia,ib;
int main()
{
fin>>l>>a>>b;
c=l;
r=l%a;
ia=b;
while(r!=0)
{
ia=ia+b;
c=l-a+r;
r=c%a;
}
c=l;
r=l%b;
ib=a;
while(r!=0)
{
ib=ib+a;
c=l-b+r;
r=c%b;
}
if(ia>ib) fout< else fout< return 0;
}

Ana A.-#2324

2020-11-26 08:10:46 UTC

#include 
using namespace std;
long long n,p,dmax,d=2;
int main()
{
    cin>>n;
    while(n>1)
    {
        int p = 0;
        while(n%d==0)
        {
            n/=d;
            p++;
        }
        if(p!=0)
        {
            dmax=d;
        }
        d++;
        if(d*d>n)
        d=n;
    }
    cout << dmax;
return 0;
}

Liviu #1319

2020-11-26 08:30:35 UTC

#include
using namespace std;
int main()
{
int n;
cin>>n;
{
while (n%2==0)
{
cout<<2<<" ";
n=n/2;
}
// va fi impartit la doi pana cand nu mai este divizibil cu 2.
// n a ajuns impar, deci mergem din 2 in 2.

for (int i=3;i*i<=n;i+=2)
{
while (n%i==0)
{
cout< n=n/i;
}
}
// Dupa asta, N va ramane numar prim si deci
// nu ii gasim divizori sub sqrt N,
//...deci va trebui sa apara pe ecran
if (n>2) cout< }
return 0;
}

Lydia 407

2020-11-26 08:30:48 UTC

#include 

using namespace std;
long long n,nr,o,d,suma,da;
bool prim;
int main()
{
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        cin>>nr;
        da=nr;
        o=0;
        while(da)

        {
            o=o*10+da%10;
            da=da/10;
        }
        prim=true;
        if(o==0 || o==1) prim=false;
        if(o==2) prim=true;
        if(o%2==0) prim=false;
        for(d=3;d*d<=o;d=d+2)
            if(o%d==0) prim=false;
        if(prim) suma=suma+nr;

    }
    cout<

#include #include using namespace std;int main(){ int ncif,k; cin>>ncif>>k; switch (k) { case 1: { cout<<1; ncif--; for (ncif;ncif>0;ncif--) {cout<<0;} break; } case 2: { cout<<1; ncif-=2; for (ncif;ncif>0;ncif--) {cout<<0;} cout<<1; break; } case 3: { cout<<1; ncif-=2; for (ncif;ncif>0;ncif--) {cout<<0;} cout<<2; break; } case 4: { cout<<1; ncif-=2; for (ncif;ncif>0;ncif--) {cout<<0;} cout<<3; break; } case 5: { cout<<1; ncif-=2; for (ncif;ncif>0;ncif--) {cout<<0;} cout<<4; break; } case 6: { cout<<1; ncif-=2; for (ncif;ncif>0;ncif--) {cout<<0;} cout<<5; break; } case 7: { cout<<1; ncif-=2; for (ncif;ncif>0;ncif--) {cout<<0;} cout<<6; break; } case 8: { cout<<1; ncif-=2; for (ncif;ncif>0;ncif--) {cout<<0;} cout<<7; break; } case 0: { cout<<1; ncif-=2; for (ncif;ncif>0;ncif--) {cout<<0;} cout<<8; break; } } return 0;}

2020-11-26 08:31:47 UTC

Liviu # 1907 Numar Prim

Cristian #2913

2020-11-26 08:33:40 UTC

#include
using namespace std;

int main(){
int n;
cin >> n;
n--;
int p = 0;
while(n % 2 == 0)
n/=2, p++;
int put = (1 << p);
if(put > n)
cout << "DA";
else
cout << "NU";
return 0;
}

#3360
#include
using namespace std;

int desc(int n)
{
int nr=0,p,d=2;
while(n > 1)
{
p = 0;
while(n % d == 0)
{
++p;
n /= d;
}
if(p) nr++;

++ d;
if( d * d > n)
d=n;
}
return nr;
}

int main(){
int n, a, b, rez1 = 1000000000, rez2 = 1000000000;
cin >> n;
cin >> a;
for(int i = 2; i <= n; ++i){
cin >> b;
if(desc(a)==desc(b) && a + b < rez1 + rez2)
rez1 = a, rez2 = b;
a = b;
}
if(rez1 != 1000000000)
cout << rez1 << ' ' << rez2;
else
cout << "NU EXISTA";
return 0;
}

435, factori primi

2020-11-26 08:33:55 UTC

#include #include using namespace std;int main(){ long long int n,cn,cm,m; cin>>n>>m; if (n

#1316 70 pct

oanastoica1 — 2020-11-26 08:35:12 UTC

#include using namespace std; long long n,d,nr,m,c,p,n1; int main() { cin>>n; d=2; nr=0; c=0; m=0; n1=n; while(n>1) { p=0; while(n%d==0) { p++; n=n/d; } c++; if(p==1)nr++; if(p==2 && n==1)m++; d++; if(n>1 && d*d>n) d=n; } if(n1==2) cout<<"prim"; else if(nr==1 && c==1) cout<<"prim"; else if(nr==2) cout<<"aproape prim"; else if(m==1) cout<<"patrat prim"; else cout<<"compus"; return 0; }

#2371

oanastoica1 — 2020-11-26 08:39:49 UTC

#include

using namespace std;
long long a,b,a1,b1,r;
int main()
{
cin>>a>>b;
a1=a;
b1=b;
while(b1)
{
r=a1%b1;
a1=b1;
b1=r;
}

cout<

Diana-406

2020-11-26 08:41:13 UTC

#include

using namespace std;

int nr;

bool verifprim(int x)

{

if(x==1||x==0) return 0;

for(int i=3; i*i<=x; i+=2)

if(verifprim(sum)) return 1;

}

1590

#include

#define NRMAXPRIME 50000

using namespace std;

ifstream fin("arma1.in");

ofstream fout("arma1.out");

int n, nrprim, nrf, cerinta;

bool ciur[VMAX];

int prim[NRMAXPRIME];

if (!ciur[d]) prim[nrprim++]=d;

int euclid(int a, int b)

int putere(int x, int y)

void determina(int d, int &p, int &c)

for (m=0; d%prim[j]==0; m++,d/=prim[j]);

c*=putere(fp[j],mf[j]/p);

Stefania, 2306 #include using namespace std;int p,q,x,e2,e1,i,n;int main(){cin >> p>>q>>n;for(i=1;i<=n;i++){ cin >> x; while(x%p==0){ x=x/p; e1++;} while(x%q==0){ x=x/q; e2++; } } if (e1
2020-11-26 08:54:36 UTC

#3308 70 pct

oanastoica1 — 2020-11-26 09:16:09 UTC

```

#include 

using namespace std;
int n,i,d,x,nr;
int main()
{
    cin>>n;
    x=1;
    i=1;
    while(nr<=n)
    {
        nr=0;
        for(d=1;d*d<=x;d++)
        {
            if(x%d==0) nr+=2;
            if(d*d==x) nr--;
        }
        i++;
        x=x+i;
    }
    cout< ```

adriana

2020-11-26 09:41:07 UTC

#include
using namespace std;
int long long n,m,i;
int main()
{cin>>n>>m;
if(n%2==0)cout<<2<<" "<else{ for(i=3;i*i<=n;i=i+2) if(n%i==0)cout< return 0;
}

2608

Echipa nr.1

2020-11-26 09:48:12 UTC

grupa 4

2020-11-26 09:49:00 UTC

Felicitari tuturor!

2020-11-26 09:49:05 UTC

grupa 4

2020-11-26 09:49:24 UTC

gr 7

Gr 5

2020-11-26 09:49:27 UTC

2020-11-26 09:49:44 UTC

gr3

2020-11-26 09:51:34 UTC

2020-11-26 09:51:47 UTC

2020-11-26 09:52:18 UTC

2020-11-26 09:52:39 UTC

lydia 1907 15 puncte:((

2020-11-26 09:54:28 UTC

#include 
#include 
using namespace std;
int n,k,x,ceva,da=1,m;
int main()
{
    cin>>n>>k;
    m=n;
    while(n>1)
    {
        n--;
        da=da*10;

    }
    ceva=1;
    while(ceva<9999999)
      {
          if((ceva*9+k)

HACKATHON 26.11.2020 by Georgescu Alice

denisa :))

Doru

Anghel Rares

rares draghiceanu

Grigore

andrei banu

Ana Bascau

Dorobantu Stefan

adriana

Popescu Petru

Stefanita

Nicolaie Rares

Andrei Bazavan

Oana

Blanaru

Daria

Adina Ilie

Liviu

David

lydia

Vlad

Ioan Mihai =))

967 Denisa

268 Denisa

Daria-1517

Daria-1466

Ana A.-#2324

Liviu #1319

Lydia 407

Cristian #2913

435, factori primi

#1316 70 pct

#2371

Diana-406

Stefania, 2306 #include using namespace std;int p,q,x,e2,e1,i,n;int main(){cin >> p>>q>>n;for(i=1;i<=n;i++){ cin >> x; while(x%p==0){ x=x/p; e1++;} while(x%q==0){ x=x/q; e2++; } } if (e1 2020-11-26 08:54:36 UTC

#3308 70 pct

adriana

Echipa nr.1

grupa 4

Felicitari tuturor!

grupa 4

Gr 5

gr3

lydia 1907 15 puncte:((

Stefania, 2306 #include using namespace std;int p,q,x,e2,e1,i,n;int main(){cin >> p>>q>>n;for(i=1;i<=n;i++){ cin >> x; while(x%p==0){ x=x/p; e1++;} while(x%q==0){ x=x/q; e2++; } } if (e1
2020-11-26 08:54:36 UTC