Friday, August 9, 2013

3932. Point Connection Game in a Circle


MCIRGAME/
CODE

def fac(n):
    if(n==0):
        return 1
    else:
        return n*fac(n-1)
while(True):
    k=input()
    if(k==-1):
        break
    else:
        temp=fac(2*k)/(fac(k+1)*fac(k))
        print temp


9952. 111…1 Squared

Problem code: GUANGGUN

CODE

import sys
for s in sys.stdin:
    n=int(s)
    if(n<10):
        print n*n
    else:
        t=(n-10)/9+1
        k=10+(t-1)*9
        ans=((81*t)+1)+((n-k)*(n-k+2))
        print ans

   

 

 UCV2013I

CODE

import math
while(True):
    s=raw_input()
    str=s.split(' ')
    r=int(str[0])
    n=int(str[1])
    if(n==0 & r==0):
        break;
    else:
        x=math.pi/2
        R=r/math.sin(x/n)
        print ("%.2f")%R

Sunday, July 28, 2013

15388 Easy One For Cartman

Easy One For Cartman

CODE
import math
t=input()
for i in range(t):
    s=raw_input()
    str=s.split(' ')
    a=int(str[0])
    b=int(str[1])
    n=int(str[2])
    d=b-a
    ans=n*(2*a+(n-1)*d)/2
    #ans=(pow(n%1000000007,r%1000000007))%1000000007
    print ans

TRAINGLE

TRYANGLE
CODE

import math
t=int(input())
for i in range(1,t+1):
    n=int(input())
    ans=(n*(n-1)*(n-2))/6
    print "Case %d: %d" % (i,ans)
Counting Ids
CODE

import math
while(True):
    s=raw_input()
    str=s.split(' ')
    n=int(str[0])
    r=int(str[1])
    if(n==0 & r==0):
        break;
    else:
        ans=(n*(pow(n,r)-1)/(n-1))%1000000007
        print (ans)

Monday, June 17, 2013