UVA Problem#11172

Question:
http://uva.onlinejudge.org/external/111/11172.html 

Solution Method:
it is one of the most easiest problem of UVA. 
1. take simple input 
2. bye simple comparing you can achieve the proper output.

UVA Problem#11636

Question:
http://uva.onlinejudge.org/external/116/11636.html 

Solution: 
int main(){ 
...
..... 
scanf("%d", &n); 
if(n<0) break; 
if(n>1){
j = 0; 
line = 1; 
for(j=1; ; j++){
line *= 2; 
if(line >= n) break; 
}
  ....
....} 

UVA Problem#10783

Question:

http://uva.onlinejudge.org/external/107/10783.html 

Solution Method:

 1. loop will run from the given starting value till the gien end value

2. check for the odd numbers

3. simply add them 

UVA Problem#575

Question:
http://uva.onlinejudge.org/external/5/575.html 

Solution:
int main(){
.....
.... 
for(i=0; i<l; i++){
            s=1;
            for(j=l; j>i; j--){
                s*=2;
            }
   
            k+=((a[i]-48)*(s-1));
        }
......
..... 
} 

UVA Problem#438

Question:

http://uva.onlinejudge.org/external/4/438.html 

Solution:

int main(){

.....

.... 

m1= (y2-y1)/(x2-x1); 

m2= (y3-y1)/(x3-x1); 

if (m2==0){

  k= (x2-x3)/m1/2 + (y1+y2)/2; 

h= (x1+x3)/2; }

if (m1==0){

  k=(x3-x2)/m2/2 + (y1+y3)/2; 

h=(x1+x2)/2; 

}

else if (m1!=0&&m2!=0){ 

h= ((x1+x2)/m1 - (x1+x3)/m2 + y2-y3)/2/(1/m1 - 1/m2);

  k= ( h-(x1+x2)/2)/(-m1) + (y1+y2)/2; 

}

r= sqrt((h-x1)*(h-x1) + (k-y1)*(k-y1)); 

ans=2*pi*r;   

......

...

} 

UVA Problem#369

Question:

http://uva.onlinejudge.org/external/3/369.html 

Solution: 

double fact(int n){ 

int i; double f=1; 

for(i=2; i<=n; i++){ 

f = f*i; 

} 

return f; 

}

int main(){ 

....

.... 

c = fact(n) / ( fact(n-m) * fact(m) ) 

... 

}

UVA Problem#113

Question: 

http://uva.onlinejudge.org/external/1/113.html 

Solution:

y=exp((1/n)*log(p));