Showing posts with label UVA Solved Problem. Show all posts
Showing posts with label UVA Solved Problem. Show all posts

Friday, February 12, 2016

UVA-10370

প্রবলেমটি পড়ুন এবং বুঝুন

#include<bits/stdc++.h>

using namespace std;

int main()
{
    int test,people;

    cin>>test;
    while(test--)
    {
        double average=0;
        cin>>people;
        int value[people],counter=0;
        for(int i=0;i<people;i++)
        {
            cin>>value[i];
            average+=value[i];
        }
        average/=people;
        for(int i=0;i<people;i++)
        {
            if(average<value[i])
                counter++;
        }
        average=(counter*100)/(double)people;
        printf("%.3lf%%\n",average);
    }
    return 0;
}

Monday, February 8, 2016

UVA-382

প্রবলেমটি পড়ুন এবং বুঝুন

#include<iostream>

using namespace std;

int which_number(int a)
{
    long int sum=0,d;
    for(int i=1; i*i<=a; i++)
    {
        if(a%i==0)
        {
            d=a/i;
            if(i==a)
                continue;
            else if(i==1)
                sum+=1;
            else
                sum=sum+i+d;
        }
    }
    if(sum==a)
        cout<<a<<"  PERFECT\n";
    else if(sum<a)
        cout<<a<<"  DEFICIENT\n";
    else
        cout<<a<<"  ABUNDANT\n";
}

int main()
{
    int a,i=0;

    while((cin>>a))
    {
        if(i==0)
        {
            cout<<"PERFECTION OUTPUT\n";
            i++;
        }
        if(a==0) break;
        if(a<10)         cout<<"    ";
        else if(a<100)   cout<<"   ";
        else if(a<1000)  cout<<"  ";
        else if(a<10000) cout<<" ";
        which_number(a);
    }
    cout<<"END OF OUTPUT\n";
    return 0;
}

Sunday, February 7, 2016

UVA-299

প্রবলেমটি পড়ুন এবং বুঝুন


#include<iostream>

using namespace std;

int main()
{
    long int test,n;
    cin>>test;
    while(test--)
    {
        cin>>n;
        int a[n],counter=0;

        for(int i=0; i<n; i++)
        {
            cin>>a[i];
            for(int k=0; k<i; k++)
            {
                if(a[i]<a[k])
                {
                    int t=a[k];
                    a[k]=a[i];
                    a[i]=t;
                    counter++;
                }
            }
        }
        cout<<"Optimal train swapping takes "<<counter<<" swaps."<<endl;
    }
    return 0;
}

UVA-12289

প্রবলেমটি পড়ুন এবং বুঝুন

#include<iostream>
#include<string>

using namespace std;

void justify(char *ch)
{
    string o="one",t="two",th="three";
    int i=0,counter[3]={0};

    while(*(ch+i)!='\0')
    {
            if(o[i]==*(ch+i))
            counter[0]+=1;
            else if(t[i]==*(ch+i))
            counter[1]+=1;
            else if(th[i]==*(ch+i))
            counter[2]+=1;
        i++;
    }
   
    int v,maximum=0;
   
    for(i=0;i<3;i++)
    {
        if(maximum<=counter[i])
        {
            maximum=counter[i];
            v=i;
        }
    }
    if(v==0)
        cout<<"1\n";
    else if(v==1)
        cout<<"2\n";
    else if(v==2)
        cout<<"3\n";
}

int main()
{
    int test;
    cin>>test;
    while(test--)
    {
        string str;
        cin>>str;
        justify(&str[0]);
    }
    return 0;
}

Tuesday, February 2, 2016

UVA-11461

প্রবলেমটি পড়ুন এবং বুঝুন

#include<iostream>
#include<cmath>

using namespace std;

void square(int a,int b)
{
    int counter=0;
    for(int i=a;i<=b;i++)
    {
        double p=sqrt(i);
        int a=(int) p;
        if(i==0)
            continue;
        else if(p-a==0)
            counter++;
    }
    cout<<counter<<endl;
}

int main()
{
    int a,b;
    while((cin>>a>>b) && (a!=0 || b!=0))
            square(a,b);
    return 0;
}

UVA-11428

প্রবলেমটি পড়ুন এবং বুঝুন

#include<iostream>
#include<cmath>

using namespace std;

void cube(int a)
{
    int j=0,b=0,c;
   
    for(int i=1; i<sqrt(a)+1; i++)
    {
        for(int k=1; k<i; k++)
        {
            int p=pow(k,3);
            int t=pow(i,3);
            if(t-p==a)
            {
                if(j==0)
                {
                    b=i;
                    c=k;
                    j++;
                }
                else
                {
                    if(c>k)
                    {
                        b=i;
                        c=k;
                        j++;
                    }
                }
            }
        }
    }

    if(j==0)
        cout<<"No solution\n";
    else
        cout<<b<<" "<<c<<endl;
}

int main()
{
    int a;
    while((cin>>a) && a!=0)
    {
        cube(a);
    }
    return 0;
}

UVA-10812

 প্রবলেমটি পড়ুন এবং বুঝুন

#include<iostream>
#include<cmath>

using namespace std;

void inquary(unsigned long long int s,unsigned long long int d)
{
    unsigned long long int x1,y1,x2,y2;
    x1=(s+d)/2;
    y1=(s-x1);
    if(x1+y1==s && x1-y1==d)
        cout<<x1<<" "<<y1<<endl;
    else
    {
        y2=(s+d)/2;
        x2=(s-y2);
        if(x2+y2==s && y2-x2==d)
        cout<<y2<<" "<<x2<<endl;
        else
            cout<<"impossible\n";
    }
}

int main()
{
    unsigned long long int test,s,d;
    cin>>test;
    while(test--)
    {
        cin>>s>>d;
        if(s<d)
            cout<<"impossible\n";
        else
        inquary(s,d);
    }
    return 0;
}

Saturday, January 30, 2016

UVA-10038

প্রবলেমটি পড়ুন এবং বুঝুন

#include<iostream>
#include<cmath>

using namespace std;

void jolly(int a[],int n)
{
    int b[n],i,j=0,k,d;

    for(i=1,j=0;i<n;i++,j++)
    {
        d=abs(a[i-1]-a[i]);
        if(d>0 && d<n)
        {
            for(k=0;k<j;k++)
            {
                if(d==b[k])
                {
                    i=n;
                    break;
                }
            }
            if(k==j)
                b[j]=d;
        }

        else
            break;
    }

    if(i==n)
        cout<<"Jolly\n";
    else
        cout<<"Not jolly\n";
}

int main()
{
    int n;

    while(cin>>n)
    {
        int a[n];
        for(int i=0;i<n;i++)
            cin>>a[i];

        jolly(a,n);
    }

    return 0;
}

Friday, January 29, 2016

UVA-494

প্রবলেমটি পড়ুন এবং বুঝুন

#include<iostream>
#include<cstdlib>
#include<string>

using namespace std;

void loop(char *ch)
{
    int i=0,counter=0;
    while(ch[i]!=NULL)
    {
        if((ch[i]>=65 && ch[i]<=90)|| (ch[i]>=97 && ch[i]<=122))
        {
            for(;(((ch[i]>=65 && ch[i]<=90)|| (ch[i]>=97 && ch[i]<=122)) &&(ch[i]!='\n'));i++);
                counter++;
        }
        else
            i++;
    }
    cout<<counter<<endl;
}

int main()
{
    string str;
    while(getline(cin,str))
    {
        loop(&str[0]);
    }
    return 0;
}

UVA-10591

প্রবলেমটি পড়ুন এবং বুঝুন 


 #include<iostream>

using namespace std;

int happy(long long int a)
{
    long long int sum=0;
    int remain;

    for(; a!=0;)
    {
        remain=a%10;
        sum=sum+remain*remain;
        a/=10;
    }

    if(sum<10)
    {
        if(sum==1)
            return 1;
        else
            return 0;
    }

    happy(sum);

}

int main()
{
   unsigned long long int test,i=0,a;
    cin>>test;
    int t;

    while(test--)
    {
        i++;
        cin>>a;
        t=happy(a);
        if(t==1)
            cout<<"Case #"<<i<<": "<<a<<" is a Happy number."<<endl;
        else
            cout<<"Case #"<<i<<": "<<a<<" is an Unhappy number."<<endl;
    }
    return 0;
}