{"action":"created","comment":{"url":"https://api.github.com/repos/EgorkaKulikov/spbu-se2018-autumn/pulls/comments/243418352","pull_request_review_id":187182944,"id":243418352,"node_id":"MDI0OlB1bGxSZXF1ZXN0UmV2aWV3Q29tbWVudDI0MzQxODM1Mg==","diff_hunk":"@@ -0,0 +1,450 @@\n+#include <stdio.h>\n+#include <mem.h>\n+#include <malloc.h>\n+#include <stdlib.h>\n+#include <time.h>\n+#define max(X, Y) (((X) > (Y)) ? (X) : (Y))\n+#define startn 200\n+#define startlen 10\n+#define char unsigned char\n+\n+char **strings;\n+int *lengths;\n+//used to compare strings with different lengths\n+char get_i(char* a,int len ,int i)\n+{\n+    if (i>=len)\n+    {\n+        return 0;\n+    }\n+    else return a[i];\n+}\n+\n+//swapping strings and their lengths\n+void swap(int a, int b)\n+{\n+    char* temp = strings[a];\n+    strings[a] = strings[b];\n+    strings[b] = temp;\n+    int t=lengths[a];\n+    lengths[a]=lengths[b];\n+    lengths[b]=t;\n+}\n+// strlen is not viable,because unused memory is malloced, so it doesnt work properly\n+// hence cmp is used\n+char cmp(char* a, char* b,int lena,int lenb)\n+{\n+    for (int i = 0; i < max(lena,lenb); i++)\n+    {\n+        if (get_i(a,lena,i) > get_i(b,lenb,i))\n+        {\n+        return 1;\n+        }\n+        if (get_i(b,lenb,i) > get_i(a,lena,i))\n+        {\n+        return 0;\n+        }\n+    }\n+    return 1;\n+}\n+\n+void bubbleSort(int n)\n+{\n+    int n1 = n - 1;\n+    char f = 1;\n+    do\n+    {\n+        f = 0;\n+        for (int i = 0; i < n1; i++)\n+        {\n+            if (cmp(strings[i],strings[i+1],lengths[i],lengths[ i + 1]))\n+            {\n+                swap(i, i + 1);\n+                f = 1;\n+            }\n+        }\n+        n1--;\n+    }\n+    while (f);\n+}\n+\n+void insertionSort(int n)\n+{\n+    int i = 1;\n+    while (i < n)\n+    {\n+        int j = i;\n+        while ((j > 0) && (cmp(strings[j],strings[j-1],lengths[j],lengths[ j - 1])))\n+        {\n+            swap(j, j - 1);\n+            j = j - 1;\n+        }\n+        i += 1;\n+    }\n+\n+}\n+\n+int partition(int low, int high)\n+{\n+    int pivot = high;    // pivot\n+    int i = (low - 1);  // Index of smaller element\n+\n+    for (int j = low; j <= high - 1; j++)\n+    {\n+        // If current element is smaller than or\n+        // equal to pivot\n+        if (cmp(strings[pivot],strings[j],lengths[pivot],lengths[j]))\n+        {\n+            i++;\n+            swap(i, j);\n+            // increment index of smaller element\n+        }\n+    }\n+    swap(i + 1, high);\n+    return (i + 1);\n+}\n+\n+void StartQuickSort(int low, int high)\n+{\n+    if (low < high)\n+    {\n+\n+        int pi = partition(low, high);\n+\n+        // Separately sort elements before\n+        // partition and after partition\n+        StartQuickSort(low, pi - 1);\n+        StartQuickSort(pi + 1, high);\n+    }\n+}\n+\n+void quickSort(int low, int high)\n+{\n+    StartQuickSort(low, high);\n+}\n+\n+void merge(int l, int m, int r)\n+{\n+    int i, j, k;\n+    int n1 = m - l + 1;\n+    int n2 = r - m;\n+\n+\n+    char** L=malloc(n1*sizeof(char*));\n+    if (L==NULL)\n+    {\n+        printf(\"Error!\");\n+        exit(1);\n+    }\n+    char** R=malloc(n2*sizeof(char*));\n+    if (R==NULL)\n+    {\n+        printf(\"Error!\");\n+        exit(1);\n+    }\n+    int* len1=malloc(n1*sizeof(int));\n+    int* len2=malloc(n2*sizeof(int));\n+    if (len1==NULL || len2==NULL)\n+    {\n+        printf(\"Error!\");\n+        exit(1);\n+    }\n+\n+    for (i = 0; i < n1; i++)\n+    {\n+        L[i] = strings[l + i];\n+        len1[i]=lengths[l+i];\n+    }\n+    for (j = 0; j < n2; j++)\n+    {\n+        R[j] = strings[m + 1 + j];\n+        len2[j]=lengths[m+1+j];\n+    }\n+\n+\n+    i = 0; // Initial index of first subarray\n+    j = 0; // Initial index of second subarray\n+    k = l; // Initial index of merged subarray\n+    while (i < n1 && j < n2)\n+    {\n+        if (cmp(R[j],L[i],len2[j],len1[i]))\n+        {\n+            strings[k] = L[i];\n+            lengths[k]=len1[i];\n+            i++;\n+        }\n+        else\n+        {\n+            strings[k] = R[j];\n+            lengths[k]=len2[j];\n+            j++;\n+        }\n+        k++;\n+    }\n+\n+\n+    while (i < n1)\n+    {\n+        strings[k] = L[i];\n+        lengths[k]=len1[i];\n+        i++;\n+        k++;\n+    }\n+\n+\n+    while (j < n2)\n+    {\n+        strings[k] = R[j];\n+        lengths[k]=len2[j];\n+        j++;\n+        k++;\n+    }\n+    free(L);\n+    free(R);\n+    free(len1);\n+    free(len2);\n+}\n+\n+void StartMergeSort( int l, int r)\n+{\n+    if (l < r)\n+    {\n+        // Same as (l+r)/2, but avoids overflow for\n+        // large l and h\n+       int m = l + (r - l) / 2;\n+\n+        // Sort first and second halves\n+        StartMergeSort(l, m);\n+        StartMergeSort(m + 1, r);\n+\n+        merge(l, m, r);\n+    }\n+}\n+\n+\n+void mergeSort(int l, int r)\n+{\n+    StartMergeSort(l, r);\n+}\n+\n+// A function to do counting sort of strings[] according to\n+// the digit represented by exp.\n+void countSort(int n, int num)\n+{\n+    char** output; // output stringsay\n+    output=malloc(sizeof(char*)*n);\n+    if (output==NULL)\n+    {\n+        printf(\"Error!\");\n+        exit(1);\n+    }\n+    int i, count[256] = {0};\n+\n+    // Store count of occurrences in count[]\n+    for (i = 0; i < n; i++)\n+    {\n+        count[get_i(strings[i],lengths[i],num)]++;\n+    }\n+    // Change count[i] so that count[i] now contains actual\n+    //  position of this digit in output[]\n+    for (i = 1; i < 256; i++)\n+    {\n+        count[i] += count[i - 1];\n+    }\n+    int* lens=malloc(n*sizeof(int));\n+    if (lens==NULL)\n+    {\n+        printf(\"Error!\");\n+        exit(1);\n+    }\n+    // Build the output array\n+    for (i = n - 1; i >= 0; i--)\n+    {\n+        int index=get_i(strings[i],lengths[i],num);\n+        output[count[index] - 1] = strings[i];\n+        (lens[count[index]-1])=lengths[i];\n+        count[get_i(strings[i],lengths[i],num)]--;\n+    }\n+\n+    // Copy the output array to strings[], so that strings[] now\n+    // contains sorted numbers according to current digit\n+    for (i = 0; i < n; i++)\n+    {\n+        strings[i] = output[i];\n+        lengths[i]=lens[i];\n+    }\n+    free(output);\n+    free(lens);\n+}\n+\n+// The main function to that sorts strings[] of size n using\n+// Radix Sort\n+int getMax(int n)\n+{\n+    int mx = lengths[0];\n+    for (int i = 1; i < n; i++)\n+    {\n+        if (lengths[i] > mx)\n+        {\n+            mx = lengths[i];\n+        }\n+    }\n+    return mx;\n+}\n+void radixsort(int n)\n+{\n+\n+    // Find the maximum number to know number of digits\n+    int maxlen = getMax(n);\n+    // Do counting sort for every digit. Note that instead\n+    // of passing digit number, exp is passed. exp is 10^i\n+    // where i is current digit number\n+    for (int num = maxlen - 1; num >= 0; num--)\n+    {\n+        countSort(n, num);\n+    }\n+\n+}\n+// A utility function to print an array\n+void print(int n)\n+{\n+    for (int i = 0; i < n; i++)\n+    {\n+        for (int j = 0; j < lengths[i]; j++)\n+        {\n+            printf(\"%c\", strings[i][j]);\n+        }\n+        printf(\"\\n\");\n+    }\n+}\n+\n+// Driver program to test above functions\n+int main(int argc, /*byte_char*/char **argv)\n+{\n+\n+    int true_n=atoi(argv[1]);\n+    int n = 0;\n+//    setlocale(LC_ALL, \"Rus\");\n+    FILE *fptr;\n+    fptr = fopen(argv[2], \"r\");\n+    if (fptr == NULL)\n+    {\n+        printf(\"Error!\");\n+        return 1;\n+    }\n+    char c;\n+    unsigned long long int current_n_for_malloc = startn;\n+    unsigned long long int current_string_len = startlen;\n+    strings = malloc(current_n_for_malloc * sizeof(char *));\n+    if (strings==NULL)\n+    {\n+        printf(\"Error!\");\n+        return 1;\n+    }\n+    char *current_string = malloc(startlen* sizeof(char));\n+    if (current_string==NULL)\n+    {\n+        printf(\"Error!\");\n+        return 1;\n+    }\n+    lengths = malloc(current_n_for_malloc * sizeof(int));\n+    if (lengths==NULL)\n+    {\n+        printf(\"Error!\");\n+        return 1;\n+    }\n+    int current_string_list_len = 0;\n+    while(n<true_n)\n+    {\n+        c = getc(fptr);\n+        if (c==EOF)\n+        {\n+            printf(\"Error!\");\n+            return 1;\n+        }\n+        if (c == '\\n')\n+        {\n+            strings[n] = current_string;\n+            lengths[n] = (current_string_list_len);\n+            n++;\n+            current_string_list_len = 0;\n+            current_string = malloc(startlen* sizeof(char));\n+            current_string_len = startlen;\n+            if (n + 1 > current_n_for_malloc)\n+            {\n+                current_n_for_malloc *= 2;\n+                strings = realloc(strings, current_n_for_malloc * sizeof(char *));\n+                if (strings==NULL)\n+                {\n+                    printf(\"Error!\");\n+                    exit(1);\n+                }\n+                lengths = realloc(lengths, current_n_for_malloc * sizeof(int));\n+                if (lengths==NULL)\n+                {\n+                    printf(\"Error!\");\n+                    exit(1);\n+                }\n+            }\n+        }\n+        else\n+        {\n+            current_string[current_string_list_len] = c;\n+            (current_string_list_len)++;\n+            if ((current_string_list_len) + 1 > current_string_len)\n+            {\n+                current_string_len *= 2;\n+                current_string = realloc(current_string, current_string_len);\n+                if (current_string==NULL)\n+                {\n+                    printf(\"Error!\");\n+                    exit(1);\n+                }\n+            }\n+        }\n+    }\n+    if (current_string_list_len > 0)\n+    {\n+        strings[n] = current_string;\n+        lengths[n] = (current_string_list_len);\n+        n++;\n+    }\n+    switch (argv[3][0])","path":"Vlaev/Task05/main.c","position":412,"original_position":412,"commit_id":"d081d8efab492c2ed9fcee9f052ebac1b9d5c904","original_commit_id":"d081d8efab492c2ed9fcee9f052ebac1b9d5c904","user":{"login":"EgorkaKulikov","id":29856383,"node_id":"MDQ6VXNlcjI5ODU2Mzgz","avatar_url":"https://avatars2.githubusercontent.com/u/29856383?v=4","gravatar_id":"","url":"https://api.github.com/users/EgorkaKulikov","html_url":"https://github.com/EgorkaKulikov","followers_url":"https://api.github.com/users/EgorkaKulikov/followers","following_url":"https://api.github.com/users/EgorkaKulikov/following{/other_user}","gists_url":"https://api.github.com/users/EgorkaKulikov/gists{/gist_id}","starred_url":"https://api.github.com/users/EgorkaKulikov/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/EgorkaKulikov/subscriptions","organizations_url":"https://api.github.com/users/EgorkaKulikov/orgs","repos_url":"https://api.github.com/users/EgorkaKulikov/repos","events_url":"https://api.github.com/users/EgorkaKulikov/events{/privacy}","received_events_url":"https://api.github.com/users/EgorkaKulikov/received_events","type":"User","site_admin":false},"body":"Свитч должен быть по объекту, имя которого наделено смыслом.\r\nв таком виде совершенно непонятно","created_at":"2018-12-20T21:09:10Z","updated_at":"2018-12-20T21:10:17Z","html_url":"https://github.com/EgorkaKulikov/spbu-se2018-autumn/pull/146#discussion_r243418352","pull_request_url":"https://api.github.com/repos/EgorkaKulikov/spbu-se2018-autumn/pulls/146","author_association":"OWNER","_links":{"self":{"href":"https://api.github.com/repos/EgorkaKulikov/spbu-se2018-autumn/pulls/comments/243418352"},"html":{"href":"https://github.com/EgorkaKulikov/spbu-se2018-autumn/pull/146#discussion_r243418352"},"pull_request":{"href":"https://api.github.com/repos/EgorkaKulikov/spbu-se2018-autumn/pulls/146"}}},"pull_request":{"url":"https://api.github.com/repos/EgorkaKulikov/spbu-se2018-autumn/pulls/146","id":237095225,"node_id":"MDExOlB1bGxSZXF1ZXN0MjM3MDk1MjI1","html_url":"https://github.com/EgorkaKulikov/spbu-se2018-autumn/pull/146","diff_url":"https://github.com/EgorkaKulikov/spbu-se2018-autumn/pull/146.diff","patch_url":"https://github.com/EgorkaKulikov/spbu-se2018-autumn/pull/146.patch","issue_url":"https://api.github.com/repos/EgorkaKulikov/spbu-se2018-autumn/issues/146","number":146,"state":"open","locked":false,"title":"task05 done","user":{"login":"nikitavlaev","id":43010567,"node_id":"MDQ6VXNlcjQzMDEwNTY3","avatar_url":"https://avatars3.githubusercontent.com/u/43010567?v=4","gravatar_id":"","url":"https://api.github.com/users/nikitavlaev","html_url":"https://github.com/nikitavlaev","followers_url":"https://api.github.com/users/nikitavlaev/followers","following_url":"https://api.github.com/users/nikitavlaev/following{/other_user}","gists_url":"https://api.github.com/users/nikitavlaev/gists{/gist_id}","starred_url":"https://api.github.com/users/nikitavlaev/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/nikitavlaev/subscriptions","organizations_url":"https://api.github.com/users/nikitavlaev/orgs","repos_url":"https://api.github.com/users/nikitavlaev/repos","events_url":"https://api.github.com/users/nikitavlaev/events{/privacy}","received_events_url":"https://api.github.com/users/nikitavlaev/received_events","type":"User","site_admin":false},"body":"","created_at":"2018-12-08T22:32:06Z","updated_at":"2018-12-20T21:10:16Z","closed_at":null,"merged_at":null,"merge_commit_sha":"bb75f02bcd1412c6ac5b2128254e81ef0a2f27c7","assignee":null,"assignees":[],"requested_reviewers":[],"requested_teams":[],"labels":[],"milestone":null,"commits_url":"https://api.github.com/repos/EgorkaKulikov/spbu-se2018-autumn/pulls/146/commits","review_comments_url":"https://api.github.com/repos/EgorkaKulikov/spbu-se2018-autumn/pulls/146/comments","review_comment_url":"https://api.github.com/repos/EgorkaKulikov/spbu-se2018-autumn/pulls/comments{/number}","comments_url":"https://api.github.com/repos/EgorkaKulikov/spbu-se2018-autumn/issues/146/comments","statuses_url":"https://api.github.com/repos/EgorkaKulikov/spbu-se2018-autumn/statuses/d081d8efab492c2ed9fcee9f052ebac1b9d5c904","head":{"label":"nikitavlaev:master","ref":"master","sha":"d081d8efab492c2ed9fcee9f052ebac1b9d5c904","user":{"login":"nikitavlaev","id":43010567,"node_id":"MDQ6VXNlcjQzMDEwNTY3","avatar_url":"https://avatars3.githubusercontent.com/u/43010567?v=4","gravatar_id":"","url":"https://api.github.com/users/nikitavlaev","html_url":"https://github.com/nikitavlaev","followers_url":"https://api.github.com/users/nikitavlaev/followers","following_url":"https://api.github.com/users/nikitavlaev/following{/other_user}","gists_url":"https://api.github.com/users/nikitavlaev/gists{/gist_id}","starred_url":"https://api.github.com/users/nikitavlaev/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/nikitavlaev/subscriptions","organizations_url":"https://api.github.com/users/nikitavlaev/orgs","repos_url":"https://api.github.com/users/nikitavlaev/repos","events_url":"https://api.github.com/users/nikitavlaev/events{/privacy}","received_events_url":"https://api.github.com/users/nikitavlaev/received_events","type":"User","site_admin":false},"repo":{"id":148810289,"node_id":"MDEwOlJlcG9zaXRvcnkxNDg4MTAyODk=","name":"spbu-se2018-autumn","full_name":"nikitavlaev/spbu-se2018-autumn","private":false,"owner":{"login":"nikitavlaev","id":43010567,"node_id":"MDQ6VXNlcjQzMDEwNTY3","avatar_url":"https://avatars3.githubusercontent.com/u/43010567?v=4","gravatar_id":"","url":"https://api.github.com/users/nikitavlaev","html_url":"https://github.com/nikitavlaev","followers_url":"https://api.github.com/users/nikitavlaev/followers","following_url":"https://api.github.com/users/nikitavlaev/following{/other_user}","gists_url":"https://api.github.com/users/nikitavlaev/gists{/gist_id}","starred_url":"https://api.github.com/users/nikitavlaev/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/nikitavlaev/subscriptions","organizations_url":"https://api.github.com/users/nikitavlaev/orgs","repos_url":"https://api.github.com/users/nikitavlaev/repos","events_url":"https://api.github.com/users/nikitavlaev/events{/privacy}","received_events_url":"https://api.github.com/users/nikitavlaev/received_events","type":"User","site_admin":false},"html_url":"https://github.com/nikitavlaev/spbu-se2018-autumn","description":null,"fork":true,"url":"https://api.github.com/repos/nikitavlaev/spbu-se2018-autumn","forks_url":"https://api.github.com/repos/nikitavlaev/spbu-se2018-autumn/forks","keys_url":"https://api.github.com/repos/nikitavlaev/spbu-se2018-autumn/keys{/key_id}","collaborators_url":"https://api.github.com/repos/nikitavlaev/spbu-se2018-autumn/collaborators{/collaborator}","teams_url":"https://api.github.com/repos/nikitavlaev/spbu-se2018-autumn/teams","hooks_url":"https://api.github.com/repos/nikitavlaev/spbu-se2018-autumn/hooks","issue_events_url":"https://api.github.com/repos/nikitavlaev/spbu-se2018-autumn/issues/events{/number}","events_url":"https://api.github.com/repos/nikitavlaev/spbu-se2018-autumn/events","assignees_url":"https://api.github.com/repos/nikitavlaev/spbu-se2018-autumn/assignees{/user}","branches_url":"https://api.github.com/repos/nikitavlaev/spbu-se2018-autumn/branches{/branch}","tags_url":"https://api.github.com/repos/nikitavlaev/spbu-se2018-autumn/tags","blobs_url":"https://api.github.com/repos/nikitavlaev/spbu-se2018-autumn/git/blobs{/sha}","git_tags_url":"https://api.github.com/repos/nikitavlaev/spbu-se2018-autumn/git/tags{/sha}","git_refs_url":"https://api.github.com/repos/nikitavlaev/spbu-se2018-autumn/git/refs{/sha}","trees_url":"https://api.github.com/repos/nikitavlaev/spbu-se2018-autumn/git/trees{/sha}","statuses_url":"https://api.github.com/repos/nikitavlaev/spbu-se2018-autumn/statuses/{sha}","languages_url":"https://api.github.com/repos/nikitavlaev/spbu-se2018-autumn/languages","stargazers_url":"https://api.github.com/repos/nikitavlaev/spbu-se2018-autumn/stargazers","contributors_url":"https://api.github.com/repos/nikitavlaev/spbu-se2018-autumn/contributors","subscribers_url":"https://api.github.com/repos/nikitavlaev/spbu-se2018-autumn/subscribers","subscription_url":"https://api.github.com/repos/nikitavlaev/spbu-se2018-autumn/subscription","commits_url":"https://api.github.com/repos/nikitavlaev/spbu-se2018-autumn/commits{/sha}","git_commits_url":"https://api.github.com/repos/nikitavlaev/spbu-se2018-autumn/git/commits{/sha}","comments_url":"https://api.github.com/repos/nikitavlaev/spbu-se2018-autumn/comments{/number}","issue_comment_url":"https://api.github.com/repos/nikitavlaev/spbu-se2018-autumn/issues/comments{/number}","contents_url":"https://api.github.com/repos/nikitavlaev/spbu-se2018-autumn/contents/{+path}","compare_url":"https://api.github.com/repos/nikitavlaev/spbu-se2018-autumn/compare/{base}...{head}","merges_url":"https://api.github.com/repos/nikitavlaev/spbu-se2018-autumn/merges","archive_url":"https://api.github.com/repos/nikitavlaev/spbu-se2018-autumn/{archive_format}{/ref}","downloads_url":"https://api.github.com/repos/nikitavlaev/spbu-se2018-autumn/downloads","issues_url":"https://api.github.com/repos/nikitavlaev/spbu-se2018-autumn/issues{/number}","pulls_url":"https://api.github.com/repos/nikitavlaev/spbu-se2018-autumn/pulls{/number}","milestones_url":"https://api.github.com/repos/nikitavlaev/spbu-se2018-autumn/milestones{/number}","notifications_url":"https://api.github.com/repos/nikitavlaev/spbu-se2018-autumn/notifications{?since,all,participating}","labels_url":"https://api.github.com/repos/nikitavlaev/spbu-se2018-autumn/labels{/name}","releases_url":"https://api.github.com/repos/nikitavlaev/spbu-se2018-autumn/releases{/id}","deployments_url":"https://api.github.com/repos/nikitavlaev/spbu-se2018-autumn/deployments","created_at":"2018-09-14T15:47:13Z","updated_at":"2018-12-08T22:31:52Z","pushed_at":"2018-12-08T22:31:51Z","git_url":"git://github.com/nikitavlaev/spbu-se2018-autumn.git","ssh_url":"git@github.com:nikitavlaev/spbu-se2018-autumn.git","clone_url":"https://github.com/nikitavlaev/spbu-se2018-autumn.git","svn_url":"https://github.com/nikitavlaev/spbu-se2018-autumn","homepage":null,"size":29,"stargazers_count":0,"watchers_count":0,"language":"C","has_issues":false,"has_projects":true,"has_downloads":true,"has_wiki":true,"has_pages":false,"forks_count":0,"mirror_url":null,"archived":false,"open_issues_count":0,"license":null,"forks":0,"open_issues":0,"watchers":0,"default_branch":"master"}},"base":{"label":"EgorkaKulikov:master","ref":"master","sha":"13050f206e6f2de4d4512d68a925ef8fb8f68825","user":{"login":"EgorkaKulikov","id":29856383,"node_id":"MDQ6VXNlcjI5ODU2Mzgz","avatar_url":"https://avatars2.githubusercontent.com/u/29856383?v=4","gravatar_id":"","url":"https://api.github.com/users/EgorkaKulikov","html_url":"https://github.com/EgorkaKulikov","followers_url":"https://api.github.com/users/EgorkaKulikov/followers","following_url":"https://api.github.com/users/EgorkaKulikov/following{/other_user}","gists_url":"https://api.github.com/users/EgorkaKulikov/gists{/gist_id}","starred_url":"https://api.github.com/users/EgorkaKulikov/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/EgorkaKulikov/subscriptions","organizations_url":"https://api.github.com/users/EgorkaKulikov/orgs","repos_url":"https://api.github.com/users/EgorkaKulikov/repos","events_url":"https://api.github.com/users/EgorkaKulikov/events{/privacy}","received_events_url":"https://api.github.com/users/EgorkaKulikov/received_events","type":"User","site_admin":false},"repo":{"id":146987107,"node_id":"MDEwOlJlcG9zaXRvcnkxNDY5ODcxMDc=","name":"spbu-se2018-autumn","full_name":"EgorkaKulikov/spbu-se2018-autumn","private":false,"owner":{"login":"EgorkaKulikov","id":29856383,"node_id":"MDQ6VXNlcjI5ODU2Mzgz","avatar_url":"https://avatars2.githubusercontent.com/u/29856383?v=4","gravatar_id":"","url":"https://api.github.com/users/EgorkaKulikov","html_url":"https://github.com/EgorkaKulikov","followers_url":"https://api.github.com/users/EgorkaKulikov/followers","following_url":"https://api.github.com/users/EgorkaKulikov/following{/other_user}","gists_url":"https://api.github.com/users/EgorkaKulikov/gists{/gist_id}","starred_url":"https://api.github.com/users/EgorkaKulikov/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/EgorkaKulikov/subscriptions","organizations_url":"https://api.github.com/users/EgorkaKulikov/orgs","repos_url":"https://api.github.com/users/EgorkaKulikov/repos","events_url":"https://api.github.com/users/EgorkaKulikov/events{/privacy}","received_events_url":"https://api.github.com/users/EgorkaKulikov/received_events","type":"User","site_admin":false},"html_url":"https://github.com/EgorkaKulikov/spbu-se2018-autumn","description":null,"fork":false,"url":"https://api.github.com/repos/EgorkaKulikov/spbu-se2018-autumn","forks_url":"https://api.github.com/repos/EgorkaKulikov/spbu-se2018-autumn/forks","keys_url":"https://api.github.com/repos/EgorkaKulikov/spbu-se2018-autumn/keys{/key_id}","collaborators_url":"https://api.github.com/repos/EgorkaKulikov/spbu-se2018-autumn/collaborators{/collaborator}","teams_url":"https://api.github.com/repos/EgorkaKulikov/spbu-se2018-autumn/teams","hooks_url":"https://api.github.com/repos/EgorkaKulikov/spbu-se2018-autumn/hooks","issue_events_url":"https://api.github.com/repos/EgorkaKulikov/spbu-se2018-autumn/issues/events{/number}","events_url":"https://api.github.com/repos/EgorkaKulikov/spbu-se2018-autumn/events","assignees_url":"https://api.github.com/repos/EgorkaKulikov/spbu-se2018-autumn/assignees{/user}","branches_url":"https://api.github.com/repos/EgorkaKulikov/spbu-se2018-autumn/branches{/branch}","tags_url":"https://api.github.com/repos/EgorkaKulikov/spbu-se2018-autumn/tags","blobs_url":"https://api.github.com/repos/EgorkaKulikov/spbu-se2018-autumn/git/blobs{/sha}","git_tags_url":"https://api.github.com/repos/EgorkaKulikov/spbu-se2018-autumn/git/tags{/sha}","git_refs_url":"https://api.github.com/repos/EgorkaKulikov/spbu-se2018-autumn/git/refs{/sha}","trees_url":"https://api.github.com/repos/EgorkaKulikov/spbu-se2018-autumn/git/trees{/sha}","statuses_url":"https://api.github.com/repos/EgorkaKulikov/spbu-se2018-autumn/statuses/{sha}","languages_url":"https://api.github.com/repos/EgorkaKulikov/spbu-se2018-autumn/languages","stargazers_url":"https://api.github.com/repos/EgorkaKulikov/spbu-se2018-autumn/stargazers","contributors_url":"https://api.github.com/repos/EgorkaKulikov/spbu-se2018-autumn/contributors","subscribers_url":"https://api.github.com/repos/EgorkaKulikov/spbu-se2018-autumn/subscribers","subscription_url":"https://api.github.com/repos/EgorkaKulikov/spbu-se2018-autumn/subscription","commits_url":"https://api.github.com/repos/EgorkaKulikov/spbu-se2018-autumn/commits{/sha}","git_commits_url":"https://api.github.com/repos/EgorkaKulikov/spbu-se2018-autumn/git/commits{/sha}","comments_url":"https://api.github.com/repos/EgorkaKulikov/spbu-se2018-autumn/comments{/number}","issue_comment_url":"https://api.github.com/repos/EgorkaKulikov/spbu-se2018-autumn/issues/comments{/number}","contents_url":"https://api.github.com/repos/EgorkaKulikov/spbu-se2018-autumn/contents/{+path}","compare_url":"https://api.github.com/repos/EgorkaKulikov/spbu-se2018-autumn/compare/{base}...{head}","merges_url":"https://api.github.com/repos/EgorkaKulikov/spbu-se2018-autumn/merges","archive_url":"https://api.github.com/repos/EgorkaKulikov/spbu-se2018-autumn/{archive_format}{/ref}","downloads_url":"https://api.github.com/repos/EgorkaKulikov/spbu-se2018-autumn/downloads","issues_url":"https://api.github.com/repos/EgorkaKulikov/spbu-se2018-autumn/issues{/number}","pulls_url":"https://api.github.com/repos/EgorkaKulikov/spbu-se2018-autumn/pulls{/number}","milestones_url":"https://api.github.com/repos/EgorkaKulikov/spbu-se2018-autumn/milestones{/number}","notifications_url":"https://api.github.com/repos/EgorkaKulikov/spbu-se2018-autumn/notifications{?since,all,participating}","labels_url":"https://api.github.com/repos/EgorkaKulikov/spbu-se2018-autumn/labels{/name}","releases_url":"https://api.github.com/repos/EgorkaKulikov/spbu-se2018-autumn/releases{/id}","deployments_url":"https://api.github.com/repos/EgorkaKulikov/spbu-se2018-autumn/deployments","created_at":"2018-09-01T09:54:47Z","updated_at":"2018-12-20T20:08:01Z","pushed_at":"2018-12-20T20:24:39Z","git_url":"git://github.com/EgorkaKulikov/spbu-se2018-autumn.git","ssh_url":"git@github.com:EgorkaKulikov/spbu-se2018-autumn.git","clone_url":"https://github.com/EgorkaKulikov/spbu-se2018-autumn.git","svn_url":"https://github.com/EgorkaKulikov/spbu-se2018-autumn","homepage":null,"size":59312,"stargazers_count":0,"watchers_count":0,"language":"C","has_issues":true,"has_projects":true,"has_downloads":true,"has_wiki":true,"has_pages":false,"forks_count":32,"mirror_url":null,"archived":false,"open_issues_count":28,"license":null,"forks":32,"open_issues":28,"watchers":0,"default_branch":"master"}},"_links":{"self":{"href":"https://api.github.com/repos/EgorkaKulikov/spbu-se2018-autumn/pulls/146"},"html":{"href":"https://github.com/EgorkaKulikov/spbu-se2018-autumn/pull/146"},"issue":{"href":"https://api.github.com/repos/EgorkaKulikov/spbu-se2018-autumn/issues/146"},"comments":{"href":"https://api.github.com/repos/EgorkaKulikov/spbu-se2018-autumn/issues/146/comments"},"review_comments":{"href":"https://api.github.com/repos/EgorkaKulikov/spbu-se2018-autumn/pulls/146/comments"},"review_comment":{"href":"https://api.github.com/repos/EgorkaKulikov/spbu-se2018-autumn/pulls/comments{/number}"},"commits":{"href":"https://api.github.com/repos/EgorkaKulikov/spbu-se2018-autumn/pulls/146/commits"},"statuses":{"href":"https://api.github.com/repos/EgorkaKulikov/spbu-se2018-autumn/statuses/d081d8efab492c2ed9fcee9f052ebac1b9d5c904"}},"author_association":"CONTRIBUTOR"}}
{"actor":{"display_login":"EgorkaKulikov"}}