Cod sursa(job #2326117)
Utilizator | Data | 23 ianuarie 2019 12:40:56 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | simulare_preoli | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("prim.in");
ofstream fout("prim.out");
bool prim(int n){
int d=0;
for(int i=2;i*i<=n;i++){
if(n%i==0){
d++;
}
}
if(d==0){
return true;
}
else{
return false;
}
}
int main()
{
int n,nrp=0,i=1;
fin>>n;
while(nrp<=n){
i++;
if(prim(i)){
nrp++;
}
}
fout<<i*i;
return 0;
}