๐—–๐—ฆ ๐—”๐—น๐—ด๐—ผ ๐Ÿ’ป ๐ŸŒ ใ€Ž๐—–๐—ผ๐—บ๐—ฝ๐—ฒ๐˜๐—ถ๐˜๐—ถ๐˜ƒ๐—ฒ ๐—ฃ๐—ฟ๐—ผ๐—ด๐—ฟ๐—ฎ๐—บ๐—บ๐—ถ๐—ป๐—ดใ€
9.52K subscribers
5.56K photos
3 videos
95 files
9.7K links
๐ŸšฉMain Group - @SuperExams
๐Ÿ“Job Updates - @FresherEarth

๐Ÿ”ฐAuthentic Coding Solutions(with Outputs)
โš ๏ธDaily Job Updates
โš ๏ธHackathon Updates & Solutions

Buy ads: https://telega.io/c/cs_algo
Download Telegram
#include <bits/stdc++.h>
using namespace std;
int main()
{
    int n;
    cin >> n;
    int f = 0;
    int s = 1;
    int ans = 0;
    if (n == 0)
    {
        cout << 0;
    }
    if (n == 1)
    {
        cout << 1;
    }
    for (int i = 2; i <= n; i++)
    {
        ans = f + s;
        f = s;
        s = ans;
    }
    cout << ans;
}
#include <bits/stdc++.h>
using namespace std;
bool isPrime(int n)
{
    for (int i = 2; i <= sqrt(n); i++)
        if (n % i == 0)
            return false;
    return true;
}
int main()
{
    int n, m;
    cin >> n >> m;
    int a = 0;
    int b = 0;
    while (n < m)
    {
        if (isPrime(n))
        {
            a = n;
            break;
        }
        n++;
    }
    while (n < m)
    {
        if (isPrime(m))
        {
            b = m;
            break;
        }
        m--;
    }
    cout << a + b;
    return 0;
}
public static void main(String[] args) {
        String[] arr =new String[]{"aa", "aab", "b", "bbd", "d"};
        String tar = "aabbd";
        int len = tar.length();
        int[] dp = new int[len+1];
        Arrays.fill(dp, 9999);
        dp[0] = 0;
        for(int i = 1; i <= len; i++) {
            int cal = 0;
            for(int j = 1; j <= i; j++) {
                String sub = tar.substring(j-1,i);
                boolean found = false;
                for(int k = 0; k < arr.length; k++) {
                    if(arr[k].startsWith(sub)){
                        found = true;break;
                    }
                }
                if(found)dp[i] = Math.min(dp[i], 1 + dp[j-1]);
                System.out.print(i + " " + dp[i] + "    ");
            }
            // dp[i] = cal;
        }
        System.out.println(dp[len]);
    }

equal string trilogy โœ…
def solve(arr, target):
   
    ans = -1
    s = 0
   
    for i in range(len(arr)):
        s += arr[i]
        if s>=target:
            ans = i
            break
   
    return ans