P

@please_save_trees

cost of connecting ropes

C++
3 years ago
#include<bits/stdc++.h> using namespace std; int main(){ int n; cin>>n; priority_queue<int,vector<int>,greater<int>> minh;

nearest point to origin

C++
3 years ago
#include<bits/stdc++.h> using namespace std; int main(){ int n,k; cin>>n>>k; unordered_map<int,int> nc;

sorting an array according to frequency if element, printing the element most frequent first.

C++
3 years ago
#include<bits/stdc++.h> using namespace std; int main(){ int n; cin>>n; int a[n]; unordered_map<int,int> freq;

sorting according to frequency with typing minimum frequent element first.

C++
3 years ago
#include<bits/stdc++.h> using namespace std; int main(){ int n; cin>>n; int a[n]; unordered_map<int,int> freq;

print the numbers with highest frequency

C++
3 years ago
#include<bits/stdc++.h> using namespace std; int main(){ int n,k; cin>>n>>k; int a[n]; unordered_map<int,int> freq;

k closest number to a given number

C++
3 years ago
#include<bits/stdc++.h> using namespace std; int main(){ int n,x,k; cin>>n>>x>>k; int a[n]; priority_queue<pair<int,int>> maxhp;

sorting a nearly sorted array

C++
3 years ago
#include<bits/stdc++.h> using namespace std; int main(){ int n,k; cin>>n>>k; int a[n]; priority_queue<int , vector<int>,greater<int>> minh;

q1.31.7.22

C++
3 years ago
#include<bits/stdc++.h> using namespace std; int main(){ int t; cin>>t; while(t--){ int n,m; cin>>n>>m; string a,b;

15.6.22.cc5(wrong)

C++
4 years ago
#include<bits/stdc++.h> using namespace std; int main() { int t; cin>>t; while(t--){ int n,x,i; cin>>n>>x;

15.06.22.cc.4

C++
4 years ago
#include<bits/stdc++.h> using namespace std; int main() { int t; cin>>t; while(t--){ int n,k; cin>>n>>k;

26/5/2022

C++
4 years ago
#include<bits/stdc++.h> using namespace std; int main() { int t; cin >>t; while(t--){ long int x,y,a[101],n,to=0,cp=0; cin>>n>>x>>y;

q1 div 2 25/5/2022

C++
4 years ago
#include<bits/stdc++.h> using namespace std; int main() { int t; cin>>t; while(t--){ int n,a[51]; double avg,to=0.0;

codeforces nahi bn paya q1

C++
4 years ago
#include<bits/stdc++.h> using namespace std; int main() { int t; long int i, n,count=0; string s; cin>>t;

round c kickstart real q1

C++
4 years ago
#include<bits/stdc++.h> using namespace std; int main() { int t; cin>>t; int i = 1; string s; int m;

round c kickstart q1

C++
4 years ago
#include<bits/stdc++.h> using namespace std; int main(){ int t,j,n; long long int x,y,rc,diff; double r,total; cin >> t;

6.5.2022/q1/div2

C++
4 years ago
#include <iostream> #include <bits/stdc++.h> using namespace std; int main() { long int t; cin >> t; while(t--){ long long int n,a[100001];

2/5/2022 q1

C++
4 years ago
#include <iostream> #include <bits/stdc++.h> using namespace std; int main() { int t,x,y,a,b; cin >> t; while(t--){ cin >> x >> y;

24/4/2022 swerc q1

C++
4 years ago
#include <iostream> #include <bits/stdc++.h> using namespace std; int main() { int t,n,i,b[101],d[101]; cin >> t; while(t--){ cin >> n;

23/4/2022

C++
4 years ago
#include <iostream> using namespace std; int main() { int t,n,a[51],p=0,i; cin >> t; while(t--){ cin>>n; if(n==1){ cin>>p;