codemarshal problem section

Author: laziestcoder

codeMarshal/Problem Section/AlmostPrimeNumbers.cpp

@@ -0,0 +1,75 @@
+#include<bits/stdc++.h>
+#include<stdio.h>
+#include<math.h>
+#include<vector>
+#include<algorithm>
+#include<set>
+#define sz 1000001
+using namespace std;
+vector<int>prime;
+vector<long long int>ans;
+bool flag[1000001];
+int prsz;
+void sieve(void)
+{
+    int i,j,add;
+    flag[0]=flag[1]=1;
+    prime.push_back(2);
+    for(i=4; i<sz; i+=2)
+        flag[i]=1;
+    for(i=3; i<sz; i+=2)
+    {
+        if(!flag[i])
+        {
+            prime.push_back(i);
+            if(sz/i>=i)
+            {
+                add=i*2;
+                for(j=i*i; j<sz; j+=add)
+                    flag[j]=1;
+            }
+        }
+
+    }
+}
+
+int main()
+{
+    sieve();
+    long long int i,k,szp,j;
+    szp=prime.size();
+//    printf("total prime %lld\n",szp);
+//    for(i=0; i<=20; i++)
+//        printf("%d ",prime[prime.size()-1]);
+//    printf("\n\n\n");
+    for(i=0; i<sz; i++)
+    {
+        if(!flag[i])
+            for(j=i*i; j<1000000000001; j*=i)
+                ans.push_back(j);
+
+//        for(j=prime[i]*prime[i];j<1000000000001;j*=prime[i])
+//                ans.push_back(j);             //does not work  :( ;(
+    }
+
+
+    sort(ans.begin(),ans.end());
+    int tst,count,ansz;
+    ansz=ans.size();
+    // printf("total ans %d\n",ansz);
+    long long x,y;
+    scanf("%d",&tst);
+    while(tst--)
+    {
+        count=0;
+        scanf("%lld %lld",&x,&y);
+        i=0;
+        while(ans[i]<x)i++;
+        for(; i<ansz && ans[i]<=y; i++)
+            count++;
+        printf("%d\n",count);
+
+    }
+
+return 0;
+}

codeMarshal/Problem Section/LowerToUpper.cpp

@@ -0,0 +1,22 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+int main ()
+{
+    int t,i,j,l;
+    char n[105],ch;
+    cin>> t;
+    getchar();
+    for(i=1; i<=t; i++)
+    {
+        gets(n);
+        l=strlen(n);
+        cout<<"Case "<< i<<": ";
+        for(j=0; j<l;j++)
+        {
+           putchar(toupper(n[j]));
+        }
+        cout<<"\n";
+    }
+    return 0;
+}

codeMarshal/Problem Section/Victory Celebration.c

@@ -0,0 +1,7 @@
+
+#include<stdio.h>
+int main ()
+{
+    printf("Yaayy!! Bangladesh Won!!\n");
+    return 0;
+}

codeMarshal/Problem Section/areaOfTriangle.cpp

@@ -0,0 +1,23 @@
+#include<bits/stc++.h>
+#include<iostream>
+#include<cmath>
+#include<iomanip>
+using namespace std;
+
+int main()
+{
+
+
+ int T;
+    cin >> T;
+    for(int t = 1; t <= T; t++){
+        double a,b,c;
+        cin >> a >> b >> c;
+        double s = (a+b+c)/2;
+        double p = s*(s-a)*(s-b)*(s-c);
+        double r = sqrt(p);
+        cout<<"Case "<<t<<": "<<fixed<<setprecision(10) <<r <<endl;
+    }
+    return 0;
+
+}

codeMarshal/Problem Section/averageMarks.cpp

@@ -0,0 +1,18 @@
+#include<bits/stdc++.h>
+#include<iostream>
+using namespace std;
+int main(){
+
+    int T;
+    cin >> T;
+    for(int t = 1; t <= T; t++){
+        int n,num,sum = 0;
+        cin >> n;
+        for(int i = 0; i < n; i++){
+            cin >> num;
+            sum+=num;
+        }
+        cout << "Case " << t << ": " << sum/n << endl;
+    }
+    return 0;
+}

codeMarshal/Problem Section/budgetOfFlowerBooks.cpp

@@ -0,0 +1,7 @@
+#include<iostream>
+using namespace std;
+int main()
+{
+    cout<<"Budget of each portion is 174551 BDT."<<endl;
+    return 0;
+}

codeMarshal/Problem Section/canYouCount.cpp

@@ -0,0 +1,50 @@
+//#include<bits/stdc++.h>
+//using namespace std;
+//int main()
+//{
+//    long long a,n,T,t,i;
+//    //cin>>T;
+//    scanf("%ll",&T);
+//    for(t=1;t<=t;t++)
+//    {
+//        set<long long>res;
+//        //cin>>n;
+//        scanf("%ll",&n);
+//        for(i=0;i<n;i++)
+//        {
+//            //cin>>a;
+//            scanf("%ll",&a);
+//            res.insert(a);
+//        }
+//        cout<<"Case "<<t<<": "<<res.size()<<endl;
+//    }
+//    return 0;
+//}
+//
+
+
+#include<bits/stdc++.h>
+using namespace std;
+/*
+    *
+    * Towfiqul Islam
+    * International Islamic University Chittagong (IIUC)
+    *
+*/
+int main(){
+
+    long long a,T,n;
+
+    scanf("%lld",&T);
+    for(int t = 1; t <= T; t++){
+        set<long long> res;
+        scanf("%lld",&n);
+        for(int i = 0; i < n; i++){
+            scanf("%lld",&a);
+            res.insert(a);
+        }
+        printf("Case %lld: %d\n",t,res.size());
+    }
+    return 0;
+}
+

codeMarshal/Problem Section/canYouSumThem.cpp

@@ -0,0 +1,15 @@
+#include<iostream>
+using namespace std;
+int main()
+{
+    int a,n,i,sum=0;
+    cin>>n;
+    for(i=0;i<n;i++)
+    {
+        cin>>a;
+        if(!(i%2))sum+=a;
+    }
+    cout<<sum<<endl;
+    return 0;
+
+}

codeMarshal/Problem Section/celebratingVictory.cpp

@@ -0,0 +1,7 @@
+#include<iostream>
+using namespace std;
+int main()
+{
+	cout<<"Yaayy!! Bangladesh Won!!"<<endl;
+	return 0;
+}

codeMarshal/Problem Section/countingNumbers.cpp

@@ -0,0 +1,25 @@
+#include<iostream>
+using namespace std;
+
+int main()
+{
+  int T;
+  cin>>T;
+  for(int t = 1; t <= T; t++){
+    int n,c[101] = {0},tmp;
+    cin>>n;
+    for(int i = 0; i < n; i++){
+      cin>>tmp;
+      c[tmp]++;
+    }
+    int h = 0,m;
+    for(int i = 0; i <= 100; i++){
+      if(c[i] >= h){
+        h = c[i];
+        m = i;
+      }
+    }
+    cout<<"Case "<<t<<": "<<m<<" "<<h<<endl;
+  }
+
+}