随笔分类 -  POJ

POJ
POJ_Prob.ID：3255
摘要：POJ 3255 #include <iostream> #include <string.h> #include <algorithm> #include <stdio.h> #include <stdlib.h> #include <vector> #include <queue> #inclu 阅读全文
posted @ 2020-03-24 00:02 笔墨伺候1 阅读(131) 评论(0) 推荐(0)
POJ_Prob.ID:1182
摘要：#include<cstdio> const int maxn = 50000+10; int p[maxn]; //存父节点 int r[maxn];//存与父节点的关系 0 同一类，1被父节点吃，2吃父节点 void set(int n) //初始化 { for(int x = 1; x <= 阅读全文
posted @ 2020-03-24 00:01 笔墨伺候1 阅读(136) 评论(0) 推荐(0)
POJ_Prob.ID:2431
摘要：Expedition Time Limit: 1000MS Memory Limit: 65536K Description A group of cows grabbed a truck and ventured on an expedition deep into the jungle. Bei 阅读全文
posted @ 2020-03-24 00:00 笔墨伺候1 阅读(140) 评论(0) 推荐(0)
POJ_Prob.ID:2386 Lake Counting
摘要：Lake Counting Time Limit: 1000MS Memory Limit: 65536K Description Due to recent rains, water has pooled in various places in Farmer John’s field, whic 阅读全文
posted @ 2020-02-12 20:28 笔墨伺候1 阅读(126) 评论(0) 推荐(0)
POJ_Prob.ID:3069 Saruman's Army
摘要：A+B Problem Time Limit: 1000MS Memory Limit: 65536K Description Saruman the White must lead his army along a straight path from Isengard to Helm’s Dee 阅读全文
posted @ 2020-02-12 20:26 笔墨伺候1 阅读(118) 评论(0) 推荐(0)
POJ_Prob.ID:1000 A+B Problem
摘要：A+B Problem **Time Limit:** 1000MS **Memory Limit:** 10000K **Total Submissions:** 498343 **Accepted:** 281415 Description Calculate a+b Input Two int 阅读全文
posted @ 2020-02-12 20:16 笔墨伺候1 阅读(102) 评论(0) 推荐(0)