Scribd Logo
Upload

Welcome to Scribd!

  • Prime Encoder

    Uploaded by

    sri
    459 views1 page
    This document contains code for a primeEncoder method that takes an integer array and integer as input. It finds the nth prime number by iterating from 2 to 100 and checking if each number is prime using a prime checking method. It then returns a new integer array where each element of the input array has the nth prime number added to it.

    Original Description:

    Original Title

    prime encoder.txt

    Copyright

    © © All Rights Reserved

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document contains code for a primeEncoder method that takes an integer array and integer as input. It finds the nth prime number by iterating from 2 to 100 and checking if each number is prime using a prime checking method. It then returns a new integer array where each element of the input array has the nth prime number added to it.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as txt, pdf, or txt
    459 views1 page

    Prime Encoder

    Uploaded by

    sri
    This document contains code for a primeEncoder method that takes an integer array and integer as input. It finds the nth prime number by iterating from 2 to 100 and checking if each number is prime using a prime checking method. It then returns a new integer array where each element of the input array has the nth prime number added to it.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as txt, pdf, or txt
    of 1

    using System;

    using System.Collections.Generic;
    //Read only region startpublic class UserMainCode
    {
    public int[] primeEncoder(int[] input1,int input2)
    {
    //Read only region end
    //Write code here
    int c=0,n=0;
    for(int i=2;i<=100;i++)
    {
    if(prime(i))
    c++;
    if(c==input2)
    {
    n=i;
    break;
    }
    }
    var res=new int[input1.Length];
    for(int i=0;i<input1.Length;i++)
    res[i]=input1[i]+n;
    return res;
    //throw new NotImplementedException("Method primeEncoder(int[] input1,int
    input2) not Implemented.");
    }
    bool prime(int n)
    {
    for(int i=2;i<=n/2;i++)
    {
    if(n%i==0)
    return false;
    }
    return true;
    }
    }

    today link
    https://www.hackerearth.com/practice/basic-programming/input-output/basics-of-
    input-output/practice-problems/algorithm/bricks-game-5140869d/

    You might also like