台部落EUSIA

#include<cstdio> #include<iostream> using namespace std; const int maxn=40; int main() { int a[maxn]={0};

2020-06-24 19:27:34

#include<cstdio> #include<string> #include<vector> #include<iostream> using namespace std; const int maxn=30; int

2020-06-24 18:16:13

#include<cstdio> #include<iostream> #include<algorithm> using namespace std; const int maxn=105; int main() {

2020-06-24 18:16:12

#include<stdio.h> #define maxn 100000 int square(int a); int cube(int a); void swap(int *a,int*b); int main() {

2020-06-24 18:16:12

#include<iostream> #include<string> #include<set> #include<sstream> using namespace std; set<string> dict;//string

2020-02-23 06:43:21

#include<cstdio> #include<algorithm> using namespace std; const int maxn =10000; int main() { int n,q,x,a[maxn

2020-02-23 06:43:21

#include<iostream> using namespace std; struct Point { int x,y; Point(int x=0,int y=0):x(x),y(y){} //Point

2020-02-23 06:43:21

#include<stdio.h> #include<string.h> int readchar(); int readint(int c); int code[8][1<<8]; int readcodes(); int

2020-02-23 06:43:21

#include<stdio.h> #define PI 3.1415927 int main() { double R; while(scanf("%lf",&R)!=EOF) { p

2020-02-23 06:43:21

#include<stdio.h> #include<math.h> #define maxn 1005 int main() { int m,n; double a[maxn]; while(scanf

2020-02-23 06:43:21

#include<cstdio> #include<cmath> const int maxn=105; int is_sushu(int x); int main() { int a[maxn]={0};

2020-02-23 06:43:21

#include<stdio.h> #define maxn 100000 int main() { int a[maxn]; int n; while(scanf("%d",&n)!=EOF&&n)

2020-02-23 06:43:21

#include<stdio.h> #define maxn 105 int main() { double a[maxn]; int n; while(scanf("%d",&n)==1&&n>0)

2020-02-23 06:43:21

#include<stdio.h> #define maxn 25 int n,k ,m,a[maxn]; int go(int p,int d,int t); int main() { while(scanf("%d

2020-02-23 06:43:21

#include<iostream> using namespace std; template <typename T> T sum(T*begin,T*end) { T*p=begin; T ans=0;

2020-02-23 06:43:21