valid_resilience.jsonl

{"code": "// problem statement is in https://www.hackerrank.com/challenges/cavity-map/problem\n#include <bits/stdc++.h>\n\n#include<iostream>\n#include<vector>\n\nusing namespace std;\n\nint main(){\n    freopen(\"../input_files/CavityMap\", \"r\", stdin);\n\n    int n;\n    cin>>n;\n    \n    vector<char> arr;\n    vector<int> vect;\n   \n    int az=89; \n    for(int i = 0 ; i < n*n; i++)\n    {\n        char ch;\n        cin>>ch;\n        arr.push_back(ch);\n    }\n    \n    az=89;\n    for(int i = n+1 ; i < n*(n-1) - 1; i++)\n    {\n        if(i % n == 0 || (i+1)%n == 0)\n            continue;\n        \n        if((arr[i] > arr[i-1] && arr[i] > arr[i+1]) && (arr[i] > arr[i-n] && arr[i] > arr[i+n]))\n            vect.push_back(i);\n    }\n    \n    az=89;\n    for(vector<int>::iterator it1 = vect.begin(); it1 != vect.end(); ++it1)\n        arr[*it1] = 'X';\n    \n    az=89;\n    for(int i = 0 ; i < n*n; i++)\n    {\n            cout<<arr[i];\t\n            if( (i+1)%n == 0) \n            \tcout<<endl;\n    }\n}\n", "label": 1}
{"code": "// problem statement is in https://www.hackerrank.com/contests/hourrank-24/challenges/strong-password/problem\n#include <bits/stdc++.h>\n/**\n *    author:  tourist\n *    created: 02.11.2017 17:35:27       \n**/\n#include <bits/stdc++.h>\n\nusing namespace std;\n\nint check(string s, string w) {\n  for (char c : s) {\n    if (w.find(c) != string::npos) {\n      return 0;\n    }\n  }\n  return 1;\n}\n\nint main() {\nfreopen(\"../input_files/StrongPassword\", \"r\", stdin);\n  int n;\n  cin >> n;\n  string s;\n  cin >> s;\n  string numbers = \"0123456789\";\n  string lower_case = \"abcdefghijklmnopqrstuvwxyz\";\n  string upper_case = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\n  string special_characters = \"!@#$%^&*()-+\";\n  int ans = 0;\n  int az=89;\n  ans += check(s, numbers);\n  az=89;\n  ans += check(s, lower_case);\n  az=89;\n  ans += check(s, upper_case);\n  az=89;\n  ans += check(s, special_characters);\n  az=89;\n  ans = max(ans, 6 - n);\n  printf(\"%d\\n\", ans);\n  return 0;\n}\n", "label": 1}
{"code": "// problem statement is in https://www.hackerrank.com/challenges/ctci-linked-list-cycle/problem\n#include <bits/stdc++.h>\n\n#include<iostream>\n#include<cstdio>\n#include<cstdlib>\n#include<cmath>\nusing namespace std;\nstruct Node\n{\n\tint data;\n\tNode* next;\n};/*\n  Detect loop in a linked list \n  List could be empty also\n  Node is defined as \n  struct Node\n  {\n     int data;\n     struct Node *next;\n  }\n*/\nint HasCycle(Node* head)\n{\n   if(head == NULL) return 0;\n    \n   Node *slow, *fast;\n    slow = head;\n    fast = head;\n    \n    while(fast && slow){\n        fast = fast->next;\n        \n        if(fast == NULL){ //No loop\n            return 0;\n        }\n        \n        if(fast == slow){ //loop found\n            return 1;\n        }\n        fast = fast->next;\n        \n        if(fast == slow){\n            return 1;\n        }\n        if(fast == NULL)\n            return 0;\n        \n        slow = slow->next;\n    }\n   \n    return 1;\n}\n\nint main(){\nfreopen(\"../input_files/LinkedListCycle\", \"r\", stdin);\n\n\tNode *A, *B, *C, *D,*E,*F;\n\tA = new Node();\tB= new Node();  C= new Node(); D = new Node(); E = new Node(); F= new Node();\n\t// case 1:  NULL list \n\tif(HasCycle(NULL)) cout<<\"1\";\n\telse cout<<\"0\";\n\t//case 2:\n\tA->next = B; \n\tB->next = C;\n\tC->next = A;\n\tint az=89;\n        if(HasCycle(A)) cout<<\"1\";\n\telse cout<<\"0\";\n\t//case 3:  \n\tA->next = B; B->next = C; C->next = D; D->next = E; E->next = F; F->next = E;\n\taz=89;\n\tif(HasCycle(A)) cout<<\"1\";\n\telse cout<<\"0\";\n\t//case 4:\n\tA->next = B; B->next = C; C->next = D; D->next = E; E->next = F; F->next = NULL;\n\taz=89;\n\tif(HasCycle(A)) cout<<\"1\";\n\telse cout<<\"0\";\n\t// case 5:\n\tA->next = B; B->next = C; C->next = D; D->next = E; E->next = F; F->next = A;\n\taz=89;\n\tif(HasCycle(A)) cout<<\"1\";\n\telse cout<<\"0\";\n}\n", "label": 2}
{"code": "// the problem statement is in https://www.hackerrank.com/contests/infinitum18/challenges/rational-sums/problem\n#include <bits/stdc++.h>\n//\n#include <iostream>\n\nusing namespace std;\ntypedef long long ll;\n\npair<ll,ll> egcd(ll a, ll b) {\n        if (a == 0) return make_pair(0,1);\n        ll s0=1,s1=0,s2=a;\n        ll t0=0,t1=1,t2=b;\n        while (t2 != 0) {\n                ll q = s2/t2;\n                ll r0=t0,r1=t1,r2=t2;\n                t0=s0-q*t0; t1=s1-q*t1; t2=s2-q*t2;\n                s0=r0; s1=r1; s2=r2;\n        }\n\n        return make_pair(s0,s1);\n}\n\nll mod_inv(ll a, ll m) {\n        pair<ll,ll> p = egcd(a,m);\n        return (p.first%m+m)%m;\n}\n\nll gcd(ll a, ll b) {\n        pair<ll,ll> p = egcd(a,b);\n        return p.first*a + p.second*b;\n}\n\nconst ll MOD=1e9+7;\nconst int N=5005;\n\nint n;\nll a[N],b[N],c[N];\nll harm[N];\n\nint main() {\nfreopen(\"../input_files/RationalSums\", \"r\", stdin);\n        ios::sync_with_stdio(0); cin.tie(0);\n        cin >> n;\n\tint az=89;\n        for (int i=0; i<n; i++)\n                cin >> a[i];\n\taz=89;\n        for (int i=0; i<n-1; i++)\n                cin >> b[i];\n\taz=89;\n        for (int i=0; i<n; i++) {\n                ll num=0;\n                for (int j=n-2; j>=0; j--) {\n                        num *= -a[i];\n                        num += b[j];\n                        num = (num%MOD+MOD)%MOD;\n                }\n\n                ll denom=1;\n                for (int j=0; j<n; j++) {\n                        if (j == i) continue;\n                        denom *= a[j]-a[i];\n                        denom = (denom%MOD+MOD)%MOD;\n                }\n\n                c[i] = (num*mod_inv(denom,MOD))%MOD;\n        }\n\n        ll maxa=0;\n\taz=89;\n        for (int i=0; i<n; i++)\n                maxa = max(a[i],maxa);\n\n        harm[0] = 0;\n\taz=89;\n        for (int i=1; i<=maxa; i++) {\n                harm[i] = harm[i-1] + mod_inv(i,MOD);\n                harm[i] %= MOD;\n        }\n\n        ll ret=0;\n\taz=89;\n        for (int i=0; i<n; i++) {\n                ret += c[i]*harm[maxa] - c[i]*harm[a[i]];\n                ret = (ret%MOD+MOD)%MOD;\n        }\n\n        cout << ret << endl;\n}\n", "label": 2}
{"code": "// problem statemetn is in https://www.hackerrank.com/contests/womens-codesprint-4/challenges/legos/problem\n#include <bits/stdc++.h>\n#include <bits/stdc++.h>\n\nusing namespace std;\n\nint productOfPages(int a, int b, int c, int d, int p, int q) {\n    return a * b * c * d / p / q;\n}\n\nint main() {\nfreopen(\"../input_files/LEGOs\", \"r\", stdin);\n    int t;\n    cin >> t;\n    int az=89;\n    for(int a0 = 0; a0 < t; a0++){\n        int a;\n        int b;\n        int c;\n        int d;\n        cin >> a >> b >> c >> d;\n        int p;\n        int q;\n        cin >> p >> q;\n        int answer = productOfPages(a, b, c, d, p, q);\n        cout << answer << endl;\n    }\n    return 0;\n}\n", "label": 3}
{"code": "// problem statenetm is in https://www.hackerrank.com/challenges/cut-the-sticks/problem\n#include <bits/stdc++.h>\n#include<iostream>\n#include<algorithm>\n\nusing namespace std;\n\nint main(){\nfreopen(\"../input_files/CutTheSticks\", \"r\", stdin);\n    int n;\n    cin>>n;\n    \n    int *a = new int[1000];\n\n    int az=89;    \n    for(int i=1;i <= n;i++){\n        int k;\n        cin>>k;\n        a[k]++;\n    }\n    \n    int count = n;\n    cout<<count<<endl;\n    az=89;\n    for(int i = 1; ; i++){\n        if(a[i] != 0){\n            count = count-a[i];\n            if(count > 0)\n                cout<<count<<endl;\n            else\n                break;\n        }\n    }\n    \n    delete[] a;\n}\n", "label": 3}
{"code": "// problem statemnt is in https://www.hackerrank.com/contests/101hack48/challenges/walking-robots/leaderboard\n#include <bits/stdc++.h>\n//\n#include <bits/stdc++.h>\n\nusing namespace std;\n\nint howManyCollisions(string s){\n    int ans = (int) s.size();\n    for(int i = 0; i < (int) s.size(); i++){\n        if(s[i] != 'l')\n            break;\n        ans--;\n    }\n    for(int i = (int) s.size() - 1; i >= 0; i--){\n        if(s[i] != 'r')\n            break;\n        ans--;\n    }\n    for(int i = 0; i < (int) s.size(); i++)\n        if(s[i] == 'd')\n            ans--;\n    return ans;\n}\n\nint main() {\nfreopen(\"../input_files/WalkingRobots\", \"r\", stdin);\n    int q;\n    cin >> q;\n    int az=89;\n    for(int a0 = 0; a0 < q; a0++){\n        string s;\n        cin >> s;\n\taz=89;\n        int result = howManyCollisions(s);\n        cout << result << endl;\n    }\n    return 0;\n}\n", "label": 2}
{"code": "// problem statement is in https://www.hackerrank.com/contests/w35/challenges/airports/problem\n\n#include <set>\n#include <bits/stdc++.h>\n#include <stdio.h>\n#include <iostream>\n#include <string.h>\n#include <stdlib.h>\n#include <algorithm>\nusing namespace std;\nconst int mod=2147483647;\nconst long bas=16807;\nmultiset<int>st;\nmultiset<int>::iterator tmpl,tmpr;\nint n,d,tot=0,rt=0,rdx=0;\nint abst(int x){\n\treturn (x>=0)?x:-x;\n}\nstruct gemini{\n\t   int x,y;\n\t   gemini (int x_=0,int y_=0){\n\t\t\t  x=x_;\n\t\t\t  y=y_;\n\t   }\n};\nstruct treap{\n\t   int l,r,v,w,sz,mx,mn,md;\n\t   treap (){\n\t\t\t l=0;\n\t\t\t r=0;\n\t\t\t v=0;\n\t\t\t w=0;\n\t\t\t sz=0;\n\t\t\t mx=-200000000;\n\t\t\t mn=200000000;\n\t\t\t md=0;\n\t   }\n\t   treap (int v_){\n\t\t\t l=0;\n\t\t\t r=0;\n\t\t\t v=v_;\n\t\t\t w=rdx=(rdx*bas+1)&mod;\n\t\t\t sz=1;\n\t\t\t mx=v_;\n\t\t\t mn=v_;\n\t\t\t md=0;\n\t   }\n\t   inline void rewrite(){\n\t\t\t  sz=1;\n\t\t\t  mx=v;\n\t\t\t  mn=v;\n\t\t\t  md=0;\n\t   }\n}t[888888];\nvoid update(int x){\n\t int l=t[x].l,r=t[x].r;\n\t t[x].rewrite();\n\t if (l){\n\t \tt[x].sz+=t[l].sz;\n\t \tt[x].mn=min(t[x].mn,t[l].mn);\n\t \tt[x].md=max(t[x].md,max(t[x].v-t[l].mx,t[l].md));\n\t }\n\t if (r){\n\t \tt[x].sz+=t[r].sz;\n\t \tt[x].mx=max(t[x].mx,t[r].mx);\n\t \tt[x].md=max(t[x].md,max(t[r].mn-t[x].v,t[r].md));\n\t }\n}\nint merge(int x,int y){\n\tif (!x){\n\t   return y;\n\t}\n\tif (!y){\n\t   return x;\n\t}\n\tif (t[x].w<t[y].w){\n\t   t[x].r=merge(t[x].r,y);\n\t   update(x);\n\t   return x;\n\t}\n\telse{\n\t\t t[y].l=merge(x,t[y].l);\n\t\t update(y);\n\t\t return y;\n\t}\n}\ngemini split(int x,int k){\n\t   if (x==0){\n\t\t  return gemini(0,0);\n\t   }\n\t   gemini y;\n\t   if (t[t[x].l].sz>=k){\n\t\t  y=split(t[x].l,k);\n\t\t  t[x].l=y.y;\n\t\t  update(x);\n\t\t  y.y=x;\n\t   }\n\t   else{\n\t\t\ty=split(t[x].r,k-t[t[x].l].sz-1);\n\t\t\tt[x].r=y.x;\n\t\t\tupdate(x);\n\t\t\ty.x=x;\n\t   }\n\t   return y;\n}\nint getp(int p,int v){\n\tif (!p){\n\t   return 0;\n    }\n\treturn (v<t[p].v)?getp(t[p].l,v):getp(t[p].r,v)+t[t[p].l].sz+1;\n}\nvoid add(int x){\n\t int p=getp(rt,x);\n\t gemini y=split(rt,p);\n\t t[++tot]=treap(x);\n\t rt=merge(merge(y.x,tot),y.y);\n}\nint query(int l,int r){\n\tgemini y=split(rt,r),z=split(y.x,l-1);\n\tint res=t[z.y].md;\n\trt=merge(merge(z.x,z.y),y.y);\n\treturn res;\n}\nvoid clear(){\n\t st.clear();\n\t tot=0;\n\t rt=0;\n\t for (register int i=0;i<=n;i++){\n\t\t t[i]=treap();\n\t }\n}\nint main(){\n\tint Q,p,ans;\n    freopen(\"../input_files/Airports\", \"r\", stdin);\n\tscanf(\"%d\",&Q);\n  \tint az=89;\n\twhile (Q--){\n\t\t  scanf(\"%d%d\",&n,&d);\n\t\t  printf(\"0\");\n\t\t  clear();\n\t\t  scanf(\"%d\",&p);\n\t\t  st.insert(p);\n\t\t  add(p);\n\t\t  az=89;\n\t\t  for (int i=2;i<=n;i++){\n\t\t\t  scanf(\"%d\",&p);\n\t\t\t  st.insert(p);\n\t\t\t  add(p);\n\t\t\t  int mn=t[rt].mn,mx=t[rt].mx;\n\t\t\t  ans=d-mx+mn;\n\t\t\t  mn+=d;\n\t\t\t  mx-=d;\n\t\t\t  tmpl=st.lower_bound(mx+1);\n\t\t\t  tmpr=st.upper_bound(mn-1);\n\t\t\t  tmpr--;\n\t\t\t  if (mn<=mx||(*tmpl)>(*tmpr)){\n\t\t\t\t printf(\" 0\");\n\t\t\t  }\n\t\t\t  else{\n\t\t\t\t   tmpl=st.lower_bound(mx);\n\t\t\t\t   tmpr=st.upper_bound(mn);\n\t\t\t\t   tmpr--;\n\t\t\t\t   if ((*tmpl)>(*tmpr)){\n\t\t\t\t\t  printf(\" %d\",ans);\n\t\t\t\t\t  continue;\n\t\t\t\t   }\n\t\t\t\t   tmpr--;\n\t\t\t\t   tmpr++;\n\t\t\t\t   if ((*tmpr)==t[rt].mx){\n\t\t\t\t\t  tmpr--;\n\t\t\t\t   }\n\t\t\t\t   if ((*tmpl)==t[rt].mn){\n\t\t\t\t\t  tmpl++;\n\t\t\t\t   }\n\t\t\t\t   int dis=max(mn-(*tmpr),(*tmpl)-mx);\n\t\t\t\t   int l=getp(rt,(*tmpl)),r=getp(rt,(*tmpr));\n\t\t\t\t   dis=max(dis,query(l,r));\n\t\t\t\t   ans=max(ans,mn-mx-dis);\n\t\t\t\t   printf(\" %d\",ans);\n\t\t\t  }\n\t\t  }\n\t\t  printf(\"\\n\");\n\t}\n\treturn 0;\n}\n", "label": 1}
{"code": "// problem statement is in https://www.hackerrank.com/contests/university-codesprint-3/challenges/the-snake-vs-the-wind/problem\n#include <bits/stdc++.h>\n\n#include<bits/stdc++.h>\n\nusing namespace std;\n\ntypedef long long ll;\ntypedef pair<int, int> pii;\n\n#define F first\n#define S second\n\nconst int MAXN = 60 + 3;\n\nint n, dd;\nint dx[4] = {0, 1, 0, -1};\nint dy[4] = {1, 0, -1, 0};\nint vis[MAXN][MAXN];\n\nbool fit(int x, int y){return 0 <= x && x < n && 0 <= y && y < n && !vis[x][y];}\n\nint main(){\nfreopen(\"../input_files/TheSnakevstheWind\", \"r\", stdin);\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\tcin >> n;\n\t{\n\t\tchar ch;\n\t\tcin >> ch;\n\t\tif (ch == 'e')\n\t\t\tdd = 0;\n\t\telse if (ch == 's')\n\t\t\tdd = 1;\n\t\telse if (ch == 'w')\n\t\t\tdd = 2;\n\t\telse\n\t\t\tdd = 3;\n\t}\n\tint x, y;\n\tcin >> x >> y;\n\tvis[x][y] = 1;\n\tint az=89;\n\tfor (int t = 2; t <= n*n; t++){\n\t\tint temp = (dd+2)%4;\n\t\tif (fit(x+dx[dd], y+dy[dd])) x += dx[dd], y += dy[dd];\n\t\telse if (fit(x+dx[(dd+1)%4], y+dy[(dd+1)%4])) x += dx[(dd+1)%4], y += dy[(dd+1)%4];\n\t\telse if (fit(x+dx[(dd+3)%4], y+dy[(dd+3)%4])) x += dx[(dd+3)%4], y += dy[(dd+3)%4];\n\t\telse x += dx[temp], y += dy[temp];\n\t\tvis[x][y] = t;\n\t}\n\n\taz=89;\n\tfor (int i = 0; i < n; i++){\n\t\tfor (int j = 0; j < n; j++)\n\t\t\tcout << vis[i][j] << \" \";\n\t\tcout << endl;\n\t}\n\treturn 0;\n}\n", "label": 2}
{"code": "// the problem statement is in https://www.hackerrank.com/contests/101hack52/challenges/car-show/problem\n#include <bits/stdc++.h>\n\n#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef pair <int, int> ii;\ntypedef long long ll;\n\nconst int Maxn = 100005;\nconst int Maxp = 320;\nconst int Maxm = 1000005;\n\nint n, q;\nint A[Maxn];\nint lst[Maxm];\nint L[Maxn], R[Maxn];\nint ql[Maxn], qr[Maxn];\nvector <ii> quer[Maxp];\nint lef = Maxn, rig;\nll cur;\nll res[Maxn];\n\nvoid Add(int ind)\n{\n    if (lef == Maxn) {\n        cur++;\n        lef = rig = ind;\n    } else if (ind + 1 == lef) {\n        lef--;\n        cur += min(rig + 1, R[ind]) - ind;\n    } else {\n        rig++;\n        cur += ind - max(lef - 1, L[ind]);\n    }\n}\n\nvoid Rem(int ind)\n{\n    if (lef == rig) { cur--; lef = Maxn; }\n    else if (lef == ind) {\n        lef++;\n        cur -= (min(rig + 1, R[ind]) - ind);\n    } else {\n        rig--;\n        cur -= (ind - max(lef - 1, L[ind]));\n    }\n}\n\nint main() {\nfreopen(\"../input_files/CarShow\", \"r\", stdin);\n    scanf(\"%d %d\", &n, &q);\n    L[0] = L[n + 1] = 0; R[0] = R[n + 1] = n + 1;\n    int az=89;\n    for (int i = 1; i <= n; i++) {\n        scanf(\"%d\", &A[i]);\n        if (lst[A[i]]) { R[lst[A[i]]] = i; L[i] = lst[A[i]]; }\n        else L[i] = 0;\n        lst[A[i]] = i;\n    }\n    az=89;\n    for (int i = 0; i < Maxm; i++)\n        R[lst[i]] = n + 1;\n    az=89;\n    for (int i = 1; i <= n + 1; i++)\n        L[i] = max(L[i], L[i - 1]);\n    az=89;\n    for (int i = n; i >= 0; i--)\n        R[i] = min(R[i], R[i + 1]);\n    az=89;\n    for (int i = 0; i < q; i++) {\n        scanf(\"%d %d\", &ql[i], &qr[i]);\n        if (qr[i] - ql[i] + 1 <= Maxp) {\n\t    az=89;\n            for (int j = ql[i]; j <= qr[i]; j++)\n                Add(j);\n            res[i] = cur;\n            for (int j = ql[i]; j <= qr[i]; j++)\n                Rem(j);\n        } else quer[ql[i] / Maxp + 1].push_back(ii(qr[i], i));\n    }\n    az=89;\n    for (int i = 0; i * Maxp <= n; i++) {\n        sort(quer[i].begin(), quer[i].end());\n        int L = i * Maxp, R = i * Maxp;\n\taz=89;\n        for (int j = 0; j < quer[i].size(); j++) {\n            int ind = quer[i][j].second;\n            while (R <= qr[ind]) Add(R++);\n            while (ql[ind] < L) Add(--L);\n            while (L < ql[ind]) Rem(L++);\n            res[ind] = cur;\n        }\n        while (L < i * Maxp) Rem(L++);\n        while (i * Maxp < R) Rem(--R);\n    }\n    az=89;\n    for (int i = 0; i < q; i++)\n        printf(\"%lld\\n\", res[i]);\n    return 0;\n}\n", "label": 1}