sandesh-08 / questions-solved

all the questions of cp solved

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

questions-solved

all the questions of cp solved

infix->postfix - using stacks conversion of infix into postfix

postfix->cala - using stacks calcluting value of postfix expression

FIBBONACI AGAIN - Task. Given two integers n and m, output F n mod m (that is, the remainder of F n when divided by m).Input Format. The input consists of two integers n and m given on the same line (separated by a space).Constraints. 1 ≤ n ≤ 10 14 , 2 ≤ m ≤ 10 3 .Output Format. Output Fn mod m.

links to questions ..

HACKER-EARTH

HACKERRANK

CODEFORCES

CODEFORCES 662 DIV 2

CODEFORCES 665 DIV 2

CODEFORCES 666 DIV 2

CODEFORCES 667 DIV 3

CODECHEF

LONG CHALLENGE-

AUGUST/20

SEPTEMPER/20

LUNCHTIME

AUGUST/20

COOKOFF

AUGUST/20

About

all the questions of cp solved


Languages

Language:C++ 97.5%Language:Python 2.5%