1036A - Function Height - CodeForces Solution


math *1000

Please click on ads to support us..

Python Code:

import sys
import math
 
 
from decimal import *
 
 
 
  nr_elemente_prime=1001

vector_prime=[-1]*nr_elemente_prime
vector_rasp=[0]*nr_elemente_prime
 
vector_prime[1]=1
 
vector_rasp[1]=1
contor=2

for i in range(2,nr_elemente_prime):
 if vector_prime[i]==-1:
  vector_prime[i]=1
  vector_rasp[contor]=i
  contor=contor+1
 for j in range(i+i,nr_elemente_prime,i):
   if vector_prime[j]==-1:
    vector_prime[j]=i
      
   

set_prime=set(vector_rasp)
sume_disponibile=set()

for i in range(3,1001):
 sume_disponibile.add(vector_rasp[i-1]+vector_rasp[i])



rasp_final=""  

def transformare_baza(numar,baza):
 
 transformare=""
 while numar>=baza:
  rest=numar%baza
  numar=numar//baza
  transformare+=str(rest)
 
 transformare+=str(numar)
 noua_baza=transformare[::-1]
 return noua_baza
 
 
def bitwise_xor(a,b):
 stringul_1=transformare_baza(a,2)
 stringul_2=transformare_baza(b,2)
 
 lungime=max(len(stringul_1), len(stringul_2))
 raspunsul=0
  
 str_answ=[0]*lungime
 
  
 for i in range(0,lungime):
   j=lungime-1-i
  if len(stringul_1)>i and len(stringul_2)>i:
   if stringul_1[len(stringul_1)-1-i]!= stringul_2[len(stringul_2)-1-i]:
    raspunsul+=2**(i)
    str_answ[i]='1'
  elif len(stringul_1)>i and stringul_1[len(stringul_1)-1-i]=='1':
   raspunsul+=2**(i)
   str_answ[i]='1'
  elif len(stringul_2)>i and stringul_2[len(stringul_2)-1-i]=='1':
   raspunsul+=2**(i)
   str_answ[i]='1'
   
  
 return raspunsul


def bitwise_or(a,b):
 stringul_1=transformare_baza(a,2)
 stringul_2=transformare_baza(b,2)
 
 lungime=max(len(stringul_1), len(stringul_2))
 raspunsul=0
  
 str_answ=[0]*lungime
 
  
 for i in range(0,lungime):
   j=lungime-1-i
  if len(stringul_1)>i and len(stringul_2)>i:
   if stringul_1[len(stringul_1)-1-i]=='1' or  stringul_2[len(stringul_2)-1-i]=='1':
    raspunsul+=2**(i)
    str_answ[i]='1'
  elif len(stringul_1)>i and stringul_1[len(stringul_1)-1-i]=='1':
   raspunsul+=2**(i)
   str_answ[i]='1'
  elif len(stringul_2)>i and stringul_2[len(stringul_2)-1-i]=='1':
   raspunsul+=2**(i)
   str_answ[i]='1'
   
  
 return raspunsul
 
 
def cmmdc(x,y):
 maximul=max(x,y)
 minimul=min(x,y)
 while maximul!=minimul and minimul!=0:
  
  dif=maximul-minimul
  raport=dif//minimul
 
  
  
  maximul-=minimul*(raport+1)
  
  a=max(minimul,maximul)
  b=min(minimul, maximul)
  
  maximul=a
  minimul=b
 
 return (maximul)
 
 
dict = {}  
 alfabet = {'a': 1, 'b': 2,'c': 3,'d': 4,'e': 5,'f': 6,'g': 7,'h': 8,'i': 9,'j': 10,'k': 11,'l': 12,'m': 13,'n': 14,'o': 15,'p': 16,'q': 17,'r': 18,'s': 19,'t': 20,'u': 21,'v': 22,'w': 23,'x': 24,'y': 25,'z': 26}
 
contor=0
k=1
while k>0:
 
   vector=list(map(int,input().split()))
 print(math.ceil(Decimal(vector[1])/Decimal(vector[0])))
 
 k-=1

C++ Code:

#include <bits/stdc++.h>
using namespace std;
int main()
{
    long long k,n;
    cin>>n>>k;
    cout<<(k+n-1ll) / n<<endl;
}


Comments

Submit
0 Comments
More Questions

994. Rotting Oranges
983. Minimum Cost For Tickets
973. K Closest Points to Origin
969. Pancake Sorting
967. Numbers With Same Consecutive Differences
957. Prison Cells After N Days
946. Validate Stack Sequences
921. Minimum Add to Make Parentheses Valid
881. Boats to Save People
497. Random Point in Non-overlapping Rectangles
528. Random Pick with Weight
470. Implement Rand10() Using Rand7()
866. Prime Palindrome
1516A - Tit for Tat
622. Design Circular Queue
814. Binary Tree Pruning
791. Custom Sort String
787. Cheapest Flights Within K Stops
779. K-th Symbol in Grammar
701. Insert into a Binary Search Tree
429. N-ary Tree Level Order Traversal
739. Daily Temperatures
647. Palindromic Substrings
583. Delete Operation for Two Strings
518. Coin Change 2
516. Longest Palindromic Subsequence
468. Validate IP Address
450. Delete Node in a BST
445. Add Two Numbers II
442. Find All Duplicates in an Array