├── tries.cpp ├── TEST ├── testo.cpp ├── sockets.cpp ├── test2.cpp ├── shobhittest.cpp ├── sizeof character.cpp ├── test.cpp ├── aaa.cpp ├── sockets.c ├── test string size.cpp ├── junk.cpp ├── pointer size.cpp ├── assert test.cpp ├── gaurav.h ├── empty array.c ├── empty array.cpp ├── Untitled1.cpp ├── , operator.cpp ├── inline test.cpp ├── gaurav.cpp ├── opfile.cpp ├── array size in function.cpp ├── test subset sum.cpp ├── gcf test.cpp ├── padding.cpp ├── swapnil series.cpp ├── assert.cpp ├── graph complexity.cpp ├── or.cpp ├── te4st towers.cpp ├── mask.cpp ├── fibon.cpp ├── swapnil.cpp ├── swapnil problem.cpp ├── permutations.cpp ├── subtracting.cpp ├── mtest.cpp ├── testpradeep.cpp ├── sieves.cpp ├── te.cpp ├── subset sum(O(2^nd).cpp ├── dequeue.cpp ├── far.cpp └── t.cpp ├── month long contest ├── ss.cpp ├── p2.c └── p2.cpp ├── aaa.cpp ├── codechef ├── COOK50 │ ├── p4 │ │ ├── test.cpp │ │ └── testgen.cpp │ ├── p5 │ │ └── p1.cpp │ ├── p3 │ │ └── testgen.cpp │ └── p1 │ │ └── p1.cpp ├── november12 │ ├── saads.cpp │ ├── sss.c │ └── shobhit.cpp ├── JAN13 │ ├── sss.c │ ├── THREEDIF.cpp │ ├── shobhit.c │ └── TREEDIFTEST.cpp ├── OCT14 │ ├── TRIPS │ │ ├── TRIPS.cpp │ │ └── shobhit.cpp │ ├── CHEFSQUAtestgen.cpp │ ├── QString │ │ ├── suffixtestgen.cpp │ │ ├── testgen.cpp │ │ └── testgen2.cpp │ ├── potiontestgen.cpp │ ├── testfile.cpp │ ├── CHEFGR.cpp │ ├── Seatsrtestgen.cpp │ ├── p2.cpp │ └── FATCHEF.cpp ├── DEC13 │ ├── test2.cpp │ ├── test.cpp │ └── ALEXNUMB.cpp ├── NOV14 │ ├── p9.zip │ ├── test.cpp │ ├── p1.cpp │ ├── testgen5.cpp │ └── p3.cpp ├── NOV13 │ ├── kriti.cpp │ ├── da.cpp │ ├── forward list.cpp │ ├── JOHNY.cpp │ └── MCHAIRS.cpp ├── COOK26 │ └── saad.cpp ├── JUL13 │ ├── sadadadaads.cpp │ ├── sadas.cpp │ ├── sareja.cpp │ ├── PROB.cpp │ ├── ads.cpp │ ├── mou1t.cpp │ └── FARASA.cpp ├── OCT13 │ ├── dasads.cpp │ ├── adads.cpp │ └── MAANDI.cpp ├── MAY14 │ ├── FUNAGP │ │ ├── adsdas.cpp │ │ └── int_max_check.cpp │ ├── OJUMPS │ │ └── OJUMPS.cpp │ ├── LEBALONS │ │ ├── LEBALONS_2.cpp │ │ └── LEBALONS_testgen.cpp │ ├── RRSTONE │ │ ├── RRSTONE_testgen.cpp │ │ └── RRSTONE_brute.cpp │ ├── CHEFBM │ │ └── CHEFBM_testgen.cpp │ ├── SEAGM │ │ └── SEAGM_testgen.cpp │ ├── SEINC# │ │ └── SEINC_testgen.cpp │ └── COMPILER │ │ └── COMPILER.cpp ├── COOK27 │ └── asadsa.cpp ├── JUN13 │ ├── sadas.cpp │ ├── testgen.cpp │ ├── DELISH.cpp │ ├── PREDICT.cpp │ └── LAPINDROME.cpp ├── AUG14 │ ├── CRAWA │ │ ├── yesprinter.cpp │ │ └── randomGenerator.cpp │ ├── MOU2H │ │ └── testgen.cpp │ ├── CLETAB │ │ └── testgen.cpp │ └── PRGIFT │ │ └── PRGIFT.cpp ├── adsdas.cpp ├── SEPT14 │ ├── SEBUB │ │ ├── worstgen.cpp │ │ └── testgen.cpp │ ├── FACTORIZ │ │ ├── FACTORIZ_brute.cpp │ │ └── testgen.cpp │ ├── FLOORI4 │ │ └── testgen.cpp │ └── CHEFINV │ │ └── testgen.cpp ├── WPC15 │ ├── Untitled1.cpp │ ├── testgen.cpp │ ├── p1.cpp │ ├── p5brute.cpp │ ├── p3.cpp │ └── p4.cpp ├── sadfadfs.cpp ├── sdsad.cpp ├── CIELAB.cpp ├── NITA05.cpp ├── COOK51 │ ├── p1.cpp │ ├── p4test.cpp │ ├── testgen.cpp │ └── p2.cpp ├── testgen.cpp ├── COOK 43 │ ├── 1.cpp │ └── 2.cpp ├── Life, the Universe, and Everything.cpp ├── natural number printers.cpp ├── bitflags.cpp ├── Epiphany 2012 │ ├── epic1.cpp │ └── EPI02.cpp ├── LTIME17 │ ├── p2testgen.cpp │ ├── p1.cpp │ └── p4.cpp ├── numgame2.cpp ├── CNG.cpp ├── COOK29 │ ├── MUFFINS3.cpp │ └── TREEROOT - Copy.cpp ├── test.cpp ├── COOK45 │ └── SNAPE.cpp ├── dfadafs.cpp ├── 2d array problems.cpp ├── aug13 │ └── testdelnms.cpp ├── HS08TEST.cpp ├── TREEROOT.cpp ├── WPC │ ├── p11.cpp │ ├── p5.cpp │ ├── p7brute.cpp │ ├── testgen.cpp │ ├── brutep11.cpp │ └── p2.cpp ├── COOK44 │ └── 2.cpp ├── GREYCODE.cpp ├── atm.cpp ├── CODX2014 │ └── K.cpp ├── cads.cpp ├── LTIME14 │ └── 1.cpp ├── MARCH14 │ └── WALK.cpp ├── bytecode │ ├── evilhacker.cpp │ ├── ToGgLeD.cpp │ └── doors.cpp ├── fctrl.cpp ├── CIELDIST.cpp ├── COINTS.cpp ├── BUY1GET1.py ├── COOK33 │ ├── AMMEAT2.cpp │ ├── testgen.cpp │ └── AMMEAT.cpp ├── APRL13 │ ├── FCBARCA.cpp │ ├── sdsdfa.cpp │ └── MAXDIFF.cpp ├── LTIME15 │ └── HHAL.cpp ├── CDCN2014 │ ├── CRZ02.cpp │ ├── CRZ04.cpp │ └── CRZ01C.cpp ├── adsads.cpp ├── test2.cpp ├── COINS.cpp ├── LTIME16 │ └── p1.cpp ├── ALKH2013 │ └── swapnil.cpp ├── asa.cpp ├── NCR.cpp ├── MARCH13 │ └── APPROX.cpp ├── ALGT2013 │ └── TNMALG04.cpp ├── SPLCND2.cpp ├── ALIENC.cpp ├── TOYSGAME.cpp ├── CLASH │ └── p3.cpp ├── FEB13 │ └── BUY1GET1.cpp ├── OCT12 │ └── NEWSCH.cpp ├── testchecker.cpp ├── AND.cpp ├── LASTDIG.cpp ├── CATCH.cpp ├── project euler 4.cpp ├── TWTCLOSE.cpp ├── bytes │ └── BYTESE.cpp ├── Dilivery boy.cpp ├── Ltime08 │ └── CHRL3.cpp ├── MAGSTK.cpp ├── numgame.cpp ├── DRAGNXOR.cpp ├── MAXDIFF.cpp ├── COINS DP.cpp └── September challenge │ └── horses.cpp ├── Untitled1.cpp ├── shobhit.vbs ├── radix_sirt.cpp ├── codeforces ├── 471 │ ├── p3.cpp │ └── p1.cpp ├── 472 │ └── p5.cpp ├── 488 │ └── p1.cpp ├── gym │ └── Week2 │ │ ├── p10.cpp │ │ └── straight.in ├── Match 278 │ ├── p1.zip │ ├── p2.zip │ └── asdas.cpp ├── Match 478 │ ├── p1.cpp │ └── p2.cpp ├── Match 2 │ └── p3.cpp ├── VIRTUAL 467 │ └── p1.cpp ├── match 396 │ ├── Untitled2.cpp │ └── DIV2 P@.cpp ├── Match 483 │ ├── p1tester.cpp │ └── p1.cpp ├── Match 229 │ ├── 1.cpp │ └── 2.cpp ├── Match 268 │ └── codeforces │ │ ├── t2.cpp │ │ ├── t3.cpp │ │ ├── t1.cpp │ │ ├── k3.cpp │ │ ├── y3.cpp │ │ ├── p3.cpp │ │ ├── shbjit.cpp │ │ └── k1.cpp ├── Match 226 │ ├── p1.cpp │ └── shobhit.cpp ├── Match 463 │ ├── p2.cpp │ ├── p4.cpp │ └── p1.cpp ├── VIRTUAL 259 │ └── p1.cpp └── match 4 │ └── p1.cpp ├── CODEPOOL 2012.zip ├── NITCONTEST3.zip ├── alert sound.cpp ├── splay_trees.zip ├── MO algo template.zip ├── Testing environment ├── testchekerpalin.cpp ├── adssad.cpp ├── shobhit.cpp ├── testing dev.cpp ├── testgenmanber.cpp ├── distict pallin check │ ├── testgen.cpp │ └── testgen2.cpp ├── sadsad.cpp ├── adsads.cpp ├── testgen2.cpp ├── ads.cpp ├── p1.cpp ├── testing generations.cpp ├── test.cpp ├── testfilegen.cpp ├── testgen.cpp └── random strings.cpp ├── fibonicci checking.cpp ├── spoj ├── pt07F │ └── in2.cpp ├── MBEEWALK.cpp ├── GAMES.cpp ├── M3TILE.cpp ├── DANGER.cpp ├── HC.cpp ├── Untitled3.cpp ├── MCOINS.cpp ├── NY10E.cpp ├── ACODE.cpp ├── ROBBERY2.cpp ├── HOTELS.cpp └── GNY07H.cpp ├── suffix arrays (linear algorithm(.cpp ├── swap.cpp ├── hackerrank ├── sastra │ ├── p6.zip │ ├── p10.zip │ └── p2.cpp ├── ALGO │ ├── p2.txdt.cpp │ └── p2.cpp ├── codegon │ ├── codeagon3.cpp │ ├── saads.cpp │ └── magic1.cpp ├── inscription │ ├── p2.cpp │ ├── testgen4.cpp │ └── p1.cpp └── pairs.cpp ├── knapsack.cpp ├── Google APAC 2 └── test.cpp ├── amfib testing ├── fibo.py └── testing.cpp ├── DP practice ├── Contest 1 │ ├── DP practice 1.zip │ ├── PB.cpp │ ├── PD.cpp │ └── PH.cpp ├── Contest 2 │ ├── PG.cpp │ ├── PB.cpp │ ├── PH.cpp │ ├── PL.cpp │ └── PP.cpp ├── Contest 3 │ ├── A.cpp │ ├── M.cpp │ ├── F.cpp │ └── Brecursion.cpp ├── M3TILE.cpp └── timus 1073.cpp ├── ad.cpp ├── topcoder ├── SRM │ ├── ad.cpp │ └── p1.cpp └── SRM 637 │ └── p1.cpp ├── README.md ├── bincount.cpp ├── adsas.cpp ├── hackerearth ├── coderush │ ├── p6.cpp │ ├── p5.cpp │ ├── p2.cpp │ └── p4.cpp ├── august jam │ ├── p2.cpp │ └── p1.cpp └── October Easy │ └── testgen.cpp ├── pentium archi └── file1.cpp ├── Discrete Optimisaion Coursera └── Assignment 2 Puzzle Challenge │ ├── 8 queens │ ├── stats.jpg │ ├── BT_stat │ ├── CP_set_version_stat │ ├── CP_stat │ ├── newstat_BT │ ├── CP_set_heap_version_stat │ ├── newstat_CP1 │ ├── newstat_CP2 │ └── newstat_CP3 │ └── magic_series │ └── stat_brute ├── seudo.cpp ├── hiding a window.cpp ├── integer reverse.cpp ├── LCM.cpp ├── pallindrome check.cpp ├── virtual contests ├── session 4 │ ├── 1.cpp │ ├── 4.cpp │ ├── 3.cpp │ └── 2.cpp ├── session 1 │ └── p2.cpp ├── session 3 │ └── A.cpp └── session 2 │ └── p5.cpp ├── bitflags.cpp ├── trie.cpp ├── adsads.cpp ├── alphabets.cpp ├── fdasdf.cpp ├── assad.cpp ├── firstn.cpp ├── subset sum(O(2^n).cpp ├── GREY TO BINARY.cpp ├── sdsf.cpp ├── timing.cpp ├── icpc └── fibonacci.cpp ├── power.cpp ├── FINITE_AUTOMATION_odd a's suffing a string.cpp ├── NITCONTEST3 ├── Jindal and Numbers │ ├── testcaseGenerator.cpp │ └── setter_solution.cpp ├── Gaurav and Recurrences │ ├── testcase_generator.cpp │ └── setter_programDP.cpp └── Rajat and Classes │ └── testcasegenerator.cpp ├── kdtree testing.cpp ├── DC3.cpp ├── persistent lists.cpp ├── GCD.cpp ├── all combinartions.cpp ├── loswecase.cpp ├── ENCODER2014 └── p1.cpp ├── nCr(dynamic).cpp ├── tower of hanoi.cpp ├── google.cpp ├── nPr.cpp ├── reverse of a string.cpp ├── india map.c ├── adsfdsa.cpp ├── Sets.cpp ├── india.cpp ├── odd number entry.cpp ├── acmkn14 └── p1.cpp ├── shobhit.cpp ├── RGPVR102.cpp ├── COOLGUYS.cpp ├── coins_ankit.cpp ├── india23.cpp ├── FDAADS.cpp ├── he testing └── panda │ └── pnda.cpp ├── india2.cpp ├── permutations.cpp ├── binary search.cpp ├── mulmod(O(logn)).cpp ├── testchecker.cpp ├── Turing Machine └── turing_machine.cpp ├── dynamic matrix.cpp ├── odd one out.cpp ├── encoder(altius 2012) └── ENCD (3).cpp ├── .gitattributes ├── testgen.cpp ├── random strings.cpp ├── Facebook Challenge ├── p3.cpp └── p1.cpp ├── subset sum(O(2^n n).cpp ├── G.cpp ├── points_inside_rectange_brute.cpp ├── smaller 2.cpp ├── unimodular array.cpp ├── points_inside_rectange_testgen.cpp └── addafdf.cpp /tries.cpp: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /TEST/testo.cpp: -------------------------------------------------------------------------------- 1 | 2; 2 | -------------------------------------------------------------------------------- /month long contest/ss.cpp: -------------------------------------------------------------------------------- 1 | -------------------------------------------------------------------------------- /aaa.cpp: -------------------------------------------------------------------------------- 1 | #Include 2 | int main() 3 | {} 4 | -------------------------------------------------------------------------------- /codechef/COOK50/p4/test.cpp: -------------------------------------------------------------------------------- 1 | 2 2 | 1 5 3 | 2 5 4 | -------------------------------------------------------------------------------- /Untitled1.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | -------------------------------------------------------------------------------- /shobhit.vbs: -------------------------------------------------------------------------------- 1 | CreateObject("SAPI.SpVoice").Speak"Shobhit Saxena" 2 | -------------------------------------------------------------------------------- /TEST/sockets.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | -------------------------------------------------------------------------------- /radix_sirt.cpp: -------------------------------------------------------------------------------- 1 | 2 | #include 3 | using namespace std; 4 | 5 | 6 | -------------------------------------------------------------------------------- /codechef/november12/saads.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int a; 5 | } 6 | -------------------------------------------------------------------------------- /codechef/november12/sss.c: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int a; 5 | } 6 | -------------------------------------------------------------------------------- /codechef/november12/shobhit.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int a; 5 | } 6 | -------------------------------------------------------------------------------- /codeforces/488/p1.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(){ 5 | 6 | } 7 | -------------------------------------------------------------------------------- /CODEPOOL 2012.zip: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dragonslayerv2/Competitive-Programming/HEAD/CODEPOOL 2012.zip -------------------------------------------------------------------------------- /NITCONTEST3.zip: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dragonslayerv2/Competitive-Programming/HEAD/NITCONTEST3.zip -------------------------------------------------------------------------------- /alert sound.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int main() 4 | { 5 | cout<<"\a"; 6 | } 7 | -------------------------------------------------------------------------------- /codechef/JAN13/sss.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int a[]; 6 | 7 | 8 | } 9 | -------------------------------------------------------------------------------- /splay_trees.zip: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dragonslayerv2/Competitive-Programming/HEAD/splay_trees.zip -------------------------------------------------------------------------------- /TEST/test2.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | printf("%d",'a'-'Z'); 5 | getchar(); 6 | } 7 | -------------------------------------------------------------------------------- /codechef/OCT14/TRIPS/TRIPS.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(){ 5 | 6 | } 7 | -------------------------------------------------------------------------------- /codeforces/gym/Week2/p10.cpp: -------------------------------------------------------------------------------- 1 | 4 4 2 | +-+ +-+ 3 | | | | 4 | + +-+-+ 5 | | | 6 | +-+-+-+ 7 | | | 8 | +-+-+-+ 9 | -------------------------------------------------------------------------------- /MO algo template.zip: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dragonslayerv2/Competitive-Programming/HEAD/MO algo template.zip -------------------------------------------------------------------------------- /Testing environment/testchekerpalin.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | 6 | -------------------------------------------------------------------------------- /codechef/DEC13/test2.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | 5 | int main() 6 | { 7 | 8 | } 9 | -------------------------------------------------------------------------------- /codechef/NOV14/p9.zip: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dragonslayerv2/Competitive-Programming/HEAD/codechef/NOV14/p9.zip -------------------------------------------------------------------------------- /fibonicci checking.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dragonslayerv2/Competitive-Programming/HEAD/fibonicci checking.cpp -------------------------------------------------------------------------------- /spoj/pt07F/in2.cpp: -------------------------------------------------------------------------------- 1 | 1 2 | 10 3 | 4 10 4 | 8 9 5 | 2 6 6 | 2 4 7 | 4 8 8 | 3 10 9 | 3 7 10 | 1 8 11 | 5 6 12 | -------------------------------------------------------------------------------- /suffix arrays (linear algorithm(.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | 6 | -------------------------------------------------------------------------------- /swap.cpp: -------------------------------------------------------------------------------- 1 | inline void swap(int *a,int *b) 2 | { 3 | int temp=*a; 4 | *a=*b; 5 | *b=temp; 6 | } 7 | -------------------------------------------------------------------------------- /TEST/shobhittest.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int a; 5 | printf("%d",a=3); 6 | getchar(); 7 | } 8 | -------------------------------------------------------------------------------- /TEST/sizeof character.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | printf("%d",sizeof('A')); 5 | getchar(); 6 | } 7 | -------------------------------------------------------------------------------- /TEST/test.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | printf("%lld",(long long)1<<40); 5 | getchar(); 6 | } 7 | -------------------------------------------------------------------------------- /codechef/NOV13/kriti.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dragonslayerv2/Competitive-Programming/HEAD/codechef/NOV13/kriti.cpp -------------------------------------------------------------------------------- /hackerrank/sastra/p6.zip: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dragonslayerv2/Competitive-Programming/HEAD/hackerrank/sastra/p6.zip -------------------------------------------------------------------------------- /knapsack.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | 5 | 6 | struct item 7 | { 8 | 9 | }; 10 | -------------------------------------------------------------------------------- /Google APAC 2/test.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(){ 5 | printf("%d %d",'(',')'); 6 | } 7 | -------------------------------------------------------------------------------- /TEST/aaa.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int sockets(int domain,int type,int protocol); 5 | 6 | -------------------------------------------------------------------------------- /TEST/sockets.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int sockets(int domain,int type,int protocol); 5 | 6 | -------------------------------------------------------------------------------- /TEST/test string size.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | printf("%d",sizeof("SHOBHIT")); 5 | getchar(); 6 | } 7 | -------------------------------------------------------------------------------- /codeforces/Match 278/p1.zip: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dragonslayerv2/Competitive-Programming/HEAD/codeforces/Match 278/p1.zip -------------------------------------------------------------------------------- /codeforces/Match 278/p2.zip: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dragonslayerv2/Competitive-Programming/HEAD/codeforces/Match 278/p2.zip -------------------------------------------------------------------------------- /hackerrank/ALGO/p2.txdt.cpp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dragonslayerv2/Competitive-Programming/HEAD/hackerrank/ALGO/p2.txdt.cpp -------------------------------------------------------------------------------- /hackerrank/sastra/p10.zip: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dragonslayerv2/Competitive-Programming/HEAD/hackerrank/sastra/p10.zip -------------------------------------------------------------------------------- /Testing environment/adssad.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() 5 | { 6 | cout<<'\0'<<'a'; 7 | } 8 | -------------------------------------------------------------------------------- /TEST/junk.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | 6 | printf("%d"); 7 | getchar(); 8 | 9 | } 10 | -------------------------------------------------------------------------------- /amfib testing/fibo.py: -------------------------------------------------------------------------------- 1 | a=0 2 | b=1 3 | for i in range(1,1000): 4 | temp=a+b 5 | a=b 6 | b=temp 7 | print temp 8 | 9 | -------------------------------------------------------------------------------- /TEST/pointer size.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | printf("%d %d",sizeof(int),sizeof(long long *)); 5 | getchar(); 6 | } 7 | -------------------------------------------------------------------------------- /codechef/COOK26/saad.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | printf("%d %d",sizeof(long long),sizeof(int)); 5 | getchar(); 6 | } 7 | -------------------------------------------------------------------------------- /DP practice/Contest 1/DP practice 1.zip: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/dragonslayerv2/Competitive-Programming/HEAD/DP practice/Contest 1/DP practice 1.zip -------------------------------------------------------------------------------- /TEST/assert test.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | int main() 4 | { 5 | int i=0; 6 | assert(i>0); 7 | getchar(); 8 | } 9 | -------------------------------------------------------------------------------- /codechef/COOK50/p5/p1.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int main(){ 7 | 8 | } 9 | -------------------------------------------------------------------------------- /codechef/JUL13/sadadadaads.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | cout< 2 | using namespace std; 3 | 4 | 5 | int main() 6 | { 7 | system("C:\\windows\\explorer.exe"); 8 | } 9 | -------------------------------------------------------------------------------- /codechef/NOV13/da.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | 5 | int main() 6 | { 7 | cout<<1000000000000000000LL; 8 | 9 | } 10 | -------------------------------------------------------------------------------- /TEST/gaurav.h: -------------------------------------------------------------------------------- 1 | #include 2 | void bla() 3 | { 4 | printf("shobhit"); 5 | getchar(); 6 | } 7 | #pragma startup bla 8 | #pragma exit bla 9 | 10 | -------------------------------------------------------------------------------- /codechef/MAY14/FUNAGP/adsdas.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() 5 | { 6 | long long R=1000000000LL; 7 | cout< 2 | 3 | int a[]; 4 | 5 | int main() 6 | { 7 | a[0]=1; 8 | printf("%d",sizeof(a)); 9 | return 0; 10 | } 11 | -------------------------------------------------------------------------------- /codechef/COOK27/asadsa.cpp: -------------------------------------------------------------------------------- 1 | 2 | #include 3 | using namespace std; 4 | int main() 5 | { 6 | printf("%llf",75.47784648840000); 7 | getchar(); 8 | } 9 | -------------------------------------------------------------------------------- /codeforces/472/p5.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(){ 5 | int n; 6 | cin>>n; 7 | vector bitCount(32); 8 | 9 | } 10 | -------------------------------------------------------------------------------- /TEST/empty array.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int a[]; 4 | 5 | int main() 6 | { 7 | a[0]=1; 8 | // printf("%d",sizeof(a)); 9 | return 0; 10 | } 11 | -------------------------------------------------------------------------------- /ad.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() 5 | { 6 | int t=5; 7 | while(t>=0) 8 | { 9 | t=t--; 10 | cout< 2 | using namespace std; 3 | 4 | void func(){ 5 | 6 | } 7 | 8 | int main(){ 9 | thread t(func); 10 | } 11 | -------------------------------------------------------------------------------- /topcoder/SRM/ad.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main(){ 6 | cout<<(((long long )1)<<50); 7 | vector a(0); 8 | } 9 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | codes 2 | ===== 3 | This repository contains my backup of algorithmic codes, and various solutions to various questions submitted by me on various programming websites. 4 | -------------------------------------------------------------------------------- /TEST/Untitled1.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int a; 5 | a=2,1,3; 6 | printf("%d",a); 7 | getchar(); 8 | return 0; 9 | 10 | } 11 | -------------------------------------------------------------------------------- /codechef/JUN13/sadas.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | int a[100]; 5 | 6 | int main() 7 | { 8 | memset(a,0,sizeof(a)); 9 | } 10 | -------------------------------------------------------------------------------- /codechef/MAY14/FUNAGP/int_max_check.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | cout<::max(); 8 | } 9 | -------------------------------------------------------------------------------- /codeforces/gym/Week2/straight.in: -------------------------------------------------------------------------------- 1 | 2 | 2 2 3 | +-+ 4 | | | 5 | +-+ 6 | 7 | 4 4 8 | +-+-+-+ 9 | | 10 | + +-+-+ 11 | | | | | 12 | +-+ +-+ 13 | | 14 | +-+-+-+ 15 | -------------------------------------------------------------------------------- /bincount.cpp: -------------------------------------------------------------------------------- 1 | int bincount(int n) 2 | { 3 | int count=0; 4 | while(n) 5 | { 6 | count+=n&1; 7 | n=n>>1; 8 | } 9 | return count; 10 | } 11 | -------------------------------------------------------------------------------- /codechef/AUG14/CRAWA/yesprinter.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(){ 5 | int t; 6 | cin>>t; 7 | while(t--) 8 | cout<<"YES"< 2 | using namespace std; 3 | 4 | 5 | int main(){ 6 | int x=2,y=-1,z=0; 7 | 8 | printf("%d",(z>=y)?(x>=y)?(y>=z)?23:(z>=y 2 | using namespace std; 3 | 4 | int min(int a,int b) 5 | { 6 | return 100; 7 | } 8 | int main() 9 | { 10 | cout< 2 | int main() 3 | { 4 | int a; 5 | a=(1,2,3); 6 | printf("%d",a); 7 | a=1,2,3; 8 | printf("%d",a); 9 | getchar(); 10 | } 11 | -------------------------------------------------------------------------------- /codechef/JUL13/sadas.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int main() 7 | { 8 | while(!kbhit()) 9 | { 10 | } 11 | } 12 | -------------------------------------------------------------------------------- /codechef/OCT13/adads.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | 5 | int main() 6 | { 7 | long long a=1000000000; 8 | long long b=1000000000; 9 | cout< 2 | using namespace std; 3 | 4 | int func(int i=0){ 5 | cout< 2 | using namespace std; 3 | 4 | int main(){ 5 | freopen("test.txt","w",stdout); 6 | for(int i=100;i>=1;i--) 7 | cout< 2 | using namespace std; 3 | 4 | int main(){ 5 | int n; 6 | cin>>n; 7 | map stringCounts; 8 | long long counts=0; 9 | } 10 | -------------------------------------------------------------------------------- /TEST/inline test.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | inline int func(int z) 3 | {z++;} 4 | int main() 5 | { 6 | int z=1; 7 | func(z); 8 | printf("%d",z); 9 | getchar(); 10 | } 11 | -------------------------------------------------------------------------------- /codechef/NOV14/test.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main(){ 6 | cout<<10000000000000000000LL; 7 | cout<::max(); 8 | } 9 | -------------------------------------------------------------------------------- /TEST/gaurav.cpp: -------------------------------------------------------------------------------- 1 | 2 | #include"gaurav.h" 3 | 4 | 5 | void shobhit() 6 | { 7 | printf("hi..."); 8 | 9 | } 10 | #pragma startup shobhit 11 | int main() 12 | { 13 | getchar(); 14 | } 15 | -------------------------------------------------------------------------------- /codechef/sadfadfs.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | 5 | 6 | struct x 7 | { 8 | int y:1; 9 | }; 10 | int main() 11 | { 12 | x ob; 13 | cout< 2 | using namespace std; 3 | 4 | int main() 5 | { 6 | char a[100]; 7 | cin.get(a,100); 8 | cout< 2 | 3 | int main(){ 4 | int t,n; 5 | scanf("%d",&t); 6 | while(t--){ 7 | scanf("%d",&n); 8 | printf("%s\n",(n&(-n))==n?"YES":"NO"); 9 | } 10 | } 11 | -------------------------------------------------------------------------------- /pentium archi/file1.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include"rdtsc.h" 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | unsigned long long a,b; 8 | a=rdtsc(); 9 | b=rdtsc(); 10 | cout< 2 | 3 | int main() 4 | { 5 | int a,b; 6 | scanf("%d %d",&a,&b); 7 | int dif=a-b; 8 | printf("%d",(dif/10)*10+(dif%10==2?1:2)); 9 | return 0; 10 | } 11 | -------------------------------------------------------------------------------- /hackerrank/codegon/codeagon3.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | using namespace std; 7 | 8 | int main(){ 9 | ceil(2.1); 10 | } 11 | -------------------------------------------------------------------------------- /codechef/NITA05.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | int n,m,a; 8 | cin>>n>>m>>a; 9 | cout< 2 | #include 3 | using namespace std; 4 | 5 | 6 | int main() 7 | { 8 | while(1) 9 | { 10 | double a; 11 | cin>>a; 12 | cout< 2 | using namespace std; 3 | 4 | int main(){ 5 | int t; 6 | cin>>t; 7 | while(t--){ 8 | string x; 9 | cin>>x; 10 | cout< 2 | #include 3 | #include 4 | 5 | int main() 6 | { 7 | srand(time(NULL)); 8 | for(int i=0;i<11;i++) 9 | { 10 | printf("%d",rand()%2); 11 | 12 | } 13 | 14 | 15 | } 16 | -------------------------------------------------------------------------------- /hiding a window.cpp: -------------------------------------------------------------------------------- 1 | 2 | #include 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | HWND window; 8 | AllocConsole(); 9 | window=FindWindowA("ConsoleWindowClass",NULL); 10 | ShowWindow(window,0); 11 | } 12 | -------------------------------------------------------------------------------- /integer reverse.cpp: -------------------------------------------------------------------------------- 1 | inline int numrev(int n) 2 | { 3 | int c=n; 4 | int x=0; 5 | while(c) 6 | { 7 | x=x*10+c%10; 8 | c/=10; 9 | } 10 | return x; 11 | } 12 | -------------------------------------------------------------------------------- /codechef/COOK51/p1.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main(){ 6 | int t; 7 | cin>>t; 8 | while(t--){ 9 | long long n; 10 | cin>>n; 11 | cout<<(n+(n*(n+1))/2)< 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int main() 7 | { 8 | int t; 9 | cin>>t; 10 | while(t--) 11 | { 12 | int n,k; 13 | cin>>n>>k; 14 | } 15 | } 16 | -------------------------------------------------------------------------------- /codechef/testgen.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int main(){ 7 | srand(time(NULL)); 8 | int t=10; 9 | cout< 2 | using namespace std; 3 | 4 | 5 | int main() 6 | { 7 | int t; 8 | cin>>t; 9 | while(t--) 10 | { 11 | int a,b; 12 | cin>>a>>b; 13 | cout< 2 | using namespace std; 3 | 4 | int main() 5 | { 6 | int t; 7 | cin>>t; 8 | while(t--) 9 | { 10 | long long a,b,c,t; 11 | cin>>a>>b>>c>>t; 12 | cout< 2 | using namespace std; 3 | 4 | int main() 5 | { 6 | long long a; 7 | cin>>a; 8 | int res=(a%6); 9 | if(res==0||res==1||res==3) 10 | cout<<"yes"; 11 | else 12 | cout<<"no"; 13 | } 14 | -------------------------------------------------------------------------------- /TEST/opfile.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() 5 | { 6 | ofstream test("test.txt"); 7 | test<<"100000\n"; 8 | for(int i=1;i<=100000;i++) 9 | { 10 | test< 2 | int main() 3 | { 4 | int n; 5 | while(1) 6 | { 7 | scanf("%d",&n); 8 | if(n==42) break; 9 | printf("%d\n",n); 10 | } 11 | } 12 | -------------------------------------------------------------------------------- /LCM.cpp: -------------------------------------------------------------------------------- 1 | // FUnctions to find nLCM and GCD using Euclids Division Lemma 2 | 3 | 4 | int GCD(int a, int b) 5 | { 6 | if (b==0) return a; 7 | return GCD(b,a%b); 8 | } 9 | 10 | int LCM(int a, int b) 11 | { 12 | return b*a/GCD(a,b); 13 | } 14 | 15 | -------------------------------------------------------------------------------- /codechef/natural number printers.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | FILE *p; 5 | p=fopen("aa.txt","w"); 6 | for(int i=1;i<=5000000;i++) 7 | { 8 | fprintf(p,"%d, ",i); 9 | } 10 | fclose(p); 11 | 12 | } 13 | -------------------------------------------------------------------------------- /pallindrome check.cpp: -------------------------------------------------------------------------------- 1 | inline int ispallindrome(int n) 2 | { 3 | int x=0,c=n; 4 | while(c) 5 | { 6 | x=x*10+c%10; 7 | c/=10; 8 | } 9 | if(x==n) return 1; 10 | else return 0; 11 | } 12 | -------------------------------------------------------------------------------- /virtual contests/session 4/1.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | 5 | int main() 6 | { 7 | int n,k; 8 | cin>>n>>k; 9 | for(int i=k+1;i>=1;i--) 10 | cout< 2 | #include 3 | #define MAX 100000 4 | 5 | int flags[MAX/32+2]; 6 | 7 | #define isSet(n) flags[n>>5]&(1<<(n&31)) 8 | #define unset(n) flags[n>>5] &= ~(1<<(n&31)) 9 | #define set(n) flags[n>>5]|=(1<<(n&31)) 10 | 11 | -------------------------------------------------------------------------------- /TEST/array size in function.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | void func(int m[100][100]) 4 | { 5 | printf("%d ",sizeof(m)); 6 | } 7 | 8 | int main() 9 | { 10 | int m[100][100]; 11 | func(m); 12 | printf("%d",sizeof(m)); 13 | getchar(); 14 | } 15 | -------------------------------------------------------------------------------- /Testing environment/shobhit.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | clock_t start=clock(); 8 | for(int i=0;i<1000000000;i++); 9 | clock_t end=clock(); 10 | 11 | cout<<(end-float(start))/CLK_TCK; 12 | 13 | } -------------------------------------------------------------------------------- /codechef/COOK50/p4/testgen.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int main(){ 4 | int t; 5 | t=5; 6 | cout< 2 | using namespace std; 3 | 4 | int main(){ 5 | int fibo[100]; 6 | fibo[0]=fibo[1]=1; 7 | for(int i=2;i<100;i++) 8 | { 9 | fibo[i]=fibo[i-1]+fibo[i-2]; 10 | cout< 2 | #include 3 | using namespace std; 4 | 5 | 6 | int main() 7 | { 8 | cout<<10000< 2 | #define MAX 1000 3 | int flags[MAX]; 4 | 5 | #define isSet(n) flags[n>>5]&(1<<(n&31)) 6 | #define unset(n) flags[n>>5] &= ~(1<<(n&31)) 7 | #define set(n) flags[n>>5]|=(1<<(n&31)) 8 | 9 | int main() 10 | { 11 | 12 | } 13 | -------------------------------------------------------------------------------- /codechef/Epiphany 2012/epic1.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | int n; 5 | scanf("%d",&n); 6 | int count=0; 7 | while(n) 8 | { 9 | count+=n&1; 10 | n=n>>1; 11 | } 12 | printf("%d",count); 13 | return 0; 14 | } 15 | -------------------------------------------------------------------------------- /codechef/JUL13/ads.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | 6 | int main() 7 | { 8 | array a; 9 | a[0]=1; 10 | a[0]=2; 11 | a[0]=3; 12 | a[0]=4; 13 | a[0]=5; 14 | 15 | for(int &x:a) 16 | { 17 | cout< 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int main(){ 7 | srand(time(NULL)); 8 | int t=1; 9 | cout< 2 | #include 3 | #include 4 | #include 5 | using namespace std; 6 | 7 | int main(){ 8 | int n=1000; 9 | cout< 2 | int main() 3 | { 4 | int t; 5 | scanf("%d",&t); 6 | int n; 7 | while(t--) 8 | { 9 | scanf("%d",&n); 10 | printf("%s",(n%2?"BOB\n":"ALICE\n")); 11 | } 12 | return 0; 13 | } 14 | -------------------------------------------------------------------------------- /codeforces/Match 478/p1.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() 5 | { 6 | int sum=0; 7 | for(int i=0;i<5;i++){ 8 | int x; 9 | cin>>x; 10 | sum+=x; 11 | } 12 | if(sum%5==0){ 13 | cout< 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | 7 | int main() 8 | { 9 | srand(time(NULL)); 10 | string a; 11 | for(int i=0;i<100;i++) 12 | a+='a'+(rand()%10); 13 | cout< 2 | using namespace std; 3 | 4 | 5 | int main() 6 | { 7 | cerr<<"Kunal ullu ka patha"<>t; 10 | while(t--) 11 | { 12 | long long c,d; 13 | cin>>c>>d; 14 | 15 | cout<<(c*d)-(c+d)< 2 | 3 | int main() 4 | { 5 | int t; 6 | scanf("%d",&t); 7 | while(t--) 8 | { 9 | int n; 10 | scanf("%d",&n); 11 | printf("%d\n",n/2+1); 12 | } 13 | return 0; 14 | } 15 | -------------------------------------------------------------------------------- /codechef/MAY14/LEBALONS/LEBALONS_2.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() 5 | { 6 | int t=1; 7 | cout< 2 | using namespace std; 3 | int main() 4 | { 5 | ofstream test("test.txt"); 6 | test<<10000< 2 | #include 3 | using namespace std; 4 | 5 | map >,int> DP; 6 | int main() 7 | { 8 | int t; 9 | cin>>t; 10 | while(t--) 11 | { 12 | int n; 13 | cin>>n; 14 | cout< 2 | #include 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | int t; 8 | cin>>t; 9 | while(t--) 10 | { 11 | 12 | int b,ls; 13 | cin>>b>>ls; 14 | cout< 2 | #include 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | long long a,b,w,x,c; 8 | cin>>a>>b>>w>>x>>c; 9 | long long p=0; 10 | if(a 2 | using namespace std; 3 | 4 | int main(){ 5 | int n; 6 | cin>>n; 7 | int count = 0; 8 | while(n--){ 9 | int in,capacity; 10 | cin>>in>>capacity; 11 | if(in+2<=capacity) 12 | count++; 13 | } 14 | cout< 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int main(){ 7 | srand(time(NULL)); 8 | int t=10; 9 | cout< 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | 7 | int main() 8 | { 9 | srand(time(NULL)); 10 | string a; 11 | for(int i=0;i<20;i++) 12 | a+='a'+(rand()%5); 13 | cout< 2 | 3 | int main() 4 | { 5 | 6 | char p[]="Shobhit"; 7 | fact(5); 8 | changestr(p); 9 | } 10 | 11 | 12 | 13 | int fact(int) 14 | { 15 | cout<<"hi..."; 16 | 17 | 18 | } 19 | 20 | 21 | char *changestr(char *p) 22 | { 23 | printf(p); 24 | } 25 | -------------------------------------------------------------------------------- /trie.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | struct node 5 | { 6 | bool is_leaf; 7 | vector character; 8 | }; 9 | 10 | node *root=NULL; 11 | 12 | 13 | void insert_trie(node *root,char *data) 14 | { 15 | for(int i=0;data[i]!=NULL;i++) 16 | { 17 | 18 | } 19 | } 20 | -------------------------------------------------------------------------------- /adsads.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | 7 | int main() 8 | { 9 | array x; 10 | 11 | for(int &i:x) 12 | { 13 | cin>>i; 14 | } 15 | sort(x.begin(),x.end()); 16 | for(int &i:x) 17 | { 18 | cout< 2 | 3 | #define islower(x) (x&0x20) 4 | #define isupper(x) (!(x&0x20)) 5 | #define tolower(x) (x|0x20) 6 | #define toupper(x) (x&~(0x20)) 7 | #define switchcase(x) (x^0x20) 8 | 9 | int main() 10 | { 11 | printf("%c",switchcase('a')); 12 | getchar(); 13 | } 14 | -------------------------------------------------------------------------------- /codeforces/471/p3.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(){ 5 | long long a; 6 | cin>>a; 7 | a*=2; 8 | long long count=0; 9 | for(long long f=1;f<=2000000;f++){ 10 | if(a-f-3*f*f>=0&&(a-f-3*f*f)%6==0){ 11 | count++; 12 | } 13 | } 14 | cout< 2 | #include 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | int n; 8 | cin>>n; 9 | vector > matrix(n,vector(n)); 10 | for(int i=0;i>matrix[i][j]; 13 | 14 | } 15 | -------------------------------------------------------------------------------- /Testing environment/distict pallin check/testgen2.cpp: -------------------------------------------------------------------------------- 1 | 2 | #include 3 | #include 4 | #include 5 | using namespace std; 6 | 7 | 8 | int main() 9 | { 10 | srand(time(NULL)); 11 | string a; 12 | for(int i=0;i<100;i++) 13 | a+='a'+(rand()%5); 14 | cout< 2 | #include 3 | 4 | int main() 5 | { 6 | int a[10][10]={1}; 7 | 8 | printf("%d\n",&a); 9 | printf("%d\n",a); 10 | printf("%d\n",*a); 11 | 12 | printf("%d",*(*a)); 13 | getch(); 14 | } 15 | 16 | -------------------------------------------------------------------------------- /codechef/aug13/testdelnms.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int main() 7 | { 8 | freopen("test.txt","w",stdout); 9 | cout<<46< 2 | #include 3 | #include 4 | 5 | using namespace std; 6 | 7 | int main() 8 | { 9 | int a[5]; 10 | for(int i=0;i<5;i++) 11 | { 12 | cin>>a[i]; 13 | } 14 | 15 | sort(a,a+5); 16 | for(int i=0;i<5;i++) 17 | { 18 | cout< 2 | #include 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | int a[]={5,6,7,8,3,45,6,7,7,5,4}; 8 | 9 | sort(a,a+sizeof(a)/4); 10 | 11 | for(int *p=a;p 2 | int main() 3 | { 4 | int x; 5 | float y; 6 | scanf("%d %f",&x,&y); 7 | if(x%5==0&&((float)(x+0.50) 2 | #include 3 | using namespace std; 4 | 5 | 6 | int main() 7 | { 8 | int n=1+(rand()%10000); 9 | int k=rand()%1000; 10 | cout< 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | #define nMAX 1000000 7 | int main(){ 8 | srand(time(NULL)); 9 | int n=nMAX; 10 | for(int i=0;i 2 | 3 | 4 | int sum(int a[],int n,int i=0,int s=0) 5 | { 6 | if(i==n) return s; 7 | return sum(a,n,i+1,s)+sum(a,n,i+1,s+a[i]); 8 | } 9 | int main() 10 | { 11 | int a[]={1,2,3,4}; 12 | printf("%d",sum(a,sizeof(a)/sizeof(*a))); 13 | getchar(); 14 | } 15 | -------------------------------------------------------------------------------- /assad.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main(){int arr[2][3]={2,1,4,3,6,5}; 6 | int i,j; 7 | for(i = 0 ;i<3;i++){ 8 | for(j=1;j<++i+2;j++){ 9 | printf("%d",arr[1][0]); 10 | break; 11 | } 12 | for(i=j;i<4;i++) 13 | cout< 2 | using namespace std; 3 | int main(){ 4 | srand(time(NULL)); 5 | int t=100000; 6 | cout< 2 | int main() 3 | { 4 | int i=1; 5 | long long sum1=0; 6 | long long sum2=0; 7 | for(int i=1;i<=100;i++) 8 | { 9 | sum1+=i*i; 10 | sum2+=i; 11 | } 12 | sum2*=sum2; 13 | printf("%lld",-1*sum1+sum2); 14 | getchar(); 15 | } 16 | -------------------------------------------------------------------------------- /subset sum(O(2^n).cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | 4 | int sum(int a[],int n,int i=0,int s=0) 5 | { 6 | if(i==n) return s; 7 | return sum(a,n,i+1,s)+sum(a,n,i+1,s+a[i]); 8 | } 9 | int main() 10 | { 11 | int a[]={1,2,3,4}; 12 | printf("%d",sum(a,sizeof(a)/sizeof(*a))); 13 | getchar(); 14 | } 15 | -------------------------------------------------------------------------------- /TEST/gcf test.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | inline int gcf(int a, int b) 4 | { 5 | int temp; 6 | while(b) 7 | { 8 | temp=a; 9 | a=b; 10 | b=temp%b; 11 | } 12 | return a; 13 | } 14 | 15 | int main() 16 | { 17 | printf("%d",gcf(2,3)); 18 | getchar(); 19 | } 20 | -------------------------------------------------------------------------------- /codechef/OCT14/QString/testgen.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int main(){ 4 | srand(time(NULL)); 5 | int t=100; 6 | cout< 2 | using namespace std; 3 | 4 | int main() 5 | { 6 | int t; 7 | cin>>t; 8 | while(t--) 9 | { 10 | int n; 11 | cin>>n; 12 | int root=0; 13 | while(n--) 14 | { 15 | int a,b; 16 | cin>>a>>b; 17 | root+=a-b; 18 | } 19 | cout< 2 | using namespace std; 3 | 4 | int main(){ 5 | int t; 6 | cin>>t; 7 | while(t--){ 8 | int n; 9 | cin>>n; 10 | bool isPossbile=false; 11 | while(n%10==0) 12 | n/=10; 13 | if(n==1) 14 | cout<<"NO"< 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int main(){ 7 | set values; 8 | int prevN; 9 | cin>>prevN; 10 | int n; 11 | while(cin>>n){ 12 | values.insert(abs(n-prevN)); 13 | prevN=n; 14 | } 15 | cout< 2 | 3 | #define btog(n) (n^(n>>1)) 4 | 5 | 6 | int main() 7 | { 8 | int t; 9 | scanf("%d",&t); 10 | while(t--) 11 | { 12 | int n; 13 | scanf("%d",&n); 14 | printf("%d\n",btog(n)); 15 | } 16 | return 0; 17 | } 18 | -------------------------------------------------------------------------------- /sdsf.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | 7 | int main() 8 | { 9 | int a[5]; 10 | int n; 11 | cin>>n; 12 | 13 | for(int i=0;i>a[i]; 16 | } 17 | sort(a,a+n); 18 | for(int i=0;i 2 | using namespace std; 3 | 4 | int main() 5 | { 6 | int t; 7 | cin>>t; 8 | 9 | while(t--) 10 | { 11 | double x; 12 | cin>>x; 13 | for(int i=1;1;i++) 14 | { 15 | if((x*i)==(long long)(x*i)) 16 | { 17 | cout< 2 | #include 3 | 4 | struct 5 | { 6 | char x; 7 | char y; 8 | double z; 9 | 10 | 11 | 12 | } node; 13 | int main() 14 | { 15 | printf("%d\n",&(node.x)); 16 | printf("%d\n",&(node.y)); 17 | printf("%d\n",&(node.z)); 18 | getch(); 19 | 20 | } 21 | -------------------------------------------------------------------------------- /Testing environment/adsads.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int main() 7 | { 8 | int t=500000; 9 | ofstream outfile("test.txt"); 10 | outfile< 2 | using namespace std; 3 | 4 | int main() 5 | { 6 | long long n; 7 | cin>>n; 8 | long long sum=0; 9 | for(int i=0;i>x; 13 | sum+=x; 14 | } 15 | 16 | if(sum*2==n*(n+1)) 17 | cout<<"YES"< 2 | 3 | #define btog(n) (n^(n>>1)) 4 | 5 | 6 | int main() 7 | { 8 | int t; 9 | scanf("%d",&t); 10 | while(t--) 11 | { 12 | int n; 13 | scanf("%d",&n); 14 | printf("%d\n",btog(n)); 15 | } 16 | return 0; 17 | } 18 | -------------------------------------------------------------------------------- /codeforces/Match 229/1.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | int n; 8 | cin>>n; 9 | 10 | map hor,ver; 11 | 12 | while(n--) 13 | { 14 | int x,y; 15 | cin>>x>>y; 16 | hor[x]++; 17 | ver[y]++; 18 | } 19 | cout< 2 | #include 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | clock_t start; 8 | clock_t end; 9 | 10 | start=clock(); 11 | //--------- 12 | int i=0; 13 | while(i<1000000) i++; 14 | //---------------- 15 | end=clock(); 16 | 17 | cout<<(float(end)-start)/CLOCKS_PER_SEC; 18 | } 19 | -------------------------------------------------------------------------------- /DP practice/Contest 2/PG.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | vector DP(101); 8 | DP[1]=1; 9 | for(int i=2;i<=100;i++) 10 | DP[i]=i*i+DP[i-1]; 11 | while(1) 12 | { 13 | int n; 14 | cin>>n; 15 | if(n==0) 16 | break; 17 | cout< 2 | #include 3 | int main() 4 | { 5 | int n; 6 | float f; 7 | scanf("%d %f",&n,&f); 8 | if((n)%5!=0||f<(float)n+0.50) 9 | printf("%.2f",f); 10 | else 11 | printf("%.2f",f-n-0.50); 12 | getch(); 13 | return 0; 14 | } 15 | -------------------------------------------------------------------------------- /codeforces/Match 268/codeforces/t2.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | int main() 4 | { 5 | srand(time(NULL)); 6 | int n=1+rand()%100000; 7 | int k=rand()%n+1; 8 | cout< 2 | 3 | inline long long fibo(int n) 4 | { 5 | long long a=1,b=a; 6 | long long temp; 7 | for(int i=0;i 2 | #include 3 | 4 | int main() 5 | { 6 | float a; 7 | for(int n=1;n<10;n++) 8 | { 9 | a=0.0; 10 | for(int r=1;r<=n;r++) 11 | { 12 | a+=pow((pow(2,r)+pow(0.5,r)),r); 13 | } 14 | printf("%f\n",a); 15 | } 16 | getchar(); 17 | } 18 | -------------------------------------------------------------------------------- /codechef/CODX2014/K.cpp: -------------------------------------------------------------------------------- 1 | 
#include<iostream>
 2 | using namespace std;
 3 | 
 4 | 
 5 | int main()
 6 | {
 7 | 	int t;
 8 | 	cin>>t;
 9 | 	while(t--)
10 | 	{
11 | 		long long a,b;
12 | 		cin>>a>>b;
13 | 		long long n=b-a+1;
14 | 		int first=n;
15 | 		int second=n-1;
16 | 		cout<<(n*(n-1))/2<<endl;
17 | 	}
18 | }
-------------------------------------------------------------------------------- /codechef/OCT14/potiontestgen.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int main(){ 7 | srand(time(NULL)); 8 | int t=1; 9 | cout<<"1"< 2 | using namespace std; 3 | 4 | int main() 5 | { 6 | int t; 7 | cin>>t; 8 | while(t--){ 9 | 10 | 11 | int n,i,ans,x; 12 | cin>>n; 13 | ans=0; 14 | for(i=0;i>x; 17 | ans=max(x,ans); 18 | } 19 | 20 | cout< 2 | using namespace std; 3 | int main() 4 | { 5 | srand(time(NULL)); 6 | int n=1+rand()%300000; 7 | cout< 2 | #include 3 | using namespace std; 4 | 5 | class GreaterGameDiv2{ 6 | int calc(vector snuke, vector sothe){ 7 | int count=0; 8 | for(int i=0;isothe[i]); 10 | return count; 11 | } 12 | }; 13 | int main(){ 14 | 15 | 16 | } 17 | -------------------------------------------------------------------------------- /codechef/AUG14/MOU2H/testgen.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int main(){ 7 | srand(time(NULL)); 8 | int t=3; 9 | cout< 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int main(){ 7 | srand(time(NULL)); 8 | int t=50; 9 | cout< 2 | 3 | int main() 4 | { 5 | int N,n,i; 6 | scanf("%d",&N); 7 | i=1; 8 | n=N; 9 | while(n) 10 | { 11 | n>>=1; 12 | i<<=1; 13 | } 14 | i>>=1; 15 | int ans=((N-i)*2)+1; 16 | printf("%d\n",ans); 17 | return 0; 18 | } 19 | -------------------------------------------------------------------------------- /Testing environment/testgen2.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | 7 | 8 | int main() 9 | { 10 | srand(time(NULL)); 11 | const int size=100; 12 | char a[size]; 13 | a[size-1]='\0'; 14 | for(int i=0;i 2 | #include 3 | using namespace std; 4 | 5 | char s[100005]; 6 | int main(){ 7 | ios::sync_with_stdio(false); 8 | int t; 9 | cin>>t; 10 | while(t--){ 11 | cin>>s; 12 | set distinct; 13 | for(int i=0;s[i];i++) 14 | distinct.insert(s[i]); 15 | cout< 2 | using namespace std; 3 | 4 | 5 | long long mod(long long a){ 6 | return a<0?-a:a; 7 | } 8 | int main(){ 9 | int t; 10 | cin>>t; 11 | while(t--){ 12 | long long e,o; 13 | cin>>e>>o; 14 | if(mod(3*e-2*o)%5==0) 15 | cout< 2 | using namespace std; 3 | 4 | #define MOD 1000000007 5 | int main() 6 | { 7 | int t; 8 | cin>>t; 9 | while(t--) 10 | { 11 | int n; 12 | cin>>n; 13 | long long count=1; 14 | for(int i=1;i<=n;i++) 15 | { 16 | count=count*(i*2-1); 17 | count%=MOD; 18 | } 19 | cout< 2 | 3 | using namespace std; 4 | int main() 5 | { 6 | int ans=-1; 7 | while(1) 8 | { 9 | char c=getchar(); 10 | if(c=='\n') break; 11 | if(c=='a') ans*=-1; 12 | else ans=-1; 13 | } 14 | printf("%s",ans==1?"TRUE":"FALSE"); 15 | 16 | } 17 | -------------------------------------------------------------------------------- /NITCONTEST3/Jindal and Numbers/testcaseGenerator.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | #define MAXQUERY 10 7 | int main() 8 | { 9 | freopen("test2.txt","w",stdout); 10 | srand(time(NULL)); 11 | cout< 2 | #include 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | int n; 8 | cin>>n; 9 | vector a(n); 10 | for(int i=0;i>a[i]; 12 | 13 | int maximum =0; 14 | for(int i=0;i 2 | #include 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | int t; 8 | cin>>t; 9 | while(t--) 10 | { 11 | int n; 12 | cin>>n; 13 | int x=INT_MIN; 14 | 15 | for(int i=0;i>a; 19 | x=max(x,a+i); 20 | } 21 | cout< 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int main() 7 | { 8 | srand(time(NULL)); 9 | int n,m,p; 10 | n=1+rand()%3; 11 | m=1+rand()%3; 12 | p=rand()%5; 13 | cout< 2 | 3 | 4 | int main() 5 | { 6 | int x,y;int t; 7 | scanf("%d",&t); 8 | while(t--) 9 | { 10 | 11 | scanf("%d %d",&x,&y); 12 | if(x==0||y==0) printf("0\n"); 13 | else printf("%d\n",x/2+y/2+1); 14 | } 15 | 16 | return 0; 17 | } 18 | -------------------------------------------------------------------------------- /kdtree testing.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | 6 | int main() 7 | { 8 | int n=10000; 9 | cout< 2 | using namespace std; 3 | 4 | int main() 5 | { 6 | int t; 7 | cin>>t; 8 | while(t--) 9 | { 10 | long long n; 11 | cin>>n; 12 | long long fivep=5; 13 | int count=0; 14 | while(fivep<=n) 15 | { 16 | count+=n/fivep; 17 | fivep*=5; 18 | } 19 | cout< 2 | using namespace std; 3 | 4 | int main(){ 5 | int t; 6 | cin>>t; 7 | while(t--){ 8 | int a,b; 9 | cin>>a>>b; 10 | 11 | int total=b-a+1; 12 | int errorCases=0; 13 | while(a%3!=1) 14 | a++; 15 | if(a<=b) 16 | errorCases=1+(b-a)/3; 17 | 18 | cout< 2 | using namespace std; 3 | 4 | template persistent_forward_list 5 | { 6 | public: 7 | typedef T value_type; 8 | private: 9 | struct node 10 | { 11 | value_type data; 12 | node *next; 13 | }; 14 | 15 | vector version_head; 16 | 17 | 18 | 19 | }; 20 | int main() 21 | { 22 | 23 | 24 | } 25 | -------------------------------------------------------------------------------- /topcoder/SRM/p1.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | class ChristmasTreeDecorationDiv2{ 5 | int solve(vector col, vector x, vector y){ 6 | int beautiful=0; 7 | for(int i=0;i 2 | 3 | inline unsigned long long gcd(unsigned long long a, unsigned long long b) 4 | { 5 | unsigned long long temp; 6 | while(b) 7 | { 8 | temp=a; 9 | a=b; 10 | b=temp%b; 11 | } 12 | return a; 13 | } 14 | 15 | int main() 16 | { 17 | printf("%d",gcf(1001,2431)); 18 | getchar(); 19 | } 20 | -------------------------------------------------------------------------------- /all combinartions.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() 5 | { 6 | char* children[]={"Ankit","Umesh","Shivam","Gambhir","Surbhi"}; 7 | for(int i=0;i<(1<<5);i++) 8 | { 9 | int n=i; 10 | for(int j=0;j<5;j++) 11 | { 12 | if(n&1) 13 | cout<>1; 16 | } 17 | cout< 2 | using namespace std; 3 | 4 | int main(){ 5 | int t; 6 | cin>>t; 7 | while(t--){ 8 | long long x,m,n; 9 | cin>>x>>m>>n; 10 | long long ans=0; 11 | long long last=1; 12 | for(int i=0;i<=m;i++){ 13 | ans+=last; 14 | last*=x; 15 | last%=n; 16 | ans%=n; 17 | } 18 | cout< 2 | #include 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | int t; 8 | cin>>t; 9 | while(t--) 10 | { 11 | long long n,l,r; 12 | cin>>n>>l>>r; 13 | long long k=floor(double(n)/l); 14 | if(k>=ceil(double(n)/r)) 15 | cout<<"Yes"; 16 | else 17 | cout<<"No"; 18 | cout< 2 | #include 3 | using namespace std; 4 | 5 | int main(){ 6 | freopen("test2.txt","r",stdin); 7 | int t; 8 | cin>>t; 9 | while(t--){ 10 | double p; 11 | double time; 12 | cin>>p>>time; 13 | //printf("%.4lf\n",pow(1+p,time/1440.0)exit'-1); 14 | printf("%.4lf\n",1-pow(1-p,time/1440.0)); 15 | } 16 | } 17 | -------------------------------------------------------------------------------- /loswecase.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | #define lowercase(x) (x&0x20) 4 | #define uppercase(x) (!(x&0x20)) 5 | #define tolower(x) (x|0x20) 6 | #define toupper(x) (x&~(0x20)) 7 | #define changecase(x) (x^0x20) 8 | 9 | 10 | 11 | int main() 12 | { 13 | printf("%c",toupper('a')); 14 | // printf("%d",uppercase('A')); 15 | getchar(); 16 | return 0; 17 | } 18 | 19 | -------------------------------------------------------------------------------- /codechef/CIELDIST.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | using namespace std; 4 | 5 | 6 | int main() 7 | { 8 | int t; 9 | cin>>t; 10 | while(t--) 11 | { 12 | int s,t,d; 13 | cin>>s>>t>>d; 14 | int sum; 15 | if(s+t==d||((s+t>d)&&(s+d>t)&&(d+t>s))) sum=0; 16 | else 17 | sum=d-(s+t); 18 | if(sum<0) sum*=-1; 19 | 20 | cout< 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int main() 7 | { 8 | srand(time(NULL)); 9 | int t=10; 10 | cout< 2 | #include 3 | #include 4 | #include 5 | using namespace std; 6 | //------------------------------------------ 7 | 8 | int main() 9 | { 10 | srand(time(NULL)); 11 | int n; 12 | n=rand()%10; 13 | cout< 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int main(){ 7 | srand(time(NULL)); 8 | int t=10; 9 | cout< 2 | 3 | #define max(a,b) a>b?a:b 4 | 5 | int solve(int n) 6 | { 7 | if(n==0) return 0; 8 | int a=solve(n/2)+solve(n/3)+solve(n/4); 9 | return max(a,n); 10 | } 11 | 12 | int main() 13 | { 14 | 15 | int n; 16 | while(scanf("%d",&n)>0) 17 | printf("=%d\n",solve(n)); 18 | return 0; 19 | } 20 | -------------------------------------------------------------------------------- /codechef/SEPT14/FACTORIZ/testgen.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int main(){ 7 | srand(time(NULL)); 8 | int t=1+rand()%10; 9 | cout< 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | 7 | int count[]={6,2,5,5,4,5,6,3,7,6}; 8 | int main() 9 | { 10 | int t; 11 | cin>>t; 12 | while(t--) 13 | { 14 | string n; 15 | cin>>n; 16 | long long total=0; 17 | for(int i=0;i 2 | using namespace std; 3 | #define MOD 1000000007 4 | long long arr[]={1,0,3,0,15,0,133,0,2025,0,37851,0,1030367,0,36362925,0,1606008513LL}; 5 | 6 | int main() 7 | { 8 | int n; 9 | cin>>n; 10 | 11 | long long solution=arr[n-1]; 12 | for(int i=1;i<=n;i++) 13 | { 14 | solution=(i*solution)%MOD; 15 | } 16 | cout< 2 | #include 3 | #include 4 | 5 | void print_number(int* myInt) { 6 | assert (myInt!=NULL); 7 | printf ("%d\n",*myInt); 8 | } 9 | 10 | int main () 11 | { 12 | int a=10; 13 | int * b = NULL; 14 | int * c = NULL; 15 | 16 | b=&a; 17 | // abort(); 18 | print_number (b); 19 | print_number (c); 20 | 21 | return 0; 22 | } 23 | -------------------------------------------------------------------------------- /Testing environment/ads.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | int n,m; 6 | scanf("%d %d",&n,&m); 7 | int a[100000]; 8 | for(int i=0;i1) 12 | { 13 | pos=(pos+(m-1))%n; 14 | for(int i=pos;i 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int main(){ 7 | srand(time(NULL)); 8 | int n; 9 | n=rand()%10+3; 10 | cout< 2 | #include 3 | 4 | int main() 5 | { 6 | for(int v=1;v<=10000;v++) 7 | { 8 | int max; 9 | for(int e=1;e 2 | 3 | int hi() 4 | { 5 | printf("hi.."); 6 | return 1; 7 | } 8 | 9 | int bye() 10 | { 11 | printf("byeee..."); 12 | return 1; 13 | } 14 | int x() 15 | { 16 | printf("x..."); 17 | return 1; 18 | } 19 | 20 | int main() 21 | { 22 | if(bye()||hi()||!x()) 23 | printf("hola"); 24 | getchar(); 25 | 26 | } 27 | -------------------------------------------------------------------------------- /TEST/te4st towers.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int solve(int from,int to,int n,int temp=2) 4 | { 5 | if(n>0) 6 | { 7 | solve(from, to-1, n-1,to); 8 | printf("%d=> %d---> %d\n",n,from,to); 9 | solve(to-1,to,n-1,from); 10 | } 11 | } 12 | 13 | int main() 14 | { 15 | int n; 16 | scanf("%d",&n); 17 | solve(1,4,n); 18 | fflush(stdin); 19 | getchar(); 20 | } 21 | -------------------------------------------------------------------------------- /codechef/BUY1GET1.py: -------------------------------------------------------------------------------- 1 | #!/usr/bin/python -tt 2 | def main(): 3 | t=input() 4 | for T in range(t): 5 | count=0 6 | d={} 7 | string=raw_input() 8 | 9 | for i in string: 10 | if i in d: 11 | del d[i] 12 | else: 13 | d[i]=0; 14 | count=count+1 15 | print count 16 | 17 | main() 18 | -------------------------------------------------------------------------------- /codechef/COOK33/AMMEAT2.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() 5 | { 6 | int t; 7 | cin>>t; 8 | while(t--) 9 | { 10 | int n,k; 11 | cin>>n>>k; 12 | 13 | if(k==1) 14 | cout< 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | 7 | int main() 8 | { 9 | srand(time(NULL)); 10 | int t=1; 11 | cout< 2 | #include 3 | using namespace std; 4 | 5 | 6 | 7 | int nCr[200][200]; 8 | 9 | void generatenCr(int n,long long MOD) 10 | { 11 | for(int i=0;i<=n;i++) 12 | for(int j=0;j<=i;j++) 13 | { 14 | if(i==0||j==0) 15 | nCr[i][j]=1; 16 | else 17 | nCr[i][j]=nCr[i-1][j-1]+nCr[i-1][j]; 18 | } 19 | } 20 | 21 | int main() 22 | { 23 | 24 | } 25 | -------------------------------------------------------------------------------- /tower of hanoi.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int solve(int from,int to,int n,int temp=2) 4 | { 5 | if(n>0) 6 | { 7 | solve(from, temp, n-1,to); 8 | printf("%d=> %d---> %d\n",n,from,to); 9 | solve(temp,to,n-1,from); 10 | } 11 | } 12 | 13 | int main() 14 | { 15 | int n; 16 | scanf("%d",&n); 17 | solve(1,18,n); 18 | fflush(stdin); 19 | getchar(); 20 | } 21 | -------------------------------------------------------------------------------- /codechef/JUN13/testgen.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | 5 | int main() 6 | { 7 | int t=1048576; 8 | cout<>1; 20 | } 21 | cout< 2 | using namespace std; 3 | 4 | int main(){ 5 | long long n,m; 6 | cin>>n>>m; 7 | long long max=((n-m)*(n-m+1))/2; 8 | long long min1=(n/m); 9 | min1*=(n/m-1); 10 | min1/=2; 11 | min1*=(m-n%m); 12 | long long min2=(n/m+1); 13 | min2*=(n/m); 14 | min2/=2; 15 | min2*=n%m; 16 | long long min=min1+min2; 17 | 18 | 19 | cout< 2 | using namespace std; 3 | 4 | 5 | typedef map > graph; 6 | int main(){ 7 | int t; 8 | cin>>t; 9 | for(int T=1;T<=t;T++){ 10 | cout<<"Case #"<>n; 20 | 21 | } 22 | -------------------------------------------------------------------------------- /codechef/APRL13/FCBARCA.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | #define MOD 1000000007 4 | int main() 5 | { 6 | int t; 7 | cin>>t; 8 | while(t--) 9 | { 10 | int n,k; 11 | cin>>k>>n; 12 | 13 | long long m=1; 14 | long long nm=0; 15 | 16 | while(k--) 17 | { 18 | long long tm=m; 19 | m=nm; 20 | nm=((nm*(n-1))%MOD+(tm*(n))%MOD)%MOD; 21 | } 22 | cout< 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | 7 | int main() 8 | { 9 | forward_list a; 10 | 11 | a.push_front(5); 12 | forward_list::iterator x=a.begin(); 13 | 14 | for(int i=0;i<10;i++) 15 | x=a.insert_after(x,i); 16 | 17 | for(forward_list::iterator i=a.begin();i!=a.end();i++) 18 | cout<<*i< 11 | 12 | inline unsigned int P(int n,int r) 13 | { 14 | unsigned int p=1; 15 | while(r--) 16 | p*=n--; 17 | return p; 18 | } 19 | 20 | int main() 21 | { 22 | printf("%d",P(5,3)); 23 | getchar(); 24 | 25 | } 26 | -------------------------------------------------------------------------------- /Discrete Optimisaion Coursera/Assignment 2 Puzzle Challenge/8 queens/BT_stat: -------------------------------------------------------------------------------- 1 | 0.031 2 | 0.031 3 | 0.016 4 | 0.031 5 | 0.031 6 | 0.016 7 | 0.031 8 | 0.016 9 | 0.031 10 | 0.031 11 | 0.016 12 | 0.016 13 | 0.047 14 | 0.031 15 | 0.125 16 | 0.031 17 | 0.719 18 | 0.063 19 | 6.156 20 | 0.11 21 | 1.766 22 | 0.234 23 | 2 24 | 2.235 25 | 16.704 26 | 6.828 27 | 131.708 28 | 28.455 29 | 211.001 30 | 381.836 31 | -------------------------------------------------------------------------------- /Testing environment/p1.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | string a; 8 | cin>>a; 9 | map M; 10 | for(int i=0;i>t; 15 | while(t--) 16 | { 17 | string b; 18 | cin>>b; 19 | cout<<(M.find(b)!=M.end())< 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int main() 7 | { 8 | int t; 9 | cin>>t; 10 | while(t--) 11 | { 12 | int n; 13 | vector height(n); 14 | for(int i=0;i>height[n]; 16 | 17 | vector heightdif(n-1); 18 | 19 | for(int i=0;i 2 | using namespace std; 3 | int main(){ 4 | srand(time(NULL)); 5 | int n = 1+rand()%100; 6 | cout< 2 | #include 3 | using namespace std; 4 | 5 | #define MOD 1000000007LL 6 | int main(){ 7 | vector ans(1000000+1); 8 | ans[1]=2; 9 | ans[2]=3; 10 | for(int i = 3;i>t; 17 | while(t--){ 18 | int n; 19 | cin>>n; 20 | cout< 2 | #include 3 | 4 | #define swap(a,b) (a^=b^=a^=b) 5 | 6 | void reverse(char a[],int h,int l=0) 7 | { 8 | if(l 2 | #include 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | vector f(40); 8 | vector g(40); 9 | 10 | f[0]=1; 11 | 12 | for(int i=2;i 2 | #include 3 | main() 4 | { 5 | int a,b,c; 6 | int count = 1; 7 | for (b=c=10;a="TFy!QJu ROo TNn(ROo)SLq SLq ULo+UHs UJq TNn*RPn/QPbEWS_JSWQAIJO^NBELPeHBFHT}TnALVlBLOFAkHFOuFETpHCStHAUFAgcEAelclcn^r^r\\tZvYxXyT|S~Pn SPm SOn TNn ULo0ULo#ULo-WHq!WFs XDt!"[b+++21];) 8 | { 9 | 10 | for(;a-->64;) 11 | putchar ( ++c=='Z' ? c = c/ 9:33^b&1); 12 | 13 | } 14 | system("pause"); 15 | return 0; 16 | } 17 | -------------------------------------------------------------------------------- /DP practice/Contest 3/A.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | map hash; 6 | long long solve(long long n) 7 | { 8 | if(n==0) 9 | return 0; 10 | if(hash.find(n)==hash.end()) 11 | hash[n]=max(n,solve(n/2)+solve(n/3)+solve(n/4)); 12 | return hash[n]; 13 | } 14 | int main() 15 | { 16 | int n; 17 | while(cin>>n) 18 | { 19 | hash.clear(); 20 | cout< 2 | #include 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | vector f(40); 8 | vector g(40); 9 | 10 | f[0]=1; 11 | 12 | for(int i=2;i 2 | using namespace std; 3 | 4 | 5 | int main() 6 | { 7 | int t; 8 | cin>>t; 9 | while(t--) 10 | { 11 | int n,k; 12 | cin>>n>>k; 13 | if(k==1) 14 | { 15 | cout<<1<n/2) 18 | { 19 | cout<<-1< 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int main(){ 7 | srand(time(NULL)); 8 | int t=10000; 9 | #define MAX 100; 10 | cout< 2 | using namespace std; 3 | 4 | string s; 5 | int main(){ 6 | int t; 7 | cin>>t; 8 | while(t--){ 9 | cin>>s; 10 | int first,last; 11 | first = 0; 12 | last = s.size()-1; 13 | while(last>=first){ 14 | if(s[last]!=s[first]) 15 | break; 16 | last--; 17 | first++; 18 | } 19 | if(last 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | 7 | int main() 8 | { 9 | freopen("test.txt","w",stdout); 10 | int n=10000; 11 | cout< 2 | #include 3 | using namespace std; 4 | 5 | #define MOD (1000000000+7) 6 | #define MAX 1000005 7 | int main() 8 | { 9 | vector fibo(MAX); 10 | fibo[1]=1; 11 | fibo[2]=1; 12 | 13 | for(int i=3;i>t; 18 | while(t--) 19 | { 20 | int n; 21 | cin>>n; 22 | cout< 2 | using namespace std; 3 | #define MOD 1000000007 4 | int main() 5 | { 6 | int t; 7 | cin>>t; 8 | long long a,b,c; 9 | while(t--) 10 | { 11 | 12 | cin>>a>>b>>c; 13 | if(a>c) a^=c^=a^=c; 14 | if(a>b) a^=b^=a^=b; 15 | if(b>c) b^=c^=b^=c; 16 | cout<<((((a%MOD)*(b-1)%MOD)%MOD)*((c-2)%MOD))%MOD< 2 | using namespace std; 3 | #define MOD 1000000007 4 | 5 | int main() 6 | { 7 | int t; 8 | cin>>t; 9 | long long a,b,c; 10 | while(t--) 11 | { 12 | 13 | cin>>a>>b>>c; 14 | if(a>c) a^=c^=a^=c; 15 | if(a>b) a^=b^=a^=b; 16 | if(b>c) b^=c^=b^=c; 17 | cout<<((((a%MOD)*(b-1)%MOD)%MOD)*((c-2)%MOD))%MOD< 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int main(){ 7 | srand(time(NULL)); 8 | int t=10; 9 | cout< 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int main(){ 7 | srand(time(NULL)); 8 | int n=5,m=4; 9 | cout< 2 | using namespace std; 3 | int main(){ 4 | int t; 5 | srand(time(NULL)); 6 | t=1000; 7 | cout< 2 | #include 3 | 4 | #include 5 | using namespace std; 6 | 7 | 8 | int main() 9 | { 10 | vector > > a; 11 | a.assign(5,list >()); 12 | a[2].push_back(vector(5)); 13 | a[2].push_back(vector(5)); 14 | a[2].push_back(vector(5)); 15 | auto i=a[2].begin(); 16 | i++; 17 | (*i)[2]=3; 18 | cout<<(*i).operator[](2); 19 | 20 | 21 | 22 | } 23 | -------------------------------------------------------------------------------- /codeforces/Match 226/p1.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int main() 7 | { 8 | int n,c; 9 | cin>>n>>c; 10 | vector a(n); 11 | for(int i=0;i>a[i]; 13 | 14 | int MAX=numeric_limits::min(); 15 | for(int i=0;i 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int main() 7 | { 8 | srand(time(NULL)); 9 | int t=2; 10 | cout< 2 | using namespace std; 3 | 4 | 5 | int main() 6 | { 7 | int t=3125; 8 | cout< 2 | #include 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | int t; 8 | cin>>t; 9 | while(t--) 10 | { 11 | int n; 12 | cin>>n; 13 | int a[n][n]; 14 | for(int i=0;i>a[i][j]; 17 | for(int i=n-2;i>=0;i--) 18 | for(int j=0;j<=i;j++) 19 | a[i][j]+=max(a[i+1][j],a[i+1][j+1]); 20 | cout< 2 | using namespace std; 3 | 4 | int main() 5 | { 6 | 7 | long long sum=0,ans=0, n,i; 8 | cin>>n; 9 | vector a(n); 10 | for(i=0;i>a[i]; 13 | sum+=a[i]; 14 | } 15 | ans=sum; 16 | sort(a.begin(),a.end()); 17 | for(i=0;i 2 | #include 3 | using namespace std; 4 | 5 | template set 6 | { 7 | map element; 8 | public: 9 | bool insert(const T &E) 10 | { 11 | if(element[E]) return false; 12 | else 13 | { 14 | element[E]=true; 15 | return true; 16 | } 17 | } 18 | 19 | bool isDere(const T &E) 20 | { 21 | return element[E]; 22 | } 23 | }; 24 | 25 | 26 | int main() 27 | { 28 | 29 | 30 | } 31 | -------------------------------------------------------------------------------- /TEST/mask.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | 4 | #define MASK 0x80000000 5 | 6 | 7 | int bintogray(int n) 8 | { 9 | int ans=0,bit; 10 | ans=bit=(n&MASK?1:0); 11 | printf("%d",bit); 12 | n<<=1; 13 | while(n) 14 | { 15 | ans<<1; 16 | int bit=(n&MASK)?1:0; 17 | ans|=bit; 18 | n<<=1; 19 | } 20 | return ans; 21 | } 22 | 23 | 24 | 25 | int main() 26 | { 27 | bintogray(21); 28 | } 29 | -------------------------------------------------------------------------------- /codechef/COINS.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | 4 | int recurse(unsigned long n) 5 | { 6 | if(n==0) return 0; 7 | else 8 | { 9 | 10 | unsigned long x=recurse(n/2)+recurse(n/3)+recurse(n/4); 11 | return x>n?x:n; 12 | } 13 | } 14 | int main() 15 | { 16 | unsigned long n; 17 | while(scanf("%lu",&n)>0) 18 | { 19 | printf("%lu\n",recurse(n)); 20 | } 21 | return 0; 22 | } 23 | -------------------------------------------------------------------------------- /codechef/LTIME16/p1.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int main(){ 7 | int t; 8 | cin>>t; 9 | while(t--){ 10 | int n; 11 | cin>>n; 12 | vector a(n); 13 | for(int i=0;i>a[i]; 15 | 16 | sort(a.begin(),a.end()); 17 | 18 | long long chef=0; 19 | for(int j=a.size()-1;j>=0;j-=2) 20 | chef+=a[j]; 21 | cout< 2 | #include 3 | using namespace std; 4 | 5 | int main(){ 6 | long long int n,sum=0,i,j,l,r,ar[300005],ans=0,tmp; 7 | scanf("%I64d",&n); 8 | for(i=0;i 2 | using namespace std; 3 | 4 | int main(){ 5 | int n; 6 | cin>>n; 7 | long long start, energy; 8 | start=energy=0; 9 | long long ans=0; 10 | while(n--){ 11 | long long height; 12 | cin>>height; 13 | start-=height; 14 | 15 | if(start+energy<0){ 16 | ans-=start+energy; 17 | energy=0; 18 | } 19 | else{ 20 | energy+=start; 21 | } 22 | start=height; 23 | } 24 | cout< 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int main(){ 7 | int n,m,k; 8 | cin>>n>>m>>k; 9 | vector values(n); 10 | for(int i=0;i>values[i]; 12 | 13 | sort(values.rbegin(),values.rend()); 14 | 15 | int count=0; 16 | while(k 2 | using namespace std; 3 | 4 | int main() 5 | { 6 | long long a,b,c; 7 | cin>>a>>b>>c; 8 | 9 | long long solution1=a/3+b/3+c/3; 10 | 11 | long long solution2=0; 12 | if(a&&b&&c) 13 | solution2=1+(a-1)/3+(b-1)/3+(c-1)/3; 14 | 15 | long long solution3=0; 16 | if(a>=2&&b>=2&&c>=2) 17 | solution3=2+(a-2)/3+(b-2)/3+(c-2)/3; 18 | 19 | cout< 2 | using namespace std; 3 | 4 | 5 | long long maxsub(int a[],int n) 6 | { 7 | long long global_sum=0; 8 | long long sum=0; 9 | for(int i=0;i 2 | #include 3 | using namespace std; 4 | 5 | #define MOD 1000000007 6 | 7 | int main(){ 8 | int t; 9 | cin>>t; 10 | while(t--){ 11 | long long n,k; 12 | cin>>k>>n; 13 | vector arr(n+1,1); 14 | arr[1]=1; 15 | arr[2]=k; 16 | for(int i=3;i<=n;i++){ 17 | for(int j=1;j 2 | using namespace std; 3 | #define MOD (1000000007LL) 4 | 5 | long long p(long long n,long long m) 6 | { 7 | if(m==0) return 1%MOD; 8 | long long x=p(n,m/2); 9 | if(m%2==0) 10 | return (x*x)%MOD; 11 | else 12 | return (((x*x)%MOD)*n)%MOD; 13 | } 14 | 15 | int main(){ 16 | int t; 17 | cin>>t; 18 | while(t--){ 19 | long long n; 20 | cin>>n; 21 | cout< 2 | #include 3 | #include 4 | main() 5 | { 6 | int a,b,c; 7 | int count = 1; 8 | for (b=c=10;a="TFy!QJu ROo TNn(ROo)SLq SLq ULo+UHs UJq TNn*RPn/QPbEWS_JSWQAIJO^NBELPeHBFHT}TnALVlBLOFAkHFOuFETpHCStHAUFAgcEAelclcn^r^r\\tZvYxXyT|S~Pn SPm SOn TNn ULo0ULo#ULo-WHq!WFs XDt!"[b+++21];) 9 | { 10 | 11 | for(;a-->64;) 12 | putchar ( ++c=='Z' ? c = c/ 9:33^b&1); 13 | //getch(); 14 | } 15 | system("pause"); 16 | return 0; 17 | } 18 | -------------------------------------------------------------------------------- /spoj/DANGER.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() 5 | { 6 | while(1) 7 | { 8 | string s; 9 | cin>>s; 10 | if(s=="00e0") 11 | break; 12 | 13 | int n=s[0]-'0'; 14 | n*=10; 15 | n+=s[1]-'0'; 16 | for(int i=0;i 2 | 3 | int f(int n) 4 | { 5 | int a=1; 6 | int b=1; 7 | int c; 8 | for(int i=3;i<=n;i++) 9 | { 10 | c=a+b; 11 | a=b; 12 | b=c; 13 | } 14 | return c; 15 | } 16 | int g(int n) 17 | { 18 | if(n==0) return 0; 19 | return g(n-1)+ f(4*n-1); 20 | } 21 | int main() 22 | { 23 | for(int i=0;i<11;i++) 24 | { printf("%d, ",g(i)); } 25 | getchar(); 26 | } 27 | -------------------------------------------------------------------------------- /codechef/OCT14/CHEFGR.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main(){ 6 | int t; 7 | cin>>t; 8 | while(t--){ 9 | int n,m; 10 | cin>>n>>m; 11 | vector a(n); 12 | int maximum=0; 13 | for(int i=0;i>a[i]; 15 | maximum=max(maximum,a[i]); 16 | } 17 | int cost=0; 18 | for(int i=0;i=0&&(m%n==0)?"Yes":"No")< 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int main(){ 7 | srand(time(NULL)); 8 | int t=10; 9 | cout< 2 | using namespace std; 3 | 4 | int coef[]={1,2,5,10}; 5 | int var(int total,int sum,int current=0) 6 | { 7 | if(current==total) 8 | { 9 | if(sum==0) 10 | return 1; 11 | else 12 | return 0; 13 | } 14 | long long count=0; 15 | for(int i=0;i<=sum/coef[current]+1;i++) 16 | { 17 | count+=var(4,sum-coef[current]*i,current+1); 18 | } 19 | return count; 20 | } 21 | 22 | int main() 23 | { 24 | cout< 2 | #include 3 | #include 4 | #include 5 | #include 6 | using namespace std; 7 | 8 | int main(){ 9 | string firstWord; 10 | string secondWord; 11 | cin>>firstWord>>secondWord; 12 | 13 | bool isPossible[26][26][26]; 14 | for(int i=0;i<26;i++) 15 | for(int j=0;j<26;j++) 16 | for(int k=0;k<26;k++) 17 | isPossible[i][j][k]=true; 18 | int n; 19 | cin>>n; 20 | 21 | 22 | } 23 | -------------------------------------------------------------------------------- /odd number entry.cpp: -------------------------------------------------------------------------------- 1 | // O(n) solution to test for odd number entry in an array 2 | #include 3 | #include 4 | #define br -1 5 | 6 | int main() 7 | { 8 | int x=0; 9 | int n; 10 | while(1) 11 | { 12 | scanf("%d",&n); 13 | if(n==br) 14 | break; 15 | x^=n; 16 | } 17 | printf("%d",x); 18 | getch(); 19 | return 0; 20 | } 21 | -------------------------------------------------------------------------------- /DP practice/Contest 1/PB.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() 5 | { 6 | while(1) 7 | { 8 | string s; 9 | cin>>s; 10 | if(s=="00e0") 11 | break; 12 | 13 | int n=s[0]-'0'; 14 | n*=10; 15 | n+=s[1]-'0'; 16 | for(int i=0;i 2 | #include 3 | #include 4 | #include 5 | #include 6 | using namespace std; 7 | 8 | int main() 9 | { 10 | ofstream out("test.txt"); 11 | 12 | srand(time(NULL)); 13 | int t=10; 14 | out< 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | 7 | int main() 8 | { 9 | freopen("test.txt","w",stdout); 10 | int t=100; 11 | cout< 2 | using namespace std; 3 | 4 | int main(){ 5 | int t; 6 | cin>>t; 7 | while(t--){ 8 | long long s,e; 9 | cin>>s>>e; 10 | bool isPossible=true; 11 | int n; 12 | cin>>n; 13 | for(int i=0;i>x>>y; 17 | if(x>=e||y<=s); 18 | else 19 | isPossible=false; 20 | } 21 | if(isPossible) 22 | cout<<"YES"; 23 | else 24 | cout<<"NO"; 25 | cout< 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int main(){ 7 | int t; 8 | cin>>t; 9 | while(t--){ 10 | int n,m; 11 | cin>>n>>m; 12 | int MAX=INT_MIN; 13 | int MIN=INT_MAX; 14 | while(m--){ 15 | int x; 16 | cin>>x; 17 | MAX=max(MAX,x); 18 | MIN=min(MIN,x); 19 | } 20 | for(int i=0;i 11 | 12 | inline int nCr(int n,int r) 13 | { 14 | int nm=1; 15 | int rm=1; 16 | while(r) 17 | { 18 | nm=nm*(n--); 19 | rm*=(r--); 20 | } 21 | return nm/rm; 22 | } 23 | 24 | int main() 25 | { 26 | int n,x; 27 | printf("%d",nCr(6,2)); 28 | getchar(); 29 | } 30 | -------------------------------------------------------------------------------- /shobhit.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main(){ 6 | int t; 7 | cin>>t; 8 | while(t--){ 9 | int n; 10 | cin>>n; 11 | 12 | int l =1, r =n; 13 | long long sum = 0; 14 | 15 | bool incrementType=true; 16 | while(l 2 | using namespace std; 3 | 4 | int main() 5 | { 6 | while(1) 7 | { 8 | string s; 9 | cin>>s; 10 | if(s=="00e0") 11 | break; 12 | 13 | int n=s[0]-'0'; 14 | n*=10; 15 | n+=s[1]-'0'; 16 | for(int i=0;i 2 | using namespace std; 3 | 4 | int main() 5 | { 6 | int t; 7 | cin>>t; 8 | while(t--) 9 | { 10 | int max=0; 11 | int points[50]={0}; 12 | int n; 13 | cin>>n; 14 | for(int i=0;i>points[i]; 16 | for(int i=0;i>temp; 20 | points[i]=points[i]*3+temp; 21 | if(points[i]>max) 22 | max=points[i]; 23 | } 24 | cout< 2 | 3 | #define MOD 1000000007 4 | 5 | int main() 6 | { 7 | int t; 8 | scanf("%d",&t); 9 | long long a,b,c; 10 | while(t--) 11 | { 12 | 13 | scanf("%lld %lld %lld",&a,&b,&c); 14 | 15 | if(a>c) a^=c^=a^=c; 16 | if(a>b) a^=b^=a^=b; 17 | if(b>c) b^=c^=b^=c; 18 | 19 | printf("%lld\n",((((a%MOD)*((b-1)%MOD))%MOD)*((c-2)%MOD))%MOD); 20 | } 21 | return 0; 22 | } 23 | -------------------------------------------------------------------------------- /codechef/COOK 43/2.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | 7 | int main() 8 | { 9 | int t; 10 | cin>>t; 11 | while(t--) 12 | { 13 | int n; 14 | cin>>n; 15 | vector array(n); 16 | for(int i=0;i>array[i]; 18 | sort(array.begin(),array.end()); 19 | long long result=0; 20 | for(int i=1;i 2 | #include 3 | using namespace std; 4 | 5 | 6 | int main() 7 | { 8 | int n; 9 | long long k; 10 | cin>>n>>k; 11 | set SET; 12 | for(int i=0;i>a; 16 | SET.insert(a); 17 | } 18 | long long count=0; 19 | for(set::iterator i=SET.begin();i!=SET.end();i++) 20 | { 21 | if(SET.find(*i+k)!=SET.end()) 22 | count++; 23 | } 24 | cout< 2 | using namespace std; 3 | 4 | 5 | inline int gcf(long long a, long long b) 6 | { 7 | long long temp; 8 | while(b) 9 | { 10 | temp=a; 11 | a=b; 12 | b=temp%b; 13 | } 14 | return a; 15 | } 16 | 17 | 18 | int main() 19 | { 20 | for(int i=1;i<100;i++) 21 | { 22 | long long count=0; 23 | for(int j=1;j<=i;j++) 24 | count+=i/j; 25 | 26 | cout< 2 | 3 | int main() 4 | { 5 | 6 | int sum=0; 7 | for(int i=1;i<=999;i++) 8 | { 9 | 10 | int n=i; 11 | int num=1; 12 | while(n) 13 | { 14 | int r=n%10; 15 | if(r) num*=r; 16 | n/=10; 17 | } 18 | sum+=num; 19 | } 20 | printf("%d",sum); 21 | getchar(); 22 | 23 | } 24 | -------------------------------------------------------------------------------- /codechef/MARCH13/APPROX.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() 5 | { 6 | 7 | 8 | 9 | int t; 10 | cin>>t; 11 | while(t--) 12 | { 13 | int num=103993%33102; 14 | int den=33102; 15 | int n; 16 | cin>>n; 17 | 18 | cout<<3; 19 | if(n>0) 20 | { 21 | cout<<"."; 22 | while(n) 23 | { 24 | num=num*10; 25 | cout< 2 | #include 3 | using namespace std; 4 | 5 | 6 | int main() 7 | { 8 | int t; 9 | cin>>t; 10 | while(t--) 11 | { 12 | int n; 13 | cin>>n; 14 | vector array(n); 15 | for(int i=0;i>array[i]; 17 | 18 | int k; 19 | cin>>k; 20 | k--; 21 | 22 | int count=1; 23 | for(int i=0;i 2 | using namespace std; 3 | 4 | int main(){ 5 | ios::sync_with_stdio(false); 6 | int t; 7 | cin>>t; 8 | while(t--){ 9 | long long x,k; 10 | cin>>x>>k; 11 | long double pow2=1; 12 | 13 | long long kCopy=k; 14 | while(kCopy){ 15 | pow2*=2; 16 | kCopy>>=1; 17 | } 18 | 19 | long double ans=(1+(2*k-pow2))/pow2; 20 | ans*=x; 21 | cout.setf(ios::fixed); 22 | cout.precision(6); 23 | cout< 2 | #include 3 | using namespace std; 4 | 5 | 6 | string padzero(int a) 7 | { 8 | string s="00"; 9 | s[1]+=a%10; 10 | s[0]+=a/10; 11 | return s; 12 | } 13 | int main() 14 | { 15 | int sH,sM; 16 | int tH,tM; 17 | char temp; 18 | scanf("%d:%d",&sH,&sM); 19 | scanf("%d:%d",&tH,&tM); 20 | 21 | int ans=(sH-tH)*60+(sM-tM); 22 | if(ans<0) 23 | ans+=24*60; 24 | 25 | cout< 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int main() 7 | { 8 | char a[1000]; 9 | char b[1000]; 10 | ifstream f1("out1.txt"),f2("out2.txt"); 11 | 12 | int i=1; 13 | while(a&&b) 14 | { 15 | 16 | f1>>a; 17 | f2>>b; 18 | if(strcmp(a,b)!=0) 19 | { cout<<"Line No"< 2 | using namespace std; 3 | 4 | 5 | bool recurse(int coins,int turn) 6 | { 7 | if(coins<=1) 8 | return false; 9 | else 10 | { 11 | if((!recurse(coins-1,turn*-1))||(!recurse(coins-2,turn*-1))||(!recurse(coins-3,turn*-1))) 12 | { 13 | return true; 14 | } 15 | else 16 | { 17 | return false; 18 | } 19 | } 20 | } 21 | int main() 22 | { 23 | for(int i=1;i<=21;i++) 24 | { 25 | cout< "< 3 | main() 4 | { 5 | int a,b,c; 6 | int count = 1; 7 | 8 | for (b = c = 10; 9 | a = "ello Folks,\ 10 | TFy!QJu ROo TNn(ROo)SLq SLq ULo+\ 11 | UHs UJq TNn*RPn/QPbEWS_JSWQAIJO^\ 12 | NBELPeHBFHT}TnALVlBLOFAkHFOuFETp\ 13 | HCStHAUFAgcEAelclcn^r^r\\tZvYxXy\ 14 | T|S~Pn SPm SOn TNn ULo0ULo#ULo-W\ 15 | Hq!WFs XDt!"[b+++0]; ) 16 | for(; a-- > 64 ; ) 17 | putchar ( ++c=='Z' ? 18 | c = c / 9 : 19 | 33 ^ b & 1 ); 20 | getch(); 21 | return 0; 22 | } 23 | -------------------------------------------------------------------------------- /codechef/ALGT2013/TNMALG04.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | unsigned long long C(int n) 6 | { 7 | unsigned long long c=1; 8 | for(int i=2;i<=n;i++) 9 | { 10 | c=(2*(2*i-1)*c)/(i+1); 11 | } 12 | return c; 13 | } 14 | 15 | 16 | int main() 17 | { 18 | int t; 19 | char c[100]; 20 | cin>>t; 21 | while(t--) 22 | { 23 | cin>>c; 24 | cout< 2 | using namespace std; 3 | 4 | long long f(int n) 5 | { 6 | long long fact=1; 7 | for(int i=1;i<=n;i++) 8 | fact*=n; 9 | return fact; 10 | } 11 | 12 | long long g(int a,int n) 13 | { 14 | long long p=1; 15 | for(int i=0;i"; 24 | for(int k=1;k<20;k++) 25 | cout<<(f(k)>g(a,k)); 26 | cout< 2 | #include 3 | using namespace std; 4 | 5 | 6 | int main() 7 | { 8 | 9 | 10 | int a[]={1,2,4,8,16,32}; 11 | for(int i=0;i<20;i++) 12 | { 13 | cout< 2 | using namespace std; 3 | #define MOD 1000000007 4 | long long p(int n,int m) 5 | { 6 | if(m==0) return 1; 7 | 8 | long long x=p(n,m/2); 9 | if(m%2==0) 10 | return (x*x)%MOD; 11 | else 12 | return (((x*x)%MOD)*n)%MOD; 13 | } 14 | int main() 15 | { 16 | int t; 17 | cin>>t; 18 | while(t--) 19 | { 20 | int n; 21 | cin>>n; 22 | long long ans=p(2,n); 23 | cout<<(MOD+ans-1)%MOD< 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | #define MAXQUERY 1000 7 | int main() 8 | { 9 | freopen("test7.txt","w",stdout); 10 | srand(time(NULL)); 11 | cout< 2 | 3 | int main() 4 | { 5 | int t; 6 | scanf("%d",&t); 7 | int n,k,i; 8 | while(t--) 9 | { 10 | scanf("%d %d",&n,&k); 11 | for(i=0;i>1; 15 | } 16 | if(n==i) printf("ON\n"); 17 | else printf("OFF\n"); 18 | } 19 | return 0; 20 | } 21 | -------------------------------------------------------------------------------- /he testing/panda/pnda.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | using namespace std; 6 | 7 | int main(){ 8 | freopen("in.txt","r",stdin); 9 | int n; 10 | cin>>n; 11 | map stringCounts; 12 | long long counts=0; 13 | while(n--){ 14 | string s; 15 | cin>>s; 16 | for(int i=0;i 3 | main() 4 | { 5 | int a,b,c; 6 | int count = 1; 7 | 8 | for (b = c = 10; 9 | a = "- FIGURE?, UMKC,XYZHello Folks,\ 10 | TFy!QJu ROo TNn(ROo)SLq SLq ULo+\ 11 | UHs UJq TNn*RPn/QPbEWS_JSWQAIJO^\ 12 | NBELPeHBFHT}TnALVlBLOFAkHFOuFETp\ 13 | HCStHAUFAgcEAelclcn^r^r\\tZvYxXy\ 14 | T|S~Pn SPm SOn TNn ULo0ULo#ULo-W\ 15 | Hq!WFs XDt!"[b+++21]; ) 16 | for(; a-- > 64 ; ) 17 | putchar ( ++c=='Z' ? 18 | c = c / 9 : 19 | 33 ^ b & 1 ); 20 | getch(); 21 | return 0; 22 | } 23 | -------------------------------------------------------------------------------- /virtual contests/session 4/3.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | long long abs(long long a) 7 | { 8 | if(a<0) 9 | return -1*a; 10 | else 11 | return a; 12 | } 13 | int main() 14 | { 15 | int n; 16 | cin>>n; 17 | vector array(n); 18 | for(int i=0;i>array[i]; 20 | sort(array.begin(),array.end()); 21 | long long sum=0; 22 | for(int i=0;i Verified OK 0.061 2 | ----------------------------------------- 3 | 5 => Verified OK 0.037 4 | ----------------------------------------- 5 | 6 => Verified OK 0.131 6 | ----------------------------------------- 7 | 7 => Verified OK 0.556 8 | ----------------------------------------- 9 | 8 => Verified OK 11.482 10 | ----------------------------------------- 11 | 9 => Verified OK 138.683 12 | ----------------------------------------- 13 | -------------------------------------------------------------------------------- /codechef/AUG14/CLETAB/testgen.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | using namespace std; 6 | 7 | int main() 8 | { 9 | srand(time(NULL)); 10 | int t = 20; 11 | cout << t << endl; 12 | while (t--) { 13 | int n = rand() % 20 + 1, m = rand() % 40 + 1; 14 | cout << n << " " << m << endl; 15 | for (int i = 0; i < m; i++) { 16 | cout << rand() % 20 + 1 << " "; 17 | } 18 | cout << endl; 19 | } 20 | } 21 | -------------------------------------------------------------------------------- /codechef/MAY14/RRSTONE/RRSTONE_brute.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int main() 7 | { 8 | int n,k; 9 | cin>>n>>k; 10 | vector array(n); 11 | for(int i=0;i>array[i]; 13 | 14 | while(k--) 15 | { 16 | int MAX=numeric_limits::min(); 17 | for(int i=0;i 2 | #include 3 | using namespace std; 4 | 5 | 6 | int main() 7 | { 8 | int t; 9 | cin>>t; 10 | while(t--) 11 | { 12 | int n; 13 | cin>>n; 14 | long long x=0; 15 | long long sum=0; 16 | long long MIN=numeric_limits::max(); 17 | while(n--) 18 | { 19 | long long a; 20 | cin>>a; 21 | sum+=a; 22 | x^=a; 23 | MIN=min(MIN,a); 24 | } 25 | if(x==0) 26 | cout< 2 | using namespace std; 3 | 4 | int main(){ 5 | int n,k; 6 | cin>>n>>k; 7 | int i=1; 8 | int j=n; 9 | 10 | int turn=0; 11 | while(i<=j&&k--){ 12 | if(turn){ 13 | cout<=i){ 24 | cout<=i){ 30 | cout< 2 | using namespace std; 3 | 4 | char* children[]={"Ankit","Umesh","Shivam","Gambhir","S"}; 5 | 6 | void permute(int i,int n) 7 | { 8 | if(i==n) 9 | { 10 | for(int i=0;i<5;i++) 11 | cout< 11 | int bsearch(int l,int h,int a[],int c) 12 | { 13 | int pos; 14 | while(l<=h) 15 | { 16 | pos=(l+h)/2; 17 | if(a[pos]==c) 18 | return pos; 19 | else if(a[pos] 2 | 3 | int day=0; 4 | 5 | void days(long long n) 6 | { 7 | 8 | if(day>=36524) return; 9 | if(n==1) return; 10 | day++; 11 | if(n%2) days(3*(n+1)); 12 | else days(n/2); 13 | } 14 | 15 | int main() 16 | { 17 | int t; 18 | scanf("%d",&t); 19 | while(t--) 20 | { 21 | long long n; 22 | scanf("%lld",&n); 23 | int flag=1; 24 | while(n) 25 | { 26 | if((n&1)&&n!=1){flag=0;break;} 27 | n=n>>1; 28 | } 29 | printf("%s\n",flag?"No":"Yes"); 30 | } 31 | return 0; 32 | } 33 | -------------------------------------------------------------------------------- /codechef/COOK33/testgen.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | 7 | int main() 8 | { 9 | 10 | int t=100; 11 | cout< 2 | 3 | int recurse(int n,int k,int turn) 4 | { 5 | if(n==0) return turn*(-1); 6 | if(n==k) reutnr turn; 7 | if(n/k<=2||n==k*3-1) return 8 | return recurse(n-k,k,turn*-1); 9 | } 10 | int main() 11 | { 12 | int t,k; 13 | scanf("%d %d",&t,&k); 14 | while(t--) 15 | { 16 | int n; 17 | scanf("%d",&n); 18 | printf("%s\n",recurse(n,k,1)==1?"Brainy":"Clumsy"); 19 | 20 | } 21 | return 0; 22 | } 23 | -------------------------------------------------------------------------------- /spoj/HC.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() 5 | { 6 | int t; 7 | cin>>t; 8 | while(t--) 9 | { 10 | int n; 11 | cin>>n; 12 | n--; 13 | 14 | int ans; 15 | char s[5]; 16 | cin>>s; 17 | if(s[0]=='l') 18 | ans=1; 19 | else 20 | ans=0; 21 | 22 | while(n--) 23 | { 24 | cin>>s; 25 | if(s[0]=='l') 26 | ans^=1; 27 | else 28 | ans^=0; 29 | } 30 | 31 | if(ans==1) 32 | cout<<"lxh"; 33 | else 34 | cout<<"hhb"; 35 | cout< 2 | #include 3 | #include 4 | #include 5 | using namespace std; 6 | 7 | int main() 8 | { 9 | int t; 10 | cin>>t; 11 | while(t--) 12 | { 13 | int n,k; 14 | cin>>n>>k; 15 | vector height(n); 16 | for(int i=0;i>height[i]; 18 | sort(height.begin(),height.end()); 19 | int MIN=INT_MAX; 20 | for(int i=0;i 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | 7 | vector hashmap(100000,-1); 8 | 9 | int solve(int n) 10 | { 11 | int MIN=INT_MAX; 12 | if(n==1) 13 | return 1; 14 | if(n==0) 15 | return 0; 16 | if(hashmap[n]==-1) 17 | { 18 | for(int i=1;i*i<=n;i++) 19 | MIN=min(MIN,1+solve(n-i*i)); 20 | 21 | hashmap[n]=MIN; 22 | } 23 | return hashmap[n]; 24 | } 25 | 26 | int main() 27 | { 28 | int n; 29 | cin>>n; 30 | cout< 2 | 3 | int main() 4 | { 5 | 6 | int sum=0; 7 | for(int i=1;i<=999;i++) 8 | { 9 | 10 | int n=i; 11 | int num=1; 12 | while(n) 13 | { 14 | int r=n%10; 15 | if(r) num*r; 16 | n/=10; 17 | } 18 | sum+=num; 19 | printf("%d ",num); 20 | } 21 | printf("%d",sum); 22 | getchar(); 23 | 24 | } 25 | -------------------------------------------------------------------------------- /codeforces/Match 268/codeforces/p3.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int main(){ 7 | int n; 8 | cin>>n; 9 | vector coins(n); 10 | for(int i=0;i>coins[i]; 12 | sort(coins.begin(),coins.end()); 13 | 14 | long long sum = 0 ; 15 | for(int i=0;i 2 | #include 3 | using namespace std; 4 | 5 | int main(){ 6 | int n,k; 7 | cin>>n>>k; 8 | vector > permutations(k,vector(n)); 9 | 10 | for(int i=0;i>permutations[i][j]; 13 | permutations[i][j]--; 14 | } 15 | 16 | vector > positions(k,vector(n)); 17 | 18 | for(int i=0;i 2 | using namespace std; 3 | 4 | int main() 5 | { 6 | int t; 7 | cin>>t; 8 | while(t--) 9 | { 10 | int n; 11 | cin>>n; 12 | n--; 13 | 14 | int ans; 15 | char s[5]; 16 | cin>>s; 17 | if(s[0]=='l') 18 | ans=1; 19 | else 20 | ans=0; 21 | 22 | while(n--) 23 | { 24 | cin>>s; 25 | if(s[0]=='l') 26 | ans^=1; 27 | else 28 | ans^=0; 29 | } 30 | 31 | if(ans==1) 32 | cout<<"lxh"; 33 | else 34 | cout<<"hhb"; 35 | cout< 2 | #include 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | int n; 8 | cin>>n; 9 | vector V(n); 10 | 11 | for(int i=0;i>V[i]; 13 | 14 | vector > DP(n,vector(n)); 15 | for(int i=n-1;i>=0;i--) 16 | for(int j=i;j 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | void signalHandler( int signum ) 7 | { 8 | cout << "Interrupt signal (" << signum << ") received.\n"; 9 | 10 | // cleanup and close up stuff here 11 | // terminate program 12 | 13 | 14 | } 15 | 16 | 17 | int main () 18 | { 19 | // register signal SIGINT and signal handler 20 | signal(SIGSEGV, signalHandler); 21 | int *a=0; 22 | *a=6; 23 | cout<<"hi.."; 24 | return 0; 25 | } 26 | -------------------------------------------------------------------------------- /codechef/CLASH/p3.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main(){ 6 | int n; 7 | cin>>n; 8 | map personLevel; 9 | map levelPerson; 10 | while(n--){ 11 | string person; 12 | cin>>person; 13 | int &level = personLevel[person]; 14 | level++; 15 | if(levelPerson[level].size()==0) 16 | levelPerson[level]=person; 17 | } 18 | 19 | for(map::const_iterator i=levelPerson.begin();i!=levelPerson.end();i++) 20 | cout<first<<" "<second< 2 | 3 | int main() 4 | { 5 | int t; 6 | scanf("%d",&t); 7 | while(t--) 8 | { 9 | int sum=0; 10 | int n; 11 | scanf("%d",&n); 12 | while(n--) 13 | { 14 | int N; 15 | int S; 16 | scanf("%d %d",&N,&S); 17 | sum+=N-S; 18 | } 19 | printf("%d\n",sum); 20 | } 21 | return 0; 22 | } 23 | -------------------------------------------------------------------------------- /mulmod(O(logn)).cpp: -------------------------------------------------------------------------------- 1 | /* 2 | Name: (a*b)%c 3 | Copyright: 4 | Author: Shobhit Saxena 5 | Date: 14/05/13 22:54 6 | Description: This algorithm calculates (a*b)%c in O(log(b)). 7 | 8 | 9 | */ 10 | 11 | 12 | #include 13 | using namespace std; 14 | 15 | long long mulmod(long long a,long long b,long long c) 16 | { 17 | long long x = 0,y=a%c; 18 | while(b > 0) 19 | { 20 | if(b%2 == 1) 21 | { 22 | x = (x+y)%c; 23 | } 24 | y = (y*2)%c; 25 | b /= 2; 26 | } 27 | return x%c; 28 | } 29 | 30 | -------------------------------------------------------------------------------- /NITCONTEST3/Gaurav and Recurrences/setter_programDP.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | #define MOD 10000007 6 | int main() 7 | 8 | { 9 | vector DP(100001); 10 | DP[1]=1; 11 | DP[2]=2; 12 | DP[3]=3; 13 | DP[4]=2; 14 | DP[5]=1; 15 | for(int i=6;i>t; 23 | while(t--) 24 | { 25 | int n; 26 | cin>>n; 27 | cout< 2 | #include 3 | using namespace std; 4 | 5 | 6 | pair maxsubarray(int a[],int n) 7 | { 8 | long long max_so_far=numeric_limits::min(); 9 | , max_ending_here=0; 10 | 11 | } 12 | int main() 13 | { 14 | int t; 15 | cin>>t; 16 | while(t--) 17 | { 18 | int a[10000]; 19 | int n; 20 | cin>>n; 21 | for(int i=0;i>a[i]; 24 | } 25 | 26 | pair maxsubarr= 27 | 28 | 29 | 30 | 31 | } 32 | 33 | 34 | 35 | 36 | } 37 | -------------------------------------------------------------------------------- /codechef/JUN13/PREDICT.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | double sol(double p, int x,int y) 5 | { 6 | return (2*(1-p)*x-y)*p+(2*p*y-x)*(1-p); 7 | } 8 | int main() 9 | { 10 | cout.precision(6); 11 | cout.setf(ios::fixed); 12 | int t; 13 | cin>>t; 14 | while(t--) 15 | { 16 | double p; 17 | cin>>p; 18 | double MAX=max(sol(p,10000,0),sol(p,0,10000)); 19 | MAX=max(MAX,0.0); 20 | //MAX=max(MAX,sol(p,0,1)); 21 | //MAX=max(MAX,sol(p,1,0)); 22 | cout<<10000+MAX< 2 | #include 3 | using namespace std; 4 | 5 | int main(){ 6 | long long n,k; 7 | cin>>n>>k; 8 | 9 | vector a(n); 10 | long long maximum=0; 11 | for(int i=0;i>a[i]; 13 | maximum=max(maximum,a[i]); 14 | } 15 | long long sum=0; 16 | long long last=0; 17 | for(int i=0;ilast){ 20 | sum+=maximum-a[i]-last; 21 | } 22 | last=maximum-a[i]; 23 | } 24 | if(sum>k) 25 | cout<<0; 26 | else 27 | cout< 2 | using namespace std; 3 | 4 | 5 | int main() 6 | { 7 | string a; 8 | cin>>a; 9 | 10 | int last_h=a.size()-1; 11 | int h=a.size()-1; 12 | int count=0; 13 | 14 | while(h>=0) 15 | { 16 | count++; 17 | while(h>=0&&a[h]=='0') 18 | h--; 19 | if((last_h-h+1)==((h-1)-(0)+1)) 20 | { 21 | if(a.substr(0,(h-1)-(0)+1)((h-1)-(0)+1)) 25 | break; 26 | h--; 27 | last_h=h; 28 | } 29 | cout< 2 | #include 3 | 4 | using namespace std; 5 | int main() 6 | { 7 | ifstream t1("o1.txt"); 8 | if(!t1) cout<<"O1.txt not found\n"; 9 | ifstream t2("o2.txt"); 10 | if(!t2) cout<<"O2.txt not found\n"; 11 | int n1,n2; 12 | int i=0; 13 | while(t1&&t2) 14 | { 15 | t1>>n1; 16 | t2>>n2; 17 | if(n1!=n2) 18 | printf("%d\n",i); 19 | i++; 20 | } 21 | printf("Over\n"); 22 | getchar(); 23 | } 24 | -------------------------------------------------------------------------------- /Testing environment/testgen.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | 7 | int main() 8 | { 9 | srand(time(NULL)); 10 | int t=10; 11 | cout< 2 | #include 3 | using namespace std; 4 | 5 | int main(){ 6 | int t; 7 | cin>>t; 8 | while(t--){ 9 | int n; 10 | cin>>n; 11 | bool I=false; 12 | bool Y=false; 13 | while(n--){ 14 | char x; 15 | cin>>x; 16 | if(x=='I') 17 | I=true; 18 | if(x=='Y') 19 | Y=true; 20 | } 21 | if(I&&Y) 22 | cout<<"NOT SURE"; 23 | else if(I) 24 | cout<<"INDIAN"; 25 | else if(Y) 26 | cout<<"NOT INDIAN"; 27 | else 28 | cout<<"NOT SURE"; 29 | cout< 2 | using namespace std; 3 | 4 | int sum(int a,int b){ 5 | int newNumber=0; 6 | while(a||b){ 7 | newNumber*=10; 8 | newNumber+=(a+b)%10; 9 | a/=10; 10 | b/=10; 11 | } 12 | return newNumber; 13 | } 14 | int main(){ 15 | for(int i=1;i<10000;i++){ 16 | bool isPossible=false; 17 | for(int j=1;j<=i;j++){ 18 | for(int k=1;k<=i;j++){ 19 | if(sum(j,k)==k){ 20 | isPossible=true; 21 | break; 22 | } 23 | } 24 | } 25 | if(!isPossible) 26 | cout< 2 | #include 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | int n; 8 | cin>>n; 9 | vector a(n),b(n); 10 | for(int i=0;i>a[i]; 12 | 13 | for(int i=0;i>b[i]; 15 | 16 | long long score=0; 17 | for(int i=0;i=1&&second>=1&&first<=a[i]&&second<=a[i]) 22 | score+=first*second; 23 | else 24 | score--; 25 | } 26 | cout< 2 | #include 3 | using namespace std; 4 | 5 | #define MAX 1000005 6 | bool win[MAX]; 7 | int main() 8 | { 9 | ios_base::sync_with_stdio(false); 10 | int k,l,m; 11 | cin>>k>>l>>m; 12 | 13 | for(int i=1;i=0) 17 | lose|=!win[i-1]; 18 | if(i-k>=0) 19 | lose|=!win[i-k]; 20 | if(i-l>=0) 21 | lose|=!win[i-l]; 22 | 23 | win[i]=lose; 24 | } 25 | while(m--) 26 | { 27 | int n; 28 | cin>>n; 29 | cout<<(win[n]?"A":"B"); 30 | } 31 | } 32 | -------------------------------------------------------------------------------- /DP practice/Contest 3/M.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | freopen("testM.txt","r",stdin); 8 | int n; 9 | cin>>n; 10 | vector a(n); 11 | for(int i=0;i>a[i]; 13 | 14 | vector DP(n,1); 15 | 16 | int ans=0; 17 | for(int i=n-1;i>=0;i--) 18 | { 19 | int MAX=0; 20 | for(int j=i+1;j 2 | #include 3 | 4 | void swap(char arr[], int a, int b) 5 | { 6 | char temp; 7 | temp=arr[a]; 8 | arr[a] = arr[b]; 9 | arr[b] = temp; 10 | } 11 | 12 | void printAll(char arr[], int j, int n) 13 | { 14 | int i; 15 | if(j==n) 16 | { 17 | printf("\n%s", arr); 18 | return;} 19 | for(i=j; iinput_iterator_type turingMachine::parse(const input_iterator_type &iterator) throw(typename turingMachine::MACHINE_NOT_ACTIVE) 5 | { 6 | if(is_active()) 7 | { 8 | pair current=read_character(iterator); 9 | while(!current.first) 10 | current=read_character(current.second); 11 | return current.second; 12 | } 13 | else 14 | throw MACHINE_NOT_ACTIVE(); 15 | } 16 | 17 | -------------------------------------------------------------------------------- /dynamic matrix.cpp: -------------------------------------------------------------------------------- 1 | // Functions to create a 2D matrix and deallocate it... 2 | int ** allocate(int r,int c) 3 | { 4 | int **a=(int **)malloc(r*sizeof(int *)); 5 | if(a==NULL) {return 0;} 6 | for(int i=0;i 2 | #include 3 | using namespace std; 4 | 5 | 6 | #define MAX 1000000 7 | #define MOD 10000007 8 | int main() 9 | { 10 | vector ways(MAX+1); 11 | ways[1]=1; 12 | ways[2]=1; 13 | ways[3]=2; 14 | ways[4]=4; 15 | 16 | for(int i=5;i>T; 25 | while(T--) 26 | { 27 | int n; 28 | cin>>n; 29 | cout< 2 | #include 3 | int main() 4 | { 5 | int t; 6 | scanf("%d",&t); 7 | char string[210]; 8 | 9 | while(t--) 10 | { 11 | char hashmap[255]; 12 | memset(hashmap,0,sizeof(hashmap)); 13 | 14 | scanf("%s",string); 15 | int count=0; 16 | int i; 17 | for(i=0;string[i];i++) 18 | { 19 | if(hashmap[string[i]]==0) 20 | { 21 | count++; 22 | hashmap[string[i]]=1; 23 | } 24 | else 25 | hashmap[string[i]]=0; 26 | } 27 | printf("%d\n",count); 28 | } 29 | return 0; 30 | } 31 | -------------------------------------------------------------------------------- /hackerearth/august jam/p1.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main(){ 5 | int t; 6 | cin>>t; 7 | while(t--){ 8 | int index,n; 9 | cin>>index>>n; 10 | int pos ; 11 | switch(index){ 12 | case 1: 13 | if(n==0) 14 | pos=1; 15 | else if(n%2==0) 16 | pos=1; 17 | else 18 | pos=0; 19 | break; 20 | case 0: 21 | case 2: 22 | if(n==0) 23 | pos=index; 24 | else if(n%2==0) 25 | pos = 0; 26 | else 27 | pos = 1; 28 | break; 29 | } 30 | cout< 2 | #include 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | vector > count(65,vector(10)); 8 | 9 | for(int j=0;j<=9;j++) 10 | count[1][j]=j+1; 11 | for(int i=2;i<=64;i++) 12 | for(int j=0;j<=9;j++) 13 | for(int k=0;k<=j;k++) 14 | count[i][j]+=count[i-1][k]; 15 | 16 | int t; 17 | cin>>t; 18 | while(t--) 19 | { 20 | int number; 21 | cin>>number; 22 | cout<>n; 27 | cout< 2 | #include 3 | using namespace std; 4 | 5 | #define MAX 1000005 6 | bool win[MAX]; 7 | int main() 8 | { 9 | ios_base::sync_with_stdio(false); 10 | int k,l,m; 11 | cin>>k>>l>>m; 12 | 13 | for(int i=1;i=0) 17 | lose|=!win[i-1]; 18 | if(i-k>=0) 19 | lose|=!win[i-k]; 20 | if(i-l>=0) 21 | lose|=!win[i-l]; 22 | 23 | win[i]=lose; 24 | } 25 | while(m--) 26 | { 27 | int n; 28 | cin>>n; 29 | cout<<(win[n]?"A":"B"); 30 | } 31 | } 32 | -------------------------------------------------------------------------------- /codeforces/Match 268/codeforces/shbjit.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | 6 | void toBinary(char a){ 7 | stack S; 8 | for(int i=0;i<8;i++){ 9 | S.push(a&1); 10 | a>>=1; 11 | } 12 | while(!S.empty()){ 13 | cout< 2 | using namespace std; 3 | 4 | inline int gcf(int a, int b) 5 | { 6 | int temp; 7 | while(b) 8 | { 9 | temp=a; 10 | a=b; 11 | b=temp%b; 12 | } 13 | return a; 14 | } 15 | 16 | int main() 17 | { 18 | for(int i=1;i<1000000;i++) 19 | { 20 | for(int j=i;j<1000000;j++) 21 | { 22 | int n=i,m=j; 23 | while(n!=m) 24 | { 25 | if(n>m) 26 | n=n-m; 27 | else 28 | m=m-n; 29 | } 30 | if(n!=gcf(i,j)) 31 | cout< 2 | 3 | #define MOD (1000000000+7) 4 | 5 | 6 | long long p(int n,int m) 7 | { 8 | if(m==0) return 1; 9 | 10 | long long x=p(n,m/2); 11 | if(m%2==0) 12 | return (x*x)%MOD; 13 | else 14 | return (x*x*n)%MOD; 15 | } 16 | 17 | int main() 18 | { 19 | int t,n; 20 | scanf("%d",&t); 21 | while(t--) 22 | { 23 | scanf("%d",&n); 24 | int counter=n%2?-3:3; 25 | printf("%d\n",int((p(3,n)+counter)%MOD)); 26 | } 27 | } 28 | -------------------------------------------------------------------------------- /hackerrank/codegon/magic1.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | using namespace std; 7 | 8 | int main(){ 9 | string firstWord; 10 | string secondWord; 11 | cin>>firstWord>>secondWord; 12 | 13 | bool isPossible[26][26][26]; 14 | for(int i=0;i<26;i++) 15 | for(int j=0;j<26;j++) 16 | for(int k=0;k<26;k++) 17 | isPossible[i][j][k]=true; 18 | int n; 19 | cin>>n; 20 | while(n--){ 21 | string a,b,c; 22 | cin>>a>>b>>c; 23 | for(int i=0;i 2 | #include 3 | using namespace std; 4 | 5 | int main(){ 6 | int n; 7 | cin>>n; 8 | vector freq(1001); 9 | 10 | int maxPosition=0; 11 | while(n--){ 12 | int x; 13 | cin>>x; 14 | freq[x]++; 15 | if(freq[x]>maxPosition) 16 | maxPosition=x; 17 | } 18 | 19 | bool moreAvailable=false; 20 | for(int i=0;i 12 | 13 | int func(int a[],int n) 14 | { 15 | int sum=0, xr=0; 16 | for(int i=0;i 2 | #include 3 | 4 | using namespace std; 5 | int main() 6 | { 7 | ifstream t1("o1.txt"); 8 | if(!t1) cout<<"O1.txt not found\n"; 9 | ifstream t2("o2.txt"); 10 | if(!t2) cout<<"O2.txt not found\n"; 11 | int n1,n2; 12 | int i=1; 13 | while(t1&&t2) 14 | { 15 | t1>>n1; 16 | t2>>n2; 17 | if(n1!=n2) 18 | printf("Line=>%d n1=%d, n2=%d\n",i,n1,n2); 19 | i++; 20 | } 21 | printf("Over\n"); 22 | getchar(); 23 | } 24 | -------------------------------------------------------------------------------- /encoder(altius 2012)/ENCD (3).cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | #define MOD (1000000000+7) 4 | 5 | 6 | long long p(int n,int m) 7 | { 8 | if(m==0) return 1; 9 | 10 | long long x=p(n,m/2); 11 | if(m%2==0) 12 | return (x*x)%MOD; 13 | else 14 | return (x*x*n)%MOD; 15 | } 16 | 17 | int main() 18 | { 19 | int t,n; 20 | scanf("%d",&t); 21 | while(t--) 22 | { 23 | scanf("%d",&n); 24 | int counter=n%2?-3:3; 25 | printf("%d\n",int((p(3,n)+counter)%MOD)); 26 | } 27 | } 28 | -------------------------------------------------------------------------------- /.gitattributes: -------------------------------------------------------------------------------- 1 | # Auto detect text files and perform LF normalization 2 | * text=auto 3 | 4 | # Custom for Visual Studio 5 | *.cs diff=csharp 6 | *.sln merge=union 7 | *.csproj merge=union 8 | *.vbproj merge=union 9 | *.fsproj merge=union 10 | *.dbproj merge=union 11 | 12 | # Standard to msysgit 13 | *.doc diff=astextplain 14 | *.DOC diff=astextplain 15 | *.docx diff=astextplain 16 | *.DOCX diff=astextplain 17 | *.dot diff=astextplain 18 | *.DOT diff=astextplain 19 | *.pdf diff=astextplain 20 | *.PDF diff=astextplain 21 | *.rtf diff=astextplain 22 | *.RTF diff=astextplain 23 | -------------------------------------------------------------------------------- /codechef/AND.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | 6 | int main() 7 | { 8 | 9 | int n; 10 | cin>>n; 11 | vector digits(64); 12 | 13 | while(n--) 14 | { 15 | int a; 16 | cin>>a; 17 | int i=0; 18 | while(a) 19 | { 20 | digits[i]+=(a&1); 21 | a>>=1; 22 | i++; 23 | } 24 | } 25 | 26 | long long pow2=1; 27 | long long sum=0; 28 | for(int i=0;i<64;i++) 29 | { 30 | sum+=pow2*((digits[i]*(digits[i]-1))/2); 31 | 32 | pow2*=2; 33 | } 34 | cout< 2 | using namespace std; 3 | 4 | int D[]={0,1,4,3,8,5,2,7,6,9}; 5 | 6 | 7 | int d(int i) 8 | { 9 | 10 | int ans=0; 11 | while(i) 12 | { 13 | ans+=D[i%10]; 14 | i=i/10; 15 | } 16 | return ans%10; 17 | 18 | } 19 | 20 | int main() 21 | { 22 | int t; 23 | cin>>t; 24 | while(t--) 25 | { 26 | int a,b; 27 | cin>>a>>b; 28 | 29 | int ans=45*(b/10-a/10); 30 | for(int i=(b/10)*10;i 2 | using namespace std; 3 | 4 | bool isOverlucky(int n) 5 | { 6 | while(n) 7 | { 8 | if(n%10==7||n%10==4) 9 | return true; 10 | n/=10; 11 | } 12 | return false; 13 | } 14 | 15 | int main() 16 | { 17 | int t; 18 | cin>>t; 19 | while(t--) 20 | { 21 | long long n; 22 | cin>>n; 23 | int count=0; 24 | for(long long j=1;j*j<=n;j++) 25 | { 26 | if(n%j==0) 27 | { 28 | if(isOverlucky(j)) 29 | count++; 30 | if(isOverlucky(n/j)) 31 | count++; 32 | } 33 | } 34 | cout< 2 | #include 3 | using namespace std; 4 | 5 | 6 | int main() 7 | { 8 | while(1) 9 | { 10 | char code[6000]; 11 | cin>>code; 12 | if(code[0]=='0') 13 | break; 14 | int len=strlen(code); 15 | long long DP[6000]; 16 | DP[len-1]=code[len-1]!='0'; 17 | DP[len]=1; 18 | for(int i=len-2;i>=0;i--) 19 | { 20 | if(code[i]=='0') 21 | DP[i]=0; 22 | else 23 | { 24 | DP[i]=DP[i+1]; 25 | if((code[i]-'0')*10+(code[i+1]-'0')<=26) 26 | DP[i]+=DP[i+2]; 27 | } 28 | } 29 | cout< 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | char types[]={'i','r','k','f','b','d','s','p'}; 7 | 8 | int main() 9 | { 10 | srand(time(NULL)); 11 | int n=10000; 12 | cout< 2 | #include 3 | 4 | main() 5 | { 6 | int gd = DETECT,gm,left=100,top=100,right=200,bottom=200,x= 300,y=150,radius=50; 7 | 8 | initgraph(&gd, &gm, "C:\\TC\\BGI"); 9 | 10 | rectangle(left, top, right, bottom); 11 | circle(x, y, radius); 12 | bar(left + 300, top, right + 300, bottom); 13 | line(left - 10, top + 150, left + 410, top + 150); 14 | ellipse(x, y + 200, 0, 360, 100, 50); 15 | outtextxy(left + 100, top + 325, "My First C Graphics Program"); 16 | 17 | getch(); 18 | closegraph(); 19 | return 0; 20 | } 21 | -------------------------------------------------------------------------------- /TEST/testpradeep.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | int main() 4 | { 5 | int t,n,x,*a,i,j,s,r,c; 6 | scanf("%d",&t); 7 | for(i=0;i 2 | #include 3 | #include 4 | #include 5 | #include 6 | using namespace std; 7 | 8 | 9 | int main(){ 10 | srand(time(NULL)); 11 | int t=1; 12 | cout< a(n); 19 | for(int i=0;i 2 | #include 3 | #include 4 | using namespace std; 5 | char *genstring(char *a) 6 | { 7 | int i; 8 | int length=1+rand()%9; 9 | for(i=0;i 2 | #include 3 | using namespace std; 4 | 5 | #define EPS 0.001F 6 | int main() 7 | { 8 | //freopen("testF.txt","r",stdin); 9 | vector hanging; 10 | hanging.resize(600); 11 | for(int i=1;i>a; 18 | if(a+EPS>=0.00F&&a-EPS<=0.00F) 19 | break; 20 | 21 | for(int i=0;i=a) 23 | { 24 | cout< 2 | #include 3 | using namespace std; 4 | 5 | double abs(double x) 6 | { 7 | if(x<0) 8 | return 360+x; 9 | else 10 | return x; 11 | } 12 | int main() 13 | { 14 | int t; 15 | cin>>t; 16 | while(t--) 17 | { 18 | int h,m; 19 | cin>>h>>m; 20 | 21 | if(h<0||h>23||m<0||m>59) 22 | cout<<"Invalid Time"< 2 | #include 3 | using namespace std; 4 | 5 | char expression[2000000]; 6 | 7 | int main() 8 | { 9 | int t; 10 | scanf("%d",&t); 11 | while(t--) 12 | { 13 | int longestPrefix=0; 14 | scanf("%s",expression); 15 | int leftCount=0; 16 | for(int i=0;expression[i];i++) 17 | { 18 | if(expression[i]=='<') 19 | leftCount++; 20 | else 21 | leftCount--; 22 | if(leftCount==0) 23 | longestPrefix=i+1; 24 | else if(leftCount<0) 25 | break; 26 | } 27 | 28 | printf("%d\n",longestPrefix); 29 | } 30 | } 31 | -------------------------------------------------------------------------------- /hackerearth/October Easy/testgen.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | using namespace std; 6 | 7 | void printSegment(int high){ 8 | int l=rand()%high; 9 | int r=l-1; 10 | while(l>r){ 11 | r=rand()%(high+1); 12 | } 13 | cout< 2 | using namespace std; 3 | 4 | 5 | int main() 6 | { 7 | int t; 8 | cin>>t; 9 | while(t--) 10 | { 11 | string s; 12 | cin>>s; 13 | int corrections=0; 14 | int count=0; 15 | for(int i=0;i1) 28 | { 29 | while(count-1>=1) 30 | { 31 | count-=2; 32 | corrections++; 33 | } 34 | } 35 | cout< 2 | #include 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | int t; 8 | cin>>t; 9 | while(t--) 10 | { 11 | int n; 12 | cin>>n; 13 | vector a(n); 14 | vector LIS(n); 15 | 16 | for(int i=0;i>a[i]; 18 | int max=1; 19 | LIS[0]=1; 20 | for(int i=0;i=a[j]) 26 | LIS[i]=LIS[j]; 27 | } 28 | LIS[i]++; 29 | if(LIS[i]>max) 30 | max=LIS[i]; 31 | } 32 | cout< 2 | using namespace std; 3 | 4 | #define MOD 1000000009 5 | 6 | long long p(long long n,int m) 7 | { 8 | if(m==0) return 1%MOD; 9 | 10 | long long x=p(n,m/2); 11 | if(m%2==0) 12 | return (x*x)%MOD; 13 | else 14 | return (((x*x)%MOD)*n)%MOD; 15 | } 16 | 17 | 18 | int main(){ 19 | ios::sync_with_stdio(false); 20 | int t; 21 | cin>>t; 22 | while(t--){ 23 | int n,m; 24 | cin>>n>>m; 25 | long long ans = (p(m,n/2)*p(m-1,n/2))%MOD; 26 | if(n&1) 27 | ans=(ans*m)%MOD; 28 | cout< 2 | #include 3 | #include 4 | using namespace std; 5 | char *genstring(char *a) 6 | { 7 | int i; 8 | int length=1+rand()%9; 9 | for(i=0;i 2 | 3 | inline int check(int n) 4 | { 5 | int x=0,c=n; 6 | while(c) 7 | { 8 | x=x*10+c%10; 9 | c/=10; 10 | } 11 | if(x==n) return 1; 12 | else return 0; 13 | } 14 | 15 | int main() 16 | { 17 | int max=0; 18 | int x,y; 19 | for(int i=999;i>=101;i--) 20 | { 21 | for(int j=999;j>=101;j--) 22 | { 23 | if(check(i*j)&&i*j>max) 24 | {x=i;y=j;max=i*j;} 25 | } 26 | } 27 | printf("%d %d %d",max,x,y); 28 | getchar(); 29 | 30 | } 31 | -------------------------------------------------------------------------------- /TEST/sieves.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | #define MAX 5000001 4 | #define MOD 1000000007 5 | 6 | bool isprime[MAX]; 7 | 8 | void sieve() 9 | { 10 | int i,j; 11 | isprime[1]=0; 12 | for(i=2;i 2 | #include 3 | #include 4 | #define MOD 1000000007 5 | using namespace std; 6 | int main() 7 | { 8 | int cases; 9 | scanf("%d",&cases); 10 | while(cases--){ 11 | int N; 12 | scanf("%d",&N); 13 | bool vis[N+1]; 14 | memset(vis,0,sizeof(bool)*(N+1)); 15 | int count=0; 16 | for(int i=1;i 2 | #include 3 | #include 4 | #include 5 | using namespace std; 6 | 7 | 8 | int main() 9 | { 10 | int t; 11 | cin>>t; 12 | 13 | 14 | while(t--) 15 | { 16 | int n,k; 17 | vector a; 18 | cin>>n>>k; 19 | int sum=0; 20 | for(int i=0;i>x; 24 | a.push_back(x); 25 | sum+=a[i]; 26 | } 27 | sort(a.begin(),a.end()); 28 | if(n-k 2 | using namespace std; 3 | 4 | int main() 5 | { 6 | #ifndef ONLINE_JUDGE 7 | freopen("test.txt","r",stdin); 8 | #endif 9 | 10 | char yes[] = "YES"; 11 | char no[] = "NO"; 12 | int t; 13 | cin>>t; 14 | while(t--) 15 | { 16 | int n,k; 17 | cin>>n>>k; 18 | int evenCount = 0; 19 | 20 | for(int i=0;i>a; 23 | evenCount+=((a%2)==0); 24 | } 25 | 26 | if(k==0&&evenCount==n) 27 | cout<=k) 29 | cout< 2 | #include 3 | #include 4 | #include 5 | using namespace std; 6 | using namespace __gnu_cxx; 7 | int main() 8 | { 9 | vector array; 10 | int n; 11 | cin>>n; 12 | array.reserve(n); 13 | for(int i=0;i>a; 17 | array.push_back(a); 18 | } 19 | 20 | 21 | hash_map sums; 22 | for(int i=0;i 2 | 3 | 4 | int subsetsum(int a[],int n) 5 | { 6 | int pow=1; 7 | int sum=0; 8 | for(int i=0;i>=1; 18 | k++; 19 | } 20 | } 21 | return sum; 22 | } 23 | int main() 24 | { 25 | int a[]={1,2,3}; 26 | printf("%d",subsetsum(a,sizeof(a)/sizeof(*a))); 27 | getchar(); 28 | } 29 | -------------------------------------------------------------------------------- /hackerearth/coderush/p4.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main(){ 6 | int t; 7 | cin>>t; 8 | while(t--){ 9 | int p; 10 | cin>>p; 11 | vector nodesConnected(p+1); 12 | int q; 13 | cin>>q; 14 | while(q--){ 15 | int n,a; 16 | cin>>n>>a; 17 | a--; 18 | nodesConnected[a]++; 19 | nodesConnected[a+n]--; 20 | } 21 | int MAX = 0; 22 | for(int i=1;i 2 | 3 | 4 | int subsetsum(int a[],int n) 5 | { 6 | int pow=1; 7 | int sum=0; 8 | for(int i=0;i>=1; 18 | k++; 19 | } 20 | } 21 | return sum; 22 | } 23 | int main() 24 | { 25 | int a[]={1,2,3}; 26 | printf("sum = %d",subsetsum(a,sizeof(a)/sizeof(*a))); 27 | getchar(); 28 | } 29 | -------------------------------------------------------------------------------- /TEST/dequeue.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | class MyQueue//Our data structure 4 | { 5 | deque D;//We need 2 deque objects 6 | deque Min; 7 | 8 | push(element)//pushing element to MyQueue 9 | { 10 | D.push_back(element); 11 | while(Min.is_not_empty() and Min.back()>element) 12 | Min.pop_back(); 13 | Min.push_back(element); 14 | } 15 | pop()//poping MyQueue 16 | { 17 | if(Min.front()==D.front() ) 18 | Min.pop_front(); 19 | D.pop_front(); 20 | } 21 | 22 | min() 23 | { 24 | return Min.front(); 25 | } 26 | } 27 | -------------------------------------------------------------------------------- /codechef/TWTCLOSE.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | 6 | int main() 7 | { 8 | int n,k; 9 | cin>>n>>k; 10 | map tweet; 11 | int count=0; 12 | while(k--) 13 | { 14 | char command[100]; 15 | int number; 16 | cin>>command; 17 | if(command[2]=='I') 18 | { 19 | cin>>number; 20 | if(tweet[number]) 21 | { 22 | count--; 23 | tweet[number]=false; 24 | } 25 | else 26 | { 27 | count++; 28 | tweet[number]=true; 29 | } 30 | } 31 | else 32 | { 33 | count=0; 34 | tweet.clear(); 35 | } 36 | cout< 2 | #include 3 | using namespace std; 4 | 5 | int main(){ 6 | map stickCount; 7 | 8 | bool isFour=false; 9 | for(int i=0;i<6;i++){ 10 | int stick; 11 | cin>>stick; 12 | stickCount[stick]++; 13 | if(stickCount[stick]==4) 14 | isFour=true; 15 | } 16 | if(isFour){ 17 | int count=stickCount.size(); 18 | for(map::iterator i=stickCount.begin();i!=stickCount.end();i++) 19 | if(i->second==4) 20 | count--; 21 | if(count==0||count==1) 22 | cout<<"Elephant"; 23 | else 24 | cout<<"Bear"; 25 | } 26 | else 27 | cout<<"Alien"; 28 | } 29 | -------------------------------------------------------------------------------- /codechef/bytes/BYTESE.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define MAX 1000010 3 | char input[MAX]; 4 | char twin1[MAX]; 5 | char twin2[MAX]; 6 | int main() 7 | { 8 | int t; 9 | scanf("%d",&t); 10 | getchar(); 11 | while(t--) 12 | { 13 | 14 | int p1=0; 15 | int p2=0; 16 | twin1[p1]=0; 17 | gets(input); 18 | for(int i=0;input[i];i++) 19 | { 20 | if(input[i]==twin1[p2]) 21 | twin2[p2++]=input[i]; 22 | else 23 | twin1[p1++]=input[i]; 24 | 25 | } 26 | twin1[p1]=NULL; 27 | if(p1==p2&&p1>=1) 28 | printf("%s\n",twin1); 29 | else 30 | printf("Twins don\'t exist\n"); 31 | } 32 | return 0; 33 | } 34 | -------------------------------------------------------------------------------- /G.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | freopen("testG.txt","r",stdin); 8 | ios_base::sync_with_stdio(false); 9 | int n,m; 10 | while(cin>>n) 11 | { 12 | cin>>m; 13 | vector > grid(n,vector(m)); 14 | for(int i=0;i>grid[i][j]; 17 | 18 | for(int j=m-2;j>=0;j--) 19 | for(int i=0;i 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | inline int gcd(int a, int b) 7 | { 8 | int temp; 9 | while(b) 10 | { 11 | temp=a; 12 | a=b; 13 | b=temp%b; 14 | } 15 | return a; 16 | } 17 | 18 | int main(){ 19 | int t; 20 | cin>>t; 21 | while(t--){ 22 | int n; 23 | cin>>n; 24 | int a; 25 | cin>>a; 26 | for(int i=1;i>x; 29 | a=gcd(a,x); 30 | } 31 | if(a==1) 32 | cout< 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | #define nMAX 1000000 7 | int main(){ 8 | 9 | srand(time(NULL)); 10 | int n=nMAX; 11 | for(int i=0;i 2 | #include 3 | #include 4 | #include 5 | using namespace std; 6 | 7 | int main() 8 | { 9 | freopen("test2.txt","w",stdout); 10 | srand(time(NULL)); 11 | int n=100; 12 | int c=100; 13 | cout< > S; 16 | while(c--) 17 | { 18 | int a=1+rand()%n; 19 | int b=1+rand()%n; 20 | while(a==b||S.find(make_pair(a,b))!=S.end()) 21 | { 22 | a=1+rand()%n; 23 | b=1+rand()%n; 24 | } 25 | S.insert(make_pair(a,b)); 26 | S.insert(make_pair(b,a)); 27 | 28 | cout< 2 | intssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssss{ssssssss 3 | chaadsadsadsadsadsadsadsadsadsadsr a; 4 | char bssssss; 5 | chassssr ssssc; 6 | } 7 | -------------------------------------------------------------------------------- /codechef/Dilivery boy.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() 4 | { 5 | unsigned int n,m; 6 | unsigned int t[250][250]; 7 | unsigned int s,g,d; 8 | unsigned int o1,o2; 9 | scanf("%d",&n); 10 | for(int i=0;i 2 | using namespace std; 3 | 4 | int main(){ 5 | int n; 6 | cin>>n; 7 | int s; 8 | cin>>s; 9 | 10 | pair money= make_pair(s,0); 11 | int currentMax = -1; 12 | for(int i=0;i currentCost; 14 | cin>>currentCost.first>>currentCost.second; 15 | for(int j=1;j==1;j++){ 16 | pair newCost = make_pair(currentCost.first*j+(currentCost.second*j)/100,(currentCost.second*j)%100); 17 | if(newCost<=money){ 18 | currentMax= max(currentMax,((100-newCost.second!=100)?100-newCost.second:0)); 19 | } 20 | } 21 | } 22 | cout< 2 | #include 3 | using namespace std; 4 | 5 | int main(){ 6 | int t; 7 | cin>>t; 8 | vector numbers; 9 | for(int i=0;i>x; 12 | numbers.push_back(x); 13 | } 14 | vector isPossible(t+1,false); 15 | isPossible[t]=true; 16 | for(int i=t-1;i>=0;i--) 17 | if(i+numbers[i]+1 2 | #include 3 | using namespace std; 4 | 5 | int main(){ 6 | int n,m; 7 | cin>>n>>m; 8 | map, pair > object; 9 | 10 | while(n--){ 11 | int attr,id,value,pr; 12 | cin>>attr>>id>>value>>pr; 13 | pair key=make_pair(attr,id); 14 | 15 | pair lastValue=object[key]; 16 | pair newValue=make_pair(value,pr); 17 | if(lastValue.second<=newValue.second) 18 | object[key]=newValue; 19 | } 20 | while(m--){ 21 | int attr,id; 22 | cin>>attr>>id; 23 | pair value=object[make_pair(attr,id)]; 24 | cout<#include<iostream> 2 | #include<map> 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | int n; 8 | cin>>n; 9 | map<int,int> smaller; 10 | 11 | int a; 12 | cin>>a; 13 | smaller[a]++; 14 | for(int i=0;i<n-1;i++) 15 | { 16 | 17 | int a; 18 | cin>>a; 19 | 20 | if(!smaller[a]) 21 | { 22 | map<int,int>::iterator x=smaller.find(a); 23 | if(x!=smaller.begin()) 24 | x--; 25 | if(x->second) 26 | x->second--; 27 | if(x->second==0) 28 | smaller.erase(x); 29 | smaller[a]++; 30 | } 31 | } 32 | cout<<smaller.size(); 33 | } -------------------------------------------------------------------------------- /codechef/WPC/p2.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main(){ 6 | char a; 7 | int lastCount=0; 8 | char lastCharacter='a'; 9 | int maxCount=0; 10 | char maxCharacter='a'; 11 | while(cin>>a){ 12 | if(a==lastCharacter){ 13 | lastCount++; 14 | } 15 | else{ 16 | lastCharacter=a; 17 | lastCount=1; 18 | } 19 | 20 | if(maxCount 2 | #include 3 | using namespace std; 4 | 5 | int DP[2][101][101]; 6 | 7 | int solve(int i,int n,int k,int last=0) 8 | { 9 | if(i==0) 10 | return solve(i+1,n,k,0)+solve(i+1,n,k,1); 11 | 12 | if(i==n) 13 | { 14 | if(k==0) 15 | return 1; 16 | else 17 | return 0; 18 | } 19 | else return solve(i+1,n,k-last,1)+solve(i+1,n,k,0); 20 | } 21 | int main() 22 | { 23 | freopen("testB.txt","r",stdin); 24 | int T; 25 | cin>>T; 26 | while(T--) 27 | { 28 | int t; 29 | cin>>t; 30 | cout<>n>>k; 34 | cout< 2 | #include 3 | using namespace std; 4 | 5 | 6 | int main() 7 | { 8 | int t; 9 | cin>>t; 10 | while(t--) 11 | { 12 | int n; 13 | cin>>n; 14 | deque digits; 15 | while(n) 16 | { 17 | digits.push_front(n&1); 18 | n/=2; 19 | } 20 | 21 | int i=0,j=1; 22 | int chance=0; 23 | while(i 2 | #include 3 | int func(int n) 4 | { 5 | int low=1; 6 | int high=sqrt(n); 7 | int mid; 8 | if(n==0) return 1; 9 | while(low<=high) 10 | { 11 | 12 | mid=(high+low)/2; 13 | if((mid*mid+2*mid>=n)&&((mid*mid-1) 2 | #include 3 | using namespace std; 4 | 5 | 6 | int main(){ 7 | //freopen("rectTest.txt","r",stdin); 8 | vector > board(1000,vector(1000,0)); 9 | int q; 10 | cin>>q; 11 | while(q--){ 12 | char type; 13 | cin>>type; 14 | int x,y; 15 | cin>>x>>y; 16 | switch(type){ 17 | case 'I': board[x][y]++; 18 | break; 19 | case 'D': board[x][y]--; 20 | break; 21 | case 'Q': 22 | int sum=0; 23 | for(int i=0;i<=x;i++) 24 | for(int j=0;j<=y;j++) 25 | sum+=board[i][j]; 26 | 27 | cout< 2 | #include 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | int t; 8 | cin>>t; 9 | while(t--) 10 | { 11 | long long n,k; 12 | cin>>n>>k; 13 | 14 | long long rounds=((-1+sqrt(double(1+8*n)))/(2*k)); 15 | 16 | n-=((rounds*k)*(rounds*k+1))/2; 17 | 18 | for(int i=1;i<=k;i++) 19 | { 20 | long long solution=0; 21 | if(rounds>0) 22 | solution=(rounds*((2*i+(rounds-1)*k)))/2; 23 | 24 | long long term=i+(rounds)*k; 25 | 26 | solution+=min(term,n); 27 | n-=min(term,n); 28 | cout< 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | 7 | int main() 8 | { 9 | int t; 10 | cin>>t; 11 | while(t--) 12 | { 13 | int n; 14 | unsigned long long m; 15 | cin>>n>>m; 16 | vector p(n); 17 | for(int i=0;i>p[i]; 19 | 20 | sort(p.begin(),p.end()); 21 | 22 | unsigned long long x=0; 23 | int i; 24 | for(i=n-1;i>=0;i--) 25 | { 26 | x+=p[i]; 27 | if(x>=m) 28 | break; 29 | } 30 | 31 | if(x>=m) 32 | cout< 2 | #include 3 | using namespace std; 4 | 5 | 6 | int main() 7 | { 8 | int t; 9 | cin>>t; 10 | while(t--) 11 | { 12 | int n; 13 | cin>>n; 14 | 15 | vector stickcount(500); 16 | 17 | vector pos(500); 18 | vector h(500); 19 | 20 | for(int i=0;i>pos[i]>>h[i]; 23 | pos[i]+=200; 24 | stickcount[pos[i]]++; 25 | } 26 | 27 | for(int i=1;i<=stickcount.size();i++) 28 | stickcount[i]+=stickcount[i-1]; 29 | 30 | for(int i=0;i 2 | #include 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | int n; 8 | long long m; 9 | scanf("%d %lld",&n,&m); 10 | 11 | vector A(n); 12 | for(int i=0;i 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | 7 | int main() 8 | { 9 | int n,s,t; 10 | cin>>n>>s>>t; 11 | s--; 12 | t--; 13 | vector next(n); 14 | for(int i=0;i>next[i]; 17 | next[i]--; 18 | } 19 | vector distance(n,-1); 20 | distance[s]=0; 21 | queue Q; 22 | Q.push(s); 23 | while(!Q.empty()) 24 | { 25 | int current=Q.front(); 26 | Q.pop(); 27 | if(distance[next[current]]==-1) 28 | { 29 | distance[next[current]]=distance[current]+1; 30 | Q.push(next[current]); 31 | } 32 | } 33 | 34 | cout< 2 | #include 3 | using namespace std; 4 | 5 | int main() 6 | { 7 | int n; 8 | long long m; 9 | scanf("%d %lld",&n,&m); 10 | 11 | vector A(n); 12 | for(int i=0;i 2 | int recurse(int n,int turn) 3 | { 4 | if(n==1) 5 | return turn; 6 | 7 | for(int i=n-1;i>=1;i--) 8 | { 9 | if(n%i==0) 10 | { 11 | if(recurse(n-i,turn*(-1))!=turn) 12 | return turn *(-1); 13 | } 14 | } 15 | return turn; 16 | } 17 | int main() 18 | { 19 | int t; 20 | scanf("%d",&t); 21 | while(t--) 22 | { 23 | int n; 24 | scanf("%d",&n); 25 | printf("%s\n",(recurse(n,1)==(-1))?"ALICE":"BOB"); 26 | } 27 | return 0; 28 | } 29 | -------------------------------------------------------------------------------- /codechef/OCT14/FATCHEF.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | #define MOD 1000000009 7 | int main(){ 8 | ios::sync_with_stdio(false); 9 | int t; 10 | cin>>t; 11 | while(t--){ 12 | int n,m; 13 | cin>>n>>m; 14 | vector > colors(m); 15 | for(int i=0;i>colors[i].second>>colors[i].first; 17 | sort(colors.begin(),colors.end()); 18 | 19 | long long ans=1; 20 | for(int i=1;i 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int main(){ 7 | freopen("p2.txt","r",stdin); 8 | int t; 9 | cin>>t; 10 | getchar(); 11 | while(t--){ 12 | int num1,num2,den1,den2; 13 | char s[1000]; 14 | cin.getline(s,sizeof(s)); 15 | cout< 2 | #include 3 | #include 4 | #include 5 | union REGS r; 6 | void main (void) 7 | { 8 | int x=100,y=100; 9 | int gd=DETECT,gm; 10 | initgraph(&gd,&gm,"c:\\tc\\bgi"); 11 | rectangle(100,100,200,120); 12 | rectangle(102,102,198,118); 13 | r.x.ax=0; 14 | int86(0x33,&r,&r); 15 | r.x.ax=1; 16 | int86(0x33,&r,&r); 17 | while(!kbhit()) 18 | { 19 | r.x.ax=3; 20 | x=r.x.cx; 21 | y=r.x.dx; 22 | int86(0x33,&r,&r); 23 | if(x>102 && x<198 && y>102 && y<118) 24 | { 25 | setcolor(15); 26 | outtextxy(105,105,"Over"); 27 | delay(100); 28 | setcolor(0); 29 | outtextxy(105,105,"Over"); 30 | } 31 | 32 | } 33 | 34 | getche(); 35 | closegraph(); 36 | } 37 | -------------------------------------------------------------------------------- /codechef/DRAGNXOR.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | 5 | int main() 6 | { 7 | int t; 8 | cin>>t; 9 | while(t--) 10 | { 11 | int n,a,b; 12 | cin>>n>>a>>b; 13 | int a1=0,a0=0,b1=0,b0=0; 14 | while(a) 15 | { 16 | if(a&1) 17 | a1++; 18 | a>>=1; 19 | } 20 | 21 | while(b) 22 | { 23 | if(b&1) 24 | b1++; 25 | b>>=1; 26 | } 27 | 28 | a0=n-a1; 29 | b0=n-b1; 30 | 31 | int tot1=min(a1,b0)+min(b1,a0); 32 | 33 | int ans=1<<(n-1); 34 | 35 | while(tot1>1) 36 | { 37 | ans=ans|(ans>>1); 38 | tot1--; 39 | } 40 | if(a1==0 &&b1==0) cout<<0< 2 | #include 3 | using namespace std; 4 | 5 | 6 | int main() 7 | { 8 | int t; 9 | cin>>t; 10 | while(t--) 11 | { 12 | int n,k; 13 | cin>>n>>k; 14 | if(k>n-k) 15 | k=n-k; 16 | long long sum=0; 17 | priority_queue min_weights; 18 | for(int i=0;i>a; 22 | sum+=a; 23 | min_weights.push(a); 24 | // cout<k) 26 | min_weights.pop(); 27 | } 28 | long long sum2=0; 29 | while(!min_weights.empty()) 30 | { 31 | sum2+=min_weights.top(); 32 | min_weights.pop(); 33 | } 34 | cout< 2 | #include 3 | using namespace std; 4 | 5 | #define MOD 1000000007 6 | template T p(T n,int m) 7 | { 8 | if(m==0) return 1%MOD; 9 | 10 | T x=p(n,m/2); 11 | if(m%2==0) 12 | return (x*x)%MOD; 13 | else 14 | return (((x*x)%MOD)*n)%MOD; 15 | } 16 | 17 | 18 | 19 | int main(){ 20 | ios::sync_with_stdio(false); 21 | int t; 22 | cin>>t; 23 | while(t--){ 24 | long long n,m; 25 | cin>>n>>m; 26 | long long ans=0; 27 | if(n>=1) 28 | ans=m; 29 | if(n>=2) 30 | ans=(ans*(m-1))%MOD; 31 | if(n>=3) 32 | ans=(ans*p(m-2,n-2))%MOD; 33 | cout< 2 | using namespace std; 3 | 4 | int main() 5 | {int n,i,j; 6 | cin>>n; 7 | char s[n+1][n+2]; 8 | for(i=0;i>s[i]; 10 | int flag=1; 11 | for(i=0;i 3 | 4 | #define MAX 10001 5 | #define MOD 1000000007 6 | int w[MAX]; 7 | 8 | void precompute() 9 | { 10 | w[0]=1; 11 | w[1]=1; 12 | for(int n=2;n 3 | 4 | #define MAX 109 5 | #define MOD 1000000007 6 | int w[MAX]; 7 | 8 | void precompute() 9 | { 10 | w[0]=1; 11 | w[1]=1; 12 | for(int n=2;n 4 | #include 5 | int smaller2(int n) 6 | { 7 | int i=1; 8 | 9 | while(n) 10 | { 11 | n>>=1; 12 | i<<=1; 13 | } 14 | i>>=1; 15 | return i; 16 | } 17 | 18 | int Smaller2(int n) 19 | { 20 | n=n>>1|n; 21 | n=n>>2|n; 22 | n=n>>4|n; 23 | n=n>>8|n; 24 | n=n>>16|n; 25 | n=(n+1)>>1; 26 | return n; 27 | } 28 | int main() 29 | { printf("%d\n",smaller2(130)); 30 | printf("%d\n",Smaller2(130)); 31 | system("pause"); 32 | } 33 | // 34 | -------------------------------------------------------------------------------- /spoj/GNY07H.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | #define MAX 1000000 6 | int main() 7 | { 8 | vector F(MAX); 9 | vector S(MAX); 10 | vector G(MAX); 11 | F[0]=1; 12 | 13 | for(int i=1;i=2) 16 | G[i]=G[i-2]+F[i-2]; 17 | 18 | if(i>=3) 19 | S[i]=F[i-2]+F[i-3]+S[i-2]; 20 | else if(i>=2) 21 | S[i]=F[i-2]+S[i-2]; 22 | 23 | if(i>=2) 24 | F[i]=F[i-1]+F[i-2]+2*S[i]+G[i]; 25 | else 26 | F[i]=F[i-1]+2*S[i]+G[i]; 27 | } 28 | 29 | 30 | 31 | int t; 32 | cin>>t; 33 | for(int T=1;T<=t;T++) 34 | { 35 | int n; 36 | cin>>n; 37 | cout< 11 | #define SIZEOF(a) (sizeof(a)/sizeof(*a)) 12 | int find(int a[],int low,int high) 13 | { 14 | if(low==high) return -1; 15 | int mid=(low+high)/2; 16 | if(a[mid-1]>a[mid]&&a[mid+1]>a[mid]) return mid; 17 | else if(a[mid+1] 2 | #include 3 | using namespace std; 4 | 5 | map lookuptable; 6 | 7 | long long solve(long long n) 8 | { 9 | if(n==0) 10 | return 0; 11 | else 12 | long long ans=0; 13 | if(lookuptable.find(n/2)==lookuptable.end()) 14 | lookuptable[n/2]=solve(n/2); 15 | if(lookuptable.find(n/3)==lookuptable.end()) 16 | lookuptable[n/3]=solve(n/3); 17 | if(lookuptable.find(n/4)==lookuptable.end()) 18 | lookuptable[n/4]=solve(n/4); 19 | return max(lookuptable[n/2]+lookuptable[n/3]+lookuptable[n/4],n); 20 | } 21 | 22 | int main() 23 | { 24 | int n; 25 | 26 | while(cin>>n) 27 | { 28 | cout< 2 | #include 3 | using namespace std; 4 | 5 | 6 | bool islapindrome(char *a,char *b,int l) 7 | { 8 | int hash[26]={0}; 9 | for(int i=0;i>t; 24 | while(t--) 25 | { 26 | char a[2000]; 27 | cin>>a; 28 | int l=strlen(a); 29 | int ans; 30 | if(l%2==0) 31 | ans=islapindrome(a,a+l/2,l/2); 32 | else 33 | ans=islapindrome(a,a+l/2+1,l/2); 34 | cout<<(ans?"YES":"NO")< 2 | #include 3 | #include 4 | #include 5 | using namespace std; 6 | 7 | 8 | int main(){ 9 | srand(time(NULL)); 10 | int q=2000; 11 | const int X = 1000; 12 | const int Y = 1000; 13 | cout< > board(X,vector(Y)); 15 | char queries[3]={'I','Q','D'}; 16 | while(q--){ 17 | int x=rand()%X; 18 | int y=rand()%Y; 19 | char query; 20 | if(board[x][y]) 21 | query=queries[rand()%3]; 22 | else 23 | query=queries[rand()%2]; 24 | 25 | cout< 2 | #include 3 | using namespace std; 4 | 5 | #define MAX 1000000 6 | int main() 7 | { 8 | vector F(MAX); 9 | vector S(MAX); 10 | vector G(MAX); 11 | F[0]=1; 12 | 13 | for(int i=1;i=2) 16 | G[i]=G[i-2]+F[i-2]; 17 | 18 | if(i>=3) 19 | S[i]=F[i-2]+F[i-3]+S[i-2]; 20 | else if(i>=2) 21 | S[i]=F[i-2]+S[i-2]; 22 | 23 | if(i>=2) 24 | F[i]=F[i-1]+F[i-2]+2*S[i]+G[i]; 25 | else 26 | F[i]=F[i-1]+2*S[i]+G[i]; 27 | } 28 | 29 | 30 | 31 | int t; 32 | cin>>t; 33 | for(int T=1;T<=t;T++) 34 | { 35 | int n; 36 | cin>>n; 37 | cout< 2 | using namespace std; 3 | 4 | #define MOD (1000000000+7) 5 | 6 | 7 | long long p(int n,int m) 8 | { 9 | if(m==0) return 1; 10 | 11 | long long x=p(n,m/2); 12 | if(m%2==0) 13 | return (x*x)%MOD; 14 | else 15 | return (((x*x)%MOD)*n)%MOD; 16 | } 17 | 18 | 19 | int main() 20 | { 21 | int t; 22 | cin>>t; 23 | long long i25=p(25,MOD-2); 24 | while(t--) 25 | { 26 | int n; 27 | cin>>n; 28 | long long ans=0; 29 | 30 | ans=(2*((((26*(MOD+p(26,n/2)-1))%MOD)*i25)%MOD))%MOD; 31 | if(n%2) 32 | { 33 | ans+=p(26,n/2+1); 34 | ans%=MOD; 35 | } 36 | cout< 2 | #include 3 | using namespace std; 4 | 5 | #define PRECISION 0.0000001 6 | double p(double n,int m) 7 | { 8 | if(m==0) return 1; 9 | 10 | double x=p(n,m/2); 11 | if(m%2==0) 12 | return (x*x); 13 | else 14 | return ((x*x)*n); 15 | } 16 | 17 | int main() 18 | { 19 | int t; 20 | cin>>t; 21 | while(t--) 22 | { 23 | int n,k; 24 | cin>>n>>k; 25 | cout.setf(ios::fixed); 26 | cout.precision(6); 27 | 28 | if(n==0) 29 | cout<<0.0< 2 | using namespace std; 3 | 4 | 5 | int main() 6 | { 7 | int t; 8 | int s[5000]; 9 | int n; 10 | scanf("%d",&t); 11 | while(t--) 12 | { 13 | unsigned int n; 14 | cin>>n; 15 | unsigned int m=n; 16 | if(!(m%2)){n--;} 17 | 18 | unsigned int ans=((n-1)*(n+1)/2)+2; 19 | 20 | if(!(m%2)) 21 | { 22 | ans=ans+m%1000000007; 23 | ans=ans%1000000007; 24 | } 25 | cout< 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int main() 7 | { 8 | int t; 9 | cin>>t; 10 | while(t--) 11 | { 12 | int n; 13 | cin>>n; 14 | vector array(n); 15 | for(int i=0;i>array[i]; 17 | 18 | sort(array.begin(),array.end()); 19 | 20 | long long count=0; 21 | 22 | size_t lastdifferent=0; 23 | 24 | array.push_back(0); 25 | 26 | for(size_t i=0;i