UVA 11350 - Stern-Brocot Tree(solution)

problem link:- Stern-Brocot Tree

submit link:- Submit

code ref:- c++ language, bfs-tree

#include<bits/stdc++.h>
using namespace std;

UVA 406 - Prime Cuts(solution)

To read problem (সমস্যা পড়তে ক্লিক কর) → uva 406 - Prime Cuts

To submit (সাবমিট করতে ক্লিক কর) → Submit(uva 406)

Solution:

Solution - UVa 417

UVa online judge

problem:417

word index

problem: 

https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=358

 

UVa 10018

       UVa online judge 

problem:10018

(reverse and add)

problem:https://uva.onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=959 

 

UVa online judge 694

UVa online judge

problem:694

( The Collatz sequence)

problem: 

https://uva.onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=635

UVa online jude 12543

UVa online judge

problem:12543

(longest word)

 problem(PDF):

https://uva.onlinejudge.org/external/125/12543.pdf

UVa online judge 10970

UVa online judge 

problem:10970

Big chocolate

problem:

https://uva.onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=1911

uva online judge 11461

UVa online judge

problem: 11461

problem link:

https://uva.onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=2456

UVa online judge 543

UVA online judge 543

Goldbach's conjecture

Link:
https://uva.onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=484 


Solution:

#include<bits/stdc++.h>
using namespace std;
#define N 1000000
int primes[N];
void Sieve()
{
    int i;
    for(i=2; i<=N; i++)
        primes[i] = 1;
    primes[0] = primes[1] = 0;

    int len = sqrt(N);
    for(i = 2; i <= len; ++i)
    {
        if(primes[i])
        {
            for( int k = i * i; k <= N; k += i )
                primes[k] = 0;
        }
    }
    primes[2] = 0;
}
int main()
{

    Sieve();

    int n,b,a;
    while(scanf("%d", &n)&&n)
    {
        for( a = 3; a < n; ++a)
        {
            if( primes[a] )
            {
                b = n - a;
                if( primes[b] )
                {
                    // printf("%d = %d + %d\n", n, a, b);
                    cout <<n<<" "<<"="<<" "<<a<<" "<<"+"<<" "<<b<<endl;
                    break;
                }
            }
        }
        if(a+b!=n)
            // printf("Goldbach's conjecture is wrong\n");
            cout <<"Goldbach's conjecture is wrong"<< endl;
    }
    return 0;
}

UVa online judge 11876 N+NOD(N)

 UVA online judge

problem:11876

N+ NOD (N)

problem link(PDF):

https://uva.onlinejudge.org/external/118/11876.pdf

 

 SOLUTION:

#include<bits/stdc++.h>
using namespace std;
bool prime[1000009];
vector<int>num;
vector<int>pr;
int binary(int a)
{
    int mid,L=0,u=num.size()-1;
    while(L<=u)
    {
        mid=(u+L)/2;
        if(a>num[mid])
            L=mid+1;
        else if(a<num[mid])
            u=mid-1;
        else return mid;
    }
   return mid;
}

Solution to Uva problem 11530 - SMS Typing

Problem link:: https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=2525 

soliution :: 

#include<bits/stdc++.h>
using namespace std;
int main()
{
    map< char,int >mp;
    int n,ans;
    string s;
    mp['a']=1,mp['b']=2,mp['c']=3,mp['d']=1,mp['e']=2,mp['f']=3,mp['g']=1,mp['h']=2,mp['i']=3,mp['j']=1,mp['k']=2,mp['l']=3,mp['m']=1;
    mp['n']=2,mp['o']=3,mp['p']=1,mp['q']=2,mp['r']=3,mp['s']=4,mp['t']=1,mp['u']=2,mp['v']=3,mp['w']=1,mp['x']=2,mp['y']=3,mp['z']=4;
    mp[' ']=1,mp['\n']=0;
    cin>>n;
    getchar();
    for(int i=0;i<n;i++)
    {
        ans=0;
        getline(cin,s);
        for(int i=0;i<s.size();i++)
        {
            ans=ans+mp[s[i]];
        }
        cout<<"Case #"<<i+1<<": "<<ans<<endl;
    }
    return 0;

}

/*this problem solution is solved with mapping if you don't know mapping then you will fail to undrstand so stay with us to know about mapping */

/* if you don't know about cin && cout put scanf instead of cin && printf instead of cout. Both works the same. */

UVA ONLINE JUDGE 488

UVA online JUDGE 

PROBLEM:488

(TRIANGLE WAVE)

PROBLEM LINK:https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=429

 

Solution:


 
#include<bits/stdc++.h>
 using namespace std;
int main()

{

UVA ONLINE JUDGE PROBLEM 11636

UVA ONLINE JUDGE  

PROBLEM 11636

Hello World!
 

Problem link:https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=2683

Solution:

#include<bits/stdc++.h>
using namespace std;
int main()
{
    ios::sync_with_stdio(false);
    int n,j;

UVA ONLINE JUDGE (PROBLEM: 11577)

UVA ONLINE JUDGE

(PROBLEM: 11577)

Problem link: 
https://uva.onlinejudge.org/index.phpoption=com_onlinejudge&Itemid=8&page=show_problem&problem=2624

Solution::

#include<bits/stdc++.h>
using namespace std;
int freq[30],t;
int main()
{

UVa 10474 Solution

UVa 10474

Problem Link: https://odzkskevi.qnssl.com/53e5c6d66221525b0c18113b513fc3fb?v=1492798416

Solution: 

#include<bits/stdc++.h>
using namespace std;
int a[10001],b[10001];
int main()
{
 

UVA -203 (Train swapping)

UVA -203 

Train swapping

problem link: 

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=235

Solution:

#include <bits / stdc ++. h>

using namespace std;

long long int ara [20000000];

int main ()

{

UVa online judge  problem:11854

(EGYPT)

Problem link:
https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=2954

Solution:

#include<stdio.h>
int main()
{

UVA:100(3N+1)

                    UVA ONLINE JUDGE
                       Problem:100(3N+1)



Problem link:
https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=36

Solution:

#include<bits/stdc++.h>
using namespace std;

int main()
{

UVa 12578 (10:6:2)

UVa 12578 

( 10:6:2 )

Problem Link: 

https://uva.onlinejudge.org/external/125/12578.pdf

Solution:

#include<stdio.h>

#include<math.h>

#define PI acos(-1)

int main()

{

UVa 10394 solution (Twine Prime)

UVa 10394 solution 

( Twine Prime )

Link of Problem::
https://uva.onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=1335


SOLIUTION::

SOLIUTION LINK::http://paste.ubuntu.com/24305142/

#include<bits/stdc++.h>
using namespace std;
int mx = 20000007;
char mark[20000007];
void sieve()
{
 mark[0] = mark[1] = 1;           // 1 means not prime
 for(int i = 4; i<mx; i+=2) mark[i] = 1;
 for(int i = 3; i*i<mx; i+=2)
  if(mark[i]==0)                   // i is a prime number
   for(int j = i*i; j<mx; j+=i+i)
    mark[j] = 1;
}


int main()
{
    vector<int>a;
    vector<int>c;
    vector<int>d;
    long long int n;
 sieve();
 for(int l=0; l<=20000000; l++)
    {
        if(mark[l]==0)
        {
            a.push_back(l);
        }
    }
 for(int r=1;r<a.size();r++)
 {
     if((a[r])-a[r-1]==2)
     {
         c.push_back(a[r-1]);   // change
         d.push_back(a[r]);  // change
     }
 }

    while(cin>>n)
    {

        cout<<'('<<c[n-1]<<", "<<d[n-1]<<')'<<endl;
    }
    return 0;
}