Skip to content

Commit 8921673

Browse files
Pankajcoder1Pankajcoder1
committed
practice
1 parent 5fe0850 commit 8921673

33 files changed

+2904
-4
lines changed

‎README.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -5,7 +5,7 @@ Contain file of my [competitive programming](https://en.wikipedia.org/wiki/Compe
55
- [Hackerrank](https://www.hackerrank.com/)
66
- [Hackerearth](https://www.hackerearth.com/)
77
- [CSES](https://cses.fi/problemset/)
8-
- Facebook hacker cup
8+
- [Facebook hacker cup](https://www.facebook.com/codingcompetitions/hacker-cup)
99

1010

1111
Executable codes to contest problems in [c++](https://medium.com/sololearn/reasons-to-love-c-11c7c2f23d88)

‎Template.cpp

+10-3
Original file line numberDiff line numberDiff line change
@@ -3,10 +3,13 @@
33
country:-INDIA
44
*/
55
#include <bits/stdc++.h>
6+
#include <ext/pb_ds/assoc_container.hpp>
7+
#include <ext/pb_ds/tree_policy.hpp>
68
using namespace std;
9+
using namespace __gnu_pbds;
710
typedef long long ll ;
811
typedef vector<ll> vl;
9-
#define pan cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
12+
#define speed cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
1013
// define values.
1114
// #define mod 1000000007
1215
#define phi 1.618
@@ -28,6 +31,10 @@ typedef vector<ll> vl;
2831
#define srt(V) sort(all(V))
2932
#define srtGreat(V) sort(all(V),greater<ll>())
3033
#define printv(v) for(ll i=0;i<ll(v.size());i++){cout<<v[i]<<" ";} line;
34+
/* ONLINE JUDGE */
35+
#ifdef ONLINE_JUDGE
36+
freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);
37+
#endif
3138
// function
3239

3340
ll power(ll x,ll y,ll mod)
@@ -61,7 +68,7 @@ ll solve()
6168

6269
int main()
6370
{
64-
pan;
71+
speed;
6572
//freopen("input.txt"a, "r", stdin);
6673
// solve();
6774
cc
@@ -74,4 +81,4 @@ int main()
7481
* int overflow
7582
* special test case (n=0||n=1||n=2)
7683
* don't get stuck on one approach if you get wrong answer
77-
*/
84+
*/

‎a.out

2.01 KB
Binary file not shown.

‎codeforces/139A-Petr_and_Book.cpp

+108
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,108 @@
1+
/*
2+
written by Pankaj Kumar.
3+
country:-INDIA
4+
*/
5+
#include <bits/stdc++.h>
6+
#include <ext/pb_ds/assoc_container.hpp>
7+
#include <ext/pb_ds/tree_policy.hpp>
8+
using namespace std;
9+
using namespace __gnu_pbds;
10+
typedef long long ll ;
11+
typedef vector<ll> vl;
12+
#define speed cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
13+
// define values.
14+
// #define mod 1000000007
15+
#define phi 1.618
16+
/* Abbrevations */
17+
#define ff first
18+
#define ss second
19+
#define mp make_pair
20+
#define line cout<<endl;
21+
#define pb push_back
22+
#define Endl "\n"
23+
// loops
24+
#define forin(arr,n) for(ll i=0;i<n;i++) cin>>arr[i];
25+
// Some print
26+
#define no cout<<"NO"<<endl;
27+
#define yes cout<<"YES"<<endl;
28+
#define cc ll test;cin>>test;while(test--)
29+
// sort
30+
#define all(V) (V).begin(),(V).end()
31+
#define srt(V) sort(all(V))
32+
#define srtGreat(V) sort(all(V),greater<ll>())
33+
#define printv(v) for(ll i=0;i<ll(v.size());i++){cout<<v[i]<<" ";} line;
34+
// some extra
35+
#define sz(V) ll(V.size())
36+
/* ONLINE JUDGE */
37+
// #ifdef ONLINE_JUDGE
38+
// freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);
39+
// #endif
40+
// function
41+
42+
ll power(ll x,ll y,ll mod)
43+
{
44+
ll res=1;
45+
// x=x%mod;
46+
while(y>0)
47+
{
48+
if(y%2==1)
49+
{
50+
res*=x;
51+
// res=res%mod;
52+
}
53+
y/=2; x*=x; // x=x%mod;
54+
}
55+
return res;
56+
}
57+
// datatype definination
58+
#define ordered_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
59+
60+
/* ascii value
61+
A=65,Z=90,a=97,z=122
62+
*/
63+
/* -----------------------------------------------------------------------------------*/
64+
65+
ll solve()
66+
{
67+
ll n;
68+
cin>>n;
69+
ll ans=0;
70+
vl v(7,0);
71+
forin(v,7);
72+
vl pre(7);
73+
pre[0]=v[0];
74+
for(ll i=1;i<7;i++)
75+
{
76+
pre[i]=pre[i-1]+v[i];
77+
}
78+
ll sum=accumulate(all(v),0LL);
79+
while(n>sum)
80+
n-=sum;
81+
for(ll i=0;i<7;i++)
82+
{
83+
if(n<=pre[i])
84+
{
85+
ans=i+1;
86+
break;
87+
}
88+
}
89+
cout<<ans<<endl;
90+
return 0;
91+
}
92+
93+
int main()
94+
{
95+
speed;
96+
//freopen("input.txt"a, "r", stdin);
97+
solve();
98+
// cc
99+
// {
100+
// solve();
101+
// }
102+
}
103+
104+
/* stuff you should look before submission
105+
* int overflow
106+
* special test case (n=0||n=1||n=2)
107+
* don't get stuck on one approach if you get wrong answer
108+
*/

‎codeforces/141A-Amusing_Joke.cpp

+99
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,99 @@
1+
/*
2+
written by Pankaj Kumar.
3+
country:-INDIA
4+
*/
5+
#include <bits/stdc++.h>
6+
#include <ext/pb_ds/assoc_container.hpp>
7+
#include <ext/pb_ds/tree_policy.hpp>
8+
using namespace std;
9+
using namespace __gnu_pbds;
10+
typedef long long ll ;
11+
typedef vector<ll> vl;
12+
#define speed cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
13+
// define values.
14+
// #define mod 1000000007
15+
#define phi 1.618
16+
/* Abbrevations */
17+
#define ff first
18+
#define ss second
19+
#define mp make_pair
20+
#define line cout<<endl;
21+
#define pb push_back
22+
#define Endl "\n"
23+
// loops
24+
#define forin(arr,n) for(ll i=0;i<n;i++) cin>>arr[i];
25+
// Some print
26+
#define no cout<<"NO"<<endl;
27+
#define yes cout<<"YES"<<endl;
28+
#define cc ll test;cin>>test;while(test--)
29+
// sort
30+
#define all(V) (V).begin(),(V).end()
31+
#define srt(V) sort(all(V))
32+
#define srtGreat(V) sort(all(V),greater<ll>())
33+
#define printv(v) for(ll i=0;i<ll(v.size());i++){cout<<v[i]<<" ";} line;
34+
// some extra
35+
#define sz(V) ll(V.size())
36+
/* ONLINE JUDGE */
37+
// #ifdef ONLINE_JUDGE
38+
// freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);
39+
// #endif
40+
// function
41+
42+
ll power(ll x,ll y,ll mod)
43+
{
44+
ll res=1;
45+
// x=x%mod;
46+
while(y>0)
47+
{
48+
if(y%2==1)
49+
{
50+
res*=x;
51+
// res=res%mod;
52+
}
53+
y/=2; x*=x; // x=x%mod;
54+
}
55+
return res;
56+
}
57+
// datatype definination
58+
#define ordered_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
59+
60+
/* ascii value
61+
A=65,Z=90,a=97,z=122
62+
*/
63+
/* -----------------------------------------------------------------------------------*/
64+
65+
ll solve()
66+
{
67+
string a,b,c;
68+
cin>>a>>b>>c;
69+
vl v(26,0);
70+
for(auto x:a)
71+
v[x-'A']++;
72+
for(auto x:b)
73+
v[x-'A']++;
74+
for(auto x:c)
75+
v[x-'A']--;
76+
for(ll i=0;i<26;i++)
77+
{
78+
if(v[i]!=0)
79+
{
80+
no
81+
return 0;
82+
}
83+
}
84+
yes
85+
return 0;
86+
}
87+
88+
int main()
89+
{
90+
speed;
91+
//freopen("input.txt"a, "r", stdin);
92+
solve();
93+
}
94+
95+
/* stuff you should look before submission
96+
* int overflow
97+
* special test case (n=0||n=1||n=2)
98+
* don't get stuck on one approach if you get wrong answer
99+
*/

‎codeforces/144A-Arrival_of_the_General.cpp

+104
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,104 @@
1+
/*
2+
written by Pankaj Kumar.
3+
country:-INDIA
4+
*/
5+
#include <bits/stdc++.h>
6+
#include <ext/pb_ds/assoc_container.hpp>
7+
#include <ext/pb_ds/tree_policy.hpp>
8+
using namespace std;
9+
using namespace __gnu_pbds;
10+
typedef long long ll ;
11+
typedef vector<ll> vl;
12+
#define speed cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
13+
// define values.
14+
// #define mod 1000000007
15+
#define phi 1.618
16+
/* Abbrevations */
17+
#define ff first
18+
#define ss second
19+
#define mp make_pair
20+
#define line cout<<endl;
21+
#define pb push_back
22+
#define Endl "\n"
23+
// loops
24+
#define forin(arr,n) for(ll i=0;i<n;i++) cin>>arr[i];
25+
// Some print
26+
#define no cout<<"NO"<<endl;
27+
#define yes cout<<"YES"<<endl;
28+
#define cc ll test;cin>>test;while(test--)
29+
// sort
30+
#define all(V) (V).begin(),(V).end()
31+
#define srt(V) sort(all(V))
32+
#define srtGreat(V) sort(all(V),greater<ll>())
33+
#define printv(v) for(ll i=0;i<ll(v.size());i++){cout<<v[i]<<" ";} line;
34+
// some extra
35+
#define sz(V) ll(V.size())
36+
/* ONLINE JUDGE */
37+
// #ifdef ONLINE_JUDGE
38+
// freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);
39+
// #endif
40+
// function
41+
42+
ll power(ll x,ll y,ll mod)
43+
{
44+
ll res=1;
45+
// x=x%mod;
46+
while(y>0)
47+
{
48+
if(y%2==1)
49+
{
50+
res*=x;
51+
// res=res%mod;
52+
}
53+
y/=2; x*=x; // x=x%mod;
54+
}
55+
return res;
56+
}
57+
// datatype definination
58+
#define ordered_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
59+
60+
/* ascii value
61+
A=65,Z=90,a=97,z=122
62+
*/
63+
/* -----------------------------------------------------------------------------------*/
64+
65+
ll solve()
66+
{
67+
ll n;
68+
cin>>n;
69+
ll mini=LONG_MAX,maxo=0,maxo_pos=-1,mini_pos=-1;
70+
ll temp=0;
71+
for(ll i=0;i<n;i++)
72+
{
73+
cin>>temp;;
74+
if(temp>maxo)
75+
{
76+
77+
maxo=temp;
78+
maxo_pos=i;
79+
}
80+
if(temp<=mini)
81+
{
82+
mini=temp;
83+
mini_pos=i;
84+
}
85+
}
86+
ll ans=maxo_pos+abs(mini_pos-(n-1));
87+
if(mini_pos<maxo_pos)
88+
ans--;
89+
cout<<ans<<endl;
90+
return 0;
91+
}
92+
93+
int main()
94+
{
95+
speed;
96+
//freopen("input.txt"a, "r", stdin);
97+
solve();
98+
}
99+
100+
/* stuff you should look before submission
101+
* int overflow
102+
* special test case (n=0||n=1||n=2)
103+
* don't get stuck on one approach if you get wrong answer
104+
*/

0 commit comments

Comments
 (0)