Problems from SCB-PA Inter School and College Programming Contest 2019 Practice 1
A.
Biswa and Picnic Biswa’s department is going on a picnic and as usual, he is a member of the organizing committee. Th... |
B.
Full Pyramid Given an integer N, print a full pyramid of asterisks. A full pyramid of asterisks of size N has N l... |
C.
Is Anagram An anagram is a word formed by rearranging the letters of another word. The words "listen" and "sile... |
D.
Test Cases Byang's friend is building a sport programming platform and needs your help with one of the modules.... |
E.
Afifa's ITS Imagine some made up story here including Afifa (my little sister) and an Intelligent Transport Syst... |
F.
A New Tough Game We are introducing a new game in Toph. And, by participating in IUT ICT Fest 2019, you have become o... |
G.
Byang's Assembly Byang doesn't need your help with his projects... Except with this project that his teacher wants hi... |
H.
Shadow Business The result of the S.S.C exam is published. And Poltu has got A+. Poltu is very happy for his achieve... |
I.
Ghosh vs Datta About two hundred years ago, a serious dispute evoked between the two neighboring colonies of Khulna... |
J.
Itachi's Challenge Sasuke is a 12-year old ninja who is very much interested in learning Ninjutsu (A tactic used by nin... |
K.
Set, Intersection and Range You are given N sets of integers (S[1] , S[2] , S[3] , ... , S[N]) and Q queries. Each query has 4 i... |
L.
Pizza From SpongeBob SpongeBob recently got obsessed with his (not perfect) rectangular face and has started making recta... |
M.
Remember the Name... There's a famous song written by Mike Shinoda, which has these lines: This is 10% luck, 20% skill, ... |
N.
MaxFlow (II) Given a connected undirected graph with n nodes and m edges and the capacity of each edge is 1. maxF... |
O.
Childhood Game About twenty years ago, when we had only 16MB RAMs and 5GB hard disks, playing games might seem like... 
Very Easy
9/15/40 |
Practice Contest
Practice contests allow you to re-run contests and experience them as close as possible to the original run.
Tags
2Sat, Adhoc, ApolloneasTheorem, Backtracking, BFS, Bignum, BinarySearch, BipartiteMatching, Bitmask, BruteForce, ChineseRemainderTheorem, Combinatorics, ConvexHull, CutVertex, DataStructure, DFS, DigitDP, DisjointSets, DivideAndConquer, DP, Eertree, EulerTour, ExpectedValue, FenwickTree, FFT, Flow, Game, GCD, Geometry, Graph, Greedy, Hashing, HeavyLightDecomposition, Implementation, InclusionExclusion, Interactive, KnuthMorrisPratt, LowestCommonAncestor, Math, Matrix, MatrixExponentiation, MergeSortTree, ModularExponentiation, MOSAlgorithm, MST, NTT, NumberTheory, Parsing, PersistentLiChaoTree, PersistentSegmentTree, PollardRho, PriorityQueue, Probability, Queue, RabinMiller, RangeOrderStatistics, Scheduling, SegmentTree, ShortestPath, Simulation, Sorting, SparseTable, SpragueGrundyTheorem, SqrtDecomposition, Stack, String, StronglyConnectedComponents, SuffixStructure, TernarySearch, Tree, Trie, TwoPointer, WaveletTree
