seminar 3

Author: Eugene Yurtaev

arena.cpp

@@ -0,0 +1,25 @@
+#include <iostream>
+#include <fstream>
+#include <sstream>
+#include <ctype.h> 
+
+using namespace std;
+
+struct Item {
+    Item *next;
+    long long value;
+};
+
+class Arena {
+    
+};
+
+
+int main(int argc, char *argv[]) {
+    char str[] = "first line    \nsecond line";
+    normalize_file(str);
+    for (int i = 0; str[i] != '\0';i++){
+       printf ("%c", str[i]);
+    }
+}   
+

besum.cpp

@@ -0,0 +1,25 @@
+#include <iostream>
+#include <fstream>
+#include <sstream>
+#include <string> 
+
+using namespace std;
+
+int main(int argc, char *argv[]) {
+    for (size_t i = 1; i < (size_t) argc; ++i) {
+        string filename(argv[i]);
+        ifstream file(filename, ios::in | ios::binary);
+
+        char * buffer = new char [4];
+        do {
+            file.read(buffer, 4);
+            cout << buffer[0] << buffer[1] << buffer[2] << buffer[3] << endl;
+            unsigned int x;   
+            stringstream ss;
+            ss << std::hex << buffer[0] << buffer[1] << buffer[2] << buffer[3];
+            ss >> x;
+            cout << x;
+        } while (!file.eof());
+    }
+}
+

bitcount.cpp

@@ -0,0 +1,42 @@
+#include <iostream>
+#include <string> 
+
+using namespace std;
+
+int main(int argc, char *argv[]) {
+    for (size_t i = 1; i < (size_t) argc; ++i) {
+        string str(argv[i]);
+        unsigned int number;
+        size_t pos = 0;
+        size_t arg_len = str.size();
+        try {
+            number = stoul(str, &pos);    
+        }
+        catch (...) {
+            cout << -1 << endl;
+            continue;
+        }
+        if (pos != arg_len) {
+            cout << -1 << endl;
+            continue;
+        }
+        // first method
+        unsigned int bitscount = 0;
+        for (size_t k = 0; k < 32; ++k) {
+            unsigned int shifted = number >> k;
+            if (shifted == 0) {
+                break;
+            }
+            if (shifted & 1) {
+                ++bitscount;
+            }
+        }
+        // second method
+        unsigned int bitscount2 = __builtin_popcount(number);
+        if (bitscount == bitscount2)
+            cout << bitscount << endl;
+        else 
+            cout << "-1";
+    }
+}
+

fclassify.cpp

@@ -0,0 +1,41 @@
+#include <iostream>
+#include <fstream>
+#include <sstream>
+#include <bitset>
+#include <string> 
+
+using namespace std;
+
+bitset<32> getbits(float f) {
+	union {
+        float input;  
+        unsigned int output;
+    } data;
+    data.input = f;	
+    bitset<32> bits(data.output);
+    return bits;
+}
+
+enum class FPClass
+{
+	ZERO, DENORMALIZED, NORMALIZED, INF, NAN
+};
+
+
+int main() {
+	
+    float f; 
+    while (cin >> f) {
+    	bits = getbits(f);
+        unsigned int exponent = 0;
+        for (int i = 0; i < 8; ++i) {
+            exponent += bits[23 + i] * (1 << i);
+        }
+        unsigned int frac = 0;
+        for (int i = 0; i < 23; ++i) {
+            frac += bits[i] * (1 << i);
+        }
+        cout << dec << bits[31] << " " << exponent << " ";
+        cout << hex << frac << endl;
+    }   
+}

file

@@ -0,0 +1 @@
+ffff000031f21010

fsplit.cpp

@@ -0,0 +1,33 @@
+#include <iostream>
+#include <fstream>
+#include <sstream>
+#include <bitset>
+#include <string> 
+
+using namespace std;
+
+
+int main() {
+    float f; 
+    while (cin >> f) {
+        union {
+            float input;  
+            unsigned int output;
+        } data;
+
+        data.input = f;
+
+        bitset<32> bits(data.output);
+
+        unsigned int exponent = 0;
+        for (int i = 0; i < 8; ++i) {
+            exponent += bits[23 + i] * (1 << i);
+        }
+        unsigned int frac = 0;
+        for (int i = 0; i < 23; ++i) {
+            frac += bits[i] * (1 << i);
+        }
+        cout << dec << bits[31] << " " << exponent << " ";
+        cout << hex << frac << endl;
+    }   
+}

intfit.cpp

@@ -0,0 +1,58 @@
+#include <iostream>
+#include <fstream>
+#include <sstream>
+#include <string> 
+
+using namespace std;
+
+bool isProperlyRepresented(unsigned int n) {
+    if (n <= 16777216) {
+            return 1; 
+    }
+    bool bits[32];
+    for (size_t k = 0; k < 32; ++k) {
+        unsigned int shifted = n >> k;
+        if (shifted & 1) {
+            bits[k] = 1;
+        } else {
+            bits[k] = 0;
+        }
+    }
+    int left_shift = 0, right_shift = 32;
+    for (int i = 0; i < 32; ++i) {
+        if (bits[i] == 1) {
+            right_shift = i;
+        }
+    }    
+    for (int j = 31; j >= 0; --j) {
+        if (bits[j] == 1) {
+            left_shift = j;
+        }
+    }
+    // cout << left_shift << " " << right_shift << endl;
+    if (right_shift - left_shift + 1 > 24) {
+        return 0;
+    }
+    return 1;
+}
+
+int main() {
+    unsigned int n; 
+
+    while (cin >> n) {
+        // float f = (float) n;
+        // unsigned int nn = (unsigned int) f;
+        // cout << n << " " << nn << endl;
+        // cout << bitset<32>(n) << endl;
+        cout << (isProperlyRepresented(n) ? "1\n":"0\n");
+    }
+    
+    // for (int i = 2000000000; i < 9000000000; ++i) {
+    //     float f = (float) i;
+    //     int ii = (int) f;
+    //     if (i != ii && isProperlyRepresented(i)) {
+    //         cout << i << " " << ii << "wuuut" << endl;
+    //     }
+    //     // cout << (isProperlyRepresented(n) ? "1\n":"0\n");
+    // }
+}

norm_path.cpp

@@ -0,0 +1,33 @@
+#include <iostream>
+#include <fstream>
+#include <sstream>
+#include <string> 
+
+using namespace std;
+
+
+void normalize_path(char *buf) {
+    int cur = 0;
+    bool is_slash = false;
+    for (int pos = 0; buf[pos] != '\0'; ++pos) {
+        if (!is_slash && buf[pos] == '/') {
+            buf[cur] = '/';
+            is_slash = true;
+            ++cur;
+        } else if (buf[pos] != '/') {
+            buf[cur] = buf[pos];
+            ++cur;
+            is_slash = false;
+        }
+    }
+    buf[cur] = '\0';
+}
+
+int main(int argc, char *argv[]) {
+    char str[] = "///a//b///c/";
+    normalize_path(str);
+    for (int i = 0; str[i] != '\0';i++){
+       printf ("%c", str[i]);
+    }
+}   
+

normalize_file.cpp

@@ -0,0 +1,55 @@
+// #include <iostream>
+// #include <fstream>
+// #include <sstream>
+#include <ctype.h> 
+
+// using namespace std;
+
+void normalize_file(char *buf) {
+    if (buf[0] == '\0')
+        return;
+    int cur = 0;
+    int pos = 0;
+    int spaces_started = -1;
+    while (pos == 0 || buf[pos - 1] != '\0') {
+        if (buf[pos] == '\n' || buf[pos] == '\0') {
+            if (buf[pos] == '\0') {
+                if (buf[pos - 1] != '\n') {
+                    buf[cur++] = '\n';
+                    buf[cur++] = '\0';
+                } else {
+                    buf[cur++] = '\0';
+                }
+                break;
+            } else {
+                buf[cur++] = '\n';
+            }
+            spaces_started = -1;
+        } else if (isspace(buf[pos])) {
+            if (spaces_started == -1) {
+                spaces_started = pos;
+            }
+        } else {
+            if (spaces_started != -1) {
+                for (int j = spaces_started; j <= pos; ++j) {
+                    buf[cur++] = buf[j];
+                }
+                spaces_started = -1;
+            } else {
+                buf[cur++] = buf[pos];
+            }
+        }
+        ++pos;
+    }
+}
+
+
+
+// int main(int argc, char *argv[]) {
+//     char str[] = "first line    \nsecond line";
+//     normalize_file(str);
+//     for (int i = 0; str[i] != '\0';i++){
+//        printf ("%c", str[i]);
+//     }
+// }   
+

satsum.cpp

@@ -0,0 +1,13 @@
+// #include <iostream>
+
+// using namespace std;
+
+
+unsigned satsum(unsigned v1, unsigned v2) {
+    unsigned v3 = v1 + v2;
+    if (v3 < v1) {
+        return -1;
+    } else {
+        return v3;    
+    }
+}