Cod sursa(job #460271)
Utilizator | Iuliana Ionescu julliard | Data | 1 iunie 2010 19:49:26 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <iostream.h>
#include <stdio.h>
using namespace std;
int i,j,n,k;
int ciur[10000];
int main()
{ freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
cin>>n;
for(i=2;i<=(n/2);i++)
for(j=2;(j*i)<=n;j++)
ciur[j*i]=1;
for(i=2;i<n;i++)
if(ciur[i]==0)
cout<<i<<" "<<endl;;
cout<<'n';
system("PAUSE");
return 0;
}