Problems from SUST SWE 128 Lab 3
A.
GCD Plus LCM In this problem you will be given two integers a, b. You have to answer if GCD(a,b)+LCM(a,b)=a+b is ... |
B.
Big Factorials Given an integer N, print the trailing 4 digits of N! (N factorial). N!=N×(N−1)×(N−2)×...×1 Here are... |
C.
Left Prime Prime numbers are the ones which can only be divided by 1 and the number itself. 2, 3, 5, 7, 11, 13 ... |
D.
Complex Operations You are given an array A of length N. You have to perform two different types of operations. In the ... |
E.
Pascal's Triangle Given an integer N, print the sum of the Nth row of the Pascal's triangle. In mathematics, Pascal's ... |
F.
Fibonacci Numbers Given an integer N, print the N-th Fibonacci number. A Fibonacci series is a series of numbers in wh... |
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
