{{ message }}

Instantly share code, notes, and snippets.

# farma11

Last active Jan 13, 2018
UVa #11995 I Can Guess the Data Structure!
View UVa11995_01.cpp
 #include #include #include #include #include #include #include using namespace std; string table[5] = { "stack", "queue", "priority queue", "impossible", "not sure" };
Last active Jan 13, 2018
AtCoder Beginner Contest #013C – 節制
View ABC013C_01.cpp
 #include #include using namespace std; #define LL long long int LL n, h; LL a, b, c, d, e; // 質素な食事の最低限の回数が求められる inline LL minCheapFood(double x){
Created Jan 14, 2018
View std-string.cpp
 #include #include #include #include #include #include #include #include using namespace std;
Created Jan 22, 2018
AtCoder Beginner Contest #085 C - Otoshidama
View ABC085C_01.cpp
 #include #include using namespace std; enum { B10 = 10000, B5 = 5000, B1 = 1000 }; inline bool isCorrect(int x10, int x5, int x1, int n, long y){ bool isPositive = ((x10 >= 0) && (x5 >= 0) && (x1 >=0));
Created Feb 3, 2018
View sigmoid.py
 import numpy as np import matplotlib.pylab as plt def sigmoid(x): return 1 / (1 + np.exp(-x)) x = np.arange(-5.0, 5.0, 0.1) # -5.0から5.0まで0.1刻みで生成 y = sigmoid(x) plt.plot(x, y)
Last active Feb 5, 2018
View AOJ0033_Bit01.cpp
 #include using namespace std; int main() { int n, balls[10]; cin >> n; while(n--){ for(int i = 0; i < 10; i++) cin >> balls[i]; bool sortable = false; for(int i = 0; i < (1 << 10); i++){
Last active Feb 12, 2018
Bootstrap4を用いたナビバー：右側に言語選択dropdownを追加バージョン
You can’t perform that action at this time.