Skip to main content

Posts

Showing posts from October, 2022

Educational Codeforces Round 137 (Rated for Div. 2) (C. Save the Magazines)

Bismillahir Rahmanir Rahim ///Author: Tanvir Ahmmad ///CSE,Islamic University,Bangladesh #include<iostream> #include<cstdio> #include<algorithm> #include<string> #include<cstring> #include<sstream> #include<cmath> #include<cstring> #include<vector> #include<queue> #include<map> #include<set> #include<stack> #include<vector> #include<iterator> #include <functional> ///sort(arr,arr+n,greater<int>()) for decrement of array /*every external angle sum=360 degree   angle find using polygon hand(n) ((n-2)*180)/n*/ ///Floor[Log(b)  N] + 1 = the number of digits when any number is represented in base b using namespace std; typedef long long ll; int main() {     ll tst,n;     cin>>tst;     while(tst--)     {         vector<ll>vec;         string str;         cin>>n>...

AtCoder Practice-1

Bismillahir Rahmanir Rahim ///Author: Tanvir Ahmmad ///CSE,Islamic University,Bangladesh #include< iostream > #include< cstdio > #include< algorithm > #include< string > #include< cstring > #include< sstream > #include< cmath > #include< cstring > #include< vector > #include< queue > #include< map > #include< set > #include< stack > #include< vector > #include< iterator > #include   < functional >   ///sort(arr,arr+n,greater<int>()) for decrement of array /*every external angle sum=360 degree   angle find using polygon hand(n) ((n-2)*180)/n*/ ///Floor[Log(b)  N] + 1 = the number of digits when any number is represented in base b using   namespace  std; typedef   long   long ...