order topics by syllabus

Author: sandromirr

Introduction/01-introduction.pdf 01-Introduction/01-introduction.pdf

@@ -0,0 +1,39 @@
+#include <iostream>
+#include <cmath>
+using namespace std;
+ 
+void solve(int number){
+    int all = (int)(log((double)number) / log(2.0));
+    int root = (int)pow(2.0,(double)all);
+    int level = 0;
+   // cout << root << endl;
+    while (level < all) {
+        if (root == number) {
+            break;
+        }
+ 
+        if (root > number) {
+            root -= (int)pow(2.0, all - level - 1);
+            level++;
+        }
+ 
+        if (root < number) {
+            root += (int)pow(2.0, all - level - 1);
+            level++;
+        }
+    }
+ 
+    int min = number - (int)pow(2.0, all - level) + 1;
+    int max = number + (int)pow(2.0, all - level) - 1;
+ 
+    cout << min << " " << max << endl;
+}
+ 
+int main(){
+    int n,a;
+    cin >> n;
+    while(n--){
+        cin >> a;
+        solve(a);
+    }
+}

Introduction/1000.cpp 01-Introduction/1000.cpp

@@ -0,0 +1,22 @@
+#include <iostream>
+#include <map>
+#include <string>
+#include <iomanip>
+using namespace std;
+int main(){
+    map<string,int> m;
+    string s;
+    double all = 0.0;
+    while(getline(cin,s)){
+        all++;
+        if(m.find(s) != m.end()){
+            m[s]++;
+        }else{
+            m[s] = 1;
+        }
+    }
+    for (std::map<string,int>::iterator it=m.begin(); it!=m.end(); ++it){
+        cout << it-> first << " ";
+        printf("%.4f\n",(it->second / all) * 100); 
+    }
+}