Experimental Educational Round: VolBIT Formulas Blitz

x=input()
print(pow(5,int(x),100))

x=input().split()
print(int(x[0])*pow(1.000000011,int(x[1])))

x=int(input())
ans = 0
for i in range(0,x):
 ans=(ans+1)*2
print(ans)

n=int(input())
print(3*n*(n+1)+1)

import operator
import math
def c(n,k):  
    return  int(math.factorial(n)/(math.factorial(k)*math.factorial(n-k)))
x=int(input())
print(c(x,5)+c(x,6)+c(x,7))

import operator
import math
def c(n,k):  
    return  int(math.factorial(n)/(math.factorial(k)*math.factorial(n-k)))
x=int(input())
print(c(x+4,5)*c(x+2,3))

import operator
import math
def c(n,k):  
    return  math.factorial(n)*math.factorial(n)//(math.factorial(k)*math.factorial(n-k)*math.factorial(n-k))
x=int(input())
print(c(x,5))

x=int(input())
print(int(x/2520))

import itertools  
import math
p=int(input())
aa=p
for i in range(1,11):
 t=list(itertools.combinations([2,3,5,7],i))
 for j in t:
  ans=1
  for k in j:
   ans*=k
  ans=p//ans
  if i&1:
   aa-=ans
  else:
   aa+=ans
print(aa)

x=input()
print("%05d" % pow(10000*int(x[0])+1000*int(x[2])+100*int(x[4])+10*int(x[3])+int(x[1]),5,100000))

import math
x=input().split()
a=int(x[0])
b=int(x[1])
c=int(x[2])
t=math.sqrt(b*b-4*a*c)
print(max((t-b)/(2*a),(-t-b)/(2*a)))
print(min((t-b)/(2*a),(-t-b)/(2*a)))

x=int(input())
print(2-(x&1))

 

此条目发表在Codeforces, 容斥原理, 快速幂, 排列组合分类目录。将固定链接加入收藏夹。