Cod sursa(job #1034247)

Utilizator Balescu_OvidiuBalescu Ovidiu-Gheorghe Balescu_Ovidiu Data 17 noiembrie 2013 18:53:03
Problema Ciurul lui Eratosthenes Scor 0
Compilator cpp Status done
Runda cei_mici3 Marime 0.52 kb
#include <stdio.h>
#include <stdlib.h>
int N, i,d,flag=1,j,q;
using namespace std;

int main()
{
    FILE * f;  f=fopen("ciur.in","r"); FILE * g; g=fopen("ciur.out","w"); fscanf(f,"%d",&N);
    for(i=1;i<N;i+=2)
    {
        if(i%2!=0 && i>1)
        {
            for(d=3;d*d<=N;d+=2)
            {
                if(N%d!=0) flag=1;
                else flag=0;
            }
        }
        else flag=0;

        if(flag==1) q++;
    }
    fprintf(g,"%d",q); fclose(f); fclose(g);
    return 0;
}