Cod sursa(job #3316211)
| Utilizator | Data | 17 octombrie 2025 20:41:08 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.35 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int main()
{
int a,i,cnt=0,cnti=0,cntj=1;
for(i=1;i<=10000000;i++)
{
if(i%2==0)
{
cnt++;
cnti++;
cntj=cntj*2;
}
}
out<<cnt<<cnti<<cntj;
return 0;
}
