UVA 155 - All Squares

/***
Md. Namzul Hasan
Shahjalal University of Science & Technology,Sylhet.
hasan08sust@gmail.com
***/
#include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
typedef int in ;
typedef unsigned long long ull ;
const double pi = 2*acos(0) ;
#define maxi 40000
#define pf printf
#define sc scanf
#define pb push_back
#define MEM(x,y) (memset((x),(y),sizeof(x)))
#define MIN(x,y) ((x) < (y) ? (x) : (y))
#define MAX(x,y) ((x) > (y) ? (x) : (y))
#define load(array,size)  for(int i=0 ; i<size ; i++) cin>>array[i]  ;
#define new_line  pf("\n")
#define clear_data(array) memset(array,0,sizeof(array))
#define highest_int 2147483647

int n,m ;
int ans =0 ;

void count_squre(int x,int y,int k)
{
    if(k==0)
        return  ;
    if(x-k<=n && x+k>=n && y-k<=m && y+k>=m)
        ans++ ;
    count_squre(x+k,y+k,k/2) ;
    count_squre(x-k,y+k,k/2) ;
    count_squre(x-k,y-k,k/2) ;
    count_squre(x+k,y-k,k/2) ;
}

int main()
{
    int k ;
    while(sc("%d %d %d",&k,&n,&m))
    {
        if(k==0 && n==0 && m==0)
            break ;
        ans =0 ;
        count_squre(1024,1024,k) ;
        pf("%3d\n",ans) ;

    }
    return 0;
}

UVA 10466 - How Far?

/***
Md. Namzul Hasan
Shahjalal University of Science & Technology,Sylhet.
hasan08sust@gmail.com
***/
#include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
typedef int in ;
typedef unsigned long long ull ;
const double pi = 2*acos(0) ;
#define maxi 40000
#define pf printf
#define sc scanf
#define pb push_back
#define MEM(x,y) (memset((x),(y),sizeof(x)))
#define MIN(x,y) ((x) < (y) ? (x) : (y))
#define MAX(x,y) ((x) > (y) ? (x) : (y))
#define load(array,size)  for(int i=0 ; i<size ; i++) cin>>array[i]  ;
#define new_line  pf("\n")
#define clear_data(array) memset(array,0,sizeof(array))
#define highest_int 2147483647

int main()
{
    int n ,T ;
    while(cin>>n>>T)
    {
         double r=0 ,t=0 ;
         double x =0 ,y=0 ;

        for(int i =0 ;i<n ;i++)
        {
            sc("%lf %lf",&r,&t) ;
            double angle =  2* pi * (T/t) ;
             x += r * cos(angle) ;
             y += r*sin(angle) ;
             if(i)
                pf(" ") ;
             pf("%.4lf",hypot(x,y)) ;
        }
        pf("\n") ;
    }
    return 0;
}

UVA 11068 - An Easy Task

/***
Md. Namzul Hasan
Shahjalal University of Science & Technology,Sylhet.
hasan08sust@gmail.com
***/
#include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
typedef int in ;
typedef unsigned long long ull ;
const double pi = 2*acos(0) ;
#define maxi 40000
#define pf printf
#define sc scanf
#define pb push_back
#define MEM(x,y) (memset((x),(y),sizeof(x)))
#define MIN(x,y) ((x) < (y) ? (x) : (y))
#define MAX(x,y) ((x) > (y) ? (x) : (y))
#define load(array,size)  for(int i=0 ; i<size ; i++) cin>>array[i]  ;
#define new_line  pf("\n")
#define clear_data(array) memset(array,0,sizeof(array))
#define highest_int 2147483647

int main()
{
    int a1,b1,c1,a2,b2,c2 ;

    while(sc("%d %d %d %d %d %d",&a1,&b1,&c1,&a2,&b2,&c2))
    {
        if(a1==0 && b1==0 &&c1==0 && a2==0 && b2==0 && c2==0)
            break ;

        int divisor = a1*b2 - a2*b1 ;
        if(divisor)
        {
            double x, y ;
            int z = b2*c1 -b1*c2 ;

            if(z)
                x = z/(double)divisor  ;
            else
                x =0.0 ;
            z = c2*a1- c1*a2 ;
            if(z)
                y = z/(double)divisor  ;
            else
                y = 0.0 ;

            pf("The fixed point is at %.2lf %.2lf.\n",x,y) ;
        }
        else
            pf("No fixed point exists.\n") ;

    }
    return 0;
}

UVA 10250 - The Other Two Trees

/***
Md. Namzul Hasan
Shahjalal University of Science & Technology,Sylhet.
hasan08sust@gmail.com
***/
#include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
typedef int in ;
typedef unsigned long long ull ;
const double pi = 2*acos(0) ;
#define maxi 40000
#define pf printf
#define sc scanf
#define pb push_back
#define MEM(x,y) (memset((x),(y),sizeof(x)))
#define MIN(x,y) ((x) < (y) ? (x) : (y))
#define MAX(x,y) ((x) > (y) ? (x) : (y))
#define load(array,size)  for(int i=0 ; i<size ; i++) cin>>array[i]  ;
#define new_line  pf("\n")
#define clear_data(array) memset(array,0,sizeof(array))
#define highest_int 2147483647


double mx, my ;

void midValue(double x1, double y1, double x2, double y2)
{
    mx = (x1 + x2)/2 ;
    my = (y1 + y2)/2 ;
}

double dis(double x1, double y1, double x2, double y2)
{
    double d = sqrt((x2-x1)*(x2-x1) + (y2-y1)*(y2-y1)) ;
    return d ;
}

int main()
{
    double x1, y1, x2,y2 ;
    while(cin>>x1>>y1>>x2>>y2)
    {

        midValue(x1, y1, x2,y2) ;
        double dx = x1 -mx ;
        double dy = y1 - my;
        double x3 = mx +dy ;
        double y3 = my - dx ;
        double x4 = mx - dy ;
        double y4 = my + dx ;

            pf("%.10lf %.10lf %.10lf %.10lf\n",x3,y3,x4,y4) ;

    }
    return 0;
}