├── ABCD(2).cpp ├── ABCDEF.cpp ├── ABCPATH.cpp ├── ABCSTR.cpp ├── ACODE.cpp ├── ACPC10D.cpp ├── ACPC11B.cpp ├── ACS.cpp ├── ADDMUL.cpp ├── ADIGIT.c ├── AE00.cpp ├── AGGRCOW.cpp ├── AIBOH.cpp ├── AKS.cpp ├── ALICESIE.cpp ├── ALIEN.cpp ├── ALMA01.cpp ├── ALMA02.cpp ├── ALMA03.cpp ├── ALMA05.cpp ├── AMR10G.cpp ├── AMR11E.cpp ├── AMR12D.cpp ├── AMR14D.cpp ├── AMR14E.cpp ├── ANARC05B.cpp ├── ANARC05H.cpp ├── ANARC08H.cpp ├── ANARC09A.cpp ├── ANARC09B.cpp ├── ANDTUP.cpp ├── ANDTUPLE.cpp ├── ANKGAME.cpp ├── ANKPAREN.cpp ├── ANUARM.cpp ├── ANUDTC.cpp ├── ANUMLA.cpp ├── ANUUND.cpp ├── ANUWTA.cpp ├── AP2.cpp ├── ARCHERY.cpp ├── ARHN04.cpp ├── ARHN07.cpp ├── ARHN08.cpp ├── ARHN09.cpp ├── ARHN10.cpp ├── ARRAYSUB.cpp ├── ARRGAME2.cpp ├── ASHIGIFT.cpp ├── ASSIGN(2).cpp ├── ASSIST.cpp ├── BABTWR.cpp ├── BANDW.cpp ├── BEADS.cpp ├── BINSTIRL.cpp ├── BINTOUR.cpp ├── BITMAP.cpp ├── BLINNET.cpp ├── BORW.cpp ├── BRACKETS.cpp ├── BRCKTS(2).cpp ├── BRCKTS.cpp ├── BRIDGE.cpp ├── BRIN.cpp ├── BST.cpp ├── BST[TEE].cpp ├── BTCD1501.cpp ├── BTREE.c ├── BUGLIFE.cpp ├── BUSYMAN.cpp ├── BYECAKES.cpp ├── BYTESE2.cpp ├── BYTESM2.cpp ├── CADYDIST.cpp ├── CAPPLE.cpp ├── CBARG.cpp ├── CD1IT1.cpp ├── CD1IT2.cpp ├── CD1IT3.cpp ├── CD1IT4.cpp ├── CD1IT5.cpp ├── CDCR15_1.cpp ├── CDCR15_2.cpp ├── CDCR15_3.cpp ├── CDCR15_4.cpp ├── CDMN03.cpp ├── CDMN05.cpp ├── CDMN05_2.cpp ├── CDVA1502.cpp ├── CDVA1503.cpp ├── CDVA1504.cpp ├── CDVA1505.cpp ├── CDVA1507.cpp ├── CDVA1508.cpp ├── CDVA1509.cpp ├── CDVA1510.cpp ├── CDVS1506.cpp ├── CF009C.cpp ├── CF109A.cpp ├── CF118D.cpp ├── CF135A.cpp ├── CF137C.cpp ├── CF149C.cpp ├── CF152C.cpp ├── CF182D.cpp ├── CF18C.cpp ├── CF208D.cpp ├── CF217A.cpp ├── CF220A.cpp ├── CF225C.cpp ├── CF231C.cpp ├── CF231D.cpp ├── CF235A.cpp ├── CF246D.cpp ├── CF251A.cpp ├── CF254A.cpp ├── CF254C.cpp ├── CF264A.cpp ├── CF264B.cpp ├── CF268C.cpp ├── CF269B.cpp ├── CF271A.cpp ├── CF271C.cpp ├── CF271D.cpp ├── CF276D.cpp ├── CF279A.cpp ├── CF279B.cpp ├── CF279C.cpp ├── CF283A.cpp ├── CF285A.cpp ├── CF295B.cpp ├── CF300C.cpp ├── CF337C.cpp ├── CF339D.cpp ├── CF343A.cpp ├── CF348A.cpp ├── CF350C.cpp ├── CF354A.cpp ├── CF363C.cpp ├── CF371C.cpp ├── CF375B.cpp ├── CF377A.cpp ├── CF382C.cpp ├── CF385C.cpp ├── CF388A.cpp ├── CF401C.cpp ├── CF407B.cpp ├── CF414A.cpp ├── CF414B.cpp ├── CF424C(2).cpp ├── CF424C.cpp ├── CF427C(2).cpp ├── CF427C.cpp ├── CF429A.cpp ├── CF429B.cpp ├── CF431C.cpp ├── CF441C.cpp ├── CF445A.cpp ├── CF445B.cpp ├── CF445C.cpp ├── CF447B.cpp ├── CF447C.cpp ├── CF447a.cpp ├── CF448D.cpp ├── CF451D.cpp ├── CF455A.cpp ├── CF456P0.cpp ├── CF459C.cpp ├── CF462A.cpp ├── CF462B.cpp ├── CF462C.cpp ├── CF462D.cpp ├── CF463A.cpp ├── CF463B.cpp ├── CF463C.cpp ├── CF463C_2.cpp ├── CF463D.cpp ├── CF464A.cpp ├── CF466C.cpp ├── CF469A.cpp ├── CF469B.cpp ├── CF471B.cpp ├── CF472A.cpp ├── CF472B.cpp ├── CF472C.cpp ├── CF472D.cpp ├── CF472D_2.cpp ├── CF477B.cpp ├── CF478C.cpp ├── CF478D.cpp ├── CF479C.cpp ├── CF479D(2).cpp ├── CF479D.cpp ├── CF483B.cpp ├── CF483C.cpp ├── CF484B.cpp ├── CF485A.cpp ├── CF485B.cpp ├── CF485C.cpp ├── CF485D.cpp ├── CF486C.cpp ├── CF488A.cpp ├── CF488B.cpp ├── CF489C.cpp ├── CF489D.cpp ├── CF490C.cpp ├── CF493C.cpp ├── CF493D.cpp ├── CF495B.cpp ├── CF495C.cpp ├── CF496A.cpp ├── CF498A.cpp ├── CF500A.cpp ├── CF500B.cpp ├── CF500C.cpp ├── CF501B.cpp ├── CF501C.cpp ├── CF505A.cpp ├── CF505B.cpp ├── CF505C.cpp ├── CF507C.cpp ├── CF508A.cpp ├── CF508B.cpp ├── CF508C.cpp ├── CF509A.cpp ├── CF509B.cpp ├── CF509C.cpp ├── CF509E.cpp ├── CF510B.cpp ├── CF510C.cpp ├── CF510C_2.cpp ├── CF514C.cpp ├── CF514C_2.cpp ├── CF515A.cpp ├── CF515B.cpp ├── CF515C.cpp ├── CF515D.cpp ├── CF518A.cpp ├── CF518B.cpp ├── CF518C.cpp ├── CF519C.cpp ├── CF520C.cpp ├── CF523C.cpp ├── CF524C.cpp ├── CF525C.cpp ├── CF526C.cpp ├── CF534C.cpp ├── CF538A.cpp ├── CF538B.cpp ├── CF538C.cpp ├── CF544A.cpp ├── CF544B.cpp ├── CF545B.cpp ├── CF545C.cpp ├── CF545D.cpp ├── CF548A.cpp ├── CF548B.cpp ├── CF548C.cpp ├── CF549A.cpp ├── CF549D.cpp ├── CF549G.cpp ├── CF549H.cpp ├── CF550A.cpp ├── CF550B.cpp ├── CF550C.cpp ├── CF550D.cpp ├── CF551C.cpp ├── CF552A.cpp ├── CF552B.cpp ├── CF552C.cpp ├── CF552D.cpp ├── CF554.cpp ├── CF554B.cpp ├── CF554C.cpp ├── CF556A.cpp ├── CF556B.cpp ├── CF556C.cpp ├── CF556D.cpp ├── CF558C(2).cpp ├── CF558C.cpp ├── CF560A.cpp ├── CF560B.cpp ├── CF560C.cpp ├── CFRTEST.cpp ├── CHBILL.cpp ├── CHCUBE.cpp ├── CHECK.cpp ├── CHEFANUP.cpp ├── CHEFAXR.cpp ├── CHEFBR(3).cpp ├── CHEFCH.cpp ├── CHEFDTRE.cpp ├── CHEFEQ.cpp ├── CHEFGR.cpp ├── CHEFGRPH(2).cpp ├── CHEFGRPH(3).cpp ├── CHEFGRPH.cpp ├── CHEFHOME.cpp ├── CHEFLR.cpp ├── CHEFPNT_2.cpp ├── CHEFPOW.cpp ├── CHEFPRES(2).cpp ├── CHEFSEG.cpp ├── CHEFSQUA(2).cpp ├── CHEFSTON.cpp ├── CHEFVOTE.cpp ├── CHEFWORD(2).cpp ├── CHEFWORD_2.cpp ├── CHEFZOT.cpp ├── CHICAGO.cpp ├── CHOC.cpp ├── CHOCOLA.cpp ├── CHPLGNS.cpp ├── CHSTR.cpp ├── CIMM2.c ├── CLETAB.cpp ├── CLONE.cpp ├── CLPERM(2).cpp ├── CM1401.cpp ├── CM1403.cpp ├── CM1404.cpp ├── CMPLS.cpp ├── CNOTE.cpp ├── CNPIIM.c ├── COALSCAM.cpp ├── CODESPTB.cpp ├── COINS.cpp ├── COMDIV.cpp ├── COMPILER.c ├── COMPILER.cpp ├── COPS.cpp ├── CPCRC1C.cpp ├── CPRMT.cpp ├── CRAWA.cpp ├── CRDS.cpp ├── CRSCNTRY.cpp ├── CSS2.cpp ├── CSTREET.cpp ├── CSUB.cpp ├── CUBEFR.cpp ├── CUBES.cpp ├── CULPRO.cpp ├── DANGER.cpp ├── DCEPC504.cpp ├── DEPEND.cpp ├── DEVBDAY.cpp ├── DEVJERRY.cpp ├── DEVUGRAP.cpp ├── DIEHARD.cpp ├── DISCHAR.cpp ├── DISHOWN.cpp ├── DISUBSTR.cpp ├── DIVGOLD.cpp ├── DIVNINE.cpp ├── DOMSOL.cpp ├── DOTAA.cpp ├── DSUBSEQ.cpp ├── DUSBSEQ.cpp ├── DoublyLinkedList.cpp ├── EBOXES.cpp ├── EC_CONB.cpp ├── EDIST(2).cpp ├── EDIT.cpp ├── EGBOBRD.cpp ├── EGYPIZZA.cpp ├── EIGHTS.cpp ├── ELIS.cpp ├── ENIGMATH.cpp ├── ETF.cpp ├── FACEFRND.cpp ├── FACTORIZ(2).cpp ├── FACTORIZ(3).cpp ├── FACTORIZ.cpp ├── FANCy.cpp ├── FARIDA.cpp ├── FATCHEF.cpp ├── FBq1.cpp ├── FBq2.cpp ├── FBq3.cpp ├── FBround1_A.cpp ├── FBround1_B(2).cpp ├── FBround1_B.cpp ├── FBround1_C.cpp ├── FBround1_D.cpp ├── FIBCHI.cpp ├── FIBO.cpp ├── FIBOSUM.cpp ├── FISHER.cpp ├── FLAGS.cpp ├── FLAGSII.cpp ├── FNCS.cpp ├── FORGETPW.cpp ├── FPOLICE(2).cpp ├── FPOLICE(3).cpp ├── FPOLICE.cpp ├── FREQUENT.cpp ├── FRNDMTNG.cpp ├── FROGV.cpp ├── FTEMP.cpp ├── FTRIP.cpp ├── GAMES.cpp ├── GAMe2048.cpp ├── GCD2.cpp ├── GCDQ.cpp ├── GENERATE.cpp ├── GLJIVE.cpp ├── GNY07H.cpp ├── GNYR09F.cpp ├── GSS1(2).cpp ├── GSS1.cpp ├── GSS3.cpp ├── GSS[2].cpp ├── GUESS.cpp ├── GUESSTHE.cpp ├── HACKRNDM.cpp ├── HANGOVER.cpp ├── HASHIT.cpp ├── HC.cpp ├── HEADBOB.cpp ├── HECM01.cpp ├── HEMEC1.cpp ├── HEMEC2.cpp ├── HEMEC3.cpp ├── HEMEC4.cpp ├── HEMEC5.cpp ├── HERDING.cpp ├── HIGHWAYS.cpp ├── HISTOGRA(2).cpp ├── HISTOGRA.cpp ├── HLPSUG.cpp ├── HORRIBLE(2).cpp ├── HORRIBLE.cpp ├── HOTELS.cpp ├── HPYBDAY.cpp ├── HPYBDAY_gen.cpp ├── HPYNOS.cpp ├── HREC01.cpp ├── HREC03.cpp ├── HREC04.cpp ├── HREC05.cpp ├── HREC06.cpp ├── HREP02.cpp ├── HRHS01.cpp ├── HRHS02.cpp ├── HTPLM.cpp ├── IEEEBGAM.cpp ├── IGNUS15A.cpp ├── IGNUS15B.cpp ├── IGNUS15D.cpp ├── IGNUS15E.cpp ├── IITK2P01.cpp ├── IITK2P02.cpp ├── IITK2P06.cpp ├── IITK2P08.cpp ├── IITK2P10.cpp ├── IITKWPCB.cpp ├── IITKWPCN.cpp ├── INUMBER.cpp ├── INVER.cpp ├── IOIPALIN.cpp ├── ITM001.cpp ├── ITM002.cpp ├── ITM003.cpp ├── ITM004.cpp ├── IWGBS.cpp ├── IWGBS.py ├── IWIN.cpp ├── JNEXT.cpp ├── JNTUV1.cpp ├── JNTUV2.cpp ├── JNTUV3.cpp ├── JNTUV4.cpp ├── KALKI(2).cpp ├── KGP14A.cpp ├── KGP14B.cpp ├── KGP14C(2).cpp ├── KGP14D.cpp ├── KGP14J.cpp ├── KGSS.cpp ├── KNODES.cpp ├── KNPSK.cpp ├── LABYR1.cpp ├── LCA.cpp ├── LCH15CD.cpp ├── LCH15JAB.cpp ├── LCH15JEF.cpp ├── LCKYST.cpp ├── LEXSTR.cpp ├── LISA.cpp ├── LITE.cpp ├── LUNCH.cpp ├── LexBFS.cpp ├── MAJOR.cpp ├── MARCHA4.cpp ├── MATSUM.cpp ├── MAXDIST.cpp ├── MAXLN.cpp ├── MAXSUMSQ.cpp ├── MAXWOODS.cpp ├── MAYA.cpp ├── MAYHEM15A.cpp ├── MAYHEM15B.cpp ├── MAYHEM15C.cpp ├── MAYHEM15D.cpp ├── MBEEWALK.cpp ├── MBLAST.cpp ├── MCHAIRS.cpp ├── MCHEF.cpp ├── MCOINS.cpp ├── MDIST.cpp ├── MFLAR10.cpp ├── MHTBAG.cpp ├── MHTPAIR.cpp ├── MICEMAZE.cpp ├── MINCOUNT.cpp ├── MISERMAN.cpp ├── MIXTURES.cpp ├── MKLABELS.cpp ├── MMAXPER.cpp ├── MOSTDIST.cpp ├── MPILOT.cpp ├── MRECAMAN.cpp ├── MSTRING.cpp ├── MUL.cpp ├── MULTQ3.cpp ├── MXZERO.cpp ├── MYQ1.cpp ├── NEG2.cpp ├── NOCHANGE.cpp ├── NOKIA.cpp ├── NOTATRI.cpp ├── NPL1.cpp ├── NPL2.cpp ├── NPL3.cpp ├── NSYSTEM.cpp ├── NWAYS.cpp ├── NY10A.cpp ├── NY10E.cpp ├── OFFSIDE.cpp ├── OHANISER.cpp ├── OJUMPS.c ├── OLOLO.cpp ├── ONEKING.cpp ├── ONEZERO.cpp ├── ONP.cpp ├── PAINTBOX.cpp ├── PARTPALI.cpp ├── PARTY.cpp ├── PEBBLE.cpp ├── PERMSUFF(5).cpp ├── PERMUT1.cpp ├── PETERSEN.cpp ├── PFDEP.cpp ├── PHIDIAS.cpp ├── PHONELST.cpp ├── PHYSICS.cpp ├── PIGBANK.cpp ├── PLTGRP.cpp ├── PNTNG.cpp ├── POLEVAL.cpp ├── PON.cpp ├── POUR1(2).cpp ├── POWERMUL(3).cpp ├── PPATH.cpp ├── PPERM.cpp ├── PPTEMP.cpp ├── PQUEUE.cpp ├── PRAC.cpp ├── PRGIFT.cpp ├── PRGM.cpp ├── PRLADDU.cpp ├── PRPALN.cpp ├── PRPOTION.cpp ├── PRVG153.cpp ├── PT07X.cpp ├── PT07Y.cpp ├── PT07Z(4).cpp ├── QCJ2.cpp ├── QSET(lazy).cpp ├── QUADAREA.cpp ├── QUCOBIC.cpp ├── QUCOITA(2).cpp ├── RAINBOWB.cpp ├── RANKLIST.cpp ├── RBTREE.cpp ├── REARSTR.cpp ├── RECBOX.cpp ├── RECCKT.cpp ├── RECMSG.cpp ├── RECPLA.cpp ├── RECREP.cpp ├── RENT(2).cpp ├── RENT.cpp ├── REPUB.cpp ├── RESSTNCE.cpp ├── RETPO.cpp ├── REVERSE.cpp ├── RNUM.cpp ├── ROADNET(2).cpp ├── ROADS(2).cpp ├── ROCK.cpp ├── ROOTCIPH.cpp ├── ROTATION.cpp ├── RPLC.cpp ├── RPLH.cpp ├── RRCOPY.cpp ├── RRFRNDS(2).cpp ├── RRJOKE.cpp ├── RRMTRX2.cpp ├── RRSTONE.cpp ├── RRSUM.cpp ├── SAMER08D.cpp ├── SANSKAR.cpp ├── SBANK.cpp ├── SBETS.cpp ├── SCPC11B.cpp ├── SCUBADIV.cpp ├── SEAGCD(2).cpp ├── SEAGCD.cpp ├── SEALCM(2).cpp ├── SEALCM(brute).cpp ├── SEAND2.cpp ├── SEAVOTE.cpp ├── SGARDEN.cpp ├── SHOP.cpp ├── SIGNWAVE.cpp ├── SILVER.cpp ├── SNOWPRIM.cpp ├── SOLDIER.cpp ├── SPEED.cpp ├── SPELL.cpp ├── SQRBR.cpp ├── STABLEMP.cpp ├── STAMPS.cpp ├── STDYTAB.cpp ├── STFM.cpp ├── STL.cpp ├── STPAR.cpp ├── STRAB.cpp ├── STRBIT.cpp ├── STREET.cpp ├── STREETR.cpp ├── STRQ(2).cpp ├── STRQ.cpp ├── STRSUB.cpp ├── SUBLCM.cpp ├── SUBSTR1.cpp ├── SUMFOUR.cpp ├── SUMITR.cpp ├── SUMPAIR.cpp ├── SWAPS.cpp ├── SWEET.cpp ├── SegmentTree.cpp ├── SinglyLinkedList.cpp ├── StackTEE.cpp ├── TAAND.cpp ├── TAAND2.cpp ├── TADELIVE.cpp ├── TASHIFT.cpp ├── TASUMOBC.cpp ├── TEAM2.cpp ├── TERNARY.cpp ├── THREECOL.cpp ├── THRPWRS.cpp ├── TOE1.cpp ├── TOHU.cpp ├── TREE.cpp ├── TREEROOT.cpp ├── TRGRID.cpp ├── TRIKA.cpp ├── TRIP.cpp ├── TRT(2).cpp ├── TSHIRTS.cpp ├── TSHOW1.cpp ├── TSHPATH.cpp ├── TTEMP.cpp ├── TTENIS.cpp ├── TWENDS.cpp ├── TWOSQR(2).cpp ├── TWTCLOSE.cpp ├── UASEQ.cpp ├── UJ.py ├── UPSUB.cpp ├── UTMOPR.cpp ├── UVAFQVAL.cpp ├── WORDCNT.cpp ├── WORDS1.cpp ├── WTK.cpp ├── XC201.cpp ├── XRMTRX.cpp ├── YODA.cpp ├── Z-Algorithm.cpp ├── ZSUM.cpp ├── heapsort.cpp ├── numplain.cpp ├── openCV.cpp ├── opencv2.cpp └── rook.cpp /ACODE.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() { 5 | char str[5000+5]; 6 | while(1) { 7 | cin.getline( str, 5005 ); 8 | if( str[0] == '0' ) 9 | break; 10 | 11 | long long unsigned int dp[5000+5]; 12 | dp[0] = 1; 13 | 14 | int i; 15 | 16 | for( i = 1; str[i] != '\0'; i++ ) { 17 | int num = str[i-1] - '0'; 18 | num *= 10; num += str[i] - '0'; 19 | 20 | dp[i] = 0; 21 | 22 | if( num <= 26 && str[i-1] != '0' ) 23 | dp[i] += (i-2 >= 0) ? dp[i-2] : 1; 24 | 25 | if( str[i] != '0' ) 26 | dp[i] += dp[i-1]; 27 | } 28 | 29 | cout << dp[--i] << endl; 30 | } 31 | } 32 | 33 | 34 | 35 | 36 | -------------------------------------------------------------------------------- /ADIGIT.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | int main() { 5 | long int n, m; 6 | char a[100005]; 7 | 8 | scanf("%ld %ld", &n, &m); 9 | scanf(" %s", a); 10 | 11 | while(m--) { 12 | long long int t, i, sum = 0; 13 | scanf("%lld", &t); 14 | t--; 15 | for( i = 0; i < t; i++ ) 16 | sum += abs( (a[t]-'0') - (a[i]-'0') ); 17 | 18 | printf("%lld\n", sum); 19 | } 20 | } 21 | -------------------------------------------------------------------------------- /AE00.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main() { 6 | long int n, i, t = 1, maxsum = 0; 7 | cin >> n; 8 | 9 | for( i = 1; t > 0; i++ ) { 10 | t = n/i; 11 | t = t - i + 1; 12 | 13 | if( t > 0 ) 14 | maxsum += t; 15 | } 16 | 17 | cout << maxsum; 18 | 19 | system("pause"); 20 | } 21 | 22 | -------------------------------------------------------------------------------- /ALMA01.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll int 3 | #define get(a) scanf("%d", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( typeof(v.begin()) it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( typeof(s.begin()) it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 10 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 11 | #define matrix vector< vector > 12 | #define MOD 1000000007 13 | #define F first 14 | #define S second 15 | #define mp make_pair 16 | #define L 2*r 17 | #define R 2*r+1 18 | #define INPFILE freopen("input.in","r",stdin) 19 | using namespace std; 20 | 21 | int main() { 22 | ll t; get(t); 23 | while(t--) { 24 | ll n, k; 25 | get(n); get(k); 26 | 27 | long long val = 1; 28 | 29 | FOR(i,n-k+1,n) 30 | { val *= i; val %= MOD; } 31 | 32 | printf("%lld\n", val); 33 | } 34 | } 35 | -------------------------------------------------------------------------------- /AMR10G.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | #include 8 | #include 9 | #include 10 | #include 11 | #include 12 | #define ll long 13 | #define get(a) scanf("%ld", &a) 14 | #define rep(n) for( ll i = 0; i < n; i++ ) 15 | #define repVector(v) for(vector::iterator it = v.begin(); it != v.end(); it++ ) 16 | #define all(c) c.begin(), c.end() 17 | #define repu(a,n) for( ll i = a; i < n; i++ ) 18 | #define max(a,b) a > b ? a : b 19 | #define pb push_back 20 | using namespace std; 21 | 22 | int main() { 23 | ll t; 24 | get(t); 25 | 26 | while(t--) { 27 | ll n, k; 28 | get(n); get(k); 29 | 30 | vector v; 31 | 32 | rep(n) { 33 | ll x; 34 | get(x); 35 | v.pb(x); 36 | } 37 | 38 | sort( all(v) ); 39 | 40 | ll min = LONG_MAX; 41 | rep(n-k+1) { 42 | ll x = v[i+k-1] - v[i]; 43 | if( min > x ) 44 | min = x; 45 | } 46 | 47 | printf("%ld\n", min); 48 | } 49 | } 50 | -------------------------------------------------------------------------------- /AMR12D.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #define ll long 4 | #define get(a) scanf("%ld", &a) 5 | #define rep(n) for( ll i = 0; i < n; i++ ) 6 | #define repVector(v) for(vector::iterator it = v.begin(); it != v.end(); it++ ) 7 | #define repSet(s) for( set::iterator it = s.begin(); it != s.end(); it++ ) 8 | #define all(c) c.begin(), c.end() 9 | #define repu(a,n) for( ll i = a; i <= n; i++ ) 10 | #define pb push_back 11 | #define min(a,b) ( (a < b) ? a : b ) 12 | #define max(a,b) ( (a > b) ? a : b ) 13 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 14 | #define FOR(i,a,b) for( ll i = a; i < b; i++ ) 15 | #define matrix vector< vector > 16 | #define MOD 1000000007 17 | #define F first 18 | #define S second 19 | #define L 2*r 20 | #define R 2*r+1 21 | #define mp make_pair 22 | using namespace std; 23 | 24 | bool isPalin( string s ) { 25 | FOR(i,0, s.size()/2 ) 26 | if( s[i] != s[ s.size() - 1 - i ] ) 27 | return 0; 28 | return 1; 29 | } 30 | 31 | int main() { 32 | ll t; get(t); 33 | 34 | while(t--) { 35 | string a; 36 | cin >> a; 37 | 38 | if( isPalin(a) ) 39 | printf("YES\n"); 40 | else 41 | printf("NO\n"); 42 | } 43 | } 44 | -------------------------------------------------------------------------------- /AMR14D.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll int 3 | #define get(a) scanf("%d", &a) 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( vector::iterator it = v.begin(); it != v.end(); it++ ) 6 | #define repSTL(s) for( typeof(s.begin()) it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 10 | #define FOR(i,a,b) for( int i = a; i <= b; i++ ) 11 | #define matrix vector< vector > 12 | #define MOD 1000000007 13 | #define F first 14 | #define S second 15 | #define mp make_pair 16 | #define L 2*r 17 | #define R 2*r+1 18 | #define INPFILE freopen("input.in","r",stdin) 19 | using namespace std; 20 | 21 | int main() { 22 | ll t; get(t); 23 | while(t--) { 24 | ll n; get(n); 25 | vector v; 26 | 27 | rep(n) 28 | { ll x; get(x); v.pb(x); } 29 | 30 | sort( all(v) ); 31 | 32 | bool flag = 0; 33 | 34 | FOR(i,1,v.size()-1) 35 | if( v[i] == v[i-1] ) 36 | { flag = 1; break; } 37 | 38 | if( flag ) 39 | printf("NO\n"); 40 | else 41 | printf("YES\n"); 42 | } 43 | } 44 | -------------------------------------------------------------------------------- /ANARC08H.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #define ll int 4 | #define get(a) scanf("%d", &a) 5 | #define rep(n) for( ll i = 0; i < n; i++ ) 6 | #define repVector(v) for(vector::iterator it = v.begin(); it != v.end(); it++ ) 7 | #define repSet(s) for( set::iterator it = s.begin(); it != s.end(); it++ ) 8 | #define all(c) c.begin(), c.end() 9 | #define repu(a,n) for( ll i = a; i <= n; i++ ) 10 | #define pb push_back 11 | #define min(a,b) ( (a < b) ? a : b ) 12 | #define max(a,b) ( (a > b) ? a : b ) 13 | #define absol(a) a >= 0 ? a : -a 14 | #define FOR(i,a,b) for( ll i = a; i < b; i++ ) 15 | #define matrix vector< vector > 16 | #define MOD 1000000007 17 | #define L 2*r 18 | #define R 2*r+1 19 | using namespace std; 20 | 21 | ll gcd( ll a, ll b ) { return ( b == 0 ? a : gcd( b, a%b ) ); } 22 | 23 | int main() { 24 | while(1) { 25 | ll n, d; 26 | get(n); get(d); 27 | if( n == 0 && d == 0 ) 28 | return 0; 29 | 30 | ll ans = 0; 31 | 32 | FOR(i,1,n+1) 33 | ans = (ans + d)%i; 34 | 35 | printf("%d %d %d\n", n, d, ans+1 ); 36 | } 37 | 38 | } 39 | -------------------------------------------------------------------------------- /ANARC09A.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | #include 8 | #include 9 | #define ll int 10 | #define get(a) scanf("%d", &a) 11 | #define rep(n) for( ll i = 0; i < n; i++ ) 12 | #define repVector(v) for(vector::iterator it = v.begin(); it != v.end(); it++ ) 13 | #define all(c) c.begin(), c.end() 14 | #define repu(a,n) for( ll i = a; i < n; i++ ) 15 | #define pb push_back 16 | using namespace std; 17 | 18 | int main() { 19 | long t = 0; 20 | while(1) { 21 | t++; 22 | char str[3000]; 23 | scanf("%s", &str); 24 | 25 | if( str[0] == '-' ) 26 | break; 27 | 28 | long count = 0; 29 | long check = 0; 30 | 31 | 32 | repu( 0, strlen(str) ) { 33 | if( str[i] == '}' ) { 34 | check--; 35 | if( check < 0 ) 36 | { check = 1; count++; } 37 | } 38 | else 39 | check++; 40 | } 41 | 42 | cout << t << ". " << count + check/2 << endl; 43 | 44 | } 45 | } 46 | -------------------------------------------------------------------------------- /ANDTUPLE.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #define ll long long 4 | #define get(a) scanf("%lld", &a) 5 | #define rep(n) for( ll i = 0; i < n; i++ ) 6 | #define repVector(v) for(vector< pair >::iterator it = v.begin(); it != v.end(); it++ ) 7 | #define repSet(s) for( set< pair< ll, pair > >::iterator it = s.begin(); it != s.end(); it++ ) 8 | #define all(c) c.begin(), c.end() 9 | #define repu(a,n) for( ll i = a; i <= n; i++ ) 10 | #define pb push_back 11 | #define min(a,b) ( (a < b) ? a : b ) 12 | #define max(a,b) ( (a > b) ? a : b ) 13 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 14 | #define FOR(i,a,b) for( ll i = a; i < b; i++ ) 15 | #define matrix vector< vector > 16 | #define MOD 1000000007 17 | #define F first 18 | #define S second 19 | #define L 2*r 20 | #define R 2*r+1 21 | #define mp make_pair 22 | using namespace std; 23 | 24 | 25 | int main() { 26 | ll t; 27 | get(t); 28 | 29 | while(t--) { 30 | ll n, k; 31 | get(k); get(n); 32 | 33 | 34 | printf("%lld\n", n/2+1); 35 | 36 | } 37 | } 38 | -------------------------------------------------------------------------------- /ANUDTC.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%lld", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( typeof(v.begin()) it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( typeof(s.begin()) it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 10 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 11 | #define ROF(i,a,b) for( ll i = a; i >= b; i-- ) 12 | #define debug(x) cout << "[DEBUG] " << #x << " = " << x << endl 13 | #define matrix vector< vector > 14 | #define F first 15 | #define S second 16 | #define mp make_pair 17 | #define L 2*r 18 | #define R 2*r+1 19 | #define INPFILE freopen("input.in","r",stdin) 20 | using namespace std; 21 | 22 | int main() { 23 | ll t; get(t); 24 | while(t--) { 25 | ll n; get(n); 26 | 27 | 360%n == 0 ? printf("y ") : printf("n "); 28 | n <= 360 ? printf("y ") : printf("n "); 29 | n <= 26 ? printf("y") : printf("n"); 30 | printf("\n"); 31 | } 32 | } 33 | -------------------------------------------------------------------------------- /ANUWTA.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #define ll long long 4 | #define get(a) scanf("%lld", &a) 5 | #define rep(n) for( ll i = 0; i < n; i++ ) 6 | #define repVector(v) for(vector::iterator it = v.begin(); it != v.end(); it++ ) 7 | #define repSet(s) for( set::iterator it = s.begin(); it != s.end(); it++ ) 8 | #define all(c) c.begin(), c.end() 9 | #define repu(a,n) for( ll i = a; i <= n; i++ ) 10 | #define pb push_back 11 | #define min(a,b) ( (a < b) ? a : b ) 12 | #define max(a,b) ( (a > b) ? a : b ) 13 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 14 | #define FOR(i,a,b) for( ll i = a; i < b; i++ ) 15 | #define matrix vector< vector > 16 | #define MOD 1000000007 17 | #define F first 18 | #define S second 19 | #define mp make_pair 20 | using namespace std; 21 | 22 | ll gcd( ll a, ll b ) { return ( ( b == 0 ) ? a : gcd( b, a%b ) ); } 23 | 24 | 25 | int main() { 26 | ll t; get(t); 27 | while(t--) { 28 | ll n; get(n); 29 | ll sum = n*(n+1)/2; 30 | sum += n; 31 | printf("%lld\n", sum); 32 | } 33 | } 34 | -------------------------------------------------------------------------------- /AP2.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #define ll long long 6 | #define get(a) scanf("%lld", &a) 7 | #define put(a) printf("%lld\n", a) 8 | #define rep(n) for( long i = 0; i < n; i++ ) 9 | #define pb push_back 10 | using namespace std; 11 | 12 | int main() { 13 | ll t, cc = 1; 14 | get(t); 15 | 16 | while(t--) { 17 | ll x,y,s, n, a, d; 18 | get(x); get(y); get(s); 19 | 20 | n = (2*s)/(x+y); 21 | d = (y - x)/(n-5); 22 | a = x - 2*d; 23 | 24 | put(n); 25 | 26 | rep(n) 27 | printf("%lld ", a + i*d); 28 | printf("\n"); 29 | 30 | } 31 | } 32 | 33 | -------------------------------------------------------------------------------- /ARHN07.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long 3 | #define get(a) cin >> a; 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( vector::iterator it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( set::iterator it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 10 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 11 | #define matrix vector< vector > 12 | #define MOD 1000000007 13 | #define F first 14 | #define S second 15 | #define mp make_pair 16 | #define L 2*r 17 | #define R 2*r+1 18 | #define INPFILE freopen("input.in","r",stdin) 19 | #define INF LONG_MAX 20 | using namespace std; 21 | 22 | int main() { 23 | ll t; get(t); 24 | while(t--) { 25 | string a, b; 26 | cin >> a >> b; 27 | 28 | if( a.size() != b.size() ) 29 | { printf("-1\n"); continue; } 30 | 31 | ll ans = 0; 32 | 33 | FOR(i,0,a.size()-1) 34 | if( a[i] != b[i] ) 35 | ans++; 36 | 37 | printf("%ld\n", ans); 38 | 39 | 40 | } 41 | } 42 | -------------------------------------------------------------------------------- /ARHN08.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) cin >> a; 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( vector::iterator it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( set::iterator it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 10 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 11 | #define matrix vector< vector > 12 | #define MOD 1000000007 13 | #define F first 14 | #define S second 15 | #define mp make_pair 16 | #define L 2*r 17 | #define R 2*r+1 18 | #define INPFILE freopen("input.in","r",stdin) 19 | #define INF LONG_MAX 20 | using namespace std; 21 | 22 | int main() { 23 | ll n; get(n); 24 | 25 | ll dp[20][20] = {0}; 26 | 27 | FOR(i,1,n) 28 | dp[1][i] = 1; 29 | // dp[1][1] = 1; 30 | 31 | FOR(i,2,n) { 32 | FOR(j,1,n) { 33 | FOR(k,1,j) 34 | dp[i][j] += dp[i-1][k]; 35 | // cout << dp[i][j] << " "; 36 | } 37 | 38 | // cout << endl; 39 | } 40 | 41 | ll ans = 0; 42 | FOR(i,1,n) 43 | ans += dp[n][i]; 44 | 45 | cout << ans; 46 | 47 | } 48 | -------------------------------------------------------------------------------- /ARHN09.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long 3 | #define get(a) cin >> a; 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( vector::iterator it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( set::iterator it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 10 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 11 | #define matrix vector< vector > 12 | #define MOD 1000000007 13 | #define F first 14 | #define S second 15 | #define mp make_pair 16 | #define L 2*r 17 | #define R 2*r+1 18 | #define INPFILE freopen("input.in","r",stdin) 19 | #define INF LONG_MAX 20 | using namespace std; 21 | 22 | ll sum[1000005] = {0}; 23 | ll v[1000005] = {0}; 24 | 25 | int main() { 26 | ll n, m; 27 | cin >> n >> m; 28 | 29 | FOR(i,1,n) { 30 | cin >> v[i]; 31 | sum[i] = sum[i-1] + v[i]; 32 | } 33 | 34 | FOR(i,1,m) { 35 | string s; ll l, r; 36 | cin >> s >> l >> r; 37 | printf("%ld\n", sum[r] - sum[l-1]); 38 | } 39 | 40 | } 41 | -------------------------------------------------------------------------------- /ARHN10.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) cin >> a; 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( vector::iterator it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( set::iterator it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 10 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 11 | #define matrix vector< vector > 12 | #define MOD 1000000007 13 | #define F first 14 | #define S second 15 | #define mp make_pair 16 | #define L 2*r 17 | #define R 2*r+1 18 | #define INPFILE freopen("input.in","r",stdin) 19 | #define INF LONG_MAX 20 | using namespace std; 21 | 22 | int main() { 23 | ll t; get(t); 24 | while(t--) { 25 | ll n; get(n); 26 | vector v; 27 | 28 | while( n > 0 ) { 29 | if( n%7 == 0 ) 30 | { v.pb(7); n /= 7; n--; } 31 | else 32 | { v.pb(n%7); n /= 7; } 33 | } 34 | 35 | reverse( all(v) ); 36 | string c = "ddhapusv"; 37 | 38 | FOR(i,0,v.size()-1) 39 | printf("%c", c[ v[i] ]); 40 | printf("\n"); 41 | } 42 | } 43 | -------------------------------------------------------------------------------- /ARRAYSUB.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long 3 | #define get(a) scanf("%ld", &a) 4 | #define rep(n) for( ll i = 0; i < n; i++ ) 5 | #define repVector(v) for(vector::iterator it = v.begin(); it != v.end(); it++ ) 6 | #define all(c) c.begin(), c.end() 7 | #define repu(a,n) for( ll i = a; i < n; i++ ) 8 | #define pb push_back 9 | #define min(a,b) ( (a < b) ? a : b ) 10 | #define max(a,b) ( (a > b) ? a : b ) 11 | #define absol(a) a >= 0 ? a : -a 12 | #define FOR(i,a,b) for( ll i = a; i < b; i++ ) 13 | #define matrix vector< vector > 14 | #define MOD 1000000007 15 | using namespace std; 16 | 17 | int main() { 18 | ll n, k; 19 | get(n); 20 | 21 | vector v(n+1,0); 22 | 23 | rep(n) 24 | get( v[i] ); 25 | get(k); 26 | 27 | ll me = -1, up; 28 | 29 | FOR(i,0,k) 30 | if( v[i] >= me ) 31 | { me = v[i]; up = i; } 32 | printf("%ld ", me); 33 | 34 | FOR( i, k, n ) { 35 | if( v[i] >= me ) 36 | { up = i; me = v[i]; } 37 | 38 | if( i - up >= k ) { 39 | me = -1; 40 | FOR(j, up+1, i+1 ) 41 | if( v[j] >= me ) 42 | { me = v[j]; up = j; } 43 | } 44 | 45 | printf("%ld ", me); 46 | 47 | } 48 | 49 | } 50 | -------------------------------------------------------------------------------- /BANDW.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | int main() 3 | { 4 | while(1) 5 | { 6 | char *S,*T; 7 | S=(char *)malloc(501*sizeof(char)); 8 | T=(char *)malloc(501*sizeof(char)); 9 | scanf("%s%s",S,T); 10 | if(S[0]=='*' && T[0]=='*') 11 | break; 12 | int i=0,count=0; 13 | while(S[i]!='\0') 14 | { 15 | if(S[i]!=T[i]) 16 | { 17 | count++; 18 | while(S[i]!=T[i]) 19 | i++; 20 | } 21 | i++; 22 | } 23 | printf("%d\n",count); 24 | } 25 | return 0; 26 | } 27 | -------------------------------------------------------------------------------- /BINSTIRL.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #define ll long long 4 | #define get(a) scanf("%lld", &a) 5 | #define rep(n) for( ll i = 0; i < n; i++ ) 6 | #define repVector(v) for(vector< pair >::iterator it = v.begin(); it != v.end(); it++ ) 7 | #define repSet(s) for( set< pair< ll, pair > >::iterator it = s.begin(); it != s.end(); it++ ) 8 | #define all(c) c.begin(), c.end() 9 | #define repu(a,n) for( ll i = a; i <= n; i++ ) 10 | #define pb push_back 11 | #define min(a,b) ( (a < b) ? a : b ) 12 | #define max(a,b) ( (a > b) ? a : b ) 13 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 14 | #define FOR(i,a,b) for( ll i = a; i < b; i++ ) 15 | #define matrix vector< vector > 16 | #define MOD 10000007 17 | #define F first 18 | #define S second 19 | #define L 2*r 20 | #define R 2*r+1 21 | #define mp make_pair 22 | using namespace std; 23 | 24 | int main() { 25 | ll t, count = 1; 26 | get(t); 27 | 28 | while(t--) { 29 | ll n, k; 30 | get(n); get(k); 31 | 32 | ll z = n-k; 33 | ll w = (k-1)/2; 34 | bool ans = z&w; 35 | 36 | printf("%d\n", !ans); 37 | } 38 | } 39 | -------------------------------------------------------------------------------- /BINTOUR.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | 7 | int main() { 8 | int k; 9 | long long unsigned int count = 0; 10 | 11 | scanf("%d", &k); 12 | 13 | 14 | long int limit = int(pow(2,k)); 15 | if( k == 1 ) { 16 | cout << "2\n2"; 17 | return 0; 18 | } 19 | 20 | for( long int i = 1; i <= limit; i++ ) { 21 | count = 1; long int m = 1, j = limit/2; 22 | while( j!= 1 && i-m > 0) { 23 | count *= j*int( pow(2,j) )*(i - m ); 24 | j /= 2; 25 | //count %= 1000000009; 26 | m++; 27 | } 28 | 29 | cout << count << endl; 30 | } 31 | cin >> k; 32 | } 33 | 34 | 35 | 36 | 37 | -------------------------------------------------------------------------------- /BTREE.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | long long int i, j, a, b, t, step = 0; 5 | scanf("%lld", &t); 6 | 7 | while(t--) { 8 | step = 0; 9 | scanf("%lld %lld", &i, &j); 10 | a= i; b=j; 11 | while( a!=b ) { 12 | if( a > b ) 13 | a /= 2; 14 | else 15 | b /= 2; 16 | 17 | step++; 18 | } 19 | 20 | printf("%d\n", step); 21 | } 22 | 23 | } 24 | 25 | 26 | 27 | -------------------------------------------------------------------------------- /BYECAKES.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long 3 | #define get(a) scanf("%ld", &a) 4 | #define rep(n) for( ll i = 0; i < n; i++ ) 5 | #define repVector(v) for(vector::iterator it = v.begin(); it != v.end(); it++ ) 6 | #define all(c) c.begin(), c.end() 7 | #define repu(a,n) for( ll i = a; i < n; i++ ) 8 | #define pb push_back 9 | #define min(a,b) ( (a < b) ? a : b ) 10 | #define max(a,b) ( (a > b) ? a : b ) 11 | #define absol(a) a >= 0 ? a : -a 12 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 13 | #define matrix vector< vector > 14 | #define MOD 1000000007 15 | using namespace std; 16 | 17 | int main() { 18 | while(1) { 19 | vector v, cake; 20 | 21 | rep(4) { 22 | ll x; get(x); 23 | v.pb(x); 24 | } 25 | 26 | rep(4) { 27 | ll x; get(x); 28 | cake.pb(x); 29 | } 30 | 31 | if( cake[0] == -1 && v[0] == -1 ) 32 | break; 33 | 34 | ll num = 0; 35 | 36 | rep(4) { 37 | num = max( num, ceil( double(v[i])/cake[i] ) ); 38 | } 39 | 40 | rep(4) { 41 | printf("%ld ", num*cake[i] - v[i]); 42 | } 43 | printf("\n"); 44 | 45 | } 46 | } 47 | -------------------------------------------------------------------------------- /CAPPLE.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #define ll long long 4 | #define get(a) scanf("%lld", &a); 5 | #define rep(n) for( ll i = 0; i < n; i++ ) 6 | #define repVector(v) for(vector::iterator it = v.begin(); it != v.end(); it++ ) 7 | #define repSet(s) for( set::iterator it = s.begin(); it != s.end(); it++ ) 8 | #define all(c) c.begin(), c.end() 9 | #define repu(a,n) for( ll i = a; i <= n; i++ ) 10 | #define pb push_back 11 | #define min(a,b) ( (a < b) ? a : b ) 12 | #define max(a,b) ( (a > b) ? a : b ) 13 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 14 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 15 | #define matrix vector< vector > 16 | #define MOD 1000000007 17 | #define F first 18 | #define S second 19 | #define L 2*r 20 | #define R 2*r+1 21 | #define mp make_pair 22 | using namespace std; 23 | 24 | int main() { 25 | ll t; get(t); 26 | while(t--) { 27 | set s; 28 | ll n; get(n); 29 | rep(n) { ll x; get(x); s.insert(x); } 30 | printf("%ld\n", s.size()); 31 | } 32 | } 33 | -------------------------------------------------------------------------------- /CBARG.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%lld", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( auto it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( auto it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 10 | #define ROF(i,a,b) for( ll i = a; i >= b; i-- ) 11 | #define debug(x) cout << "[DEBUG] " << #x << " = " << x << endl 12 | #define matrix vector< vector > 13 | #define F first 14 | #define S second 15 | #define mp make_pair 16 | #define L 2*r 17 | #define R 2*r+1 18 | #define INPFILE freopen("input.in","r",stdin) 19 | #define MOD 1000000009 20 | using namespace std; 21 | 22 | int main() { 23 | ll t; get(t); 24 | while(t--) { 25 | ll n, ans = 0; get(n); 26 | vector v; 27 | v.pb(0); 28 | FOR(i,1,n) 29 | { ll x; cin >> x; v.pb(x); } 30 | FOR(i,1,n) 31 | if( v[i] - v[i-1] > 0 ) 32 | ans += v[i] - v[i-1]; 33 | printf("%lld\n", ans); 34 | } 35 | 36 | } 37 | -------------------------------------------------------------------------------- /CD1IT1.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long 3 | #define get(a) scanf("%ld", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( vector::iterator it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( typeof(s.begin()) it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 10 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 11 | #define matrix vector< vector > 12 | #define F first 13 | #define S second 14 | #define mp make_pair 15 | #define foo(a,b,c) mp( mp(a,b), c ) 16 | #define L 2*r 17 | #define R 2*r+1 18 | #define INPFILE freopen("input.in","r",stdin) 19 | using namespace std; 20 | 21 | int main() { 22 | ll n; get(n); 23 | vector v; 24 | 25 | FOR(i,1,n) 26 | { ll x; get(x); v.pb(x); } 27 | sort( all(v) ); 28 | 29 | if( n%2 == 0 ) 30 | printf("%ld", v[n/2-1]); 31 | else 32 | printf("%ld", v[(n-1)/2]); 33 | 34 | } 35 | -------------------------------------------------------------------------------- /CD1IT2.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%lld", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( vector::iterator it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( typeof(s.begin()) it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 10 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 11 | #define matrix vector< vector > 12 | #define MOD 1000000007 13 | #define F first 14 | #define S second 15 | #define mp make_pair 16 | #define foo(a,b,c) mp( mp(a,b), c ) 17 | #define L 2*r 18 | #define R 2*r+1 19 | #define INPFILE freopen("input.in","r",stdin) 20 | using namespace std; 21 | 22 | int main() { 23 | ll t; get(t); 24 | while(t--) { 25 | ll n; get(n); 26 | double val = log10( exp(1) ); 27 | ll ans = n*val; ans++; 28 | cout << ans << endl; 29 | } 30 | } 31 | -------------------------------------------------------------------------------- /CD1IT3.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%lld", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( vector::iterator it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( typeof(s.begin()) it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 10 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 11 | #define matrix vector< vector > 12 | #define MOD 1000000007 13 | #define F first 14 | #define S second 15 | #define mp make_pair 16 | #define foo(a,b,c) mp( mp(a,b), c ) 17 | #define L 2*r 18 | #define R 2*r+1 19 | #define INPFILE freopen("input.in","r",stdin) 20 | using namespace std; 21 | 22 | int main() { 23 | ll n, k; 24 | get(n); get(k); 25 | vector v; 26 | map m; 27 | 28 | FOR(i,1,n) 29 | { ll x; get(x); v.pb(x); m[x]++; } 30 | 31 | FOR(i,0,n-1) 32 | if( k - v[i] == v[i] && m[v[i]] >= 2 ) 33 | { printf("Yes"); return 0; } 34 | else if( k - v[i] != v[i] && m[k-v[i]] > 0 ) 35 | { printf("Yes"); return 0; } 36 | 37 | printf("No"); 38 | } 39 | -------------------------------------------------------------------------------- /CDCR15_1.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long 3 | #define get(a) scanf("%ld", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( typeof(v.begin()) it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( typeof(s.begin()) it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 10 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 11 | #define matrix vector< vector > 12 | #define F first 13 | #define S second 14 | #define mp make_pair 15 | #define L 2*r 16 | #define R 2*r+1 17 | #define INPFILE freopen("input.in","r",stdin) 18 | using namespace std; 19 | 20 | int main() { 21 | ll t; get(t); 22 | while(t--) { 23 | ll n, k; 24 | get(n); get(k); 25 | char str[n+5]; 26 | scanf("%s", str+1); 27 | 28 | ll mx = 0, dist = 0; 29 | 30 | FOR(i,1,n) 31 | if( str[i] == '.' ) 32 | dist = 0; 33 | else if( str[i] == '#' ) 34 | { dist++; mx = max( mx, dist ); } 35 | 36 | if( mx >= k ) 37 | printf("NO\n"); 38 | else 39 | printf("YES\n"); 40 | 41 | } 42 | } 43 | -------------------------------------------------------------------------------- /CDCR15_2.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long 3 | #define get(a) scanf("%ld", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( typeof(v.begin()) it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( typeof(s.begin()) it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 10 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 11 | #define matrix vector< vector > 12 | #define F first 13 | #define S second 14 | #define mp make_pair 15 | #define L 2*r 16 | #define R 2*r+1 17 | #define INPFILE freopen("input.in","r",stdin) 18 | using namespace std; 19 | 20 | int main() { 21 | ll t; get(t); 22 | while(t--) { 23 | ll x, y, z; 24 | cin >> x >> y >> z; 25 | ll dist = z*x; 26 | ll t1 = ceil(1.0*dist/y); 27 | 28 | printf("%ld\n", abs(t1-z)); 29 | } 30 | } 31 | -------------------------------------------------------------------------------- /CDMN05_2.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%lld", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( typeof(v.begin()) it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( typeof(s.begin()) it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 10 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 11 | #define ROF(i,a,b) for( ll i = a; i >= b; i-- ) 12 | #define DEBUG(x) cout << "[DEBUG]" << #x << " " << x << endl 13 | #define matrix vector< vector > 14 | #define F first 15 | #define S second 16 | #define mp make_pair 17 | #define L 2*r 18 | #define R 2*r+1 19 | #define INPFILE freopen("input.in","r",stdin) 20 | using namespace std; 21 | 22 | int main() { 23 | ll t; get(t); 24 | while(t--) { 25 | ll n, m; 26 | get(n); get(m); 27 | 28 | 29 | if( n == m && n%2 == 0) 30 | cout << "Bob\n"; 31 | else 32 | cout << "Alice\n"; 33 | } 34 | } 35 | -------------------------------------------------------------------------------- /CDVA1504.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%lld", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( typeof(v.begin()) it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( typeof(s.begin()) it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define MEM(a,b) memset(a,(b),sizeof(a)) 9 | #define MAX(a,b) ((a) > (b) ? (a) : (b)) 10 | #define MIN(a,b) ((a) < (b) ? (a) : (b)) 11 | #define pb push_back 12 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 13 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 14 | #define matrix vector< vector > 15 | #define F first 16 | #define S second 17 | #define mp make_pair 18 | #define L 2*r 19 | #define R 2*r+1 20 | #define MOD 1000000007 21 | #define INPFILE freopen("input.in","r",stdin) 22 | using namespace std; 23 | 24 | int main() { 25 | ll t; get(t); 26 | cin.ignore(); 27 | while(t--) { 28 | string s; 29 | getline(cin,s); 30 | 31 | FOR(i,0,s.size()-1) 32 | if( !isdigit(s[i]) ) 33 | printf("%c", s[i] ); 34 | printf("\n"); 35 | } 36 | } 37 | -------------------------------------------------------------------------------- /CDVA1505.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%lld", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( typeof(v.begin()) it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( typeof(s.begin()) it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define MEM(a,b) memset(a,(b),sizeof(a)) 9 | #define MAX(a,b) ((a) > (b) ? (a) : (b)) 10 | #define MIN(a,b) ((a) < (b) ? (a) : (b)) 11 | #define pb push_back 12 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 13 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 14 | #define matrix vector< vector > 15 | #define F first 16 | #define S second 17 | #define mp make_pair 18 | #define L 2*r 19 | #define R 2*r+1 20 | #define MOD 1000000007 21 | #define INPFILE freopen("input.in","r",stdin) 22 | using namespace std; 23 | 24 | int main() { 25 | ll t; get(t); 26 | while(t--) { 27 | ll n; get(n); 28 | set s; 29 | 30 | FOR(i,1,n) 31 | { ll x; get(x); s.insert(x); } 32 | cout << s.size() << endl; 33 | 34 | } 35 | } 36 | -------------------------------------------------------------------------------- /CF135A.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%ld", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( auto it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( auto it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 10 | #define ROF(i,a,b) for( ll i = a; i >= b; i-- ) 11 | #define debug(x) cout << "[DEBUG] " << #x << " = " << x << endl 12 | #define matrix vector< vector > 13 | #define F first 14 | #define S second 15 | #define mp make_pair 16 | #define L 2*r 17 | #define R 2*r+1 18 | #define INPFILE freopen("input.in","r",stdin) 19 | #define MOD 1000000009 20 | using namespace std; 21 | 22 | int main() { 23 | ll n; cin >> n; 24 | vector v; 25 | FOR(i,1,n) 26 | { ll x; cin >> x; v.pb(x); } 27 | sort( all(v) ); 28 | 29 | if( n == 1 && v[0] == 1 ) 30 | cout << "2"; 31 | else 32 | cout << "1 "; 33 | 34 | FOR(i,1,n-1) 35 | if( i == n-1 && v[i] == v[i-1] && v[i] == 1 ) 36 | cout << "2"; 37 | else 38 | cout << min( v[i], v[i-1] ) << " "; 39 | 40 | 41 | } 42 | -------------------------------------------------------------------------------- /CF152C.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%ld", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( typeof(v.begin()) it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( typeof(s.begin()) it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 10 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 11 | #define ROF(i,a,b) for( ll i = a; i >= b; i-- ) 12 | #define debug(x) cout << "[DEBUG] " << #x << " = " << x << endl 13 | #define matrix vector< vector > 14 | #define F first 15 | #define S second 16 | #define mp make_pair 17 | #define L 2*r 18 | #define R 2*r+1 19 | #define INPFILE freopen("input.in","r",stdin) 20 | using namespace std; 21 | 22 | int main() { 23 | ll n, m; 24 | cin >> n >> m; 25 | string s[n+1]; 26 | 27 | FOR(i,1,n) 28 | cin >> s[i]; 29 | 30 | ll ans = 1; 31 | 32 | FOR(i,0,m-1) { 33 | set str; 34 | FOR(j,1,n) 35 | str.insert(s[j][i]); 36 | ans *= str.size(); 37 | ans %= 1000000007; 38 | } 39 | 40 | cout << ans; 41 | } 42 | -------------------------------------------------------------------------------- /CF182D.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long 3 | #define get(a) scanf("%lld", &a); 4 | #define repVector(v) for( auto it = v.begin(); it != v.end(); it++ ) 5 | #define all(c) c.begin(), c.end() 6 | #define pb push_back 7 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 8 | #define ROF(i,a,b) for( ll i = a; i >= b; i-- ) 9 | #define debug(x) cout << "[DEBUG] " << #x << " = " << x << endl 10 | #define matrix vector< vector > 11 | #define F first 12 | #define S second 13 | #define mp make_pair 14 | #define L 2*r 15 | #define R 2*r+1 16 | #define INPFILE freopen("input.in","r",stdin) 17 | #define BOOST ios_base::sync_with_stdio(false); cin.tie(NULL); 18 | using namespace std; 19 | 20 | string a, b; 21 | 22 | bool func( string s, ll n ) { 23 | if( s.size()%n ) return false; 24 | for( ll i = 0; i < s.size(); i++ ) 25 | if( s[i] != a[i%n] ) 26 | return 0; 27 | return 1; 28 | } 29 | 30 | int main() { 31 | cin >> a >> b; 32 | ll ans = 0, i = 1; 33 | string p = a, q = b; 34 | 35 | ll minx = min( a.size(), b.size() ); 36 | 37 | while( i <= minx ) { 38 | ans += ( func(p,i) && func(q,i) ); 39 | i++; 40 | } 41 | 42 | cout << ans; 43 | } 44 | -------------------------------------------------------------------------------- /CF18C.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%ld", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( auto it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( auto it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 10 | #define ROF(i,a,b) for( ll i = a; i >= b; i-- ) 11 | #define debug(x) cout << "[DEBUG] " << #x << " = " << x << endl 12 | #define matrix vector< vector > 13 | #define F first 14 | #define S second 15 | #define mp make_pair 16 | #define L 2*r 17 | #define R 2*r+1 18 | #define INPFILE freopen("input.in","r",stdin) 19 | using namespace std; 20 | 21 | int main() { 22 | ll n, sum = 0; cin >> n; 23 | vector v; 24 | FOR(i,1,n) 25 | { ll x; cin >> x; sum += x; v.pb(x); } 26 | 27 | ll cur = 0, ans = 0; 28 | FOR(i,0,n-2) { 29 | cur += v[i]; 30 | sum -= v[i]; 31 | 32 | if( sum == cur ) 33 | ans++; 34 | } 35 | 36 | cout << ans; 37 | } 38 | -------------------------------------------------------------------------------- /CF231D.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long 3 | #define get(a) scanf("%lld", &a); 4 | #define repVector(v) for( auto it = v.begin(); it != v.end(); it++ ) 5 | #define all(c) c.begin(), c.end() 6 | #define pb push_back 7 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 8 | #define ROF(i,a,b) for( ll i = a; i >= b; i-- ) 9 | #define debug(x) cout << "[DEBUG] " << #x << " = " << x << endl 10 | #define matrix vector< vector > 11 | #define F first 12 | #define S second 13 | #define mp make_pair 14 | #define L 2*r 15 | #define R 2*r+1 16 | #define INPFILE freopen("input.in","r",stdin) 17 | #define BOOST ios_base::sync_with_stdio(false); cin.tie(NULL); 18 | using namespace std; 19 | 20 | int main() { 21 | ll x, y, z; 22 | cin >> x >> y >> z; 23 | ll a, b, c; 24 | cin >> a >> b >> c; 25 | ll A, B, C, D, E, F; 26 | cin >> A >> B >> C >> D >> E >> F; 27 | 28 | ll ans = A*(y<0) + B*(y>b) + C*(z<0) + D*(z>c) + E*(x<0) + F*(x>a); 29 | cout << ans; 30 | } 31 | -------------------------------------------------------------------------------- /CF235A.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%ld", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( auto it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( auto it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 10 | #define ROF(i,a,b) for( ll i = a; i >= b; i-- ) 11 | #define debug(x) cout << "[DEBUG] " << #x << " = " << x << endl 12 | #define matrix vector< vector > 13 | #define F first 14 | #define S second 15 | #define mp make_pair 16 | #define L 2*r 17 | #define R 2*r+1 18 | #define INPFILE freopen("input.in","r",stdin) 19 | using namespace std; 20 | 21 | int main() { 22 | ll n; cin >> n; 23 | if( n == 1 ) 24 | cout << "1"; 25 | else if( n == 2 ) 26 | cout << "2"; 27 | else if( n == 3 ) 28 | cout << "6"; 29 | else if( n%2 ) 30 | cout << n*(n-1)*(n-2); 31 | else { 32 | if( n%3 == 0 ) 33 | cout << (n-1)*(n-2)*(n-3); 34 | else 35 | cout << n*(n-1)*(n-3); 36 | } 37 | } 38 | -------------------------------------------------------------------------------- /CF251A.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%ld", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( auto it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( auto it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 10 | #define ROF(i,a,b) for( ll i = a; i >= b; i-- ) 11 | #define debug(x) cout << "[DEBUG] " << #x << " = " << x << endl 12 | #define matrix vector< vector > 13 | #define F first 14 | #define S second 15 | #define mp make_pair 16 | #define L 2*r 17 | #define R 2*r+1 18 | #define INPFILE freopen("input.in","r",stdin) 19 | using namespace std; 20 | 21 | 22 | 23 | int main() { 24 | ll n, d; 25 | cin >> n >> d; 26 | vector v; 27 | 28 | FOR(i,1,n) 29 | { ll x; cin >> x; v.pb(x); } 30 | ll ans = 0; 31 | 32 | FOR(i,0,n-3) { 33 | ll k = upper_bound( all(v), v[i]+d ) - v.begin(); 34 | k = k - i - 1; 35 | ans += k*(k-1)/2; 36 | } 37 | 38 | cout << ans; 39 | } 40 | -------------------------------------------------------------------------------- /CF254A.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long 3 | #define get(a) scanf("%ld", &a); 4 | #define repVector(v) for( auto it = v.begin(); it != v.end(); it++ ) 5 | #define all(c) c.begin(), c.end() 6 | #define pb push_back 7 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 8 | #define ROF(i,a,b) for( ll i = a; i >= b; i-- ) 9 | #define debug(x) cerr << "[DEBUG] " << #x << " = " << x << endl 10 | #define matrix vector< vector > 11 | #define F first 12 | #define S second 13 | #define mp make_pair 14 | #define L 2*r 15 | #define R 2*r+1 16 | #define INPFILE freopen("input.in","r",stdin) 17 | #define BOOST ios_base::sync_with_stdio(false); cin.tie(NULL); 18 | using namespace std; 19 | 20 | ll num[5005] = {0}; 21 | 22 | int main() { 23 | freopen("input.txt","r",stdin); 24 | freopen("output.txt","w",stdout); 25 | 26 | ll n; get(n); 27 | vector v[5005]; 28 | FOR(i,1,2*n) 29 | { ll x; get(x); num[x]++; v[x].pb(i); } 30 | 31 | FOR(i,1,5000) 32 | if( num[i]%2 ) 33 | { cout << "-1"; return 0; } 34 | 35 | FOR(i,1,5000) { 36 | ll j = 0; 37 | while(num[i]) { 38 | printf("%ld %ld\n",v[i][j],v[i][j+1]); 39 | num[i] -= 2; 40 | j += 2; 41 | } 42 | } 43 | 44 | } 45 | -------------------------------------------------------------------------------- /CF264A.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long 3 | #define get(a) scanf("%ld", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( auto it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( typeof(s.begin()) it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 10 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 11 | #define ROF(i,a,b) for( ll i = a; i >= b; i-- ) 12 | #define debug(x) cout << "[DEBUG] " << #x << " = " << x << endl 13 | #define matrix vector< vector > 14 | #define F first 15 | #define S second 16 | #define mp make_pair 17 | #define L 2*r 18 | #define R 2*r+1 19 | #define MOD 1000000007 20 | #define INPFILE freopen("input.in","r",stdin) 21 | using namespace std; 22 | 23 | queue q; 24 | string s; 25 | 26 | ll rec( ll x ) { 27 | if( s[x] == 'l' ) { 28 | rec( x+1 ); 29 | q.push(x); 30 | } 31 | else if( s[x] == 'r' ) { 32 | q.push(x); 33 | rec( x + 1 ); 34 | } 35 | } 36 | 37 | int main() { 38 | cin >> s; 39 | s = " " + s + " "; 40 | rec(1); 41 | while(!q.empty()) 42 | { cout << q.front() << "\n"; q.pop(); } 43 | } 44 | -------------------------------------------------------------------------------- /CF268C.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long 3 | #define get(a) scanf("%ld", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( typeof(v.begin()) it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( typeof(s.begin()) it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 10 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 11 | #define ROF(i,a,b) for( ll i = a; i >= b; i-- ) 12 | #define debug(x) cout << "[DEBUG] " << #x << " = " << x << endl 13 | #define matrix vector< vector > 14 | #define F first 15 | #define S second 16 | #define mp make_pair 17 | #define L 2*r 18 | #define R 2*r+1 19 | #define INPFILE freopen("input.in","r",stdin) 20 | using namespace std; 21 | 22 | int main() { 23 | ll n, m; 24 | cin >> n >> m; 25 | cout << min(n,m) + 1 << "\n"; 26 | FOR(i,0,min(n,m)) 27 | cout << i << " " << min(n,m)-i << "\n"; 28 | } 29 | -------------------------------------------------------------------------------- /CF269B.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%ld", &a); 4 | #define repVector(v) for( auto it = v.begin(); it != v.end(); it++ ) 5 | #define all(c) c.begin(), c.end() 6 | #define pb push_back 7 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 8 | #define ROF(i,a,b) for( ll i = a; i >= b; i-- ) 9 | #define debug(x) cerr << "[DEBUG] " << #x << " = " << x << endl 10 | #define matrix vector< vector > 11 | #define F first 12 | #define S second 13 | #define mp make_pair 14 | #define L 2*r 15 | #define R 2*r+1 16 | #define INPFILE freopen("input.in","r",stdin) 17 | #define BOOST ios_base::sync_with_stdio(false); cin.tie(NULL); 18 | using namespace std; 19 | 20 | int main() { 21 | ll n, m; 22 | cin >> n >> m; 23 | 24 | vector v; 25 | FOR(i,1,n) { 26 | ll x; double y; 27 | cin >> x >> y; 28 | v.pb(x); 29 | } 30 | 31 | ll dp[5005] = {0}; 32 | 33 | FOR(i,0,n-1) 34 | FOR(j,0,i-1) 35 | if( v[i] >= v[j] ) 36 | dp[i] = max( dp[i], dp[j]+1 ); 37 | 38 | ll ans = 0; 39 | FOR(i,1,n) 40 | ans = max( ans, dp[i] ); 41 | 42 | debug(ans); 43 | cout << n-ans-1; 44 | 45 | } 46 | -------------------------------------------------------------------------------- /CF271A.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #define ll long long unsigned 4 | #define get(a) cin >> a 5 | #define rep(n) for( ll i = 0; i < n; i++ ) 6 | #define repVector(v) for(vector::iterator it = v.begin(); it != v.end(); it++ ) 7 | #define repSet(s) for( set::iterator it = s.begin(); it != s.end(); it++ ) 8 | #define all(c) c.begin(), c.end() 9 | #define repu(a,n) for( ll i = a; i <= n; i++ ) 10 | #define pb push_back 11 | #define min(a,b) ( (a < b) ? a : b ) 12 | #define max(a,b) ( (a > b) ? a : b ) 13 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 14 | #define FOR(i,a,b) for( ll i = a; i < b; i++ ) 15 | #define matrix vector< vector > 16 | #define MOD 1000000007 17 | #define F first 18 | #define S second 19 | #define L 2*r 20 | #define R 2*r+1 21 | #define mp make_pair 22 | using namespace std; 23 | 24 | int main() { 25 | string str = "qwertyuiop[asdfghjkl;zxcvbnm,./"; 26 | string a,d; 27 | cin >> d; 28 | cin >> a; 29 | 30 | FOR(i,0,a.size()) 31 | if( d[0] == 'R' ) 32 | cout << str[str.find(a[i])-1]; 33 | else 34 | cout << str[str.find(a[i])+1]; 35 | 36 | } 37 | -------------------------------------------------------------------------------- /CF285A.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) cin >> a; 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( vector::iterator it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( set::iterator it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 10 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 11 | #define matrix vector< vector > 12 | #define MOD 1000000007 13 | #define F first 14 | #define S second 15 | #define mp make_pair 16 | #define L 2*r 17 | #define R 2*r+1 18 | #define INPFILE freopen("input.in","r",stdin) 19 | using namespace std; 20 | 21 | int main() { 22 | ll a, b, c, d; 23 | cin >> a >> b >> c >> d; 24 | 25 | ll mish = max( 3*a/10, a - a*c/250 ); 26 | ll vas = max( 3*b/10, b - b*d/250 ); 27 | 28 | if( mish > vas ) 29 | cout << "Misha"; 30 | else if( vas > mish ) 31 | cout << "Vasya"; 32 | else 33 | cout << "Tie"; 34 | } 35 | -------------------------------------------------------------------------------- /CF343A.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%ld", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( auto it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( auto it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 10 | #define ROF(i,a,b) for( ll i = a; i >= b; i-- ) 11 | #define debug(x) cout << "[DEBUG] " << #x << " = " << x << endl 12 | #define matrix vector< vector > 13 | #define F first 14 | #define S second 15 | #define mp make_pair 16 | #define L 2*r 17 | #define R 2*r+1 18 | #define INPFILE freopen("input.in","r",stdin) 19 | using namespace std; 20 | 21 | ll rec( ll a, ll b ) { 22 | if( a == 0 ) 23 | return 0; 24 | if( a >= b ) 25 | return a/b + rec( a - (a/b)*b, b ); 26 | else 27 | return rec( b, a ); 28 | } 29 | 30 | int main() { 31 | ll a, b; 32 | cin >> a >> b; 33 | 34 | cout << rec( a,b ); 35 | 36 | } 37 | -------------------------------------------------------------------------------- /CF407B.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%ld", &a); 4 | #define repVector(v) for( auto it = v.begin(); it != v.end(); it++ ) 5 | #define all(c) c.begin(), c.end() 6 | #define pb push_back 7 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 8 | #define ROF(i,a,b) for( ll i = a; i >= b; i-- ) 9 | #define debug(x) cerr << "[DEBUG] " << #x << " = " << x << endl 10 | #define matrix vector< vector > 11 | #define F first 12 | #define S second 13 | #define mp make_pair 14 | #define L 2*r 15 | #define R 2*r+1 16 | #define INPFILE freopen("input.in","r",stdin) 17 | #define BOOST ios_base::sync_with_stdio(false); cin.tie(NULL); 18 | using namespace std; 19 | 20 | #define MOD 1000000007 21 | 22 | ll n; 23 | ll arr[1005]; 24 | ll dp[1005] = {0}; 25 | 26 | int main() { 27 | cin >> n; 28 | FOR(i,1,n) 29 | cin >> arr[i]; 30 | 31 | FOR(i,1,n) { 32 | dp[i] = 1; 33 | FOR(j,arr[i],i-1) 34 | dp[i] = ( dp[i] + dp[j] + 1 )%MOD; 35 | } 36 | 37 | ll ans = 0; 38 | FOR(i,1,n) 39 | ans = ( ans + dp[i] + 1 )%MOD; 40 | 41 | cout << ans; 42 | 43 | } 44 | -------------------------------------------------------------------------------- /CF424C(2).cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%ld", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( auto it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( auto it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 10 | #define ROF(i,a,b) for( ll i = a; i >= b; i-- ) 11 | #define debug(x) cout << "[DEBUG] " << #x << " = " << x << endl 12 | #define matrix vector< vector > 13 | #define F first 14 | #define S second 15 | #define mp make_pair 16 | #define L 2*r 17 | #define R 2*r+1 18 | #define INPFILE freopen("input.in","r",stdin) 19 | using namespace std; 20 | 21 | ll arr[1000005] = {0}; 22 | 23 | int main() { 24 | ll n; get(n); 25 | ll ans = 0; 26 | FOR(i,1,n) 27 | { ll x; get(x); ans ^= x; } 28 | 29 | FOR(i,1,n) 30 | arr[i] ^= (i^arr[i-1]); 31 | 32 | FOR(i,1,n) 33 | if( (n/i)%2 ) { 34 | ans ^= arr[i-1]; 35 | ans ^= arr[n%i]; 36 | } 37 | else 38 | ans ^= arr[n%i]; 39 | 40 | cout << ans; 41 | 42 | } 43 | -------------------------------------------------------------------------------- /CF424C.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%ld", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( auto it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( auto it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 10 | #define ROF(i,a,b) for( ll i = a; i >= b; i-- ) 11 | #define debug(x) cout << "[DEBUG] " << #x << " = " << x << endl 12 | #define matrix vector< vector > 13 | #define F first 14 | #define S second 15 | #define mp make_pair 16 | #define L 2*r 17 | #define R 2*r+1 18 | #define INPFILE freopen("input.in","r",stdin) 19 | using namespace std; 20 | 21 | ll arr[1000005] = {0}; 22 | 23 | int main() { 24 | ll n; cin >> n; 25 | ll ans = 0; 26 | FOR(i,1,n) 27 | { ll x; cin >> x; ans ^= x; } 28 | 29 | FOR(i,2,n) 30 | FOR(j,1,i-1) 31 | arr[j] = ( arr[j] + (long long)ceil(1.0*(n-j+1)/i) )%2; 32 | 33 | FOR(i,1,n) 34 | ans ^= arr[i]*i; 35 | 36 | cout << ans; 37 | 38 | } 39 | -------------------------------------------------------------------------------- /CF447a.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() { 5 | int n, p; int a[300+5], b[300+5] = {0}; 6 | cin >> p >> n; 7 | 8 | 9 | for( int i = 0; i < n; i++ ) 10 | cin >> a[i]; 11 | 12 | for( int i = 0; i < n; i++ ) { 13 | if( b[ a[i]%p ] != 0 ) 14 | { cout << ++i; return 0; } 15 | else 16 | b[ a[i]%p ] = 1; 17 | } 18 | 19 | cout << "-1"; 20 | 21 | } 22 | -------------------------------------------------------------------------------- /CF451D.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%ld", &a); 4 | #define repVector(v) for( auto it = v.begin(); it != v.end(); it++ ) 5 | #define all(c) c.begin(), c.end() 6 | #define pb push_back 7 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 8 | #define ROF(i,a,b) for( ll i = a; i >= b; i-- ) 9 | #define debug(x) cerr << "[DEBUG] " << #x << " = " << x << endl 10 | #define matrix vector< vector > 11 | #define F first 12 | #define S second 13 | #define mp make_pair 14 | #define L 2*r 15 | #define R 2*r+1 16 | #define INPFILE freopen("input.in","r",stdin) 17 | #define BOOST ios_base::sync_with_stdio(false); cin.tie(NULL); 18 | using namespace std; 19 | 20 | int main() { 21 | string s; cin >> s; 22 | ll a[2] = {0}, b[2] = {0}; 23 | ll even = 0, odd = 0; 24 | 25 | FOR(i,0,s.size()-1) 26 | if( s[i] == 'a' ) 27 | { odd += a[i%2]; even += a[(i+1)%2]; a[i%2]++; } 28 | else if( s[i] == 'b' ) 29 | { odd += b[i%2]; even += b[(i+1)%2]; b[i%2]++; } 30 | 31 | odd += s.size(); 32 | cout << even << " " << odd; 33 | } 34 | -------------------------------------------------------------------------------- /CF455A.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%ld", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( typeof(v.begin()) it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( typeof(s.begin()) it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 10 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 11 | #define ROF(i,a,b) for( ll i = a; i >= b; i-- ) 12 | #define debug(x) cout << "[DEBUG] " << #x << " = " << x << endl 13 | #define matrix vector< vector > 14 | #define F first 15 | #define S second 16 | #define mp make_pair 17 | #define L 2*r 18 | #define R 2*r+1 19 | #define INPFILE freopen("input.in","r",stdin) 20 | using namespace std; 21 | 22 | ll a[100005] = {0}; 23 | ll dp[100005] = {0}; 24 | 25 | 26 | int main() { 27 | ll n; cin >> n; 28 | set s; 29 | FOR(i,1,n) { 30 | ll x; cin >> x; 31 | s.insert(x); 32 | a[x]++; 33 | } 34 | 35 | dp[1] = a[1]; dp[0] = 0; 36 | 37 | FOR(i,2,*s.rbegin()) 38 | dp[i] = max( dp[i-1], dp[i-2] + a[i]*i ); 39 | 40 | 41 | cout << dp[*s.rbegin()]; 42 | } 43 | -------------------------------------------------------------------------------- /CF456P0.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int main() { 7 | long int n; int arr[100000+5] = {0}; 8 | cin >> n; 9 | long int a, b; 10 | long int count = 0; 11 | 12 | for( int i = 0; i < n; i++ ) { 13 | cin >> a >> b; 14 | arr[a] = b; 15 | } 16 | 17 | int flag = 0; int low = INT_MAX; 18 | 19 | for( int i = 0; i <= 100000; i++ ) 20 | if( arr[i] != 0) { 21 | if( arr[i] < low ) 22 | low = arr[i]; 23 | 24 | if( arr[i] > low ) 25 | { flag = 1; break; } 26 | } 27 | 28 | 29 | 30 | if( flag == 0 && n != 1) 31 | cout << "Happy Alex"; 32 | else 33 | cout << "Poor Alex"; 34 | 35 | } 36 | -------------------------------------------------------------------------------- /CF462B.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) cin >> a; 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( vector::iterator it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( set::iterator it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 10 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 11 | #define matrix vector< vector > 12 | #define MOD 1000000007 13 | #define F first 14 | #define S second 15 | #define mp make_pair 16 | #define L 2*r 17 | #define R 2*r+1 18 | #define INPFILE freopen("input.in","r",stdin) 19 | using namespace std; 20 | 21 | int main() { 22 | // INPFILE; 23 | ll n, k; 24 | cin >> n >> k; 25 | 26 | string s; 27 | cin >> s; 28 | 29 | vector v(28,0); 30 | 31 | FOR(i,0,n-1) 32 | v[ s[i] - 'A' ]++; 33 | 34 | sort( all(v), greater() ); 35 | ll ans = 0, i = 0; 36 | 37 | while( k != 0 ) 38 | if( v[i] <= k ) 39 | { ans += v[i]*v[i]; k -= v[i]; i++; } 40 | else 41 | { ans += k*k; k = 0; } 42 | 43 | cout << ans; 44 | 45 | 46 | 47 | } 48 | -------------------------------------------------------------------------------- /CF462C.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) cin >> a; 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( vector::iterator it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( set::iterator it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 10 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 11 | #define matrix vector< vector > 12 | #define MOD 1000000007 13 | #define F first 14 | #define S second 15 | #define mp make_pair 16 | #define L 2*r 17 | #define R 2*r+1 18 | #define INPFILE freopen("input.in","r",stdin) 19 | using namespace std; 20 | 21 | ll arr[300005] = {0}; 22 | 23 | 24 | int main() { 25 | // INPFILE; 26 | ll n; cin >> n; 27 | vector v; 28 | v.pb(0); 29 | 30 | ll sum = 0; 31 | 32 | FOR(i,1,n) 33 | { ll x; cin >> x; v.pb(x); } 34 | 35 | sort( all(v) ); 36 | 37 | for( ll i = v.size()-1; i >= 1; i-- ) 38 | arr[i] = v[i] + arr[i+1]; 39 | 40 | FOR(i,1,n) 41 | sum += v[i-1] + arr[i]; 42 | 43 | cout << sum; 44 | 45 | 46 | 47 | } 48 | -------------------------------------------------------------------------------- /CF463B.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll int 3 | #define get(a) scanf("%ld", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( typeof(v.begin()) it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( typeof(s.begin()) it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 10 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 11 | #define ROF(i,a,b) for( ll i = a; i >= b; i-- ) 12 | #define DEBUG(x) cout << "[DEBUG]" << #x << " " << x << endl 13 | #define matrix vector< vector > 14 | #define F first 15 | #define S second 16 | #define mp make_pair 17 | #define L 2*r 18 | #define R 2*r+1 19 | #define INPFILE freopen("input.in","r",stdin) 20 | using namespace std; 21 | 22 | int main() { 23 | ll n; cin >> n; 24 | 25 | vector v; 26 | v.pb(0); 27 | FOR(i,1,n) 28 | { ll x; cin >> x; v.pb(x); } 29 | 30 | ll ans = 0; 31 | ll health = 0; 32 | 33 | FOR(i,1,v.size()-1) { 34 | ll val = v[i-1] - v[i]; 35 | health += val; 36 | 37 | if( health < 0 ) 38 | { ans += abs(health); health = 0; } 39 | } 40 | 41 | cout << ans; 42 | } 43 | -------------------------------------------------------------------------------- /CF469A.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) cin >> a; 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( vector::iterator it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( set::iterator it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 10 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 11 | #define matrix vector< vector > 12 | #define MOD 1000000007 13 | #define F first 14 | #define S second 15 | #define mp make_pair 16 | #define L 2*r 17 | #define R 2*r+1 18 | #define INPFILE freopen("input.in","r",stdin) 19 | using namespace std; 20 | 21 | int main() { 22 | ll n; cin >> n; 23 | bool mark[105] = {0}; 24 | 25 | ll p, q; 26 | cin >> p; 27 | rep(p) 28 | { ll x; cin >> x; mark[x] = 1; } 29 | cin >> q; 30 | rep(q) 31 | { ll x; cin >> x; mark[x] = 1; } 32 | 33 | FOR(i,1,n) 34 | if( !mark[i] ) 35 | { cout << "Oh, my keyboard!"; return 0; } 36 | cout << "I become the guy."; 37 | } 38 | -------------------------------------------------------------------------------- /CF472A.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%ld", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( typeof(v.begin()) it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( typeof(s.begin()) it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 10 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 11 | #define matrix vector< vector > 12 | #define F first 13 | #define S second 14 | #define mp make_pair 15 | #define L 2*r 16 | #define R 2*r+1 17 | #define INPFILE freopen("input.in","r",stdin) 18 | using namespace std; 19 | 20 | bool prime[1000005] = {0}; 21 | 22 | void sieve() { 23 | ll n = 1000000; 24 | FOR(i,2,n) 25 | if( !prime[i] ) 26 | for( ll k = i*i; k <= n; k += i ) 27 | prime[k] = 1; 28 | 29 | } 30 | 31 | int main() { 32 | ll x; 33 | cin >> x; 34 | sieve(); 35 | 36 | FOR(i,4,x/2) 37 | if( !prime[i] || !prime[x-i] ) 38 | continue; 39 | else 40 | { cout << i << " " << abs(x-i); return 0; } 41 | 42 | } 43 | -------------------------------------------------------------------------------- /CF472B.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%ld", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( typeof(v.begin()) it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( typeof(s.begin()) it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 10 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 11 | #define matrix vector< vector > 12 | #define F first 13 | #define S second 14 | #define mp make_pair 15 | #define L 2*r 16 | #define R 2*r+1 17 | #define INPFILE freopen("input.in","r",stdin) 18 | using namespace std; 19 | 20 | int main() { 21 | ll n, k; 22 | cin >> n >> k; 23 | 24 | vector v; 25 | FOR(i,1,n) 26 | { ll x; cin >> x; v.pb(x); } 27 | 28 | sort( all(v) ); 29 | reverse( all(v) ); 30 | 31 | ll i = 0, ans = 0; 32 | while( i < n ) { 33 | ans += 2*(v[i]-1); 34 | i += k; 35 | } 36 | 37 | cout << ans; 38 | 39 | 40 | } 41 | -------------------------------------------------------------------------------- /CF477B.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%lld", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( typeof(v.begin()) it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( typeof(s.begin()) it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 10 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 11 | #define ROF(i,a,b) for( ll i = a; i >= b; i-- ) 12 | #define DEBUG(x) cout << "[DEBUG]" << #x << " " << x << endl 13 | #define matrix vector< vector > 14 | #define F first 15 | #define S second 16 | #define mp make_pair 17 | #define L 2*r 18 | #define R 2*r+1 19 | #define INPFILE freopen("input.in","r",stdin) 20 | using namespace std; 21 | 22 | int main() { 23 | ll n, k; 24 | cin >> n >> k; 25 | 26 | ll arr[] = { 1, 2, 3, 5 }; 27 | 28 | cout << ( 6*n - 1 )*k << endl; 29 | FOR(i,0,n-1) { 30 | FOR(j,0,3) 31 | cout << k*( 6*i + arr[j] ) << " "; 32 | cout << endl; 33 | } 34 | } 35 | -------------------------------------------------------------------------------- /CF478C.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long 3 | #define get(a) scanf("%ld", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( typeof(v.begin()) it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( typeof(s.begin()) it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 10 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 11 | #define ROF(i,a,b) for( ll i = a; i >= b; i-- ) 12 | #define debug(x) cout << "[DEBUG] " << #x << " = " << x << endl 13 | #define matrix vector< vector > 14 | #define F first 15 | #define S second 16 | #define mp make_pair 17 | #define L 2*r 18 | #define R 2*r+1 19 | #define INPFILE freopen("input.in","r",stdin) 20 | using namespace std; 21 | 22 | int main() { 23 | vector v; 24 | ll sum = 0; 25 | FOR(i,1,3) 26 | { ll x; cin >> x; sum += x; v.pb(x); } 27 | sort( all(v) ); 28 | 29 | cout << min( sum/3, v[0] + v[1] ); 30 | 31 | } 32 | -------------------------------------------------------------------------------- /CF478D.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%ld", &a); 4 | #define repVector(v) for( auto it = v.begin(); it != v.end(); it++ ) 5 | #define all(c) c.begin(), c.end() 6 | #define pb push_back 7 | #define FOR(i,a,b) for( ll i = (a); i <= (b); i++ ) 8 | #define ROF(i,a,b) for( ll i = a; i >= b; i-- ) 9 | #define debug(x) cerr << "[DEBUG] " << #x << " = " << x << endl 10 | #define matrix vector< vector > 11 | #define F first 12 | #define S second 13 | #define mp make_pair 14 | #define L 2*r 15 | #define R 2*r+1 16 | #define INPFILE freopen("input.in","r",stdin) 17 | #define BOOST ios_base::sync_with_stdio(false); cin.tie(NULL); 18 | using namespace std; 19 | 20 | #define MOD 1000000007 21 | 22 | ll h; 23 | ll dp[200005] = {0}; 24 | 25 | int main() { 26 | ll r, g; 27 | cin >> r >> g; 28 | 29 | for( h = 1; h*(h+1)/2 <= (r+g); h++ ); h--; 30 | debug(h); 31 | 32 | dp[0] = 1; 33 | FOR(i,1,h) 34 | ROF(j,r,i) 35 | dp[j] = ( dp[j] + dp[j-i] )%MOD; 36 | 37 | ll ans = 0; 38 | FOR(i,max(0LL,h*(h+1)/2-g),r) 39 | ans = (ans+dp[i])%MOD; 40 | 41 | cout << ans; 42 | } 43 | -------------------------------------------------------------------------------- /CF483C.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #define ll long long 4 | #define get(a) cin >> a 5 | #define rep(n) for( ll i = 0; i < n; i++ ) 6 | #define repVector(v) for(vector< pair >::iterator it = v.begin(); it != v.end(); it++ ) 7 | #define repSet(s) for( set< pair< ll, pair > >::iterator it = s.begin(); it != s.end(); it++ ) 8 | #define all(c) c.begin(), c.end() 9 | #define repu(a,n) for( ll i = a; i <= n; i++ ) 10 | #define pb push_back 11 | #define min(a,b) ( (a < b) ? a : b ) 12 | #define max(a,b) ( (a > b) ? a : b ) 13 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 14 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 15 | #define matrix vector< vector > 16 | #define MOD 1000000007 17 | #define F first 18 | #define S second 19 | #define L 2*r 20 | #define R 2*r+1 21 | #define mp make_pair 22 | using namespace std; 23 | 24 | bool m[100005] = {0}; 25 | 26 | 27 | int main() { 28 | ll n, k; 29 | cin >> n >> k; 30 | 31 | ll val = 1; 32 | ll num = 0; 33 | ll count = n; 34 | ll tmp = 1; 35 | 36 | ll ans[100005] = {0}; 37 | 38 | for( ll i = 1; i <= n; i += 2 ) 39 | ans[i] = i; 40 | 41 | } 42 | -------------------------------------------------------------------------------- /CF485A.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%d", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( vector::iterator it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( set::iterator it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 10 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 11 | #define matrix vector< vector > 12 | #define MOD 1000000007 13 | #define F first 14 | #define S second 15 | #define mp make_pair 16 | #define L 2*r 17 | #define R 2*r+1 18 | #define INPFILE freopen("input.in","r",stdin) 19 | using namespace std; 20 | 21 | int main() { 22 | ll n, m; 23 | cin >> n >> m; 24 | 25 | bool mark[500005] = {0}; 26 | ll a = n; 27 | 28 | while(1) { 29 | if( a%m == 0 ) 30 | { cout << "Yes"; return 0; } 31 | if( mark[a%m] == 1 ) 32 | { cout << "No"; return 0; } 33 | mark[a%m] = 1; 34 | a += a%m; 35 | } 36 | 37 | } 38 | -------------------------------------------------------------------------------- /CF485B.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%d", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( vector::iterator it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( set::iterator it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 10 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 11 | #define matrix vector< vector > 12 | #define MOD 1000000007 13 | #define F first 14 | #define S second 15 | #define mp make_pair 16 | #define L 2*r 17 | #define R 2*r+1 18 | #define INPFILE freopen("input.in","r",stdin) 19 | using namespace std; 20 | 21 | int main() { 22 | ll n; cin >> n; 23 | vector x, y; 24 | 25 | rep(n) { 26 | ll p,q; 27 | cin >> p >> q; 28 | x.pb(p); y.pb(q); 29 | } 30 | 31 | sort( all(x) ); 32 | sort( all(y) ); 33 | 34 | ll x1 = x.back(); ll y1 = y.back(); 35 | ll x2 = *x.begin(); ll y2 = *y.begin(); 36 | 37 | ll side = max( x1 - x2 , y1 - y2 ); 38 | cout << side*side; 39 | 40 | } 41 | -------------------------------------------------------------------------------- /CF485D.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%d", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( vector::iterator it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( set::iterator it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 10 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 11 | #define matrix vector< vector > 12 | #define MOD 1000000007 13 | #define F first 14 | #define S second 15 | #define mp make_pair 16 | #define L 2*r 17 | #define R 2*r+1 18 | #define INPFILE freopen("input.in","r",stdin) 19 | using namespace std; 20 | 21 | int main() { 22 | ll n; cin >> n; 23 | vector v; 24 | 25 | while(n--) { 26 | ll x; cin >> x; 27 | v.pb(x); 28 | } 29 | 30 | 31 | } 32 | -------------------------------------------------------------------------------- /CF488A.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%lld", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( typeof(v.begin()) it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( typeof(s.begin()) it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 10 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 11 | #define ROF(i,a,b) for( ll i = a; i >= b; i-- ) 12 | #define DEBUG(x) cout << "[DEBUG]" << #x << " " << x << endl 13 | #define matrix vector< vector > 14 | #define F first 15 | #define S second 16 | #define mp make_pair 17 | #define L 2*r 18 | #define R 2*r+1 19 | #define INPFILE freopen("input.in","r",stdin) 20 | using namespace std; 21 | 22 | bool check( ll n ) { 23 | n = abs(n); 24 | 25 | while( n!= 0 ) { 26 | if( n%10 == 8 ) 27 | return 1; 28 | n /= 10; 29 | } 30 | 31 | return 0; 32 | } 33 | 34 | int main() { 35 | ll n; cin >> n; 36 | 37 | ll ans = 0; 38 | FOR(i,n+1,LLONG_MAX) { 39 | ans++; 40 | if( check(i) ) 41 | break; 42 | } 43 | 44 | cout << ans; 45 | 46 | } 47 | -------------------------------------------------------------------------------- /CF493D.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%ld", &a); 4 | #define repVector(v) for( auto it = v.begin(); it != v.end(); it++ ) 5 | #define repSet(s) for( auto it = s.begin(); it != s.end(); it++ ) 6 | #define all(c) c.begin(), c.end() 7 | #define pb push_back 8 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 9 | #define ROF(i,a,b) for( ll i = a; i >= b; i-- ) 10 | #define debug(x) cout << "[DEBUG] " << #x << " = " << x << endl 11 | #define matrix vector< vector > 12 | #define F first 13 | #define S second 14 | #define mp make_pair 15 | #define L 2*r 16 | #define R 2*r+1 17 | #define INPFILE freopen("input.in","r",stdin) 18 | #define BOOST ios_base::sync_with_stdio(false); cin.tie(NULL); 19 | using namespace std; 20 | 21 | int main() { 22 | BOOST; 23 | ll n; cin >> n; 24 | if( n%2 ) 25 | cout << "black"; 26 | else 27 | cout << "white\n1 2"; 28 | } 29 | 30 | 31 | -------------------------------------------------------------------------------- /CF496A.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long 3 | #define get(a) scanf("%ld", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( typeof(v.begin()) it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( set::iterator it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define max(a,b) ( (a > b) ? a : b ) 10 | #define min(a,b) ( (a < b) ? a : b ) 11 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 12 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 13 | #define matrix vector< vector > 14 | #define MOD 1000000007 15 | #define F first 16 | #define S second 17 | #define mp make_pair 18 | #define INPFILE freopen("input.in","r",stdin) 19 | using namespace std; 20 | 21 | int main() { 22 | ll n; get(n); 23 | vector v; 24 | 25 | rep(n) 26 | { ll x; get(x); v.pb(x); } 27 | 28 | ll ans[n+1]; 29 | ans[0] = v[0]; 30 | ans[n+1] = 0; 31 | 32 | ll val = INT_MIN; 33 | 34 | FOR(i,0,n-2) 35 | ans[i] = max( ans[i-1], v[i+1] - v[i] ); 36 | 37 | ll val = 0; 38 | 39 | FOR(i,0,n-2) 40 | val = min( val, v[i+2] - v[i] ); 41 | 42 | cout << max(ans,ans; 43 | 44 | } 45 | 46 | -------------------------------------------------------------------------------- /CF498A.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%ld", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( typeof(v.begin()) it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( set::iterator it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define max(a,b) ( (a > b) ? a : b ) 10 | #define min(a,b) ( (a < b) ? a : b ) 11 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 12 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 13 | #define matrix vector< vector > 14 | #define MOD 1000000007 15 | #define F first 16 | #define S second 17 | #define mp make_pair 18 | #define INPFILE freopen("input.in","r",stdin) 19 | #define eps 10e-14 20 | using namespace std; 21 | 22 | int main() { 23 | // INPFILE; 24 | ll x1, y1, x2, y2, m; 25 | cin >> x1 >> y1 >> x2 >> y2; 26 | 27 | ll ans = 0; 28 | 29 | cin >> m; 30 | rep(m) { 31 | ll a, b, c; 32 | cin >> a >> b >> c; 33 | ll x = ( a*x1 + b*y1 + c ) > 0 ? 1 : -1; 34 | ll y = ( a*x2 + b*y2 + c ) > 0 ? 1 : -1; 35 | 36 | 37 | 38 | if( x*y < 0 ) 39 | ans++; 40 | } 41 | 42 | cout << ans; 43 | } 44 | -------------------------------------------------------------------------------- /CF500C.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long 3 | #define get(a) scanf("%ld", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( typeof(v.begin()) it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( set::iterator it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define max(a,b) ( (a > b) ? a : b ) 10 | #define min(a,b) ( (a < b) ? a : b ) 11 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 12 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 13 | #define matrix vector< vector > 14 | #define MOD 1000000007 15 | #define F first 16 | #define S second 17 | #define mp make_pair 18 | #define INPFILE freopen("input.in","r",stdin) 19 | using namespace std; 20 | 21 | int main() { 22 | // INPFILE; 23 | ll n, m; 24 | cin >> n >> m; 25 | 26 | ll w[n+1], v[m]; 27 | rep(n) 28 | cin >> w[i]; 29 | 30 | ll ans = 0; 31 | 32 | rep(m) { 33 | cin >> v[i]; 34 | 35 | set s; 36 | ll ptr = i-1; 37 | while( ptr >= 1 && v[ptr] != v[i] ) 38 | { s.insert( v[ptr] ); ptr--; } 39 | repSet(s) 40 | ans += w[*it]; 41 | 42 | } 43 | 44 | 45 | cout << ans; 46 | 47 | } 48 | -------------------------------------------------------------------------------- /CF505A.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%lld", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( vector::iterator it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( set::iterator it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 10 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 11 | #define matrix vector< vector > 12 | #define MOD 1000000007 13 | #define F first 14 | #define S second 15 | #define mp make_pair 16 | #define L 2*r 17 | #define R 2*r+1 18 | #define INPFILE freopen("input.in","r",stdin) 19 | using namespace std; 20 | 21 | bool isPalin( string s ) { 22 | ll len = s.size(); 23 | 24 | FOR(i,0,len/2) 25 | if( s[i] != s[ len - 1 - i ] ) 26 | return 0; 27 | return 1; 28 | } 29 | 30 | int main() { 31 | string s, temp; 32 | cin >> temp; 33 | 34 | FOR(i,'a','z') { 35 | s = temp; 36 | FOR(j,0,s.size()) { 37 | s.insert( j, 1, char(i) ); 38 | if( isPalin(s) ) 39 | { cout << s; return 0; } 40 | s = temp; 41 | } 42 | } 43 | 44 | cout << "NA"; 45 | 46 | } 47 | -------------------------------------------------------------------------------- /CF509A.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long 3 | #define get(a) scanf("%ld", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( typeof(v.begin()) it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( typeof(s.begin()) it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 10 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 11 | #define matrix vector< vector > 12 | #define F first 13 | #define S second 14 | #define mp make_pair 15 | #define L 2*r 16 | #define R 2*r+1 17 | #define INPFILE freopen("input.in","r",stdin) 18 | using namespace std; 19 | 20 | int main() { 21 | ll n, ans = 1; 22 | ll arr[15][15] = {0}; 23 | get(n); 24 | 25 | FOR(i,1,n) 26 | { arr[i][1] = arr[1][i] = 1; } 27 | 28 | FOR(i,1,n) 29 | FOR(j,1,n) 30 | if( arr[i][j] == 0 ) { 31 | arr[i][j] = arr[i-1][j] + arr[i][j-1]; 32 | ans = max( ans, arr[i][j] ); 33 | } 34 | 35 | cout << ans; 36 | } 37 | -------------------------------------------------------------------------------- /CF515A.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%lld", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( typeof(v.begin()) it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( typeof(s.begin()) it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define MEM(a,b) memset(a,(b),sizeof(a)) 9 | #define MAX(a,b) ((a) > (b) ? (a) : (b)) 10 | #define MIN(a,b) ((a) < (b) ? (a) : (b)) 11 | #define pb push_back 12 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 13 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 14 | #define matrix vector< vector > 15 | #define F first 16 | #define S second 17 | #define mp make_pair 18 | #define L 2*r 19 | #define R 2*r+1 20 | #define MOD 1000000007 21 | #define INPFILE freopen("input.in","r",stdin) 22 | using namespace std; 23 | 24 | int main() { 25 | ll a, b, s; 26 | cin >> a >> b >> s; 27 | 28 | if( abs(a) + abs(b) > s ) 29 | cout << "No"; 30 | else if( ( s - abs(a) + abs(b) )%2 ) 31 | cout << "No"; 32 | else 33 | cout << "Yes"; 34 | } 35 | -------------------------------------------------------------------------------- /CF519C.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%ld", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( typeof(v.begin()) it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( typeof(s.begin()) it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 10 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 11 | #define ROF(i,a,b) for( ll i = a; i >= b; i-- ) 12 | #define debug(x) cout << "[DEBUG] " << #x << " = " << x << endl 13 | #define matrix vector< vector > 14 | #define F first 15 | #define S second 16 | #define mp make_pair 17 | #define L 2*r 18 | #define R 2*r+1 19 | #define INPFILE freopen("input.in","r",stdin) 20 | using namespace std; 21 | 22 | ll rec( ll x, ll y ) { 23 | ll a = max(x,y); ll b = min(x,y); 24 | if( a >= 2 && b >= 1 ) 25 | return 1 + rec( a-2, b-1 ); 26 | else 27 | return 0; 28 | } 29 | 30 | int main() { 31 | ll n, m; 32 | cin >> n >> m; 33 | 34 | cout << rec(n,m); 35 | } 36 | -------------------------------------------------------------------------------- /CF526C.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%ld", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( typeof(v.begin()) it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( typeof(s.begin()) it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 10 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 11 | #define ROF(i,a,b) for( ll i = a; i >= b; i-- ) 12 | #define debug(x) cout << "[DEBUG] " << #x << " = " << x << endl 13 | #define matrix vector< vector > 14 | #define F first 15 | #define S second 16 | #define mp make_pair 17 | #define L 2*r 18 | #define R 2*r+1 19 | #define INPFILE freopen("input.in","r",stdin) 20 | using namespace std; 21 | 22 | int main() { 23 | ll c, hr, hb, wr, wb; 24 | cin >> c >> hr >> hb >> wr >> wb; 25 | ll ans = 0; 26 | 27 | FOR(i,0,sqrt(c)) { 28 | if( i*wr <= c ) 29 | ans = max( ans, i*hr + ( c - i*wr )/wb * hb ); 30 | if( i*wb <= c ) 31 | ans = max( ans, i*hb + ( c - i*wb )/wr * hr ); 32 | } 33 | 34 | cout << ans; 35 | } 36 | -------------------------------------------------------------------------------- /CF534C.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%ld", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( typeof(v.begin()) it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( typeof(s.begin()) it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 10 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 11 | #define ROF(i,a,b) for( ll i = a; i >= b; i-- ) 12 | #define debug(x) cout << "[DEBUG] " << #x << " = " << x << endl 13 | #define matrix vector< vector > 14 | #define F first 15 | #define S second 16 | #define mp make_pair 17 | #define L 2*r 18 | #define R 2*r+1 19 | #define INPFILE freopen("input.in","r",stdin) 20 | using namespace std; 21 | 22 | int main() { 23 | ll n, a; 24 | cin >> n >> a; 25 | vector v; 26 | ll sum = 0; 27 | 28 | FOR(i,1,n) 29 | { ll x; cin >> x; v.pb(x); sum += x; } 30 | 31 | repVector(v) { 32 | ll x = sum - (*it); 33 | ll y = max(0LL,a-x-1); 34 | ll z = max(0LL, (*it) - ( a - n + 1 ) ); 35 | cout << y+z << " "; 36 | } 37 | 38 | } 39 | -------------------------------------------------------------------------------- /CF538A.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%lld", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( auto it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( typeof(s.begin()) it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 10 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 11 | #define ROF(i,a,b) for( ll i = a; i >= b; i-- ) 12 | #define debug(x) cout << "[DEBUG] " << #x << " = " << x << endl 13 | #define matrix vector< vector > 14 | #define F first 15 | #define S second 16 | #define mp make_pair 17 | #define L 2*r 18 | #define R 2*r+1 19 | #define MOD 1000000007 20 | #define INPFILE freopen("input.in","r",stdin) 21 | using namespace std; 22 | 23 | int main() { 24 | string s = "CODEFORCES"; 25 | string p; 26 | cin >> p; 27 | 28 | FOR(i,0,p.size()-1) 29 | FOR(j,0,p.size()-i) { 30 | string c = p; 31 | c.erase(i,j); 32 | // cout << c << endl; 33 | if( c == s ) 34 | { cout << "YES"; return 0; } 35 | } 36 | 37 | cout << "NO"; 38 | } 39 | -------------------------------------------------------------------------------- /CF545D.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%ld", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( typeof(v.begin()) it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( typeof(s.begin()) it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 10 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 11 | #define ROF(i,a,b) for( ll i = a; i >= b; i-- ) 12 | #define debug(x) cout << "[DEBUG] " << #x << " = " << x << endl 13 | #define matrix vector< vector > 14 | #define F first 15 | #define S second 16 | #define mp make_pair 17 | #define L 2*r 18 | #define R 2*r+1 19 | #define INPFILE freopen("input.in","r",stdin) 20 | using namespace std; 21 | 22 | 23 | int main() { 24 | ll n; cin >> n; 25 | vector v; 26 | 27 | FOR(i,1,n) 28 | { ll x; cin >> x; v.pb(x); } 29 | 30 | sort( all(v) ); 31 | 32 | ll wt = 0, ans = 0; 33 | FOR(i,0,n-1) 34 | if( v[i] >= wt ) 35 | { ans++; wt += v[i]; } 36 | cout << ans; 37 | } 38 | -------------------------------------------------------------------------------- /CF549G.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%ld", &a); 4 | #define repVector(v) for( auto it = v.begin(); it != v.end(); it++ ) 5 | #define all(c) c.begin(), c.end() 6 | #define pb push_back 7 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 8 | #define ROF(i,a,b) for( ll i = a; i >= b; i-- ) 9 | #define debug(x) cout << "[DEBUG] " << #x << " = " << x << endl 10 | #define matrix vector< vector > 11 | #define F first 12 | #define S second 13 | #define mp make_pair 14 | #define L 2*r 15 | #define R 2*r+1 16 | #define INPFILE freopen("input.in","r",stdin) 17 | #define BOOST ios_base::sync_with_stdio(false); cin.tie(NULL); 18 | using namespace std; 19 | 20 | int main() { 21 | ll n; cin >> n; 22 | vector v; 23 | FOR(i,1,n) 24 | { ll x; cin >> x; v.pb(x); } 25 | FOR(i,0,n-1) 26 | v[i] -= n - i; 27 | sort( all(v) ); 28 | 29 | FOR(i,0,n-1) 30 | v[i] += n - i; 31 | 32 | FOR(i,0,n-2) 33 | if( v[i] < 0 || v[i] > v[i+1] ) 34 | { cout << ":("; return 0; } 35 | FOR(i,0,n-1) 36 | cout << v[i] << " "; 37 | } 38 | -------------------------------------------------------------------------------- /CF552A.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%ld", &a); 4 | #define repVector(v) for( auto it = v.begin(); it != v.end(); it++ ) 5 | #define all(c) c.begin(), c.end() 6 | #define pb push_back 7 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 8 | #define ROF(i,a,b) for( ll i = a; i >= b; i-- ) 9 | #define debug(x) cout << "[DEBUG] " << #x << " = " << x << endl 10 | #define matrix vector< vector > 11 | #define F first 12 | #define S second 13 | #define mp make_pair 14 | #define L 2*r 15 | #define R 2*r+1 16 | #define INPFILE freopen("input.in","r",stdin) 17 | #define BOOST ios_base::sync_with_stdio(false); cin.tie(NULL); 18 | using namespace std; 19 | 20 | int main() { 21 | ll n; cin >> n; 22 | ll arr[105][105] = {0}; 23 | 24 | FOR(i,1,n) { 25 | ll x1, y1, x2, y2; 26 | cin >> x1 >> y1 >> x2 >> y2; 27 | 28 | FOR(p,x1,x2) 29 | FOR(q,y1,y2) 30 | arr[p][q]++; 31 | } 32 | 33 | ll ans = 0; 34 | FOR(i,1,100) 35 | FOR(j,1,100) 36 | ans += arr[i][j]; 37 | 38 | cout << ans; 39 | } 40 | -------------------------------------------------------------------------------- /CF552B.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%ld", &a); 4 | #define repVector(v) for( auto it = v.begin(); it != v.end(); it++ ) 5 | #define all(c) c.begin(), c.end() 6 | #define pb push_back 7 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 8 | #define ROF(i,a,b) for( ll i = a; i >= b; i-- ) 9 | #define debug(x) cout << "[DEBUG] " << #x << " = " << x << endl 10 | #define matrix vector< vector > 11 | #define F first 12 | #define S second 13 | #define mp make_pair 14 | #define L 2*r 15 | #define R 2*r+1 16 | #define INPFILE freopen("input.in","r",stdin) 17 | #define BOOST ios_base::sync_with_stdio(false); cin.tie(NULL); 18 | using namespace std; 19 | 20 | int main() { 21 | ll n; cin >> n; 22 | ll digits = 0, num = n; 23 | while(num) { 24 | num /= 10; 25 | digits++; 26 | } 27 | 28 | // debug(digits); 29 | 30 | 31 | 32 | ll ans = 0; 33 | FOR(i,1,digits-1) { 34 | ans += 9*pow(10,i-1)*i; 35 | // debug(ans); 36 | } 37 | 38 | ll val = (ll)pow(10,digits-1); 39 | ans += (n - val + 1)*digits; 40 | 41 | cout << ans; 42 | 43 | } 44 | -------------------------------------------------------------------------------- /CF552C.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%ld", &a); 4 | #define repVector(v) for( auto it = v.begin(); it != v.end(); it++ ) 5 | #define all(c) c.begin(), c.end() 6 | #define pb push_back 7 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 8 | #define ROF(i,a,b) for( ll i = a; i >= b; i-- ) 9 | #define debug(x) cout << "[DEBUG] " << #x << " = " << x << endl 10 | #define matrix vector< vector > 11 | #define F first 12 | #define S second 13 | #define mp make_pair 14 | #define L 2*r 15 | #define R 2*r+1 16 | #define INPFILE freopen("input.in","r",stdin) 17 | #define BOOST ios_base::sync_with_stdio(false); cin.tie(NULL); 18 | using namespace std; 19 | 20 | bool rec( ll w, ll m ) { 21 | // debug(m); 22 | bool ret = 0; 23 | if( m <= 0 ) 24 | return 1; 25 | 26 | if( ( m - 1 )%w == 0 ) 27 | ret |= rec( w, (m-1)/w ); 28 | if( !ret && ( m + 1 )%w == 0 ) 29 | ret |= rec( w, (m+1)/w ); 30 | if( !ret && m%w == 0 ) 31 | ret |= rec( w, m/w ); 32 | 33 | return ret; 34 | } 35 | 36 | int main() { 37 | ll w, m; 38 | cin >> w >> m; 39 | 40 | if(rec(w,m)) 41 | cout << "YES"; 42 | else 43 | cout << "NO"; 44 | 45 | } 46 | -------------------------------------------------------------------------------- /CF554.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%ld", &a); 4 | #define repVector(v) for( auto it = v.begin(); it != v.end(); it++ ) 5 | #define all(c) c.begin(), c.end() 6 | #define pb push_back 7 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 8 | #define ROF(i,a,b) for( ll i = a; i >= b; i-- ) 9 | #define debug(x) cout << "[DEBUG] " << #x << " = " << x << endl 10 | #define matrix vector< vector > 11 | #define F first 12 | #define S second 13 | #define mp make_pair 14 | #define L 2*r 15 | #define R 2*r+1 16 | #define INPFILE freopen("input.in","r",stdin) 17 | #define BOOST ios_base::sync_with_stdio(false); cin.tie(NULL); 18 | using namespace std; 19 | 20 | set s; 21 | 22 | void rec( string start, string end ) { 23 | if( end.empty() ) 24 | end = ""; 25 | 26 | FOR(i,'a','z') { 27 | string p = start + char(i) + end; 28 | s.insert(p); 29 | } 30 | 31 | if( end.empty() ) 32 | return; 33 | 34 | start += end[0]; 35 | end.erase(end.begin()); 36 | return rec( start, end ); 37 | } 38 | 39 | int main() { 40 | string s; 41 | cin >> s; 42 | rec( "", s ); 43 | cout << ::s.size(); 44 | } 45 | -------------------------------------------------------------------------------- /CF554B.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%ld", &a); 4 | #define repVector(v) for( auto it = v.begin(); it != v.end(); it++ ) 5 | #define all(c) c.begin(), c.end() 6 | #define pb push_back 7 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 8 | #define ROF(i,a,b) for( ll i = a; i >= b; i-- ) 9 | #define debug(x) cout << "[DEBUG] " << #x << " = " << x << endl 10 | #define matrix vector< vector > 11 | #define F first 12 | #define S second 13 | #define mp make_pair 14 | #define L 2*r 15 | #define R 2*r+1 16 | #define INPFILE freopen("input.in","r",stdin) 17 | #define BOOST ios_base::sync_with_stdio(false); cin.tie(NULL); 18 | using namespace std; 19 | 20 | int main() { 21 | ll n; cin >> n; 22 | string s[n+1]; 23 | 24 | FOR(i,1,n) 25 | cin >> s[i]; 26 | 27 | ll ans = 1; 28 | 29 | FOR(i,1,n) { 30 | ll val = 0; 31 | FOR(j,1,n) 32 | if( s[i] == s[j] ) 33 | val++; 34 | ans = max(ans,val); 35 | } 36 | 37 | cout << ans; 38 | 39 | } 40 | -------------------------------------------------------------------------------- /CF556A.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%ld", &a); 4 | #define repVector(v) for( auto it = v.begin(); it != v.end(); it++ ) 5 | #define all(c) c.begin(), c.end() 6 | #define pb push_back 7 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 8 | #define ROF(i,a,b) for( ll i = a; i >= b; i-- ) 9 | #define debug(x) cout << "[DEBUG] " << #x << " = " << x << endl 10 | #define matrix vector< vector > 11 | #define F first 12 | #define S second 13 | #define mp make_pair 14 | #define L 2*r 15 | #define R 2*r+1 16 | #define INPFILE freopen("input.in","r",stdin) 17 | #define BOOST ios_base::sync_with_stdio(false); cin.tie(NULL); 18 | using namespace std; 19 | 20 | int main() { 21 | //INPFILE; 22 | ll n; cin >> n; 23 | string s; cin >> s; 24 | 25 | ll zero = 0, one = 0; 26 | 27 | FOR(i,0,n-1) 28 | if( s[i] == '0' ) 29 | zero++; 30 | else if( s[i] == '1' ) 31 | one++; 32 | 33 | cout << abs(one-zero); 34 | } 35 | -------------------------------------------------------------------------------- /CF556B.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%ld", &a); 4 | #define repVector(v) for( auto it = v.begin(); it != v.end(); it++ ) 5 | #define all(c) c.begin(), c.end() 6 | #define pb push_back 7 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 8 | #define ROF(i,a,b) for( ll i = a; i >= b; i-- ) 9 | #define debug(x) cout << "[DEBUG] " << #x << " = " << x << endl 10 | #define matrix vector< vector > 11 | #define F first 12 | #define S second 13 | #define mp make_pair 14 | #define L 2*r 15 | #define R 2*r+1 16 | #define INPFILE freopen("input.in","r",stdin) 17 | #define BOOST ios_base::sync_with_stdio(false); cin.tie(NULL); 18 | using namespace std; 19 | 20 | int main() { 21 | ll n; cin >> n; 22 | ll arr[5000] = {0}; 23 | ll mark[5000] = {0}; 24 | 25 | FOR(i,1,n) { 26 | cin >> arr[i]; 27 | mark[i] = i-1; 28 | } 29 | 30 | set s; 31 | 32 | FOR(i,1,n) 33 | if(i%2) 34 | s.insert( ( mark[i] - arr[i] + n)%n ); 35 | else 36 | s.insert( ( arr[i] - mark[i] + n )%n ); 37 | 38 | if( s.size() == 1 ) 39 | cout << "Yes"; 40 | else 41 | cout << "No"; 42 | } 43 | -------------------------------------------------------------------------------- /CF560A.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%ld", &a); 4 | #define repVector(v) for( auto it = v.begin(); it != v.end(); it++ ) 5 | #define all(c) c.begin(), c.end() 6 | #define pb push_back 7 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 8 | #define ROF(i,a,b) for( ll i = a; i >= b; i-- ) 9 | #define debug(x) cerr << "[DEBUG] " << #x << " = " << x << endl 10 | #define matrix vector< vector > 11 | #define F first 12 | #define S second 13 | #define mp make_pair 14 | #define L 2*r 15 | #define R 2*r+1 16 | #define INPFILE freopen("input.in","r",stdin) 17 | #define BOOST ios_base::sync_with_stdio(false); cin.tie(NULL); 18 | using namespace std; 19 | 20 | int main() { 21 | ll n; cin >> n; 22 | vector v; bool f = 0; 23 | FOR(i,1,n) 24 | { ll x; cin >> x; if( x == 1 ) f = 1; v.pb(x); } 25 | 26 | if(f) 27 | cout << "-1"; 28 | else 29 | cout << "1"; 30 | 31 | } 32 | -------------------------------------------------------------------------------- /CF560C.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%ld", &a); 4 | #define repVector(v) for( auto it = v.begin(); it != v.end(); it++ ) 5 | #define all(c) c.begin(), c.end() 6 | #define pb push_back 7 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 8 | #define ROF(i,a,b) for( ll i = a; i >= b; i-- ) 9 | #define debug(x) cerr << "[DEBUG] " << #x << " = " << x << endl 10 | #define matrix vector< vector > 11 | #define F first 12 | #define S second 13 | #define mp make_pair 14 | #define L 2*r 15 | #define R 2*r+1 16 | #define INPFILE freopen("input.in","r",stdin) 17 | #define BOOST ios_base::sync_with_stdio(false); cin.tie(NULL); 18 | using namespace std; 19 | 20 | int main() { 21 | vector a; 22 | FOR(i,1,6) 23 | { ll x; cin >> x; a.pb(x); } 24 | ll val = 0; 25 | 26 | FOR(k,1,6) { 27 | ll ans = ( 2*a[0] + a[5] )*a[5] + ( a[3] + a[0] + a[5] )*a[4]; 28 | val = max(val,ans); 29 | a.insert( a.begin(), a.back() ); a.erase(--a.end()); 30 | } 31 | 32 | cout << val; 33 | 34 | } 35 | -------------------------------------------------------------------------------- /CFRTEST.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%lld", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( auto it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( typeof(s.begin()) it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 10 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 11 | #define ROF(i,a,b) for( ll i = a; i >= b; i-- ) 12 | #define debug(x) cout << "[DEBUG] " << #x << " = " << x << endl 13 | #define matrix vector< vector > 14 | #define F first 15 | #define S second 16 | #define mp make_pair 17 | #define L 2*r 18 | #define R 2*r+1 19 | #define MOD 1000000007 20 | #define INPFILE freopen("input.in","r",stdin) 21 | using namespace std; 22 | 23 | int main() { 24 | ll t; cin >> t; 25 | while(t--) { 26 | ll n; cin >> n; 27 | set s; 28 | FOR(i,1,n) 29 | { ll x; cin >> x; s.insert(x); } 30 | cout << s.size() << "\n"; 31 | } 32 | } 33 | 34 | -------------------------------------------------------------------------------- /CHCUBE.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%lld", &a); 4 | #define repVector(v) for( auto it = v.begin(); it != v.end(); it++ ) 5 | #define all(c) c.begin(), c.end() 6 | #define pb push_back 7 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 8 | #define ROF(i,a,b) for( ll i = a; i >= b; i-- ) 9 | #define debug(x) cout << "[DEBUG] " << #x << " = " << x << endl 10 | #define matrix vector< vector > 11 | #define F first 12 | #define S second 13 | #define mp make_pair 14 | #define L 2*r 15 | #define R 2*r+1 16 | #define INPFILE freopen("input.in","r",stdin) 17 | #define BOOST ios_base::sync_with_stdio(false); cin.tie(NULL); 18 | using namespace std; 19 | 20 | bool EQ( string a, string b, string c ) { 21 | if( a == b && b == c ) 22 | return 1; 23 | return 0; 24 | } 25 | 26 | int main() { 27 | ll t; get(t); 28 | while(t--) { 29 | string f, b, bt, l, r, t; 30 | cin >> f >> b >> l >> r >> t >> bt; 31 | 32 | bool exp = EQ(f,bt,l) || EQ(f,l,t) || EQ(f,r,t) || EQ(f,r,bt); 33 | exp |= EQ(b,bt,l) || EQ(b,l,t) || EQ(b,r,t) || EQ(b,r,bt); 34 | 35 | if(exp) 36 | cout << "YES\n"; 37 | else 38 | cout << "NO\n"; 39 | } 40 | } 41 | -------------------------------------------------------------------------------- /CHEFDTRE.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%ld", &a); 4 | #define repVector(v) for( auto it = v.begin(); it != v.end(); it++ ) 5 | #define all(c) c.begin(), c.end() 6 | #define pb push_back 7 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 8 | #define ROF(i,a,b) for( ll i = a; i >= b; i-- ) 9 | #define debug(x) cout << "[DEBUG] " << #x << " = " << x << endl 10 | #define matrix vector< vector > 11 | #define F first 12 | #define S second 13 | #define mp make_pair 14 | #define L 2*r 15 | #define R 2*r+1 16 | #define INPFILE freopen("input.in","r",stdin) 17 | #define BOOST ios_base::sync_with_stdio(false); cin.tie(NULL); 18 | using namespace std; 19 | 20 | vector s[1000000]; 21 | 22 | int main() { 23 | ll n, m; 24 | cin >> n >> m; 25 | 26 | FOR(i,1,n) 27 | s[i].pb(i); 28 | 29 | while(m--) { 30 | string str; ll a, b; 31 | cin >> str >> a >> b; 32 | 33 | if( str == "UNION" ) { 34 | n++; 35 | s[n].resize( s[a].size() + s[b].size() ); 36 | merge( all(s[a]), all(s[b]), s[n].begin() ); 37 | } 38 | else 39 | cout << s[a][b-1] << "\n"; 40 | 41 | } 42 | } 43 | -------------------------------------------------------------------------------- /CHEFEQ.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%lld", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( typeof(v.begin()) it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( typeof(s.begin()) it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define MEM(a,b) memset(a,(b),sizeof(a)) 9 | #define MAX(a,b) ((a) > (b) ? (a) : (b)) 10 | #define MIN(a,b) ((a) < (b) ? (a) : (b)) 11 | #define pb push_back 12 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 13 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 14 | #define matrix vector< vector > 15 | #define F first 16 | #define S second 17 | #define mp make_pair 18 | #define L 2*r 19 | #define R 2*r+1 20 | #define MOD 1000000007 21 | #define INPFILE freopen("input.in","r",stdin) 22 | using namespace std; 23 | 24 | int main() { 25 | ll t; get(t); 26 | while(t--) { 27 | ll n; get(n); 28 | ll arr[100005] = {0}; 29 | ll mx = 0; 30 | 31 | FOR(i,1,n) { 32 | ll x; get(x); 33 | arr[x]++; 34 | if( arr[x] > mx ) 35 | mx = arr[x]; 36 | } 37 | 38 | printf("%lld\n", n-mx); 39 | 40 | } 41 | } 42 | -------------------------------------------------------------------------------- /CHEFGR.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #define ll long 4 | #define get(a) scanf("%ld", &a) 5 | #define rep(n) for( ll i = 0; i < n; i++ ) 6 | #define repVector(v) for(vector::iterator it = v.begin(); it != v.end(); it++ ) 7 | #define repSet(s) for( set::iterator it = s.begin(); it != s.end(); it++ ) 8 | #define all(c) c.begin(), c.end() 9 | #define repu(a,n) for( ll i = a; i < n; i++ ) 10 | #define pb push_back 11 | #define min(a,b) ( (a < b) ? a : b ) 12 | #define max(a,b) ( (a > b) ? a : b ) 13 | #define absol(a) a >= 0 ? a : -a 14 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 15 | #define matrix vector< vector > 16 | #define MOD 1000000007 17 | #define L 2*r 18 | #define R 2*r+1 19 | using namespace std; 20 | 21 | int main() { 22 | ll t; 23 | get(t); 24 | 25 | while(t--) { 26 | ll n, m; 27 | ll a[100+5] = {0}; 28 | get(n); get(m); 29 | 30 | ll maxnum = 0, sum = m; 31 | 32 | rep(n) { 33 | get(a[i]); 34 | sum += a[i]; 35 | maxnum = max( a[i], maxnum ); 36 | } 37 | 38 | if( sum%n == 0 && maxnum <= sum/n ) 39 | printf("Yes\n"); 40 | else 41 | printf("No\n"); 42 | } 43 | } 44 | -------------------------------------------------------------------------------- /CHEFPOW.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) cin >> a; 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( vector::iterator it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( set::iterator it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 10 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 11 | #define matrix vector< vector > 12 | #define MOD 1000000007 13 | #define F first 14 | #define S second 15 | #define mp make_pair 16 | #define L 2*r 17 | #define R 2*r+1 18 | #define INPFILE freopen("input.in","r",stdin) 19 | using namespace std; 20 | 21 | int main() { 22 | ll n; get(n); 23 | vector v; 24 | 25 | while( n > 0 ) { 26 | ll k = log2(n); 27 | v.pb(k); 28 | n -= (1< 2 | #define ll long long 3 | #define get(a) scanf("%lld", &a); 4 | #define rep(n) for( ll i = 0; i < n; i++ ) 5 | #define repVector(v) for( vector::iterator it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( set::iterator it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define max(a,b) ( (a > b) ? a : b ) 10 | #define min(a,b) ( (a < b) ? a : b ) 11 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 12 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 13 | #define matrix vector< vector > 14 | #define MOD 1000000007 15 | #define F first 16 | #define S second 17 | #define mp make_pair 18 | #define INPFILE freopen("input.in","r",stdin) 19 | using namespace std; 20 | 21 | int main() { 22 | ll t; get(t); 23 | while(t--) { 24 | ll n, k; 25 | get(n); get(k); 26 | 27 | ll clck[100005] = {0}; 28 | ll val[100005] = {0}; 29 | 30 | rep(n) get(clck[i]); 31 | rep(n) get(val[i]); 32 | 33 | ll ans = 0; 34 | 35 | rep(n) 36 | ans = max( ans, (k/clck[i])*val[i] ); 37 | 38 | printf("%lld\n", ans); 39 | } 40 | } 41 | -------------------------------------------------------------------------------- /CHEFZOT.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() { 5 | long int n; 6 | int arr[100005], temp[100005], max = 0; 7 | 8 | cin >> n; 9 | 10 | temp[0] = 0; 11 | for( int i = 1; i <= n; i++ ) { 12 | cin >> arr[i]; 13 | 14 | if( arr[i] != 0 ) 15 | temp[i] = temp[i-1]+1; 16 | else { 17 | temp[i] = 0; 18 | if( temp[i-1] > max ) 19 | max = temp[i-1]; 20 | } 21 | } 22 | 23 | if( max < temp[n] ) 24 | max = temp[n]; 25 | 26 | cout << max; 27 | } 28 | 29 | 30 | 31 | 32 | 33 | 34 | 35 | 36 | -------------------------------------------------------------------------------- /CM1404.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #define ll long 4 | #define get(a) scanf("%ld", &a) 5 | #define rep(n) for( ll i = 0; i < n; i++ ) 6 | #define repVector(v) for(vector::iterator it = v.begin(); it != v.end(); it++ ) 7 | #define repSet(s) for( set::iterator it = s.begin(); it != s.end(); it++ ) 8 | #define all(c) c.begin(), c.end() 9 | #define repu(a,n) for( ll i = a; i <= n; i++ ) 10 | #define pb push_back 11 | #define min(a,b) ( (a < b) ? a : b ) 12 | #define max(a,b) ( (a > b) ? a : b ) 13 | #define absol(a) a >= 0 ? a : -a 14 | #define FOR(i,a,b) for( ll i = a; i < b; i++ ) 15 | #define matrix vector< vector > 16 | #define MOD 1000000007 17 | #define L 2*r 18 | #define R 2*r+1 19 | using namespace std; 20 | 21 | int main() { 22 | ll t; 23 | get(t); 24 | 25 | while(t--) { 26 | ll n; get(n); 27 | 28 | double ans = sqrt(8*n-7) - 1; 29 | ans /= 2; 30 | cout << round( ans + 0.45 ) << endl; 31 | 32 | } 33 | } 34 | -------------------------------------------------------------------------------- /CNOTE.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long 3 | #define get(a) scanf("%ld", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( typeof(v.begin()) it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( typeof(s.begin()) it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 10 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 11 | #define matrix vector< vector > 12 | #define F first 13 | #define S second 14 | #define mp make_pair 15 | #define L 2*r 16 | #define R 2*r+1 17 | #define INPFILE freopen("input.in","r",stdin) 18 | using namespace std; 19 | 20 | int main() { 21 | ll t; get(t); 22 | while(t--) { 23 | ll x, y, k, n; 24 | get(x); get(y); get(k); get(n); 25 | bool flag = 0; 26 | 27 | FOR(i,1,n) { 28 | ll p, c; 29 | get(p); get(c); 30 | 31 | if( p >= x-y && c <= k ) 32 | { flag = 1; } 33 | } 34 | 35 | if(flag) 36 | printf("LuckyChef\n"); 37 | else 38 | printf("UnluckyChef\n"); 39 | } 40 | } 41 | -------------------------------------------------------------------------------- /COINS.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #define ll long unsigned 4 | using namespace std; 5 | 6 | long unsigned int v[1000000] = {0}; 7 | 8 | 9 | 10 | ll int rec( ll int n ) { 11 | if( n == 0 ) 12 | return 0; 13 | 14 | if( n < 1000000 && ::v[n] != 0 ) 15 | return ::v[n]; 16 | 17 | ll a = n/2; ll b = n/3; ll c = n/4; 18 | a = rec(a) > a ? rec(a) : a; 19 | b = rec(b) > b ? rec(b) : b; 20 | c = rec(c) > c ? rec(c) : c; 21 | 22 | ll m = ( a+b+c ) > n ? ( a+b+c ): n; 23 | //m = m > n ? m : n; 24 | 25 | if( n < 1000000 ) 26 | ::v[n] = m; 27 | return m; 28 | 29 | } 30 | 31 | 32 | 33 | int main() { 34 | int t = 10; 35 | 36 | while(t--) { 37 | ll n; 38 | cin >> n; 39 | cout << rec(n) << endl; 40 | } 41 | } 42 | -------------------------------------------------------------------------------- /COMPILER.c: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() { 5 | int t; 6 | 7 | while(t--) { 8 | char a[1000005]; 9 | cin.getline( a, 1000005 ); 10 | 11 | long long int count = 0, open = 0; 12 | 13 | for( int i = 0; a[i] != '\0'; i++ ) { 14 | if( a[i] == '<' ) 15 | open++; 16 | if( a[i] == '>' ) 17 | open--; 18 | 19 | if( open < 0 ) 20 | break; 21 | if( open == 0 ) 22 | count++; 23 | } 24 | std::cout << count << endl; 25 | } 26 | } 27 | 28 | 29 | 30 | 31 | 32 | 33 | -------------------------------------------------------------------------------- /COMPILER.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() { 5 | int t; 6 | cin >> t; 7 | cin.ignore(); 8 | while(t--) { 9 | char a[1000005]; 10 | cin.getline( a, 1000005 ); 11 | 12 | long long int count = 0, open = 0; 13 | 14 | for( int i = 0; a[i] != '\0'; i++ ) { 15 | if( a[i] == '<' ) 16 | open++; 17 | if( a[i] == '>' ) 18 | open--; 19 | 20 | if( open < 0 ) 21 | break; 22 | if( open == 0 ) 23 | count = i+1; 24 | } 25 | cout << count << endl; 26 | } 27 | } 28 | 29 | 30 | 31 | 32 | 33 | 34 | -------------------------------------------------------------------------------- /COPS.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%lld", &a); 4 | #define repVector(v) for( auto it = v.begin(); it != v.end(); it++ ) 5 | #define all(c) c.begin(), c.end() 6 | #define pb push_back 7 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 8 | #define ROF(i,a,b) for( ll i = a; i >= b; i-- ) 9 | #define debug(x) cout << "[DEBUG] " << #x << " = " << x << endl 10 | #define matrix vector< vector > 11 | #define F first 12 | #define S second 13 | #define mp make_pair 14 | #define L 2*r 15 | #define R 2*r+1 16 | #define INPFILE freopen("input.in","r",stdin) 17 | #define BOOST ios_base::sync_with_stdio(false); cin.tie(NULL); 18 | using namespace std; 19 | 20 | int main() { 21 | ll t; cin >> t; 22 | while(t--) { 23 | ll m, x, y; 24 | cin >> m >> x >> y; 25 | vector v; 26 | bool explore[105] = {0}; 27 | FOR(i,1,m) { 28 | ll p; cin >> p; 29 | ll start = max(1ll,p-x*y); ll end = min(100ll,p+x*y); 30 | FOR(k,start,end ) 31 | explore[k] = 1; 32 | } 33 | 34 | ll ptr = 0; 35 | FOR(i,1,100) 36 | if( !explore[i] ) 37 | { ptr++; } 38 | 39 | cout << ptr << "\n"; 40 | 41 | 42 | } 43 | } 44 | -------------------------------------------------------------------------------- /CPRMT.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #define ll int 4 | #define rep(n) for( ll i = 0; i < n; i++ ) 5 | #define repu(a,n) for( ll i = a; i < n; i++ ) 6 | #define min(a,b) a > b ? b : a 7 | using namespace std; 8 | 9 | int main() { 10 | char a[2000], b[2000]; 11 | while( scanf("%s%s",&a, &b) != -1 ) { 12 | int x1[300] = {0}, x2[300] = {0}, x[300] = {0}; 13 | 14 | rep( strlen(a) ) 15 | x1[a[i]]++; 16 | rep( strlen(b) ) 17 | x2[b[i]]++; 18 | 19 | repu( 97, 123 ) { 20 | x[i] = min( x1[i], x2[i] ); 21 | while( x[i]-- ) 22 | printf("%c", char(i) ); 23 | } 24 | 25 | printf("\n"); 26 | 27 | 28 | } 29 | } 30 | -------------------------------------------------------------------------------- /CRAWA.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | long long int absol( long long int x ) { 6 | if( x < 0 ) 7 | return -x; 8 | else 9 | return x; 10 | } 11 | 12 | int main() { 13 | long int t; 14 | scanf("%ld", &t); 15 | while(t--) { 16 | long long int x, y, temp; 17 | scanf("%lld %lld", &x, &y); 18 | 19 | int flag = 0; 20 | 21 | if( x < 0 ) { 22 | if( absol(x)%2 == 0 && y >= x && y <= -x ) 23 | flag = 1; 24 | } 25 | else if( x > 0 ) { 26 | if( x%2 != 0 && y >= -x+1 && y <= x+1 ) 27 | flag = 1; 28 | } 29 | 30 | if( y > 0 && y%2 == 0 && absol(x) < absol(y) ) 31 | flag = 1; 32 | 33 | if( y < 0 && absol(y)%2 == 0 && absol(x) <= absol(y) ) 34 | flag = 1; 35 | 36 | if( y == 0 && x == 0 ) 37 | flag = 1; 38 | 39 | if( flag == 1 ) 40 | printf("YES\n"); 41 | else 42 | printf("NO\n"); 43 | 44 | } 45 | } 46 | -------------------------------------------------------------------------------- /CRDS.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | #include 8 | #include 9 | #define ll long long 10 | #define get(a) scanf("%lld", &a) 11 | #define rep(n) for( ll i = 0; i < n; i++ ) 12 | #define repVector(v) for(vector::iterator it = v.begin(); it != v.end(); it++ ) 13 | #define all(c) c.begin(), c.end() 14 | #define repu(a,n) for( ll i = a; i < n; i++ ) 15 | #define pb push_back 16 | #define MOD 1000007 17 | using namespace std; 18 | 19 | int main() { 20 | ll t; 21 | get(t); 22 | 23 | while(t--) { 24 | ll n; 25 | get(n); 26 | 27 | ll ans = 0; 28 | ans += n*(n+1); 29 | ans %= MOD; 30 | ans += ( ( n*(n-1) )/2 )%MOD; 31 | ans %= MOD; 32 | 33 | printf("%lld\n", ans); 34 | } 35 | } 36 | 37 | -------------------------------------------------------------------------------- /CSUB.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main() { 6 | long long int t; 7 | scanf("%lld", &t); 8 | 9 | while(t--) { 10 | char str[100005]; long long int n, count = 0, ans; 11 | cin >> n; 12 | cin.ignore(); 13 | cin.getline( str, 100005 ); 14 | 15 | for( long int i = 0; i < n; i++ ) 16 | if( str[i] == '1' ) 17 | count++; 18 | 19 | ans = ( count*( count +1) )/2; 20 | cout << ans << endl; 21 | } 22 | } 23 | 24 | 25 | 26 | -------------------------------------------------------------------------------- /DANGER.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main() { 6 | while(1) { 7 | char str[10]; 8 | scanf("%s", str); 9 | 10 | if( str[0] == '0' && str[1] == '0' && str[3] == '0' ) 11 | break; 12 | 13 | long long int num; 14 | num = str[0] - '0'; 15 | num *= 10; 16 | num += str[1] - '0'; 17 | num *= pow(10, str[3]-'0'); 18 | 19 | int val = log2(num); 20 | long long ans = num - pow(2,val); 21 | 22 | ans = 2*ans + 1; 23 | 24 | printf("%lld\n", ans); 25 | 26 | } 27 | } 28 | -------------------------------------------------------------------------------- /DCEPC504.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #define ll long long 4 | #define get(a) scanf("%lld", &a); 5 | #define rep(n) for( ll i = 0; i < n; i++ ) 6 | #define repVector(v) for(vector< pair >::iterator it = v.begin(); it != v.end(); it++ ) 7 | #define repSet(s) for( set::iterator it = s.begin(); it != s.end(); it++ ) 8 | #define all(c) c.begin(), c.end() 9 | #define repu(a,n) for( ll i = a; i <= n; i++ ) 10 | #define pb push_back 11 | #define min(a,b) ( (a < b) ? a : b ) 12 | #define max(a,b) ( (a > b) ? a : b ) 13 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 14 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 15 | #define matrix vector< vector > 16 | #define MOD 1000000007 17 | #define F first 18 | #define S second 19 | #define L 2*r 20 | #define R 2*r+1 21 | #define mp make_pair 22 | using namespace std; 23 | 24 | 25 | int main() { 26 | 27 | ll t; get(t); 28 | while(t--) { 29 | ll n, k; 30 | get(n); get(k); 31 | 32 | if( k%6 == 2 || k%6 == 3 || k%7 == 5 ) 33 | printf("Female\n"); 34 | else 35 | printf("Male\n"); 36 | } 37 | 38 | } 39 | 40 | -------------------------------------------------------------------------------- /DOTAA.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | #include 8 | #include 9 | #define ll long 10 | #define get(a) scanf("%ld", &a) 11 | #define rep(n) for( ll i = 0; i < n; i++ ) 12 | #define repVector(v) for(vector::iterator it = v.begin(); it != v.end(); it++ ) 13 | #define all(c) c.begin(), c.end() 14 | #define repu(a,n) for( ll i = a; i < n; i++ ) 15 | #define pb push_back 16 | using namespace std; 17 | 18 | int main() { 19 | long t; 20 | get(t); 21 | 22 | while(t--) { 23 | long n, m, d; 24 | vector v; 25 | long dd = 0; 26 | get(n); get(m); get(d); 27 | 28 | rep(n) { 29 | ll x; 30 | get(x); 31 | v.pb(x); 32 | 33 | dd += x/d; 34 | 35 | if( x%d == 0 ) 36 | dd -= 1; 37 | } 38 | 39 | if( dd >= m ) 40 | printf("YES\n"); 41 | else 42 | printf("NO\n"); 43 | 44 | } 45 | } 46 | -------------------------------------------------------------------------------- /EBOXES.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #define ll long long 4 | #define get(a) scanf("%lld", &a) 5 | #define rep(n) for( ll i = 1; i <= n; i++ ) 6 | #define repVector(v) for(vector::iterator it = v.begin(); it != v.end(); it++ ) 7 | #define repSet(s) for( set::iterator it = s.begin(); it != s.end(); it++ ) 8 | #define all(c) c.begin(), c.end() 9 | #define repu(a,n) for( ll i = a; i <= n; i++ ) 10 | #define pb push_back 11 | #define min(a,b) ( (a < b) ? a : b ) 12 | #define max(a,b) ( (a > b) ? a : b ) 13 | #define absol(a) a >= 0 ? a : -a 14 | #define FOR(i,a,b) for( ll i = a; i < b; i++ ) 15 | #define matrix vector< vector > 16 | #define MOD 1000000007 17 | #define L 2*r 18 | #define R 2*r+1 19 | using namespace std; 20 | 21 | int main() { 22 | ll t; 23 | get(t); 24 | 25 | while(t--) { 26 | ll n, k, t, f; 27 | get(n); get(k); get(t); get(f); 28 | 29 | ll x = f - n; 30 | x /= k - 1; 31 | ll ans = n + x*k; 32 | 33 | printf("%lld\n", ans); 34 | } 35 | } 36 | -------------------------------------------------------------------------------- /EGBOBRD.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%lld", &a); 4 | #define repVector(v) for( auto it = v.begin(); it != v.end(); it++ ) 5 | #define all(c) c.begin(), c.end() 6 | #define pb push_back 7 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 8 | #define ROF(i,a,b) for( ll i = a; i >= b; i-- ) 9 | #define debug(x) cout << "[DEBUG] " << #x << " = " << x << endl 10 | #define matrix vector< vector > 11 | #define F first 12 | #define S second 13 | #define mp make_pair 14 | #define L 2*r 15 | #define R 2*r+1 16 | #define INPFILE freopen("input.in","r",stdin) 17 | #define BOOST ios_base::sync_with_stdio(false); cin.tie(NULL); 18 | using namespace std; 19 | 20 | int main() { 21 | ll t; get(t); 22 | while(t--) { 23 | ll n, k; 24 | get(n); get(k); 25 | ll left = k+1, count = 1; 26 | 27 | FOR(i,1,n) { 28 | left--; 29 | if( left <= 0 ) 30 | { left = k; count++; } 31 | ll x; get(x); 32 | 33 | if( x > left ) { 34 | ll q = x - left; 35 | count += ceil(1.0*q/k); 36 | left += ceil(1.0*q/k)*k - x; 37 | } 38 | else 39 | left -= x; 40 | } 41 | printf("%lld\n", count); 42 | } 43 | } 44 | -------------------------------------------------------------------------------- /EIGHTS.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() { 5 | for( long long int i = 192; i <= 3000; i++ ) 6 | if( (i*i*i)%1000 == 888 ) 7 | cout << i << endl; 8 | 9 | int m; 10 | cin >> m; 11 | } 12 | 13 | -------------------------------------------------------------------------------- /ELIS.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long 3 | #define get(a) scanf("%ld", &a); 4 | #define rep(n) for( ll i = 0; i < n; i++ ) 5 | #define repVector(v) for( typeof(v.begin()) it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( set::iterator it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define max(a,b) ( (a > b) ? a : b ) 10 | #define min(a,b) ( (a < b) ? a : b ) 11 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 12 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 13 | #define matrix vector< vector > 14 | #define MOD 1000000007 15 | #define F first 16 | #define S second 17 | #define mp make_pair 18 | #define INPFILE freopen("input.in","r",stdin) 19 | using namespace std; 20 | 21 | vector v; 22 | 23 | ll LIS() { 24 | vector dp(v.size()+1,1); 25 | 26 | FOR(i,0,v.size()-1) 27 | for( ll j = i-1; j >= 0; j-- ) 28 | if( v[i] > v[j] ) 29 | dp[i] = max( dp[i], dp[j]+1 ); 30 | 31 | return *max_element( all(dp) ); 32 | } 33 | 34 | int main() { 35 | ll n; get(n); 36 | rep(n) 37 | { ll x; get(x); v.pb(x); } 38 | 39 | printf("%ld\n", LIS()); 40 | } 41 | -------------------------------------------------------------------------------- /ENIGMATH.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #define ll long 4 | #define get(a) scanf("%ld", &a) 5 | #define rep(n) for( ll i = 1; i <= n; i++ ) 6 | #define repVector(v) for(vector< pair >::iterator it = v.begin(); it != v.end(); it++ ) 7 | #define repSet(s) for( set< pair< ll, pair > >::iterator it = s.begin(); it != s.end(); it++ ) 8 | #define all(c) c.begin(), c.end() 9 | #define repu(a,n) for( ll i = a; i <= n; i++ ) 10 | #define pb push_back 11 | #define min(a,b) ( (a < b) ? a : b ) 12 | #define max(a,b) ( (a > b) ? a : b ) 13 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 14 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 15 | #define matrix vector< vector > 16 | #define MOD 10000007 17 | #define F first 18 | #define S second 19 | #define L 2*r 20 | #define R 2*r+1 21 | #define mp make_pair 22 | using namespace std; 23 | 24 | ll gcd( ll a, ll b ) { return ( ( b == 0 ) ? a : gcd( b, a%b ) ); } 25 | 26 | int main() { 27 | ll t; 28 | get(t); 29 | 30 | while(t--) { 31 | ll a, b; 32 | get(a); get(b); 33 | ll g = gcd(a,b); 34 | 35 | printf("%ld %ld\n", b/g, a/g); 36 | } 37 | } 38 | -------------------------------------------------------------------------------- /ETF.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #define ll long 6 | #define get(a) scanf("%ld", &a); 7 | 8 | 9 | bool arr[1000000+5]; 10 | ll a[1000000+5] = {0}; 11 | int main() { 12 | for( ll i = 2; i <= 1000000; i++ ) { 13 | if( ::arr[i] == 0 ) { 14 | for( ll j = 1; j*i <= 1000000; j++ ) { 15 | ::arr[i*j] = 1; 16 | if( a[i*j] == 0 ) 17 | a[i*j] = i*j; 18 | a[i*j] = ( a[i*j] - a[i*j]/i ); 19 | } 20 | } 21 | } 22 | 23 | a[0] = 0; 24 | a[1] = 1; 25 | 26 | ll t; 27 | get(t); 28 | 29 | while(t--) { 30 | ll n; 31 | get(n); 32 | 33 | //std::cout << a[n] << "\n"; 34 | printf("%ld\n", a[n]); 35 | } 36 | } 37 | 38 | 39 | 40 | 41 | 42 | -------------------------------------------------------------------------------- /FACEFRND.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | #include 8 | #include 9 | #define ll long 10 | #define get(a) scanf("%ld", &a) 11 | #define rep(n) for( ll i = 0; i < n; i++ ) 12 | #define repVector(v) for(vector::iterator it = v.begin(); it != v.end(); it++ ) 13 | #define all(c) c.begin(), c.end() 14 | #define repu(a,n) for( ll i = a; i < n; i++ ) 15 | #define pb push_back 16 | #define max(a,b) a > b ? a : b 17 | using namespace std; 18 | 19 | int main() { 20 | ll n; 21 | set v; 22 | vector f; 23 | get(n); 24 | 25 | while(n--) { 26 | ll m, ff; 27 | get(ff); get(m); 28 | f.pb(ff); 29 | 30 | while(m--) { 31 | ll x; get(x); 32 | v.insert(x); 33 | } 34 | 35 | } 36 | 37 | repVector(f) 38 | v.erase(*it); 39 | cout << v.size(); 40 | } 41 | -------------------------------------------------------------------------------- /FACTORIZ.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | #include 8 | #include 9 | #include 10 | #include 11 | #define ll long long 12 | #define get(a) scanf("%lld", &a) 13 | #define rep(n) for( ll i = 0; i < n; i++ ) 14 | #define repVector(v) for(vector::iterator it = v.begin(); it != v.end(); it++ ) 15 | #define all(c) c.begin(), c.end() 16 | #define repu(a,n) for( ll i = a; i < n; i++ ) 17 | #define max(a,b) a > b ? a : b 18 | #define pb push_back 19 | #define MOD 1000000007 20 | using namespace std; 21 | 22 | int main() { 23 | ll t; 24 | get(t); 25 | 26 | while(t--) { 27 | char str[10000]; 28 | scanf("%s", &str); 29 | printf("1\n%s\n", str); 30 | } 31 | } 32 | -------------------------------------------------------------------------------- /FIBO.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define MOD 1000000007 3 | using namespace std; 4 | 5 | long int fib[10000] = {0}; 6 | 7 | long fibo( long int n ) { 8 | if( fib[n] != 0 ) 9 | return fib[n]; 10 | 11 | if( n <= 2 ) 12 | return 1; 13 | else { 14 | long long val = ( fibo(n-1)%MOD + fibo(n-2)%MOD )%MOD; 15 | fib[n] = val; 16 | return val; 17 | } 18 | 19 | } 20 | 21 | int main() { 22 | fib[1] = 1; fib[2] = 1; 23 | fibo(1000); 24 | 25 | int t; 26 | cin >> t; 27 | while(t--) { 28 | long long sum = 0; 29 | int x, y; 30 | cin >> x >> y; 31 | 32 | for( int i = x; i <= y; i++ ) 33 | { sum += fibo(i); sum %= MOD; } 34 | cout << sum << endl; 35 | 36 | } 37 | 38 | } 39 | 40 | -------------------------------------------------------------------------------- /FTRIP.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() { 5 | long int t; 6 | cin >> t; 7 | 8 | while(t--) { 9 | float s, n, m, k; 10 | cin >> s >> n >> m >> k; 11 | float prob = 1; 12 | 13 | for( float i = 1; i <= k; i++ ) 14 | prob *= float( (n-i)/(s-i) ); 15 | 16 | float sum = 1; 17 | 18 | if( prob != 1 ) 19 | for( float i = k+1; i <= m-1; i++ ) 20 | sum += (n-i)/(s-i); 21 | 22 | // cout << "Prob: " << prob << " Sum: " << sum << endl; 23 | cout << float(prob*sum) << endl; 24 | } 25 | } 26 | -------------------------------------------------------------------------------- /GAMe2048.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() { 5 | long int t; 6 | 7 | cin >> t; 8 | 9 | while(t--) { 10 | long long int n; 11 | cin >> n; 12 | cout << n-1 << endl; 13 | } 14 | } 15 | -------------------------------------------------------------------------------- /GCD2.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #define ll long 4 | #define get(a) scanf("%ld", &a) 5 | using namespace std; 6 | 7 | ll gcd( ll a, ll b ) { 8 | if( b == 0 ) 9 | return a; 10 | else 11 | return gcd( b, a%b ); 12 | } 13 | 14 | int main() { 15 | ll t; 16 | get(t); 17 | 18 | while(t--) { 19 | ll a; char b[300]; ll rem = 0; 20 | get(a); scanf("%s", &b); 21 | 22 | if( a == 0 ) 23 | { printf("%s\n",b); continue; } 24 | 25 | for( ll i = 0; i < strlen(b); i++ ) 26 | rem = ( rem*10 + b[i] - '0' )%a; 27 | 28 | 29 | printf("%ld\n", gcd( a, rem ) ); 30 | 31 | } 32 | } 33 | -------------------------------------------------------------------------------- /GLJIVE.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | #include 8 | #include 9 | #define ll int 10 | #define get(a) scanf("%d", &a) 11 | #define rep(n) for( ll i = 0; i < n; i++ ) 12 | #define repVector(v) for(vector::iterator it = v.begin(); it != v.end(); it++ ) 13 | #define all(c) c.begin(), c.end() 14 | #define repu(a,n) for( ll i = a; i < n; i++ ) 15 | #define pb push_back 16 | #define min(a,b) a < b ? a : b 17 | #define absol(a) a >= 0 ? a : -a 18 | #define FOR(i,a,b) for( ll i = a; i < b; i++ ) 19 | using namespace std; 20 | 21 | int main() { 22 | ll n = 10; 23 | vector v; 24 | 25 | while(n--) { 26 | ll x; get(x); 27 | v.pb(x); 28 | } 29 | ll diff = INT_MAX, sum = 0; 30 | 31 | FOR(i,0,v.size()) { 32 | if( abs( 100 - ( sum + v[i] ) ) <= diff ){ 33 | sum += v[i]; 34 | diff = abs( 100 - ( sum ) ); 35 | } 36 | else 37 | break; 38 | } 39 | 40 | cout << sum; 41 | } 42 | -------------------------------------------------------------------------------- /GUESS.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() { 5 | long unsigned int t; 6 | cin >> t; 7 | 8 | while(t--) { 9 | long long unsigned int n, m; 10 | cin >> n >> m; 11 | 12 | if( n%2 == 0 && m%2 == 0 ) 13 | cout << "1/2" << endl; 14 | else if( (n%2 != 0 && m%2 == 0) || (n%2 == 0 && m%2 != 0) ) 15 | cout << "1/2" << endl; 16 | else if( n%2 != 0 && m%2 != 0 ) 17 | cout << (n*m-1)/2 << "/" << n*m << endl; 18 | } 19 | } 20 | 21 | 22 | 23 | 24 | 25 | 26 | 27 | -------------------------------------------------------------------------------- /HACKRNDM.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #define ll long 4 | #define get(a) scanf("%ld", &a) 5 | #define rep(n) for( ll i = 0; i < n; i++ ) 6 | #define repVector(v) for(vector::iterator it = v.begin(); it != v.end(); it++ ) 7 | #define repSet(s) for( set::iterator it = s.begin(); it != s.end(); it++ ) 8 | #define all(c) c.begin(), c.end() 9 | #define repu(a,n) for( ll i = a; i <= n; i++ ) 10 | #define pb push_back 11 | #define min(a,b) ( (a < b) ? a : b ) 12 | #define max(a,b) ( (a > b) ? a : b ) 13 | #define absol(a) a >= 0 ? a : -a 14 | #define FOR(i,a,b) for( ll i = a; i < b; i++ ) 15 | #define matrix vector< vector > 16 | #define MOD 1000000007 17 | #define L 2*r 18 | #define R 2*r+1 19 | using namespace std; 20 | 21 | int main() { 22 | ll n, k; 23 | get(n); get(k); 24 | map m; 25 | ll ans = 0; 26 | 27 | rep(n) 28 | { ll x; get(x); m[x]++; } 29 | 30 | for( map::iterator it = m.begin(); it != m.end(); it++ ) { 31 | ll f = k + it->first; 32 | 33 | map::iterator nit = m.find(f); 34 | 35 | if( nit != m.end() ) 36 | ans += (it->second) * (nit->second); 37 | } 38 | 39 | printf("%ld", ans); 40 | 41 | } 42 | -------------------------------------------------------------------------------- /HANGOVER.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() { 5 | double inp = 1.00; 6 | 7 | while( inp > 0.00 ) { 8 | cin >> inp; 9 | 10 | if( inp == 0.00 ) 11 | break; 12 | 13 | double sum = 0; 14 | long int n = 1; 15 | 16 | while( inp - sum > 0 ) { 17 | n++; 18 | sum += double(1)/n; 19 | } 20 | 21 | cout << n-1 << " card(s)" << endl; 22 | } 23 | } 24 | -------------------------------------------------------------------------------- /HC.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #define ll long long 4 | #define get(a) scanf("%lld", &a); 5 | #define rep(n) for( ll i = 0; i < n; i++ ) 6 | #define repVector(v) for(vector::iterator it = v.begin(); it != v.end(); it++ ) 7 | #define repSet(s) for( set::iterator it = s.begin(); it != s.end(); it++ ) 8 | #define all(c) c.begin(), c.end() 9 | #define repu(a,n) for( ll i = a; i <= n; i++ ) 10 | #define pb push_back 11 | #define min(a,b) ( (a < b) ? a : b ) 12 | #define max(a,b) ( (a > b) ? a : b ) 13 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 14 | #define FOR(i,a,b) for( ll i = a; i < b; i++ ) 15 | #define matrix vector< vector > 16 | #define MOD 1000000007 17 | #define F first 18 | #define S second 19 | #define L 2*r 20 | #define R 2*r+1 21 | #define mp make_pair 22 | using namespace std; 23 | 24 | int main() { 25 | ll t; get(t); 26 | while(t--) { 27 | ll n; get(n); 28 | ll lxh = 0; 29 | 30 | rep(n) { 31 | string a; cin >> a; 32 | if( a == "lxh" ) 33 | lxh++; 34 | } 35 | 36 | if( lxh%2 ) 37 | printf("lxh\n"); 38 | else 39 | printf("hhb\n"); 40 | } 41 | } 42 | -------------------------------------------------------------------------------- /HEMEC2.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%ld", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( typeof(v.begin()) it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( typeof(s.begin()) it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 10 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 11 | #define ROF(i,a,b) for( ll i = a; i >= b; i-- ) 12 | #define debug(x) cout << "[DEBUG] " << #x << " = " << x << endl 13 | #define matrix vector< vector > 14 | #define F first 15 | #define S second 16 | #define mp make_pair 17 | #define L 2*r 18 | #define R 2*r+1 19 | #define INPFILE freopen("input.in","r",stdin) 20 | using namespace std; 21 | 22 | int main() { 23 | ll n; cin >> n; 24 | vector v; 25 | FOR(i,1,n) 26 | { ll x; cin >> x; v.pb(x); } 27 | sort( all(v) ); 28 | 29 | cout << max( v[0]*v[1], v[v.size()-1]*v[v.size()-2] ); 30 | 31 | } 32 | -------------------------------------------------------------------------------- /HEMEC3.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%ld", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( typeof(v.begin()) it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( typeof(s.begin()) it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 10 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 11 | #define ROF(i,a,b) for( ll i = a; i >= b; i-- ) 12 | #define debug(x) cout << "[DEBUG] " << #x << " = " << x << endl 13 | #define matrix vector< vector > 14 | #define F first 15 | #define S second 16 | #define mp make_pair 17 | #define L 2*r 18 | #define R 2*r+1 19 | #define INPFILE freopen("input.in","r",stdin) 20 | using namespace std; 21 | 22 | int main() { 23 | ll t; cin >> t; 24 | while(t--) { 25 | ll n, m; 26 | cin >> n >> m; 27 | ll ans = 0; 28 | 29 | while(n) { 30 | ll x = log(n)/log(m); 31 | ll p = pow(m,x); 32 | ans += n/p; 33 | n -= (n/p)*p; 34 | } 35 | 36 | cout << ans << "\n"; 37 | } 38 | } 39 | 40 | -------------------------------------------------------------------------------- /HOTELS.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%lld", &a) 4 | #define rep(n) for( ll i = 0; i < n; i++ ) 5 | #define repVector(v) for(vector::iterator it = v.begin(); it != v.end(); it++ ) 6 | #define all(c) c.begin(), c.end() 7 | #define repu(a,n) for( ll i = a; i < n; i++ ) 8 | #define pb push_back 9 | #define min(a,b) a < b ? a : b 10 | #define absol(a) a >= 0 ? a : -a 11 | #define FOR(i,a,b) for( ll i = a; i < b; i++ ) 12 | #define matrix vector< vector > 13 | #define MOD 1000000007 14 | using namespace std; 15 | 16 | int main() { 17 | ll n, w; 18 | get(n); get(w); 19 | vector v; 20 | v.pb(0); 21 | 22 | rep(n) { 23 | ll x; get(x); 24 | v.pb(x); 25 | } 26 | 27 | ll maxsum = 0, now = 0; int start = 0; 28 | for( int end = 0; end < v.size(); end++ ) { 29 | if( v[end] > w ) 30 | { now = 0; start = end+1; continue; } 31 | 32 | now += v[end]; 33 | 34 | if( now == w ) 35 | { maxsum = now; break; } 36 | else if( now > w ) { 37 | while( now > w ) 38 | now -= v[start++]; 39 | } 40 | maxsum = now > maxsum ? now : maxsum; 41 | } 42 | 43 | printf("%lld", maxsum); 44 | } 45 | -------------------------------------------------------------------------------- /HPYBDAY.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() { 5 | long int arr[10] = { 0, 0, 6, 69, 405, 1725, 6027, 18312, 50016 }; 6 | 7 | int t; 8 | cin >> t; 9 | while(t--) { 10 | long int n; 11 | cin >> n; 12 | 13 | for( int i = 0; i <= 8; i++ ) { 14 | n = n - arr[i]; 15 | 16 | if( n <= 0 ) 17 | { cout << i << endl; break; } 18 | } 19 | } 20 | } 21 | 22 | 23 | 24 | 25 | -------------------------------------------------------------------------------- /HPYBDAY_gen.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | 5 | int sumnum( long long unsigned int a ) { 6 | int size = 0; 7 | long int sum = 0; 8 | 9 | while( a!= 0 ) { 10 | sum += a%10; 11 | a /= 10; 12 | size++; 13 | 14 | if( sum > 13 ) 15 | return -1; 16 | } 17 | 18 | if( sum == 13 ) 19 | return size; 20 | else 21 | return -1; 22 | } 23 | 24 | int main() { 25 | long long unsigned int con = 1111111111111ll, arr[50] = {0}; 26 | int temp = 0; 27 | 28 | for( long long unsigned int i = 1; i <= con ; i++ ) { 29 | int n = sumnum(i); 30 | if( n != -1 ) { 31 | arr[n]++; 32 | 33 | if( temp != n ) { 34 | cout << n-1 << " : " << arr[n-1] << endl; 35 | temp = n; 36 | } 37 | 38 | } 39 | 40 | } 41 | 42 | cin >> temp; 43 | } 44 | 45 | -------------------------------------------------------------------------------- /HPYNOS.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | #define ll long 8 | #define get(a) scanf("%ld", &a) 9 | #define rep(n) for( ll i = 0; i < n; i++ ) 10 | #define repVector(v) for(vector::iterator it = v.begin(); it != v.end(); it++ ) 11 | #define all(c) c.begin(), c.end() 12 | #define repu(a,n) for( ll i = a; i < n; i++ ) 13 | #define pb push_back 14 | using namespace std; 15 | 16 | ll func( ll n ) { 17 | ll sum = 0; 18 | while( n!= 0 ) 19 | { sum += (n%10)*(n%10); n /= 10; } 20 | return sum; 21 | } 22 | 23 | int main() { 24 | ll n; 25 | get(n); 26 | set v; 27 | ll count = 1; 28 | ll sum = func(n); 29 | bool flag = true; 30 | 31 | while( sum != 1 ) { 32 | count++; 33 | sum = func(sum); 34 | if( v.count(sum) != 0 ) 35 | { flag = 0; break; } 36 | v.insert(sum); 37 | } 38 | 39 | if(flag) 40 | printf("%ld", count); 41 | else 42 | printf("-1"); 43 | 44 | 45 | 46 | } 47 | -------------------------------------------------------------------------------- /HREC01.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%ld", &a); 4 | #define repVector(v) for( auto it = v.begin(); it != v.end(); it++ ) 5 | #define all(c) c.begin(), c.end() 6 | #define pb push_back 7 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 8 | #define ROF(i,a,b) for( ll i = a; i >= b; i-- ) 9 | #define debug(x) cout << "[DEBUG] " << #x << " = " << x << endl 10 | #define matrix vector< vector > 11 | #define F first 12 | #define S second 13 | #define mp make_pair 14 | #define L 2*r 15 | #define R 2*r+1 16 | #define INPFILE freopen("input.in","r",stdin) 17 | #define BOOST ios_base::sync_with_stdio(false); cin.tie(NULL); 18 | using namespace std; 19 | 20 | int main() { 21 | ll n, p, x; 22 | cin >> n >> p >> x; 23 | vector< pair > v; 24 | FOR(i,1,n) { 25 | ll r; cin >> r; 26 | v.pb( mp(r*p,i) ); 27 | p -= x; 28 | } 29 | 30 | sort( all(v), greater< pair >() ); 31 | cout << v[0].S; 32 | } 33 | -------------------------------------------------------------------------------- /HREC04.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%ld", &a); 4 | #define repVector(v) for( auto it = v.begin(); it != v.end(); it++ ) 5 | #define all(c) c.begin(), c.end() 6 | #define pb push_back 7 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 8 | #define ROF(i,a,b) for( ll i = a; i >= b; i-- ) 9 | #define debug(x) cout << "[DEBUG] " << #x << " = " << x << endl 10 | #define matrix vector< vector > 11 | #define F first 12 | #define S second 13 | #define mp make_pair 14 | #define L 2*r 15 | #define R 2*r+1 16 | #define INPFILE freopen("input.in","r",stdin) 17 | #define BOOST ios_base::sync_with_stdio(false); cin.tie(NULL); 18 | using namespace std; 19 | 20 | vector v; 21 | 22 | int main() { 23 | // INPFILE; 24 | ll n; cin >> n; 25 | FOR(i,1,n) 26 | { ll x; cin >> x; v.pb(x); } 27 | 28 | ll maxsum = 0; 29 | 30 | FOR(i,0,n-1) { 31 | ll itr = i+1; 32 | ROF(k,n-1,max(i+1,n-10)) { 33 | ll sum = 0, ptr = i; 34 | ROF(j,k,i+1) { 35 | sum += v[ptr++]*v[j]; 36 | // debug(sum); 37 | if( sum <= 0 || ptr > j ) 38 | { sum = 0; ptr = i; } 39 | maxsum = max( maxsum, sum ); 40 | } 41 | } 42 | } 43 | 44 | cout << maxsum; 45 | 46 | } 47 | -------------------------------------------------------------------------------- /HREP02.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%ld", &a); 4 | #define repVector(v) for( auto it = v.begin(); it != v.end(); it++ ) 5 | #define all(c) c.begin(), c.end() 6 | #define pb push_back 7 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 8 | #define ROF(i,a,b) for( ll i = a; i >= b; i-- ) 9 | #define debug(x) cout << "[DEBUG] " << #x << " = " << x << endl 10 | #define matrix vector< vector > 11 | #define F first 12 | #define S second 13 | #define mp make_pair 14 | #define L 2*r 15 | #define R 2*r+1 16 | #define INPFILE freopen("input.in","r",stdin) 17 | #define BOOST ios_base::sync_with_stdio(false); cin.tie(NULL); 18 | using namespace std; 19 | 20 | int main() { 21 | ll n; cin >> n; 22 | string s; cin >> s; 23 | 24 | ll arr[200] = {0}, ans = n; 25 | FOR(i,0,n-1) 26 | arr[s[i]]++; 27 | FOR(i,'a','z') 28 | ans += arr[i]*(arr[i]-1)/2; 29 | cout << ans; 30 | } 31 | -------------------------------------------------------------------------------- /HRHS01.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%lld", &a); 4 | #define repVector(v) for( auto it = v.begin(); it != v.end(); it++ ) 5 | #define repSet(s) for( auto it = s.begin(); it != s.end(); it++ ) 6 | #define all(c) c.begin(), c.end() 7 | #define pb push_back 8 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 9 | #define ROF(i,a,b) for( ll i = a; i >= b; i-- ) 10 | #define debug(x) ;//cout << "[DEBUG] " << #x << " = " << x << endl 11 | #define matrix vector< vector > 12 | #define F first 13 | #define S second 14 | #define mp make_pair 15 | #define L 2*r 16 | #define R 2*r+1 17 | #define INPFILE freopen("input.in","r",stdin) 18 | #define BOOST ios_base::sync_with_stdio(false); cin.tie(NULL); 19 | using namespace std; 20 | 21 | int main() { 22 | ll n; cin >> n; 23 | vector v; 24 | 25 | FOR(i,1,n) 26 | { ll x; cin >> x; v.pb(x); } 27 | sort( all(v) ); 28 | 29 | ll q; cin >> q; 30 | while(q--) { 31 | ll p; cin >> p; 32 | ll x = upper_bound( all(v), p ) - v.begin(); 33 | cout << x << "\n"; 34 | } 35 | } 36 | -------------------------------------------------------------------------------- /IEEEBGAM.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() { 5 | int t; 6 | cin >> t; 7 | while(t--) { 8 | double n; 9 | cin >> n; 10 | 11 | double ans = double(n-1)/n + (1/n)*( 1/double(n+1) ); 12 | printf("%0.8lf\n", ans); 13 | } 14 | } 15 | 16 | -------------------------------------------------------------------------------- /IGNUS15B.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%lld", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( typeof(v.begin()) it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( typeof(s.begin()) it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define MEM(a,b) memset(a,(b),sizeof(a)) 9 | #define MAX(a,b) ((a) > (b) ? (a) : (b)) 10 | #define MIN(a,b) ((a) < (b) ? (a) : (b)) 11 | #define pb push_back 12 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 13 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 14 | #define matrix vector< vector > 15 | #define F first 16 | #define S second 17 | #define mp make_pair 18 | #define L 2*r 19 | #define R 2*r+1 20 | #define MOD 1000000007 21 | #define INPFILE freopen("input.in","r",stdin) 22 | using namespace std; 23 | #define LOG2(X) ((unsigned) (8*sizeof (unsigned long long) - __builtin_clzll((X)) - 1)) 24 | 25 | int main() { 26 | ll t; get(t); 27 | while(t--) { 28 | ll n; get(n); 29 | ll p = LOG2(n); 30 | 31 | cout << (long long)( n - pow(2,p) )*2 + 1 << endl; 32 | } 33 | } 34 | -------------------------------------------------------------------------------- /IITK2P01.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%lld", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( vector::iterator it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( set::iterator it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 10 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 11 | #define matrix vector< vector > 12 | #define MOD 1000000007 13 | #define F first 14 | #define S second 15 | #define mp make_pair 16 | #define L 2*r 17 | #define R 2*r+1 18 | #define INPFILE freopen("input.in","r",stdin) 19 | using namespace std; 20 | 21 | 22 | int main() { 23 | ll t; get(t); 24 | while(t--) { 25 | long long n; 26 | long k; 27 | get(n); scanf("%ld", &k); 28 | 29 | long ans = 0; 30 | 31 | if( k == 1 ) 32 | { printf("%lld\n", n ); continue; } 33 | 34 | while( n > 0 ) { 35 | ans += n%k; 36 | n /= k; 37 | } 38 | 39 | printf("%ld\n", ans); 40 | 41 | } 42 | } 43 | -------------------------------------------------------------------------------- /IITKWPCB.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #define ll long long 4 | #define get(a) scanf("%lld", &a); 5 | #define rep(n) for( ll i = 0; i < n; i++ ) 6 | #define repVector(v) for( typeof(v.begin()) it = v.begin(); it != v.end(); it++ ) 7 | #define repSTL(s) for( typeof(s.begin()) it = s.begin(); it != s.end(); it++ ) 8 | #define all(c) c.begin(), c.end() 9 | #define repu(a,n) for( ll i = a; i <= n; i++ ) 10 | #define pb push_back 11 | #define min(a,b) ( (a < b) ? a : b ) 12 | #define max(a,b) ( (a > b) ? a : b ) 13 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 14 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 15 | #define matrix vector< vector > 16 | #define MOD 1000000007 17 | #define F first 18 | #define S second 19 | #define L 2*r 20 | #define R 2*r+1 21 | #define mp make_pair 22 | using namespace std; 23 | 24 | ll gcd( ll a, ll b ) { return ( b == 0 ? a : gcd( b, a%b ) ); } 25 | 26 | int main() { 27 | ll t; get(t); 28 | while(t--) { 29 | ll n; get(n); 30 | for( ll i = n/2; ; i-- ) 31 | if( gcd(i,n) == 1 ) 32 | { printf("%lld\n", i); break; } 33 | } 34 | } 35 | -------------------------------------------------------------------------------- /IITKWPCN.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long 3 | #define get(a) scanf("%ld", &a); 4 | #define rep(n) for( ll i = 0; i < n; i++ ) 5 | #define repVector(v) for( typeof(v.begin()) it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( set::iterator it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define max(a,b) ( (a > b) ? a : b ) 10 | #define min(a,b) ( (a < b) ? a : b ) 11 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 12 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 13 | #define matrix vector< vector > 14 | #define MOD 1000000007 15 | #define F first 16 | #define S second 17 | #define mp make_pair 18 | #define INPFILE freopen("input.in","r",stdin) 19 | using namespace std; 20 | 21 | int main() { 22 | ll t; get(t); 23 | while(t--) { 24 | ll w, b; 25 | get(w); get(b); 26 | 27 | ll a = w + b/2; 28 | 29 | a = ( a > 0 ) ? 1 : 0; 30 | 31 | if( b%2 == 0 ) 32 | b = 0; 33 | else 34 | b = 1; 35 | 36 | double ans = 0; 37 | 38 | if( a == 1 && b == 1 ) 39 | ans = 1; 40 | 41 | printf("%0.6lf\n", ans); 42 | 43 | 44 | } 45 | } 46 | -------------------------------------------------------------------------------- /ITM003.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%lld", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( typeof(v.begin()) it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( typeof(s.begin()) it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 10 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 11 | #define ROF(i,a,b) for( ll i = a; i >= b; i-- ) 12 | #define debug(x) cout << "[DEBUG]" << #x << " " << x << endl 13 | #define matrix vector< vector > 14 | #define F first 15 | #define S second 16 | #define mp make_pair 17 | #define L 2*r 18 | #define R 2*r+1 19 | #define INPFILE freopen("input.in","r",stdin) 20 | using namespace std; 21 | 22 | map dp; 23 | 24 | ll rec( ll n ) { 25 | if( dp.find(n) != dp.end() ) 26 | return dp[n]; 27 | if( n%2 ) 28 | return dp[n] = 1 + rec(n-1); 29 | else 30 | return dp[n] = rec(n/2); 31 | } 32 | 33 | int main() { 34 | 35 | dp[1] = 1; dp[2] = 1; 36 | 37 | ll t; get(t); 38 | while(t--) { 39 | ll n; get(n); 40 | cout << rec(n) << endl; 41 | 42 | } 43 | } 44 | -------------------------------------------------------------------------------- /IWGBS.py: -------------------------------------------------------------------------------- 1 | import sys 2 | for n in sys.stdin.readlines(): 3 | n = int(n) 4 | DP = [[0 for x in range(2)] for x in range(n+1)] 5 | DP[n][0] = 1 6 | DP[n][1] = 1 7 | for i in range(n-1,0,-1): 8 | DP[i][0] = DP[i+1][1] 9 | DP[i][1] = DP[i+1][0] + DP[i+1][1] 10 | print (DP[1][1] + DP[1][0]) 11 | -------------------------------------------------------------------------------- /IWIN.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long 3 | #define get(a) scanf("%ld", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( vector::iterator it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( typeof(s.begin()) it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 10 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 11 | #define matrix vector< vector > 12 | #define F first 13 | #define S second 14 | #define mp make_pair 15 | #define foo(a,b,c) mp( mp(a,b), c ) 16 | #define L 2*r 17 | #define R 2*r+1 18 | #define INPFILE freopen("input.in","r",stdin) 19 | using namespace std; 20 | 21 | int main() { 22 | // INPFILE; 23 | 24 | ll t; get(t); 25 | while(t--) { 26 | ll val = 0; 27 | FOR(i,1,15) 28 | { ll x; get(x); val ^= x; } 29 | ll m; get(m); 30 | 31 | ll c = 0; 32 | 33 | while( val != 0 ) { 34 | if( (val&1) ) 35 | c++; 36 | val = val>>1; 37 | } 38 | 39 | // cout << c << endl; 40 | 41 | if( c > m ) 42 | printf("YES\n"); 43 | else 44 | printf("NO\n"); 45 | } 46 | } 47 | -------------------------------------------------------------------------------- /JNEXT.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #define ll int 4 | #define get(a) scanf("%d", &a); 5 | #define rep(n) for( ll i = 0; i < n; i++ ) 6 | #define repVector(v) for( typeof(v.begin()) it = v.begin(); it != v.end(); it++ ) 7 | #define repSTL(s) for( typeof(s.begin()) it = s.begin(); it != s.end(); it++ ) 8 | #define all(c) c.begin(), c.end() 9 | #define repu(a,n) for( ll i = a; i <= n; i++ ) 10 | #define pb push_back 11 | #define min(a,b) ( (a < b) ? a : b ) 12 | #define max(a,b) ( (a > b) ? a : b ) 13 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 14 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 15 | #define matrix vector< vector > 16 | #define MOD 1000000007 17 | #define F first 18 | #define S second 19 | #define L 2*r 20 | #define R 2*r+1 21 | #define mp make_pair 22 | using namespace std; 23 | 24 | int main() { 25 | ll t; get(t); 26 | while(t--) { 27 | ll n; get(n); 28 | vector v(n); 29 | 30 | rep(n) get(v[i]); 31 | bool chk = next_permutation( all(v) ); 32 | 33 | if( !chk ) 34 | { printf("-1\n"); continue; } 35 | 36 | FOR(i,0,n-1) 37 | printf("%d", v[i]); 38 | printf("\n"); 39 | } 40 | } 41 | -------------------------------------------------------------------------------- /JNTUV1.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%lld", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( typeof(v.begin()) it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( typeof(s.begin()) it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define MEM(a,b) memset(a,(b),sizeof(a)) 9 | #define MAX(a,b) ((a) > (b) ? (a) : (b)) 10 | #define MIN(a,b) ((a) < (b) ? (a) : (b)) 11 | #define pb push_back 12 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 13 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 14 | #define matrix vector< vector > 15 | #define F first 16 | #define S second 17 | #define mp make_pair 18 | #define L 2*r 19 | #define R 2*r+1 20 | #define MOD 1000000007 21 | #define INPFILE freopen("input.in","r",stdin) 22 | using namespace std; 23 | 24 | int main() { 25 | ll n; get(n); 26 | string s; 27 | 28 | while( n > 0 ) { 29 | if( n%2 == 0 ) 30 | { s += "4"; n /= 2; n--; } 31 | else 32 | { s += "3"; n /= 2; } 33 | } 34 | 35 | reverse( all(s) ); 36 | cout << s; 37 | } 38 | -------------------------------------------------------------------------------- /LCKYST.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%lld", &a); 4 | #define repVector(v) for( auto it = v.begin(); it != v.end(); it++ ) 5 | #define all(c) c.begin(), c.end() 6 | #define pb push_back 7 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 8 | #define ROF(i,a,b) for( ll i = a; i >= b; i-- ) 9 | #define debug(x) cout << "[DEBUG] " << #x << " = " << x << endl 10 | #define matrix vector< vector > 11 | #define F first 12 | #define S second 13 | #define mp make_pair 14 | #define L 2*r 15 | #define R 2*r+1 16 | #define INPFILE freopen("input.in","r",stdin) 17 | #define BOOST ios_base::sync_with_stdio(false); cin.tie(NULL); 18 | using namespace std; 19 | 20 | int main() { 21 | ll n; get(n); 22 | while(n--) { 23 | ll x; get(x); 24 | ll p = x, c = 0; 25 | while( p%10 == 0 ) 26 | p /= 10; 27 | while( p%5 == 0 ) 28 | { c++; p /= 5; } 29 | c = ceil(1.0*c/2); 30 | printf("%lld\n", x * (ll)pow(4,c)); 31 | } 32 | } 33 | -------------------------------------------------------------------------------- /MAJOR.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | #include 8 | #include 9 | #define ll long 10 | #define get(a) scanf("%ld", &a) 11 | #define rep(n) for( ll i = 0; i < n; i++ ) 12 | #define repVector(v) for(vector::iterator it = v.begin(); it != v.end(); it++ ) 13 | #define all(c) c.begin(), c.end() 14 | #define repu(a,n) for( ll i = a; i < n; i++ ) 15 | #define pb push_back 16 | #define max(a,b) a > b ? a : b 17 | using namespace std; 18 | 19 | 20 | int main() { 21 | ll t; 22 | get(t); 23 | while(t--) { 24 | ll n; 25 | get(n); 26 | map v; 27 | 28 | rep(n) { 29 | ll x; get(x); 30 | v[x]++; 31 | } 32 | 33 | ll num = n/2; 34 | num++; 35 | bool flag = 0; 36 | 37 | for( map::iterator it = v.begin(); it != v.end(); it++ ) 38 | if( it->second >= num ) 39 | { flag = 1; printf("YES %ld\n", it->first); break; } 40 | 41 | if(!flag) { 42 | printf("NO\n"); 43 | } 44 | 45 | } 46 | } 47 | -------------------------------------------------------------------------------- /MAXLN.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() { 5 | long t, count = 1; 6 | scanf("%ld", &t); 7 | 8 | while(t--) { 9 | long long unsigned int r; 10 | scanf("%lld", &r); 11 | 12 | long long unsigned int ans = 4*r*r; 13 | printf("Case %ld: %lld.25\n", count, ans); 14 | count++; 15 | } 16 | } 17 | -------------------------------------------------------------------------------- /MBEEWALK.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll int 3 | #define get(a) scanf("%d", &a); 4 | #define rep(n) for( ll i = 0; i < n; i++ ) 5 | #define repVector(v) for( typeof(v.begin()) it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( set::iterator it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define max(a,b) ( (a > b) ? a : b ) 10 | #define min(a,b) ( (a < b) ? a : b ) 11 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 12 | #define FOR(i,a,b) for( ll i = a; i < b; i++ ) 13 | #define matrix vector< vector > 14 | #define MOD 1000000007 15 | #define F first 16 | #define S second 17 | #define mp make_pair 18 | #define INPFILE freopen("input.in","r",stdin) 19 | using namespace std; 20 | 21 | int main() { 22 | ll t; get(t); 23 | while(t--) { 24 | ll n; get(n); 25 | cout << n*(n-1)*3; 26 | } 27 | } 28 | -------------------------------------------------------------------------------- /MCHAIRS.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | 6 | int main() { 7 | long int *a, n; 8 | a = new long int[100000001]; 9 | a[0] = 1; 10 | for( int i = 1; i <= 100000001; i++ ) 11 | a[i] = (a[i-1]*2)%1000000007; 12 | 13 | cout << "Done !"; 14 | cin >> n; 15 | } 16 | -------------------------------------------------------------------------------- /MCOINS.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #define ll long 4 | #define get(a) scanf("%ld", &a) 5 | #define rep(n) for( ll i = 0; i < n; i++ ) 6 | #define repVector(v) for(vector::iterator it = v.begin(); it != v.end(); it++ ) 7 | #define repSet(s) for( set::iterator it = s.begin(); it != s.end(); it++ ) 8 | #define all(c) c.begin(), c.end() 9 | #define repu(a,n) for( ll i = a; i <= n; i++ ) 10 | #define pb push_back 11 | #define min(a,b) ( (a < b) ? a : b ) 12 | #define max(a,b) ( (a > b) ? a : b ) 13 | #define absol(a) a >= 0 ? a : -a 14 | #define FOR(i,a,b) for( ll i = a; i < b; i++ ) 15 | #define matrix vector< vector > 16 | #define MOD 1000000007 17 | #define L 2*r 18 | #define R 2*r+1 19 | using namespace std; 20 | 21 | 22 | bool dp[1000005] = {0}; 23 | 24 | int main() { 25 | ll m, k, l; 26 | get(k); get(l); get(m); 27 | 28 | FOR(i,1,1000003) { 29 | if( i-1 >= 0 && dp[i-1] == 0 ) 30 | dp[i] = 1; 31 | if( i-l >= 0 && dp[i-l] == 0 ) 32 | dp[i] = 1; 33 | if( i-k >= 0 && dp[i-k] == 0 ) 34 | dp[i] = 1; 35 | } 36 | 37 | while(m--) { 38 | ll n; get(n); 39 | printf("%c", dp[n] == 1 ? 'A':'B'); 40 | } 41 | } 42 | -------------------------------------------------------------------------------- /MFLAR10.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long 3 | #define get(a) scanf("%ld", &a) 4 | #define rep(n) for( ll i = 0; i < n; i++ ) 5 | #define repVector(v) for(vector::iterator it = v.begin(); it != v.end(); it++ ) 6 | #define all(c) c.begin(), c.end() 7 | #define repu(a,n) for( ll i = a; i < n; i++ ) 8 | #define pb push_back 9 | #define min(a,b) ( (a < b) ? a : b ) 10 | #define absol(a) a >= 0 ? a : -a 11 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 12 | #define matrix vector< vector > 13 | #define MOD 1000000007 14 | using namespace std; 15 | 16 | int main() { 17 | char str[5000]; 18 | while( cin.getline( str, 5000 ) ) { 19 | if( str[0] == '*' ) 20 | break; 21 | 22 | string s(str); 23 | size_t ff = 0; 24 | 25 | while( s[ff] == ' ' ) { ff++; } 26 | 27 | char match = tolower(s[ff]); 28 | 29 | ff = s.find(" ", ff); 30 | bool flag = true; 31 | 32 | while(ff != string::npos ) { 33 | if( ff+1 < s.size() && s[ff+1] != ' ' && tolower(s[ff+1]) != match ) 34 | { flag = false; break; } 35 | ff = s.find(" ",ff+1); 36 | } 37 | 38 | if(flag) 39 | printf("Y\n"); 40 | else 41 | printf("N\n"); 42 | } 43 | } 44 | -------------------------------------------------------------------------------- /MINCOUNT.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #define ll long long 4 | #define get(a) scanf("%lld", &a) 5 | #define rep(n) for( ll i = 0; i < n; i++ ) 6 | #define repVector(v) for(vector::iterator it = v.begin(); it != v.end(); it++ ) 7 | #define repSet(s) for( set::iterator it = s.begin(); it != s.end(); it++ ) 8 | #define all(c) c.begin(), c.end() 9 | #define repu(a,n) for( ll i = a; i <= n; i++ ) 10 | #define pb push_back 11 | #define min(a,b) ( (a < b) ? a : b ) 12 | #define max(a,b) ( (a > b) ? a : b ) 13 | #define absol(a) a >= 0 ? a : -a 14 | #define FOR(i,a,b) for( ll i = a; i < b; i++ ) 15 | #define matrix vector< vector > 16 | #define MOD 1000000007 17 | #define L 2*r 18 | #define R 2*r+1 19 | using namespace std; 20 | 21 | int main() { 22 | ll t; 23 | get(t); 24 | 25 | while(t--) { 26 | ll n; get(n); 27 | ll sum = n*(n+1); 28 | sum /= 6; 29 | printf("%lld\n", sum); 30 | 31 | } 32 | } 33 | -------------------------------------------------------------------------------- /MISERMAN.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long 3 | #define get(a) scanf("%ld", &a) 4 | #define rep(n) for( ll i = 0; i < n; i++ ) 5 | #define repVector(v) for(vector::iterator it = v.begin(); it != v.end(); it++ ) 6 | #define all(c) c.begin(), c.end() 7 | #define repu(a,n) for( ll i = a; i < n; i++ ) 8 | #define pb push_back 9 | #define min(a,b) ( (a < b) ? a : b ) 10 | #define absol(a) a >= 0 ? a : -a 11 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 12 | #define matrix vector< vector > 13 | #define MOD 1000000007 14 | using namespace std; 15 | 16 | int main() { 17 | ll n, m; 18 | get(n); get(m); 19 | 20 | ll a[105][105] = {0}; 21 | matrix dp( 105, vector(105, INT_MAX) ); 22 | 23 | rep(m+1) 24 | dp[0][i] = 0; 25 | 26 | FOR(i,1,n) 27 | FOR(j,1,m) 28 | get(a[i][j]); 29 | 30 | 31 | FOR(i,1,n) 32 | FOR(j,1,m) 33 | dp[i][j] = a[i][j] + min( dp[i-1][j] , min( dp[i-1][j-1], dp[i-1][j+1] ) ); 34 | 35 | ll small = INT_MAX; 36 | 37 | FOR(i,1,m) 38 | if( small > dp[n][i] ) 39 | small = dp[n][i]; 40 | 41 | printf("%ld", small ); 42 | 43 | } 44 | -------------------------------------------------------------------------------- /MKLABELS.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #define ll long 4 | #define get(a) scanf("%ld", &a); 5 | #define rep(n) for( ll i = 0; i < n; i++ ) 6 | #define repVector(v) for( typeof(v.begin()) it = v.begin(); it != v.end(); it++ ) 7 | #define repSTL(s) for( typeof(s.begin()) it = s.begin(); it != s.end(); it++ ) 8 | #define all(c) c.begin(), c.end() 9 | #define repu(a,n) for( ll i = a; i <= n; i++ ) 10 | #define pb push_back 11 | #define min(a,b) ( (a < b) ? a : b ) 12 | #define max(a,b) ( (a > b) ? a : b ) 13 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 14 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 15 | #define matrix vector< vector > 16 | #define MOD 1000000007 17 | #define F first 18 | #define S second 19 | #define L 2*r 20 | #define R 2*r+1 21 | #define mp make_pair 22 | using namespace std; 23 | 24 | int main() { 25 | ll c = 1; 26 | while(1) { 27 | ll n; get(n); 28 | if( n == 0 ) return 0; 29 | printf("Case %ld, N = %ld, # of different labelings = %ld\n", c++, n, (long)pow(n,n-2) ); 30 | } 31 | } 32 | -------------------------------------------------------------------------------- /MRECAMAN.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%lld", &a) 4 | #define rep(n) for( ll i = 0; i < n; i++ ) 5 | #define repVector(v) for(vector::iterator it = v.begin(); it != v.end(); it++ ) 6 | #define all(c) c.begin(), c.end() 7 | #define repu(a,n) for( ll i = a; i < n; i++ ) 8 | #define pb push_back 9 | #define min(a,b) ( (a < b) ? a : b ) 10 | #define max(a,b) ( (a > b) ? a : b ) 11 | #define absol(a) a >= 0 ? a : -a 12 | #define FOR(i,a,b) for( ll i = a; i < b; i++ ) 13 | #define matrix vector< vector > 14 | #define MOD 1000000007 15 | using namespace std; 16 | 17 | bool m[7000000] = {0}; 18 | 19 | int main() { 20 | vector v; 21 | v.pb(0); 22 | m[0] = 1; 23 | 24 | FOR( i,1, 500000+1 ) { 25 | ll a = v[i-1] - i; 26 | if( a < 0 || m[a] == 1 ) 27 | { v.pb( v[i-1] + i ); m[ v[i-1] + i ] = 1; } 28 | else 29 | { v.pb(a); m[a] = 1; } 30 | } 31 | 32 | while(1) { 33 | ll n; 34 | get(n); 35 | 36 | if( n == -1 ) 37 | break; 38 | 39 | printf("%lld\n", v[n]); 40 | 41 | 42 | } 43 | } 44 | -------------------------------------------------------------------------------- /MSTRING.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long 3 | #define get(a) scanf("%ld", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( typeof(v.begin()) it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( typeof(s.begin()) it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 10 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 11 | #define matrix vector< vector > 12 | #define F first 13 | #define S second 14 | #define mp make_pair 15 | #define L 2*r 16 | #define R 2*r+1 17 | #define INPFILE freopen("input.in","r",stdin) 18 | using namespace std; 19 | 20 | string a, b; 21 | ll dp[1001][1001]= {0}; 22 | 23 | ll rec( ll x, ll y ) { 24 | if( x >= a.size() ) 25 | return 2000; 26 | 27 | if( dp[x][y] != -1 ) 28 | return dp[x][y]; 29 | 30 | ll ans = 1; 31 | 32 | FOR(i,y,b.size()-1) 33 | if( b[i] == a[x] ) 34 | { ans = min( rec(x+1,y), 1+rec(x+1,i+1) ); break; } 35 | 36 | dp[x][y] = ans; 37 | return ans; 38 | 39 | } 40 | 41 | int main() { 42 | memset( dp, -1, sizeof dp ); 43 | cin >> a >> b; 44 | printf("%ld", rec(0,0)); 45 | } 46 | -------------------------------------------------------------------------------- /MUL.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() { 5 | long long unsigned int a, b; 6 | int c = 1000000; 7 | a = 955555; 8 | b = 9555; 9 | cout << c; 10 | cin >> c; 11 | } 12 | -------------------------------------------------------------------------------- /MXZERO.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long 3 | #define get(a) scanf("%ld", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( typeof(v.begin()) it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( typeof(s.begin()) it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 10 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 11 | #define ROF(i,a,b) for( ll i = a; i >= b; i-- ) 12 | #define debug(x) cout << "[DEBUG] " << #x << " = " << x << endl 13 | #define matrix vector< vector > 14 | #define F first 15 | #define S second 16 | #define mp make_pair 17 | #define L 2*r 18 | #define R 2*r+1 19 | #define INPFILE freopen("input.in","r",stdin) 20 | using namespace std; 21 | 22 | int main() { 23 | ll t; cin >> t; 24 | while(t--) { 25 | ll n; cin >> n; 26 | ll arr[100005] = {0}, xx = 0; 27 | FOR(i,1,n) 28 | { cin >> arr[i]; xx ^= arr[i]; } 29 | ll ans = 0; 30 | FOR(i,1,n) 31 | if( ( xx^arr[i] ) == 0 ) 32 | ans++; 33 | cout << ans << "\n"; 34 | } 35 | } 36 | -------------------------------------------------------------------------------- /NEG2.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | #include 8 | #include 9 | #define ll long long 10 | #define get(a) scanf("%lld", &a) 11 | #define rep(n) for( ll i = 0; i < n; i++ ) 12 | #define repVector(v) for(vector::iterator it = v.begin(); it != v.end(); it++ ) 13 | #define all(c) c.begin(), c.end() 14 | #define repu(a,n) for( ll i = a; i < n; i++ ) 15 | #define pb push_back 16 | #define min(a,b) a < b ? a : b 17 | #define absol(a) a >= 0 ? a : -a 18 | #define FOR(i,a,b) for( ll i = a; i < b; i++ ) 19 | using namespace std; 20 | 21 | int main() { 22 | ll n; 23 | get(n); 24 | stack q; 25 | int b = -2; 26 | 27 | if( n == 0 ) 28 | { printf("0"); return 0; } 29 | 30 | while( n != 0 ) { 31 | if( n%b == 0 ) 32 | q.push(0); 33 | else 34 | q.push(1); 35 | if( n < 0 && n%b != 0 ) 36 | { n /= b; n++; } 37 | else 38 | n /= b; 39 | } 40 | 41 | while(!q.empty()) 42 | { printf("%d", q.top()); q.pop(); } 43 | 44 | } 45 | -------------------------------------------------------------------------------- /NPL1.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long 3 | #define get(a) scanf("%ld", &a) 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for(vector::iterator it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( set::iterator it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define repu(a,n) for( ll i = a; i < n; i++ ) 9 | #define pb push_back 10 | #define min(a,b) ( (a < b) ? a : b ) 11 | #define max(a,b) ( ( (a > b) ? a : b ) ) 12 | #define absol(a) (a >= 0) ? a : -a 13 | #define FOR(i,a,b) for( ll i = a; i < b; i++ ) 14 | #define matrix vector< vector > 15 | #define MOD 1000000007 16 | #define L 2*r 17 | #define R 2*r+1 18 | using namespace std; 19 | 20 | ll gcd( ll a, ll b) { return (b == 0 ? a : gcd(b, a % b)); } 21 | 22 | int main() { 23 | ll t; 24 | get(t); 25 | 26 | while(t--) { 27 | ll x1,y1,x2,y2; 28 | get(x1); get(y1); get(x2); get(y2); 29 | ll a = abs(x1-x2); 30 | ll b = abs(y1-y2); 31 | 32 | ll g = gcd( a, b )-1; 33 | 34 | 35 | printf("%ld\n", g); 36 | 37 | } 38 | } 39 | -------------------------------------------------------------------------------- /OFFSIDE.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #define ll int 6 | #define get(a) scanf("%d", &a) 7 | #define rep(n) for( int i = 0; i < n; i++ ) 8 | #define pb push_back 9 | using namespace std; 10 | 11 | int main() { 12 | while(1) { 13 | ll x, y, p, min = INT_MAX; 14 | vector a, b; 15 | get(x); get(y); 16 | 17 | if( x == 0 && y == 0 ) 18 | break; 19 | 20 | rep(x) 21 | { get(p); min = p < min ? p: min; } 22 | rep(y) 23 | { get(p); b.pb(p); } 24 | 25 | sort( b.begin(), b.end() ); 26 | 27 | if( ( min == b[0] && min == b[1] ) || min >= b[1] ) 28 | printf("N\n"); 29 | else 30 | printf("Y\n"); 31 | 32 | 33 | } 34 | } 35 | 36 | -------------------------------------------------------------------------------- /OHANISER.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%lld", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( auto it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( auto it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 10 | #define ROF(i,a,b) for( ll i = a; i >= b; i-- ) 11 | #define debug(x) cout << "[DEBUG] " << #x << " = " << x << endl 12 | #define matrix vector< vector > 13 | #define F first 14 | #define S second 15 | #define mp make_pair 16 | #define L 2*r 17 | #define R 2*r+1 18 | #define INPFILE freopen("input.in","r",stdin) 19 | #define MOD 1000000007 20 | using namespace std; 21 | 22 | ll arr[100005] = {0}; 23 | 24 | int main() { 25 | 26 | arr[1] = 1; 27 | ll val = 1; 28 | 29 | FOR(i,2,100000) { 30 | arr[i] = ( val + arr[i-1] + arr[i-1] )%MOD; 31 | val *= 2; val %= MOD; 32 | } 33 | 34 | 35 | ll t, c = 1; get(t); 36 | while(t--) { 37 | ll n; get(n); 38 | printf("Case %lld: %lld\n", c++, arr[n]); 39 | } 40 | } 41 | -------------------------------------------------------------------------------- /OJUMPS.c: -------------------------------------------------------------------------------- 1 | #include 2 | 3 | int main() { 4 | long long unsigned int a; 5 | scanf("%llu", &a); 6 | 7 | if( a%3 == 0 || (a-1)%6 == 0 ) { 8 | printf("yes"); 9 | } 10 | else 11 | printf("no"); 12 | 13 | return 0; 14 | } 15 | -------------------------------------------------------------------------------- /OLOLO.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | #define ll long 8 | #define get(a) scanf("%ld", &a) 9 | #define rep(n) for( ll i = 0; i < n; i++ ) 10 | #define repVector(v) for(vector::iterator it = v.begin(); it != v.end(); it++ ) 11 | #define all(c) c.begin(), c.end() 12 | #define repu(a,n) for( ll i = a; i < n; i++ ) 13 | #define pb push_back 14 | using namespace std; 15 | 16 | int main() { 17 | ll t; 18 | get(t); 19 | set all, unq; 20 | vector even, odd; 21 | ll ans = 0; 22 | 23 | while(t--) { 24 | ll n; 25 | get(n); 26 | ans = ans^n; 27 | } 28 | 29 | printf("%ld", ans); 30 | } 31 | -------------------------------------------------------------------------------- /PEBBLE.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #define ll long 4 | #define get(a) scanf("%ld", &a); 5 | #define rep(n) for( ll i = 0; i < n; i++ ) 6 | #define repVector(v) for( typeof(v.begin()) it = v.begin(); it != v.end(); it++ ) 7 | #define repSTL(s) for( typeof(s.begin()) it = s.begin(); it != s.end(); it++ ) 8 | #define all(c) c.begin(), c.end() 9 | #define repu(a,n) for( ll i = a; i <= n; i++ ) 10 | #define pb push_back 11 | #define min(a,b) ( (a < b) ? a : b ) 12 | #define max(a,b) ( (a > b) ? a : b ) 13 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 14 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 15 | #define matrix vector< vector > 16 | #define MOD 1000000007 17 | #define F first 18 | #define S second 19 | #define L 2*r 20 | #define R 2*r+1 21 | #define mp make_pair 22 | using namespace std; 23 | 24 | int main() { 25 | string a; ll t = 1; 26 | while( cin >> a ) { 27 | bool bit[2]; 28 | bit[0] = 0; bit[1] = 1; 29 | ll ans = 0; 30 | 31 | rep(a.size()) 32 | if( bit[ a[i]-'0' ] == 1 ) 33 | { ans++; bit[0] = !bit[0]; bit[1] = !bit[1]; } 34 | printf("Game #%ld: %ld\n", t++, ans); 35 | } 36 | } 37 | -------------------------------------------------------------------------------- /PNTNG.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() { 5 | long long unsigned int n, m, h, C[100005], t, c, tcount = 0, mul, cost = 0; 6 | char *nn, *mm; 7 | 8 | C[0] = 0; 9 | cin >> n >> m >> h; 10 | 11 | mul = n*m; 12 | 13 | 14 | for( int i = 0; i < h; i++ ) { 15 | cin >> t >> c; 16 | C[c] += t; 17 | tcount += t; 18 | } 19 | 20 | if( tcount < mul ) { 21 | cout << "Impossible" << endl; 22 | } 23 | else { 24 | mul = n*m; 25 | int counter = 1; 26 | while( mul > 0 ) { 27 | if( C[counter] < mul ) { 28 | mul -= C[counter]; 29 | cost += C[counter]*counter; 30 | counter++; 31 | } 32 | else { 33 | cost += mul*counter; 34 | mul = 0; 35 | } 36 | } 37 | 38 | cout << cost << endl; 39 | } 40 | 41 | //cin >> cost; 42 | } 43 | 44 | 45 | 46 | 47 | 48 | 49 | 50 | -------------------------------------------------------------------------------- /PRAC.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll int 3 | #define get(a) scanf("%d", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( vector::iterator it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( typeof(s.begin()) it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 10 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 11 | #define matrix vector< vector > 12 | #define F first 13 | #define S second 14 | #define mp make_pair 15 | #define foo(a,b,c) mp( mp(a,b), c ) 16 | #define L 2*r 17 | #define R 2*r+1 18 | #define INPFILE freopen("input.in","r",stdin) 19 | using namespace std; 20 | 21 | int main() { 22 | ll t; get(t); 23 | while(t--) { 24 | double a, b, c; 25 | cin >> a >> b >> c; 26 | 27 | double s = (a+b+c)/2; 28 | double ar = s*(s-a)*(s-b)*(s-c); 29 | ar = sqrt(ar); 30 | ar *= 4; 31 | 32 | double ans = a*b*c/ar; 33 | printf("%0.2lf\n", ans); 34 | } 35 | } 36 | -------------------------------------------------------------------------------- /PRGIFT.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | 6 | int main() { 7 | int t; 8 | scanf("%d", &t); 9 | while(t--) { 10 | int n, k, count = 0; 11 | scanf("%d %d", &n, &k); 12 | 13 | for( int i = 0; i < n; i++ ) { 14 | int num; 15 | scanf("%d", &num); 16 | if( num%2 == 0 ) 17 | count++; 18 | } 19 | 20 | if( k == 0 && n-count != 0 ) 21 | printf("YES\n"); 22 | else if( k == 0 && n-count == 0 ) 23 | printf("NO\n"); 24 | else if( count >= k ) 25 | printf("YES\n"); 26 | else 27 | printf("NO\n"); 28 | } 29 | } 30 | 31 | 32 | 33 | -------------------------------------------------------------------------------- /PRLADDU.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #define ll long 4 | #define get(a) scanf("%ld", &a) 5 | #define rep(n) for( ll i = 1; i <= n; i++ ) 6 | #define repVector(v) for(vector::iterator it = v.begin(); it != v.end(); it++ ) 7 | #define repSet(s) for( set::iterator it = s.begin(); it != s.end(); it++ ) 8 | #define all(c) c.begin(), c.end() 9 | #define repu(a,n) for( ll i = a; i < n; i++ ) 10 | #define pb push_back 11 | #define min(a,b) ( (a < b) ? a : b ) 12 | #define max(a,b) ( (a > b) ? a : b ) 13 | #define absol(a) a >= 0 ? a : -a 14 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 15 | #define matrix vector< vector > 16 | #define MOD 1000000007 17 | #define L 2*r 18 | #define R 2*r+1 19 | using namespace std; 20 | 21 | int main() { 22 | ll t; 23 | get(t); 24 | 25 | while(t--) { 26 | ll n, a[100000+5] = {0}; 27 | get(n); 28 | 29 | long long sum = 0; 30 | 31 | rep(n) { 32 | get(a[i]); 33 | sum += abs( a[i-1] ); 34 | a[i] += a[i-1]; 35 | } 36 | 37 | printf("%lld\n", sum); 38 | 39 | } 40 | } 41 | -------------------------------------------------------------------------------- /QCJ2.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long 3 | #define get(a) scanf("%ld", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( typeof(v.begin()) it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( typeof(s.begin()) it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 10 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 11 | #define matrix vector< vector > 12 | #define F first 13 | #define S second 14 | #define mp make_pair 15 | #define L 2*r 16 | #define R 2*r+1 17 | #define INPFILE freopen("input.in","r",stdin) 18 | using namespace std; 19 | 20 | int main() { 21 | ll dp[105][105] = {0}; 22 | dp[0][0] = 1; 23 | 24 | FOR(i,1,100) 25 | FOR(j,0,i) 26 | FOR(k,0,j) 27 | { dp[i][j] += dp[i-1][j-k]; dp[i][j] %= 761238923; } 28 | 29 | while(1) { 30 | ll n; get(n); 31 | if( n == 0 ) return 0; 32 | 33 | printf("%ld\n", dp[n][n]); 34 | } 35 | 36 | } 37 | -------------------------------------------------------------------------------- /QUADAREA.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | #include 8 | #include 9 | #include 10 | #include 11 | #include 12 | #define ll long 13 | #define get(a) scanf("%ld", &a) 14 | #define rep(n) for( ll i = 0; i < n; i++ ) 15 | #define repVector(v) for(vector::iterator it = v.begin(); it != v.end(); it++ ) 16 | #define all(c) c.begin(), c.end() 17 | #define repu(a,n) for( ll i = a; i < n; i++ ) 18 | #define max(a,b) a > b ? a : b 19 | #define pb push_back 20 | using namespace std; 21 | 22 | int main() { 23 | ll t; 24 | get(t); 25 | 26 | while(t--) { 27 | double a[5] = {0}, s = 0; 28 | rep(4) { scanf("%lf", &a[i]); s += a[i]; } 29 | s /= 2; 30 | 31 | double val = (s - a[0])*(s - a[1])*(s - a[2])*(s - a[3]); 32 | 33 | val = sqrt(val); 34 | 35 | printf("%0.2lf\n", val); 36 | } 37 | } 38 | -------------------------------------------------------------------------------- /RANKLIST.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%lld", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( typeof(v.begin()) it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( typeof(s.begin()) it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define MEM(a,b) memset(a,(b),sizeof(a)) 9 | #define MAX(a,b) ((a) > (b) ? (a) : (b)) 10 | #define MIN(a,b) ((a) < (b) ? (a) : (b)) 11 | #define pb push_back 12 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 13 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 14 | #define matrix vector< vector > 15 | #define F first 16 | #define S second 17 | #define mp make_pair 18 | #define L 2*r 19 | #define R 2*r+1 20 | #define MOD 1000000007 21 | #define INPFILE freopen("input.in","r",stdin) 22 | using namespace std; 23 | 24 | int main() { 25 | ll t; get(t); 26 | while(t--) { 27 | ll n, s; 28 | get(n); get(s); 29 | ll ans = 0; 30 | 31 | FOR(i,1,n) { 32 | if( s <= i || s-i < n-i ) 33 | { ans = n-i+ !( (s == i )*( i == n ) ); break; } 34 | s -= i; 35 | } 36 | 37 | printf("%lld\n", ans); 38 | } 39 | } 40 | -------------------------------------------------------------------------------- /RECMSG.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%lld", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( vector::iterator it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( set::iterator it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 10 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 11 | #define matrix vector< vector > 12 | #define F first 13 | #define S second 14 | #define mp make_pair 15 | #define foo(a,b,c) mp( mp(a,b), c ) 16 | #define L 2*r 17 | #define R 2*r+1 18 | #define INPFILE freopen("input.in","r",stdin) 19 | using namespace std; 20 | 21 | int main() { 22 | ll t; get(t); 23 | while(t--) { 24 | string s; 25 | cin >> s; 26 | 27 | ll ans = 0; 28 | FOR(i,0,s.size()-1) 29 | ans += s[i] - 'a' + 1; 30 | 31 | printf("%lld\n", ans); 32 | } 33 | } 34 | -------------------------------------------------------------------------------- /REPUB.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long 3 | #define get(a) scanf("%ld", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( vector::iterator it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( typeof(s.begin()) it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 10 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 11 | #define matrix vector< vector > 12 | #define F first 13 | #define S second 14 | #define mp make_pair 15 | #define foo(a,b,c) mp( mp(a,b), c ) 16 | #define L 2*r 17 | #define R 2*r+1 18 | #define INPFILE freopen("input.in","r",stdin) 19 | using namespace std; 20 | 21 | int main() { 22 | ll t; get(t); 23 | while(t--) { 24 | string s; 25 | cin.ignore(); 26 | getline(cin,s); 27 | ll arr[100] = {0}; 28 | 29 | FOR(i,0,s.size()-1) 30 | arr[tolower(s[i])-'a']++; 31 | 32 | ll mx = arr[0], ptr = 0; 33 | FOR(i,1,25) 34 | if( mx <= arr[i] ) 35 | { mx = arr[i]; ptr = i; } 36 | 37 | printf("%c\n", char(ptr+'a')); 38 | } 39 | } 40 | -------------------------------------------------------------------------------- /RESSTNCE.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%lld", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( vector::iterator it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( set::iterator it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 10 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 11 | #define matrix vector< vector > 12 | #define MOD 1000000007 13 | #define F first 14 | #define S second 15 | #define mp make_pair 16 | #define foo(a,b,c) mp( mp(a,b), c ) 17 | #define L 2*r 18 | #define R 2*r+1 19 | #define INPFILE freopen("input.in","r",stdin) 20 | using namespace std; 21 | 22 | int main() { 23 | ll t; get(t); 24 | while(t--) { 25 | ll n, m; 26 | get(n); get(m); 27 | 28 | ll a = 1, b = 1; 29 | 30 | FOR(i,2,n) { 31 | a = ( a + b )%m; 32 | b = ( a + b )%m; 33 | } 34 | 35 | printf("%lld/%lld\n", a%m,b%m); 36 | } 37 | } 38 | -------------------------------------------------------------------------------- /RETPO.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() { 5 | long long int t; 6 | cin >> t; 7 | while(t--) { 8 | long long int x, y, sum = 0, temp = 0, m, n; 9 | cin >> x >> y; 10 | 11 | if( x < 0 ) 12 | x = -x; 13 | if( y < 0 ) 14 | y = -y; 15 | 16 | if( x-y > 0 ) { 17 | m = x-y; 18 | if( m%2 == 0 ) 19 | temp = 2*m; 20 | else 21 | temp = 2*m + 1; 22 | 23 | sum = y*2 + temp; 24 | } 25 | else { 26 | m = y-x; 27 | if( m%2 == 0 ) 28 | temp = 2*m; 29 | else 30 | temp = 2*m - 1; 31 | 32 | sum = x*2 + temp; 33 | } 34 | 35 | //cout << m << ":m Temp: " << temp << endl; 36 | cout << sum << endl; 37 | } 38 | } 39 | 40 | 41 | 42 | 43 | -------------------------------------------------------------------------------- /ROOTCIPH.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%lld", &a) 4 | #define rep(n) for( ll i = 0; i < n; i++ ) 5 | #define repVector(v) for(vector::iterator it = v.begin(); it != v.end(); it++ ) 6 | #define all(c) c.begin(), c.end() 7 | #define repu(a,n) for( ll i = a; i < n; i++ ) 8 | #define pb push_back 9 | #define min(a,b) ( (a < b) ? a : b ) 10 | #define max(a,b) ( (a > b) ? a : b ) 11 | #define absol(a) a >= 0 ? a : -a 12 | #define FOR(i,a,b) for( ll i = a; i < b; i++ ) 13 | #define matrix vector< vector > 14 | #define MOD 1000000007 15 | using namespace std; 16 | 17 | int main() { 18 | ll t; 19 | get(t); 20 | 21 | while(t--) { 22 | ll a, b, c; 23 | get(a); get(b); get(c); 24 | ll ans = a*a - 2*b; 25 | printf("%lld\n", abs(ans) ); 26 | } 27 | 28 | } 29 | -------------------------------------------------------------------------------- /RPLC.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #define ll long long 4 | #define get(a) scanf("%lld", &a) 5 | #define rep(n) for( ll i = 0; i < n; i++ ) 6 | #define repVector(v) for(vector::iterator it = v.begin(); it != v.end(); it++ ) 7 | #define repSet(s) for( set::iterator it = s.begin(); it != s.end(); it++ ) 8 | #define all(c) c.begin(), c.end() 9 | #define repu(a,n) for( ll i = a; i <= n; i++ ) 10 | #define pb push_back 11 | #define min(a,b) ( (a < b) ? a : b ) 12 | #define max(a,b) ( (a > b) ? a : b ) 13 | #define absol(a) a >= 0 ? a : -a 14 | #define FOR(i,a,b) for( ll i = a; i < b; i++ ) 15 | #define matrix vector< vector > 16 | #define MOD 1000000007 17 | #define L 2*r 18 | #define R 2*r+1 19 | using namespace std; 20 | 21 | int main() { 22 | ll t; 23 | get(t); 24 | ll c = 1; 25 | 26 | while(t--) { 27 | ll n; get(n); 28 | vector v(n,0); 29 | ll sum = 0; 30 | ll m = 0; 31 | 32 | rep(n) { 33 | get(v[i]); 34 | sum += v[i]; 35 | 36 | if( sum < 0 ) 37 | m = min( m , sum ); 38 | } 39 | 40 | printf("Scenario #%lld: %lld\n", c++, 1-m ); 41 | 42 | } 43 | } 44 | -------------------------------------------------------------------------------- /RPLH.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll int 3 | #define get(a) scanf("%d", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( typeof(v.begin()) it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( typeof(s.begin()) it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 10 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 11 | #define matrix vector< vector > 12 | #define F first 13 | #define S second 14 | #define mp make_pair 15 | #define foo(a,b,c) mp( mp(a,b), c ) 16 | #define L 2*r 17 | #define R 2*r+1 18 | #define INPFILE freopen("input.in","r",stdin) 19 | using namespace std; 20 | 21 | int main() { 22 | ll t, w = 1; get(t); 23 | while(t--) { 24 | ll d, s; 25 | get(d); get(s); 26 | 27 | double ans, val = 9.806*d/(s*s); 28 | 29 | if( val > 1.0 ) 30 | { printf("Scenario #%d: -1\n", w++); continue; } 31 | else 32 | ans = ( 180*asin(val) )/(4*acos(0.0)); 33 | 34 | printf("Scenario #%d: %0.2lf\n", w++, ans); 35 | } 36 | } 37 | -------------------------------------------------------------------------------- /RRCOPY.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main() { 6 | int t; 7 | scanf("%d", &t); 8 | 9 | while(t--) { 10 | long int n, i, a[100000+5], *arr, count = 0; 11 | arr = new long int[100000+5]; 12 | scanf("%ld", &n); 13 | arr[0] = 0; 14 | 15 | for( i = 0; i <= 100000; i++ ) 16 | arr[i] = 0; 17 | 18 | for( i = 0; i < n; i++ ) { 19 | scanf("%ld", &a[i]); 20 | arr[ a[i] ]++; 21 | } 22 | 23 | for( i = 1; i <= 100000; i++ ) 24 | if( arr[i] > 0 ) { 25 | count++; } 26 | 27 | printf("%ld\n", count); 28 | 29 | delete arr; 30 | } 31 | } 32 | 33 | 34 | 35 | -------------------------------------------------------------------------------- /RRFRNDS(2).cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll int 3 | #define get(a) scanf("%d", &a) 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( vector::iterator it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( set::iterator it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 10 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 11 | #define matrix vector< vector > 12 | #define MOD 1000000007 13 | #define F first 14 | #define S second 15 | #define mp make_pair 16 | #define L 2*r 17 | #define R 2*r+1 18 | #define INPFILE freopen("input.in","r",stdin) 19 | using namespace std; 20 | 21 | int main() { 22 | // INPFILE; 23 | ll n; get(n); 24 | bitset<2000> bit[2000]; 25 | string s[n]; 26 | 27 | FOR(i,0,n-1) { 28 | cin >> s[i]; 29 | bit[i] = bitset<2000>(s[i]); 30 | } 31 | 32 | ll ans = 0; 33 | 34 | FOR(i,0,n-1) 35 | FOR(j,i+1,n-1) 36 | if( s[i][j] == '1' ) continue; 37 | else if( (bit[i]&bit[j]).any() ) ans += 2; 38 | 39 | cout << ans; 40 | } 41 | -------------------------------------------------------------------------------- /RRJOKE.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #define ll long long 4 | #define get(a) scanf("%lld", &a); 5 | #define rep(n) for( ll i = 0; i < n; i++ ) 6 | #define repVector(v) for( typeof(v.begin()) it = v.begin(); it != v.end(); it++ ) 7 | #define repSet(s) for( typeof(s.begin()) it = s.begin(); it != s.end(); it++ ) 8 | #define all(c) c.begin(), c.end() 9 | #define repu(a,n) for( ll i = a; i <= n; i++ ) 10 | #define pb push_back 11 | #define min(a,b) ( (a < b) ? a : b ) 12 | #define max(a,b) ( (a > b) ? a : b ) 13 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 14 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 15 | #define matrix vector< vector > 16 | #define MOD 1000000007 17 | #define F first 18 | #define S second2 19 | #define L 2*r 20 | #define R 2*r+1 21 | #define mp make_pair 22 | using namespace std; 23 | 24 | 25 | int main() { 26 | ll t; get(t); 27 | while(t--) { 28 | ll n; get(n); 29 | 30 | rep(n) { ll x, y; get(x); get(y); } 31 | 32 | ll ans = 0; 33 | 34 | FOR(i,1,n) 35 | ans = (ans^i); 36 | printf("%ld\n", ans); 37 | 38 | } 39 | } 40 | -------------------------------------------------------------------------------- /RRSTONE.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | //#include 3 | int main() { 4 | long long int a[100005], n, k, i, max, min; 5 | scanf("%lld %lld", &n, &k ); 6 | 7 | for( i = 0; i < n; i++ ) 8 | scanf( "%lld", &a[i] ); 9 | 10 | max = a[0]; 11 | min = a[0]; 12 | for( i = 0; i < n; i++ ){ 13 | if( a[i] > max ) 14 | max = a[i]; 15 | if( a[i] < min ) 16 | min = a[i]; 17 | } 18 | 19 | if( k == 0 ) { 20 | for( i = 0; i < n; i++ ) 21 | printf("%lld ", a[i]); 22 | } 23 | else if( k%2 == 0 ) { 24 | long long int fact = -min; 25 | for( i = 0; i < n; i++ ) 26 | printf("%lld ", fact+a[i]); 27 | } 28 | else if( k%2 != 0 ) { 29 | long long int fact = max; 30 | for( i = 0; i < n; i++ ) 31 | printf("%lld ", fact-a[i]); 32 | } 33 | 34 | //getch(); 35 | } 36 | -------------------------------------------------------------------------------- /RRSUM.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main() { 6 | long long int n, m; 7 | scanf("%lld %lld", &n, &m); 8 | 9 | while(m--) { 10 | long long int q, a; 11 | scanf("%lld", &q); 12 | a = q; 13 | 14 | if( a <= 2*n ) { 15 | a = q - n; 16 | a--; 17 | } 18 | else if( a > 2*n ) { 19 | a = q - 2*n - 1; 20 | a = n - a; 21 | } 22 | 23 | if( a <= 0 ) 24 | printf("0\n"); 25 | else 26 | printf("%lld\n", a); 27 | } 28 | } 29 | 30 | 31 | -------------------------------------------------------------------------------- /SILVER.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include 6 | #include 7 | #include 8 | #include 9 | #define ll int 10 | #define get(a) scanf("%d", &a) 11 | #define rep(n) for( ll i = 0; i < n; i++ ) 12 | #define repVector(v) for(vector::iterator it = v.begin(); it != v.end(); it++ ) 13 | #define all(c) c.begin(), c.end() 14 | #define repu(a,n) for( ll i = a; i < n; i++ ) 15 | #define pb push_back 16 | #define min(a,b) a < b ? a : b 17 | #define absol(a) a >= 0 ? a : -a 18 | #define FOR(i,a,b) for( ll i = a; i < b; i++ ) 19 | using namespace std; 20 | 21 | long dp[20000+10] = {0}; 22 | 23 | long rec( ll n ) { 24 | if( n == 1 ) 25 | return 0; 26 | if( dp[n] != 0 ) 27 | return dp[n]; 28 | ll a = n/2; 29 | ll b = n-a; 30 | ll v = min(a,b); 31 | 32 | dp[n] = 1 + rec(v); 33 | return dp[n]; 34 | 35 | } 36 | 37 | int main() { 38 | 39 | while(1) { 40 | ll n; 41 | get(n); 42 | 43 | if( n == 0 ) break; 44 | printf("%ld\n", rec(n)); 45 | 46 | } 47 | } 48 | -------------------------------------------------------------------------------- /SPEED.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #define ll int 4 | #define get(a) scanf("%d", &a) 5 | #define rep(n) for( ll i = 0; i < n; i++ ) 6 | #define repVector(v) for(vector::iterator it = v.begin(); it != v.end(); it++ ) 7 | #define repSet(s) for( set::iterator it = s.begin(); it != s.end(); it++ ) 8 | #define all(c) c.begin(), c.end() 9 | #define repu(a,n) for( ll i = a; i <= n; i++ ) 10 | #define pb push_back 11 | #define min(a,b) ( (a < b) ? a : b ) 12 | #define max(a,b) ( (a > b) ? a : b ) 13 | #define absol(a) a >= 0 ? a : -a 14 | #define FOR(i,a,b) for( ll i = a; i < b; i++ ) 15 | #define matrix vector< vector > 16 | #define MOD 1000000007 17 | #define L 2*r 18 | #define R 2*r+1 19 | using namespace std; 20 | 21 | ll gcd( ll a, ll b ) { return ( b == 0 ? a : gcd( b, a%b ) ); } 22 | 23 | int main() { 24 | ll t; 25 | get(t); 26 | 27 | while(t--) { 28 | ll a,b; get(a); get(b); 29 | ll sum = max(a,b) - min(a,b); 30 | sum /= gcd( abs(a) , abs(b) ); 31 | if( sum == 0 ) 32 | sum = 1; 33 | printf("%d\n", abs(sum) ); 34 | 35 | } 36 | } 37 | -------------------------------------------------------------------------------- /SPELL.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #define ll long long 4 | #define get(a) scanf("%lld", &a) 5 | #define rep(n) for( ll i = 1; i <= n; i++ ) 6 | #define repVector(v) for(vector< pair >::iterator it = v.begin(); it != v.end(); it++ ) 7 | #define repSet(s) for( map< vector, ll >::iterator it = s.begin(); it != s.end(); it++ ) 8 | #define all(c) c.begin(), c.end() 9 | #define repu(a,n) for( ll i = a; i <= n; i++ ) 10 | #define pb push_back 11 | #define min(a,b) ( (a < b) ? a : b ) 12 | #define max(a,b) ( (a > b) ? a : b ) 13 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 14 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 15 | #define matrix vector< vector > 16 | #define F first 17 | #define S second 18 | #define L 2*r 19 | #define R 2*r+1 20 | #define mp make_pair 21 | using namespace std; 22 | 23 | int main() { 24 | char str[1000]; 25 | ll d; get(d); 26 | while(d--) scanf("%s", str); 27 | 28 | string s; 29 | cin.ignore(); 30 | getline(cin,s); 31 | cout << s; 32 | 33 | } 34 | -------------------------------------------------------------------------------- /STAMPS.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #define ll long 6 | #define get(a) scanf("%ld", &a) 7 | #define rep(n) for( long i = 0; i < n; i++ ) 8 | #define pb push_back 9 | using namespace std; 10 | 11 | int main() { 12 | ll t, cc = 1; 13 | get(t); 14 | 15 | while(t--) { 16 | ll n, stamp, p; 17 | vector v; 18 | get(stamp); get(n); 19 | 20 | rep(n) 21 | { get(p); v.pb(p); } 22 | 23 | sort( v.begin(), v.end(), greater() ); 24 | 25 | ll sum = 0; ll i = 0; 26 | while( sum < stamp && i < n ) 27 | { sum += v[i++]; } 28 | 29 | if( sum >= stamp ) 30 | printf("Scenario #%ld:\n%ld\n\n", cc++, i); 31 | else 32 | printf("Scenario #%ld:\nimpossible\n\n", cc++); 33 | } 34 | } 35 | 36 | -------------------------------------------------------------------------------- /STL.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%ld", &a); 4 | #define repVector(v) for( auto it = v.begin(); it != v.end(); it++ ) 5 | #define all(c) c.begin(), c.end() 6 | #define pb push_back 7 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 8 | #define ROF(i,a,b) for( ll i = a; i >= b; i-- ) 9 | #define debug(x) cerr << "[DEBUG] " << #x << " = " << x << endl 10 | #define matrix vector< vector > 11 | #define F first 12 | #define S second 13 | #define mp make_pair 14 | #define L 2*r 15 | #define R 2*r+1 16 | #define INPFILE freopen("input.in","r",stdin) 17 | #define BOOST ios_base::sync_with_stdio(false); cin.tie(NULL); 18 | using namespace std; 19 | -------------------------------------------------------------------------------- /STPAR.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #define get(a) scanf("%d", &a); 4 | using namespace std; 5 | 6 | int main() { 7 | int t; 8 | while(1) { 9 | get(t); 10 | 11 | if(t == 0 ) 12 | break; 13 | 14 | int a[1000+5] = {0}; 15 | stack s; 16 | s.push(-1); 17 | 18 | for( int i = 0; i < t; i++ ) 19 | get(a[i]); 20 | a[t] = -1; 21 | 22 | int j = 0; int flag = 0; 23 | 24 | for( int i = 1; i <= t; i++ ) { 25 | //cout << i << " j:" << j << endl; 26 | 27 | if( j > t ) 28 | { printf("no\n"); flag = 1; break; } 29 | if( s.top() == i ) 30 | s.pop(); 31 | else if( a[j] == i ) 32 | { j++; continue; } 33 | else 34 | { s.push(a[j]); j++; i--; } 35 | 36 | } 37 | 38 | if(!flag) 39 | printf("yes\n"); 40 | } 41 | } 42 | 43 | 44 | 45 | -------------------------------------------------------------------------------- /SUMITR.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define F(i,a,b) for(int i=a;i<=b;i++) 3 | using namespace std; 4 | main(){int t;cin>>t;F(k,1,t){int n,m=0,a[200][200]={0};cin>>n;F(i,1,n)F(j,1,i){cin>>a[i][j];a[i][j]+=max(a[i-1][j-1],a[i-1][j]);}F(i,1,n)m=max(a[n][i],m);cout< 2 | #define ll long long 3 | #define get(a) scanf("%lld", &a); 4 | #define repVector(v) for( auto it = v.begin(); it != v.end(); it++ ) 5 | #define all(c) c.begin(), c.end() 6 | #define pb push_back 7 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 8 | #define ROF(i,a,b) for( ll i = a; i >= b; i-- ) 9 | #define debug(x) cout << "[DEBUG] " << #x << " = " << x << endl 10 | #define matrix vector< vector > 11 | #define F first 12 | #define S second 13 | #define mp make_pair 14 | #define L 2*r 15 | #define R 2*r+1 16 | #define INPFILE freopen("input.in","r",stdin) 17 | #define BOOST ios_base::sync_with_stdio(false); cin.tie(NULL); 18 | using namespace std; 19 | 20 | int main() { 21 | ll t; cin >> t; 22 | while(t--) { 23 | ll n, d; 24 | cin >> n >> d; 25 | vector v; 26 | FOR(i,1,n) 27 | { ll x; cin >> x; v.pb(x); } 28 | 29 | sort( all(v) ); 30 | bool explore[100005] = {0}; 31 | ll ans = 0; 32 | ROF(i,n-2,0) 33 | if( !explore[i+1] && v[i+1] < v[i]+d ) 34 | { explore[i] = explore[i+1] = 1; ans += v[i]+v[i+1]; } 35 | 36 | cout << ans << "\n"; 37 | 38 | } 39 | } 40 | -------------------------------------------------------------------------------- /SWAPS.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long 3 | #define get(a) scanf("%ld", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( typeof(v.begin()) it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( typeof(s.begin()) it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 10 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 11 | #define matrix vector< vector > 12 | #define F first 13 | #define S second 14 | #define mp make_pair 15 | #define L 2*r 16 | #define R 2*r+1 17 | #define INPFILE freopen("input.in","r",stdin) 18 | using namespace std; 19 | 20 | int main() { 21 | ll t; get(t); 22 | while(t--) { 23 | string s; 24 | cin >> s; 25 | s = "0" + s; 26 | ll arr[100005] = {0}, ans = 0, one = 0; 27 | 28 | FOR(i,1,s.size()-1) { 29 | if( s[i] == '0' ) 30 | arr[i] = max( arr[i-1]+1, 1L ); 31 | if( s[i] == '1' ) 32 | { arr[i] = max( arr[i-1]-1, 0L ); one++; } 33 | ans = max( arr[i], ans ); 34 | } 35 | 36 | if( one == s.size()-1 ) 37 | one--; 38 | 39 | printf("%ld\n", ans+one); 40 | 41 | } 42 | } 43 | -------------------------------------------------------------------------------- /SWEET.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%lld", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( vector::iterator it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( typeof(s.begin()) it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 10 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 11 | #define matrix vector< vector > 12 | #define F first 13 | #define S second 14 | #define mp make_pair 15 | #define foo(a,b,c) mp( mp(a,b), c ) 16 | #define L 2*r 17 | #define R 2*r+1 18 | #define INPFILE freopen("input.in","r",stdin) 19 | using namespace std; 20 | 21 | int main() { 22 | ll t; get(t); 23 | while(t--) { 24 | ll n, x; 25 | get(n); get(x); 26 | vector v; 27 | v.pb(0); 28 | 29 | FOR(i,1,n) 30 | { ll q; get(q); v.pb(q); } 31 | 32 | ll val[100005] = {0}, ans = 0; 33 | 34 | FOR(i,1,n) { 35 | val[i] = max( v[i]-x + val[i-1], 0LL ); 36 | ans = max( val[i], ans ); 37 | } 38 | 39 | printf("%lld\n", ans); 40 | } 41 | } 42 | -------------------------------------------------------------------------------- /TAAND2.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() { 5 | long long int a[100000+5]; 6 | long int n, i, j, max = 0, temp; 7 | 8 | scanf("%ld", &n); 9 | for( i = 0; i < n; i++ ) 10 | scanf("%lld", &a[i]); 11 | 12 | for( i = 0; i < n; i++ ) 13 | for( j = i+1; j < n; j++ ) { 14 | temp = a[j]&a[i]; 15 | if( temp > max ) 16 | max = temp; 17 | } 18 | 19 | cout << max; 20 | cin >> max; 21 | } 22 | 23 | 24 | 25 | -------------------------------------------------------------------------------- /TASHIFT.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | using namespace std; 3 | 4 | int main() { 5 | long int n, i, j,z, max = 0; 6 | char a[1000000+6], b[1000000+6]; 7 | 8 | cin >> n; 9 | cin.ignore(); 10 | cin.getline( a, n+1); 11 | cin.getline( b, n+1); 12 | 13 | long int flag = -1,mflag = -1, count = 0; 14 | for( j = 0; j < 2*n; j++ ) { 15 | i = j%n; 16 | if( flag == -1 && b[i] == a[0] ) { 17 | flag = i; count = 1; 18 | z = i+1;; z %= n; 19 | while( b[z] == a[count] ) 20 | { count++; z++; z%= n; } 21 | //cout <<"flag: " << flag <<"max: " << max << endl; 22 | if( max < count ) { 23 | max = count; 24 | mflag = flag; 25 | } 26 | flag = -1; count = 0; 27 | } 28 | 29 | } 30 | if( mflag == -1 ) 31 | mflag = 0; 32 | 33 | cout << mflag; 34 | //cin >> flag; 35 | } 36 | 37 | -------------------------------------------------------------------------------- /TERNARY.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long 3 | #define get(a) scanf("%ld", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( typeof(v.begin()) it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( typeof(s.begin()) it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 10 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 11 | #define ROF(i,a,b) for( ll i = a; i >= b; i-- ) 12 | #define debug(x) cout << "[DEBUG] " << #x << " = " << x << endl 13 | #define matrix vector< vector > 14 | #define F first 15 | #define S second 16 | #define mp make_pair 17 | #define L 2*r 18 | #define R 2*r+1 19 | #define INPFILE freopen("input.in","r",stdin) 20 | using namespace std; 21 | 22 | int main() { 23 | ll num[1005] = {0}; 24 | ll a, b, c; 25 | 26 | get(num[1]); get(num[2]); get(num[3]); 27 | get(a); get(b); get(c); 28 | 29 | cout << num[1]; 30 | 31 | } 32 | -------------------------------------------------------------------------------- /TOHU.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #define ll long 4 | #define get(a) scanf("%ld", &a); 5 | #define rep(n) for( ll i = 0; i < n; i++ ) 6 | #define repVector(v) for( typeof(v.begin()) it = v.begin(); it != v.end(); it++ ) 7 | #define repSTL(s) for( typeof(s.begin()) it = s.begin(); it != s.end(); it++ ) 8 | #define all(c) c.begin(), c.end() 9 | #define repu(a,n) for( ll i = a; i <= n; i++ ) 10 | #define pb push_back 11 | #define min(a,b) ( (a < b) ? a : b ) 12 | #define max(a,b) ( (a > b) ? a : b ) 13 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 14 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 15 | #define matrix vector< vector > 16 | #define MOD 1000000007 17 | #define F first 18 | #define S second 19 | #define L 2*r 20 | #define R 2*r+1 21 | #define mp make_pair 22 | using namespace std; 23 | 24 | int main() { 25 | ll t; get(t); 26 | while(t--) { 27 | ll n; get(n); 28 | double ans = 0.5; 29 | ans -= 1/double(n+1); 30 | ans += 1/double(n+2); 31 | 32 | ans *= 0.5; ans += 0.5; 33 | printf("%0.11lf\n", ans); 34 | } 35 | } 36 | -------------------------------------------------------------------------------- /TREEROOT.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll int 3 | #define get(a) scanf("%d", &a) 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( vector::iterator it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( set::iterator it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 10 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 11 | #define matrix vector< vector > 12 | #define MOD 1000000007 13 | #define F first 14 | #define S second 15 | #define mp make_pair 16 | #define L 2*r 17 | #define R 2*r+1 18 | #define INPFILE freopen("input.in","r",stdin) 19 | using namespace std; 20 | 21 | int main() { 22 | // INPFILE; 23 | ll t; get(t); 24 | while(t--) { 25 | ll n; get(n); 26 | ll sum = 0; 27 | 28 | rep(n) { 29 | ll x, y; 30 | get(x); get(y); 31 | sum += x; sum -= y; 32 | } 33 | 34 | cout << sum << endl; 35 | 36 | } 37 | } 38 | -------------------------------------------------------------------------------- /TRGRID.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%lld", &a) 4 | #define rep(n) for( ll i = 0; i < n; i++ ) 5 | #define repVector(v) for(vector::iterator it = v.begin(); it != v.end(); it++ ) 6 | #define all(c) c.begin(), c.end() 7 | #define repu(a,n) for( ll i = a; i < n; i++ ) 8 | #define pb push_back 9 | #define min(a,b) a < b ? a : b 10 | #define absol(a) a >= 0 ? a : -a 11 | #define FOR(i,a,b) for( ll i = a; i < b; i++ ) 12 | #define matrix vector< vector > 13 | #define MOD 1000000007 14 | using namespace std; 15 | 16 | int main() { 17 | ll t; 18 | get(t); 19 | 20 | while(t--) { 21 | ll x, y; 22 | get(x); get(y); 23 | ll final = x%y; 24 | final %= 4; 25 | 26 | if( x == 1 ) 27 | final = 1; 28 | else if( y == 1 ) 29 | final = 2; 30 | 31 | if( final == 0 ) 32 | printf("U"); 33 | else if( final == 1 ) 34 | printf("R"); 35 | else if( final == 2 ) 36 | printf("D"); 37 | else if( final == 3 ) 38 | printf("L"); 39 | printf("\n"); 40 | 41 | } 42 | } 43 | -------------------------------------------------------------------------------- /TWOSQR(2).cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | using namespace std; 4 | 5 | int main() { 6 | int t; 7 | scanf("%d", &t); 8 | 9 | while(t--) { 10 | long long n, a = 0, b; 11 | scanf("%lld", &n); 12 | 13 | b = sqrt(n); 14 | 15 | while(1) { 16 | if( a*a + b*b == n ) 17 | { printf("Yes\n"); break; } 18 | 19 | if( a*a > n ) 20 | { printf("No\n"); break; } 21 | 22 | if( a*a + b*b > n ) 23 | b--; 24 | else 25 | a++; 26 | 27 | } 28 | 29 | } 30 | 31 | } 32 | -------------------------------------------------------------------------------- /UJ.py: -------------------------------------------------------------------------------- 1 | import sys 2 | 3 | while(1): 4 | a,b = map(int,sys.stdin.readline().split()) 5 | 6 | if( a == 0 and b == 0 ): 7 | break 8 | print a**b 9 | -------------------------------------------------------------------------------- /UTMOPR.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%lld", &a); 4 | #define repVector(v) for( auto it = v.begin(); it != v.end(); it++ ) 5 | #define all(c) c.begin(), c.end() 6 | #define pb push_back 7 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 8 | #define ROF(i,a,b) for( ll i = a; i >= b; i-- ) 9 | #define debug(x) cout << "[DEBUG] " << #x << " = " << x << endl 10 | #define matrix vector< vector > 11 | #define F first 12 | #define S second 13 | #define mp make_pair 14 | #define L 2*r 15 | #define R 2*r+1 16 | #define INPFILE freopen("input.in","r",stdin) 17 | #define BOOST ios_base::sync_with_stdio(false); cin.tie(NULL); 18 | using namespace std; 19 | 20 | int main() { 21 | ll t; get(t); 22 | while(t--) { 23 | ll n, k; 24 | get(n); get(k); 25 | ll sum = 0; 26 | FOR(i,1,n) 27 | { ll x; cin >> x; sum += x; sum %= 2; } 28 | 29 | ll num = 0; 30 | FOR(i,1,k) { 31 | num = ( sum%2 == 0 ) ? 1 : 0; 32 | sum += num; 33 | sum %= 2; 34 | } 35 | 36 | if(num) 37 | cout << "odd\n"; 38 | else 39 | cout << "even\n"; 40 | 41 | 42 | } 43 | } 44 | -------------------------------------------------------------------------------- /WTK.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long 3 | #define get(a) scanf("%ld", &a); 4 | #define rep(n) for( ll i = 0; i < n; i++ ) 5 | #define repVector(v) for( typeof(v.begin()) it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( set::iterator it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define max(a,b) ( (a > b) ? a : b ) 10 | #define min(a,b) ( (a < b) ? a : b ) 11 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 12 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 13 | #define matrix vector< vector > 14 | #define MOD 1000000007 15 | #define F first 16 | #define S second 17 | #define mp make_pair 18 | #define INPFILE freopen("input.in","r",stdin) 19 | using namespace std; 20 | 21 | ll rec( ll n, ll k ) { 22 | if( n == 1 ) 23 | return 1; 24 | return ( rec(n-1,k+1) + k-1 )%n+1; 25 | } 26 | 27 | int main() { 28 | ll t; get(t); 29 | while(t--) { 30 | ll n; get(n); 31 | printf("%ld\n", rec(n,1)); 32 | } 33 | } 34 | -------------------------------------------------------------------------------- /XC201.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%ld", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( typeof(v.begin()) it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( typeof(s.begin()) it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define pb push_back 9 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 10 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 11 | #define matrix vector< vector > 12 | #define F first 13 | #define S second 14 | #define mp make_pair 15 | #define L 2*r 16 | #define R 2*r+1 17 | #define INPFILE freopen("input.in","r",stdin) 18 | using namespace std; 19 | 20 | int main() { 21 | ll t; get(t); 22 | while(t--) { 23 | string s; 24 | cin >> s; 25 | 26 | ll ans = 0; 27 | 28 | FOR(i,0,s.size()-1) { 29 | bool mark[200] = {0}; 30 | FOR(j,i,s.size()-1) 31 | if( mark[s[j]] ) 32 | { ans = max( ans, j-i ); break; } 33 | else 34 | mark[s[j]] = 1; 35 | } 36 | 37 | cout << ans << endl; 38 | 39 | 40 | } 41 | } 42 | -------------------------------------------------------------------------------- /XRMTRX.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #define ll long long 3 | #define get(a) scanf("%lld", &a); 4 | #define rep(n) for( ll i = 1; i <= n; i++ ) 5 | #define repVector(v) for( typeof(v.begin()) it = v.begin(); it != v.end(); it++ ) 6 | #define repSet(s) for( typeof(s.begin()) it = s.begin(); it != s.end(); it++ ) 7 | #define all(c) c.begin(), c.end() 8 | #define MEM(a,b) memset(a,(b),sizeof(a)) 9 | #define MAX(a,b) ((a) > (b) ? (a) : (b)) 10 | #define MIN(a,b) ((a) < (b) ? (a) : (b)) 11 | #define pb push_back 12 | #define absol(a) ( ( a >= 0 ) ? a : -a ) 13 | #define FOR(i,a,b) for( ll i = a; i <= b; i++ ) 14 | #define matrix vector< vector > 15 | #define F first 16 | #define S second 17 | #define mp make_pair 18 | #define L 2*r 19 | #define R 2*r+1 20 | #define MOD 1000000007 21 | #define INPFILE freopen("input.in","r",stdin) 22 | #define gc getchar 23 | #define pc(x) putchar(x); 24 | using namespace std; 25 | 26 | int main() { 27 | ll t; get(t); 28 | while(t--) { 29 | ll l, r; 30 | get(l); get(r); 31 | 32 | FOR(i,l,r) { 33 | FOR(j,l,r) 34 | cout << (i^j) << " "; 35 | cout << "\n"; 36 | } 37 | } 38 | } 39 | -------------------------------------------------------------------------------- /rook.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | using namespace std; 5 | 6 | int main() { 7 | fstream f1; 8 | f1.open("raging_rooks.txt"); 9 | int n,m,i, xcount = 0, ycount = 0; 10 | int *x, *y; 11 | x = new int[1000001]; 12 | y = new int[1000001]; 13 | x[0] = 0; y[0] = 0; 14 | 15 | 16 | //getch(); 17 | int count = 0; 18 | while( f1 >> n >> m ) { 19 | //cout << " ( " << n <<" , "<< m <<" )\n"; 20 | //getch(); 21 | x[n] = 1; 22 | y[m] = 1; 23 | count++; 24 | } 25 | 26 | cout << count; 27 | 28 | cout << "\nPassed\n"; 29 | getch(); 30 | for(i = 1; i <= 1000000; i++ ) { 31 | if( x[i] != 1 ) 32 | xcount++; 33 | if( y[i] != 1) 34 | ycount++; 35 | } 36 | 37 | cout << "xcount: " << xcount <<" ycount: " << ycount; 38 | getch(); 39 | } 40 | 41 | --------------------------------------------------------------------------------