This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <cstdio> | |
using namespace std; | |
typedef unsigned long long int ullt; | |
ullt C[61][61]={0}; | |
ullt trib (int n, int back) | |
{ | |
if (n <= 1) return 1; | |
if (C[n][back] != 0) return C[n][back]; |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <cstdio> | |
using namespace std; | |
int Fib[5001][500]={0}; | |
int main() | |
{ | |
Fib[1][0]=1; | |
for (int i=2; i<=5000; i++){ | |
for (int j=0; j<500; j++){ |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <cstdio> | |
#include <algorithm> | |
using namespace std; | |
int main() | |
{ | |
unsigned long long int N[1501]; | |
N[1]=1; | |
int p2=1,p3=1,p5=1; | |
for (int n=2; n<=1500; n++){ | |
while (N[p2]*2 <= N[n-1]) p2++; |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <cstdio> | |
using namespace std; | |
int fn[101]={0}; | |
int f91 (int N){ | |
if (N > 100) return N-10; | |
if (fn[N] != 0) return fn[N]; | |
fn[N] = f91(f91(N+11)); | |
return fn[N]; | |
} |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <cstdio> | |
using namespace std; | |
void bangla(long long int n) | |
{ | |
if (n >= 10000000){ | |
bangla (n / 10000000); | |
printf (" kuti"); | |
n %= 10000000; | |
} |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <cstdio> | |
#include <cstring> | |
using namespace std; | |
char APU[1000]; | |
int parsing (int front, int back) | |
{ | |
// 0:Mutant | |
// 1:Simple | |
// 2:Fully-Grown |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <cstdio> | |
#include <cmath> | |
using namespace std; | |
typedef long long int llt; | |
llt sum0 (llt n) | |
{ | |
llt N = n,sum = 0; | |
int left=1,mid,right=1; | |
while (N >= 10){ |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <cstdio> | |
#include <algorithm> | |
#include <cmath> | |
using namespace std; | |
int N,x[200001],y[200001]; | |
double a_dis[200001],b_dis[200001]; | |
int ax,ay,bx,by,Q,R1,R2; | |
int BS (int R,double dis[]) |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <cstdio> | |
using namespace std; | |
int main() | |
{ | |
// freopen("input.txt","rt",stdin); | |
char keyboard[] = "`1234567890-=QWERTYUIOP[]\\ASDFGHJKL;'ZXCVBNM,./"; | |
char line[1000]; | |
while (gets(line)){ | |
for (int i=0; line[i]; i++){ | |
if (line[i] == ' ') printf(" "); |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <cstdio> | |
using namespace std; | |
int main() | |
{ | |
// freopen ("input.txt","rt",stdin); | |
int N; | |
while (scanf("%d",&N)){ | |
if (!N) break; | |
int nOfX[20]={0},Max = 0; | |
char line[30]; |