dasd

Author: kumar80

.vscode/settings.json

@@ -43,7 +43,37 @@
         "thread": "cpp",
         "tuple": "cpp",
         "type_traits": "cpp",
-        "typeindex": "cpp"
+        "typeindex": "cpp",
+        "any": "cpp",
+        "bit": "cpp",
+        "cctype": "cpp",
+        "cfenv": "cpp",
+        "charconv": "cpp",
+        "cinttypes": "cpp",
+        "clocale": "cpp",
+        "codecvt": "cpp",
+        "csetjmp": "cpp",
+        "csignal": "cpp",
+        "cstdarg": "cpp",
+        "cstddef": "cpp",
+        "cstdint": "cpp",
+        "cstdio": "cpp",
+        "cstdlib": "cpp",
+        "cstring": "cpp",
+        "ctime": "cpp",
+        "cuchar": "cpp",
+        "cwctype": "cpp",
+        "map": "cpp",
+        "set": "cpp",
+        "algorithm": "cpp",
+        "memory": "cpp",
+        "memory_resource": "cpp",
+        "numeric": "cpp",
+        "optional": "cpp",
+        "system_error": "cpp",
+        "iomanip": "cpp",
+        "typeinfo": "cpp",
+        "variant": "cpp"
     },
     "competitive-programming-helper.firstTime": false,
     "compile-hero.disable-compile-files-on-did-save-code": true,

753a.cpp

@@ -0,0 +1,24 @@
+#include<bits/stdc++.h>
+using namespace std;
+ 
+#define fastio ios_base::sync_with_stdio(0); cin.tie(0)
+#define LL long long 
+#define mod 1000000007 
+#define all(v) v.begin(),v.end()
+#define pr(v) pair<v,v>
+#define pb push_back
+#define FOR(i, j, k) for (auto i=j ; i<k ; i++)
+#define ROF(i, j, k) for (auto i=j ; i>=k ; i--) 
+#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
+#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false); debug("%s time : %.4fs", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
+
+const long long INF = 1e18;
+const long long MAX = 2e5+10;
+
+int main(){
+    fastio;
+    int t; cin>>t;
+    while(t--){
+        
+    }
+}

753b.cpp

@@ -0,0 +1,24 @@
+#include<bits/stdc++.h>
+using namespace std;
+ 
+#define fastio ios_base::sync_with_stdio(0); cin.tie(0)
+#define LL long long 
+#define mod 1000000007 
+#define all(v) v.begin(),v.end()
+#define pr(v) pair<v,v>
+#define pb push_back
+#define FOR(i, j, k) for (auto i=j ; i<k ; i++)
+#define ROF(i, j, k) for (auto i=j ; i>=k ; i--) 
+#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
+#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false); debug("%s time : %.4fs", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
+
+const long long INF = 1e18;
+const long long MAX = 2e5+10;
+
+int main(){
+    fastio;
+    int t; cin>>t;
+    while(t--){
+
+    }
+}

T

@@ -0,0 +1,125 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+#define fastio                    \
+    ios_base::sync_with_stdio(0); \
+    cin.tie(0)
+#define LL long long
+#define mod 998244353
+#define FOR(i, j, k) for (int i = j; i < k; i++)
+#define ROF(i, j, k) for (int i = j; i >= k; i--)
+#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
+#define time__(d) for (long blockTime = 0; (blockTime == 0 ? (blockTime = clock()) != 0 : false); debug("%s time : %.4fs", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
+const long long INF = 1e18;
+const long long MAX = 1e5 + 10;
+
+LL ans = INT_MIN;
+bool isOp(char c)
+{
+    return (c == '+' || c == '-' || c == '*' || c == '/');
+}
+
+bool prio(char c)
+{
+    if (c == '+' || c == '-')
+        return 1;
+    return 2;
+}
+
+long long cal(LL a, LL b, char o)
+{
+    if (o == '+')
+        return a + b;
+    if (o == '-')
+        return a - b;
+    if (o == '*')
+        return a * b;
+    return a / b;
+}
+
+void eval(string s)
+{
+    int n = s.size();
+    if (isOp(s[0]) || isOp(s[n - 1]))
+        return;
+    for (int i = 0; i < n - 1; i++)
+        if (isOp(s[i]) && isOp(s[i + 1]))
+            return;
+    vector<LL> v;
+    string op;
+    LL a = 0;
+    for (int i = 0; i < n; i++)
+    {
+        if (isOp(s[i]))
+        {
+            v.push_back(a);
+            a = 0;
+            op += s[i];
+        }
+        else
+            a = a * 10 + (s[i] - '0');
+    }
+    v.push_back(a);
+    if (op.size() == 1)
+    {
+        ans = max(ans, cal(v[0], v[1], op[0]));
+    }
+    else
+    {
+        if (prio(op[0]) >= prio(op[1]))
+        {
+            LL temp = cal(v[0], v[1], op[0]);
+            temp = cal(temp, v[2], op[1]);
+            ans = max(ans, temp);
+        }
+        else
+        {
+            LL temp = cal(v[1], v[2], op[1]);
+            temp = cal(v[0], temp, op[0]);
+            ans = max(ans, temp);
+        }
+    }
+}
+LL cnt = 0;
+void permute(string s, string answer)
+{
+    if (s.length() == 0)
+    { cout<<"answer"<<" ";
+        cnt++;
+        eval(answer);
+        return;
+    }
+    for (int i = 0; i < s.length(); i++)
+    {
+        char ch = s[i];
+        string left_substr = s.substr(0, i);
+        string right_substr = s.substr(i + 1);
+        string rest = left_substr + right_substr;
+        permute(rest, answer + ch);
+    }
+}
+
+int main()
+{
+    fastio;
+    int t = 1;
+    cin >> t;
+    time__("dsad")
+    {
+        while (t--)
+        {
+            string s;
+            cin >> s;
+            //  permute(s,"");
+            sort(s.begin(), s.end());
+            while (next_permutation(s.begin(), s.end()))
+            {   cnt++;
+                eval(s);
+            }
+
+            cout << ans << " "<<cnt<<"\n";
+            cnt=0;
+            ans = INT_MIN;
+        }
+    }
+}

a.out

@@ -0,0 +1,63 @@
+
+#include <bits/stdc++.h>
+using namespace std;
+
+
+pair<int,int> printClosest(vector<vector<int>> ar1, vector<vector<int>> ar2, int m, int n, int x)
+{
+	int diff = INT_MAX;
+	int res_l=-1, res_r=-1;
+
+	int l = 0, r = n-1;
+	while (l<m && r>=0)
+	{
+	if (abs(ar1[l][1] + ar2[r][1] - x) < diff)
+	{
+		res_l = l;
+		res_r = r;
+		diff = abs(ar1[l][1] + ar2[r][1] - x);
+	}
+	if (ar1[l][1] + ar2[r][1] > x)
+		r--;
+	else 
+		l++;
+	}
+    if(res_l==-1) return {-1,-1};
+
+    return {ar1[res_l][1],ar2[res_r][1]};
+}
+
+bool cmp(vector<int>&a, vector<int>&b){
+    return (a[1]==a[1] ? a[0]<b[0]: a[1]<b[1]);
+}
+
+int main()
+{
+	vector<vector<int>> ar1 = {{2,7},{3,14}};// {{1,3},{2,5},{3,7},{4,10}};
+	vector<vector<int>> ar2  = {{2,10},{3,14}}; //{{1,2},{2,3},{3,4},{4,5}};
+    vector<int>a1[10000];
+    vector<int>a2[10000];
+    sort(ar1.begin(),ar1.end(),cmp);
+    sort(ar2.begin(),ar2.end(),cmp);
+    map<int,int>m1,m2;
+	int x = 16;
+	int n = ar1.size();
+	int m = ar2.size();
+    for(int i=0;i<n;i++) a1[ar1[i][1]].push_back(ar1[i][0]),m1[ar1[i][1]]++;
+    for(int i=0;i<m;i++) a2[ar2[i][1]].push_back(ar2[i][0]),m2[ar2[i][1]]++;
+	auto pr = printClosest(ar1, ar2, n, m, x);
+
+    vector<pair<int,int>>res;
+    int p = pr.first,q=pr.second;
+    int tot = p+q; 
+    for(int i=0;i<n && tot<=x;i++){
+        int s = ar1[i][1],e = tot-s;
+        if(!m2[e] ) continue;
+            for(int j=0;j<a1[s].size();j++){
+                for(int k=0;k<a2[e].size();k++) res.push_back({a1[s][j],a2[e][k]});
+            }
+        }
+    for(auto i : res) cout<<i.first<<" "<<i.second<<"\n";
+	return 0;
+}
+

adv.cpp

@@ -8,7 +8,7 @@
 # g++ wo.cpp
 # ./a.out < in.txt  > sol.txt
 g++ $1
-./a.out < input.txt  > out.txt
+./a.out  < input.txt  > out.txt
 
 # if [[ $(diff sol.txt out.txt ) ]]; then
 #     echo ***********************DIFFERENT ANSWER***********************

bne.cpp

@@ -1,20 +1,30 @@
-
-2
-5 4
-1 2
-6 7
-9 12
-24 24
-41 50
-
-8 7 10 9
-
-24 4 14 24
-
-1 1
-
-42 42
-
 1
-
-24
+ti
+Starteatingwellwiththeseeighttipsforhealthyeating,whichcoverthebasicsofahealthydietandgoodnutrition
+2
+ing
+Thedoublehelixformsthestructuralbasisofsemi-conservativeDNAreplication.1,2Lessintuitively,italsohasimplicationsontheinformationcontentofDNAfordouble-strandedDNAassuchonlyhasabouthalfthestoragecapacityofsingle-strandedDNA.Thisisbecauseagivensequenceanditsreversecomplement,whilethesameinthedouble-strandedform,aredifferententitiesinsingle-strandedDNA?exceptforthosesequenceswhichareidenticaltotheirreversecomplement
+3
+th
+Lemierresyndromeiscausedbyaninfectionintheoropharyngealregionwithsubsequentthrombophlebitisintheinternaljugularvein.Thethrombusfromthethrombophlebitiscaninvadeothervitalorgans,suchasliver,lungs,orjoints,resultinginsecondaryinfection,whichfurtherexacerbatesthefatalprognosisofthissyndrome.Lemierresyndrome,alsocalledpostanginalsepsisornecrobacillosis,wasfirstreportedbyDr.Lemierrein1936.Inhisreport,Lemierrementionedthatoutof20patientswhosufferedfromthissyndrome,onlytwosurvived.Healsostatedthatallofthe20patientscomplainedofinfectionsinthepalatinetonsilsanddevelopedsepsisandthrombophlebitisintheinternaljugularvein.Oncecalleda"forgottendisease,"thissyndromeshowedaveryhighmortalityrateuntilusageofantibioticsbecameprevalent
+4
+tion
+Non-applicationdecreasedshootlengthandreducednumberofunnecessarysecondaryshootsby39%comparedwiththeconventionalrate,notaffectingyieldandweight,color,firmness,andsolublesolidsoffruits.Nosignificantdifferencewasalsofoundintheyieldandthefruitcharacteristicsamongthetreesfertilizedwithdifferentrates.Concentrationsofsolublesugars,starch,N,andKofdormantshootsinMarchofthefollowingyearwerenotsignificantlychangedbythedifferenttreatmentsofthepreviousyear.Therewasnosignificantdifferenceofshootgrowthandyieldamongthetreatmentsthefollowingyearwhenthesamefertilizationratewassuppliedtoallthetrees
+5
+to
+Duetoincreasedinterestincharactercostumes,thefieldofanimationcharactercostumedesignisgraduallydevelopingintoaspecializeddomain.Thecostume-makingprocessforanimationcharacterspresentsmanydifferencesfromthecostume-makingprocessforregularapparel.However,thereremainsinsufficientresearchontheactualprocessofmakingthecharactercostumesusedinstopmotionvideosbothinKoreaandabroad.Thepurposeofthisstudyistoestablishacostumedesignprocessforanimationcharacters.Furthermore,thisstudypresentsacasestudyonthecostumeplanningandmakingprocessfor3Dstopmotionanimationcharacters.Thecharactercostume-makingprocesswassegmentalizedintothefollowingstages:characteranalysisstage,charactermodelingstage,andcharactercostumemakingstage
+6
+by
+InKorea,noinstitutionaltoolorregulationexistsbywhicharetailbusinessinchargeofgatheringandmaintainingsubscriberscanbeguaranteedindependencefromthewholesalebusinessdivisionofafixedincumbentproviderofessentialfacilitiessuchasducts,polesandcopperorfibercables,whichmayalsobeofferingthesameproductstoitsrivals.Forthatreason,awholesaledivisionmayhaveanincentivetointentionallydisruptthesharingoffacilitiesrequestedbycompetitiveoperatorsincooperationwiththeretaildivision.Ultimately,thefacilitysharingprocesswillremaininactivewhenthereisalackofequivalentaccesstothefixedaccessnetwork
+7
+as
+Theaimofthisstudywastofindtypologyoffashion-relatedmobileapplicationsthroughexploratoryinvestigationandtoinvestigatedifferencesinKoreaandU.S.Appstores.Andthen,throughthequalitativeevaluationaboutfashionmobileapplications,thisstudyproposesfashionmobileapplication'sdesignandcontentswhichcanbepreferredbyusers.Byconductingkeywordsearchineachstore,122Koreanapplicationsand150USapplicationswereanalyzed.Empiricalfindingsrevealedthatthereweresevenmajortypesoffashionmobileapplications:brand,magazine,information,SNS,game,shoppingandcoordination.Informationtypeapplicationstookupthelargestportion,andSNSandgametypeapplicationsshowedhigherrankingamongcustomers
+8
+the
+rimaryvaricellainfectionusuellyrunsabenignclinicalcourseinthehelthypopulation.However,hemorrhagicchickenpoxpresentswithaveryextensiveeruptionofhemorrhagicvesiclesinpatientswithdecreaedplateletsorimpairedimmunityandisaccompaniedbysevereconstitutionalsymptoms.A7-year-oldmalewasadmiduetoabdompalpainfor1dayandpeneralizedvesiculareruptionfor5days.Theeruptionfirstappearedonthetrunkandthenspreadtoinvolvedface,scalpandextrsmities.Theskinrashwascompatablewithvaricellabutdespitetheadministrationofacclovirintravenously,thevesiculareruptionbecamehemorrhagic.Tendaysafteradmission,havingexperiencedcardiscarresttwiceandwithhismentalstateincoms,hewasdisehargedashissituationwashopelesa
+9
+of
+Thebookconsistsofthirteenchaptersinfiveparts.InthefirstpartHarmlessdescribessomeofthegeneralandreligiousbackgroundtofourth-andfifth-centuryEgypt,whichhelpstoplacewhatfollowsinabroadercontext.InhissecondparthediscussesAntonyandPachomius,althoughheacknowledgesthatAntonyisnotthehistoricalbeginningofmonasticism.HemovesnexttodiscusstheDesertFathers,exploringsomeofthetexts,characters,themes,locations,andhistories.Thisleadsthewayforreflectionsonthetheologyandworksoftwomonastictheologians,EvagriusPonticusandJohnCassian.Itmayseemoddatfirstglancethatthefinalsectionofthebook(��Reflections��)shouldaddresstheoriginsofmonasticism,butHarmlessjustifiesthisfromhisexperienceasaneducator;peoplefinditeasiertoengagewithscholarlydiscussionsconcerningmonasticoriginsoncetheyarefamiliarwiththecharacters,texts,andthemes
+10
+es
+Intheinitialstage,domesticgamesbasedonlineconcentratedongamedevelopmentfocusingonincomeforsomegenres.However,variouscontentsfocusingonsmartenvironmentandsocialnetworkareexpandedatpresentandgamematerialsaredevelopedformorevariousobjects.So,thisstudyintendstoexaminenewcategory,positivegame,fromtheaspectofgamedesignerforgameapproachbasedonvariousobjects.And,gameapproachingprocessinthecategorybasedonpleasurewasorganizedfromthestandpointofdesigner,forthedesignerapproachintheprecedentstageofpositivegamedevelopment.Fromtheaspectofdesigner,systemicityofgamecategoryanddesignapproacharenecessarytoexpandwire-wirelessenvironmentandnewenvironmentbasedontheconvergencemediatointeractivecontentsfocusingongames

check.sh

@@ -1,3 +1,11 @@
-3
-2 3 2
-
+1
+3 3 3 6
+9 6 7 
+4 3 9 
+6 4 6 
+2 1
+2 0
+0 0
+1 0
+0 2
+1 23