Cod sursa(job #2282471)
Utilizator | Data | 13 noiembrie 2018 19:48:37 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream fin("sume2.in");
ofstream fout("sume2.out");
int N,M,S=0,i,j;
long long int V[100001];
fin>>N;
for(int c=1;c<=N;c++)
fin>>V[c];
fin>>M;
for(int c=1;c<=M;c++)
{
fin>>i>>j;
fout<<S<<endl;
S=0;
}
return 0;
}