andreuinyu

#include <iostream>
#include <vector>
using namespace std;

struct p{
    int a;
    int b;
};

p mam(int x, vector<int>& v){

andreuinyu

#include <iostream>
#include <vector>
using namespace std;

struct punt{
    int x;
    int y;
    int z;
};

andreuinyu

#include <iostream>
using namespace std;

int ackerman(int a, int b){
    if (a==0) return b+1;
    else if (b==0) return ackerman(a-1, 1);
    else return ackerman(a-1, ackerman(a, b-1));
}

int main(){

andreuinyu

#include <iostream>
#include <vector>
using namespace std;

int first_occurrence(int x, const vector<int>& v){
  if (v.size()==0) return -1;
  int inici = 0, final = v.size()-1;
  while (inici <= final) {
    int m = (inici + final)/2;
    if (v[m] < x) inici = m + 1;

andreuinyu

#include <iostream>
#include <vector>
using namespace std;

int first_occurrence(double x, const vector<double>& v){
    if (v.size()==0) return -1;
    int inici = 0, final = v.size()-1;
    while (inici <= final) {
        int m = (inici + final)/2;
        if (v[m] < x) ini = m + 1;

andreuinyu

def sedas(n):
    B, A = [], [True] * (n + 1)
    for i in range(2, n + 1):
        if A[i]:
           B.append(i)
           for j in range(i * i, n + 1, i):
               A[j] = False
    return B

while True:

andreuinyu

from math import floor, sqrt
ap=True
while True:
    p=int(input())
    for i in range (2, floor(sqrt(p))+1):
        if p%i==0:
            ap=False
            break
        else:
            ap=True