The list would not be updated for now. Don't write comments.
The count of contributions (summary of Pull Requests, opened issues and commits) to public repos at GitHub.com from Wed, 21 Sep 2022 till Thu, 21 Sep 2023.
Because of GitHub search limitations, only 1000 first users according to amount of followers are included. If you are not in the list you don't have enough followers. See raw data and source code. Algorithm in pseudocode:
githubUsers
| /* | |
| * Copyright 2015 Sudipto Chandra. | |
| * | |
| * Licensed under the Apache License, Version 2.0 (the "License"); | |
| * you may not use this file except in compliance with the License. | |
| * You may obtain a copy of the License at | |
| * | |
| * http://www.apache.org/licenses/LICENSE-2.0 | |
| * | |
| * Unless required by applicable law or agreed to in writing, software |
| /*================================== | |
| Title: Suffix Array using Radix Sort | |
| Complexity: O(n.log(n)) | |
| Author : Sudipto Chandra (Dipu) | |
| ===================================*/ | |
| #include <bits/stdc++.h> | |
| using namespace std; | |
| #define mem(a,b) memset(a, b, sizeof(a)) | |
| #define loop(i, x) for(__typeof((x).begin()) i=(x).begin(); i!=(x).end(); ++i) | |
| #define rloop(i, x) for(__typeof((x).rbegin()) i=(x).rbegin(); i!=(x).rend(); ++i) |
| /*==================================================================== | |
| Title: Compute LCP from Suffix Array using Radix Sort | |
| Suffix Array: O(n.log(n)) | |
| Compute LCP: O(n) | |
| Author : Sudipto Chandra (Dipu) | |
| =====================================================================*/ | |
| #include <bits/stdc++.h> | |
| using namespace std; | |
| #define mem(a,b) memset(a, b, sizeof(a)) | |
| #define loop(i, x) for(__typeof((x).begin()) i=(x).begin(); i!=(x).end(); ++i) |
| /*==================================================================== | |
| Title: Computes Longest Repeated Substring from a given string | |
| Complexity: O(n.log(n)) | |
| Author : Sudipto Chandra (Dipu) | |
| =====================================================================*/ | |
| #include <bits/stdc++.h> | |
| using namespace std; | |
| #define mem(a,b) memset(a, b, sizeof(a)) | |
| #define loop(i, x) for(__typeof((x).begin()) i=(x).begin(); i!=(x).end(); ++i) | |
| #define rloop(i, x) for(__typeof((x).rbegin()) i=(x).rbegin(); i!=(x).rend(); ++i) |
| // | |
| // Created by はるふ on 2017/12/11. | |
| // Copyright © 2017年 ha1f. All rights reserved. | |
| // | |
| import Foundation | |
| import CoreImage | |
| import AVFoundation | |
| extension CIFilter { |
| /* | |
| * Copyright (C) 2018 Sudipto Chandra | |
| * | |
| * This program is free software: you can redistribute it and/or modify | |
| * it under the terms of the GNU General Public License as published by | |
| * the Free Software Foundation, either version 3 of the License, or | |
| * (at your option) any later version. | |
| * | |
| * This program is distributed in the hope that it will be useful, | |
| * but WITHOUT ANY WARRANTY; without even the implied warranty of |
1.Research：Deep Tree Learning for Zero-shot Face Anti-Spoofing ,Face De-Spoofing: Anti-Spoofing via Noise Modeling ,Learning Deep Models for Face Anti-Spoofing: Binary or Auxiliary Supervision ,http://w
| # vim:ft=zsh ts=2 sw=2 sts=2 | |
| # | |
| # agnoster's Theme - https://gist.github.com/3712874 | |
| # A Powerline-inspired theme for ZSH | |
| # | |
| # # README | |
| # | |
| # In order for this theme to render correctly, you will need a | |
| # [Powerline-patched font](https://github.com/Lokaltog/powerline-fonts). | |
| # Make sure you have a recent version: the code points that Powerline |