Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
123
#include<bits/stdc++.h> #define ll long long #define mod 1000000007 #define FIO ios::sync_with_stdio(0);cin.tie(0);cout.tie(0); using namespace std; int main(void) { FIO; return 0; }
run
|
edit
|
history
|
help
0
Triplet sum in array
permutation of 1 to n
half diamond or pyramid
codeforces - 545D
stack::emplace for 30-second c++
Guess Number
Finding the first digit of a number
Nieparzyste w macierzy
Make BinTree
დიოფანტეს განტოლება