代码搜索:Zoj

找到约 65 项符合「Zoj」的源代码

代码结果 65
www.eeworm.com/read/362573/9990565

cpp zoj3015.cpp

#include #include #define pi acos(-1.0) int main(){ double k, h, a, b, x, y, d, f; while(scanf("%lf%lf%lf%lf", &k, &h, &a, &b) != EOF){ f = tan(k*pi/180);
www.eeworm.com/read/362573/9990567

cpp zoj1303.cpp

#include #define MAX 21 #define LEN 201 using namespace std; int dif[LEN], sum[LEN]; int path[MAX][2 * MAX * MAX + 1]; int f[2][2 * MAX * MAX + 1]; int n, m; void solve() {
www.eeworm.com/read/362573/9990568

cpp zoj2399.cpp

#include #include #include #include #include using namespace std; const int MAXN = 1550; const int INF = 0x3fffffff; int n, m; int N, src,
www.eeworm.com/read/362573/9990569

cpp zoj2432.cpp

#include using namespace std; int l1, l2; int a[510], b[510]; int f[510][510], pre[510][510]; int ans[510]; int main(){ scanf("%d", &l1); for (int i = 1; i
www.eeworm.com/read/362573/9990570

cpp zoj3017.cpp

#include #include int tm[20][110], mg[20][20]; int f[110][20][110]; int n, m, z; int main(){ int cases; scanf("%d", &cases); while (cases--){ scanf("%d%d%d", &n, &m
www.eeworm.com/read/362573/9990571

cpp zoj2182.cpp

#include #include #include using namespace std; const int MAXN = 110; int n, m, ans; bool g[MAXN][MAXN]; char s[10000]; vector gg[MAXN]; bool init(){
www.eeworm.com/read/362573/9990572

cpp zoj1391.cpp

#include using namespace std; const int MAXN = 8010; struct Line{ int x, y1, y2; bool operator < (const Line &b) const { return x < b.x; } } l[MAXN]; int n; int s[MAX
www.eeworm.com/read/362573/9990573

cpp zoj3014.cpp

#include char ans[20][20] = { "", "", "not special", "21", "31", "43", "5421", "5431", "76531", "765421", "9875321", "9876421", "BA98765421", "BA8765431", "DCBA9654321", "E
www.eeworm.com/read/362573/9990574

cpp zoj1866.cpp

#include #include const double eps=1e-6; int dblcmp(const double &a,const double &b) { if (fabs(a-b)
www.eeworm.com/read/362573/9990575

cpp zoj2170.cpp

#include #include using namespace std; struct elem { int num,d; int a[11]; }; bool operator