রবিবার, ২৫ ডিসেম্বর, ২০১৬

Topic wise problem(number theory)

Prime problem uva : 406,543,686,897,914,10852,10650,10490,10394,10311,10168
GCD/LCM Problems uva : 408,412,106,10407,11388,11417,11774,12068
Factorial problems uva :324,568,623,10220,10323,10338
Prime factor Problems uva :516,583,10392,11466 ,160,993,10139,10622,10680,10780,10791,11395,11889
Big Mod /Inverse mod problems uva : 10090,10104,10633,10637 ,374,10212,11029
Fibonacci Numbers Problems uva : 495,900,948,1258,10183,10334,10450,10497,10597,11000,11089,11161,11780
Base Number Conversion problems Uva : 290,343,355,389,446,10473,10551

Number theory codeforces link :
https://codeforces.com/problemset?order=BY_SOLVED_DESC&tags=number+theory

Number Theory : https://a2oj.com/category?ID=41

Sorting problem : https://a2oj.com/category?ID=95

Big Mod /Inverse mod : http://www2.seas.gwu.edu/~poorvi/Classes/CS124_2006/CS124_InversePractice.pdf
https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=4664
https://www.codechef.com/tags/problems/inverse
https://www.codechef.com/tags/problems/modulo

1 টি মন্তব্য:

Factorization with prime Sieve

vector <int> prime; char sieve[1000009]; int N=1000009; void primeSieve ( ) { sieve[0] = sieve[1] = 1; prime.push_back(2); ...