Question:http://poj.org/problem?id=1004问题点:求平均值及格式化输出. Memory: 248K Time: 0MS Language: C++ Result: Accepted #include<iostream> #include<iomanip> using namespace std; int main(void) { double sum=0.0; ;i<=;i++) { double temp; cin>>temp

1.搜索 //回溯 2.DP(动态规划) 3.贪心 北大ACM题分类2009-01-27 1 4.图论 //Dijkstra.最小生成树.网络流 5.数论 //解模线性方程 6.计算几何 //凸壳.同等安置矩形的并的面积与周长sp; 7.组合数学 //Polya定理 8.模拟 9.数据结构 //并查集.堆sp; 10.博弈论 1. 排序 sp; 1423, 1694, 1723, 1727, 1763, 1788, 1828, 1838, 1840, 2201, 2376, 2377, 2380

北大ACM - POJ试题分类 -- By EXP 2017-12-03 转载请注明出处: by EXP http://exp-blog.com/2018/06/28/pid-38/ 相关推荐文: 旧版POJ分类目录: http://exp-blog.com/2018/06/10/pid-136/ ACM绝版资源公开( 参考书.模板.讲义.指导): http://exp-blog.com/2018/07/11/pid-1777/ ACM国家集训队论文集(1999-2009): http://ex

在百度文库上找到的,不知是哪位大牛整理的,真的很不错! zz题 目分类 Posted by fishhead at 2007-01-13 12:44:58.0 -------------------------------------------------------------------------------- acm.pku.edu.cn 1. 排序 1423, 1694, 1723, 1727, 1763, 1788, 1828, 1838, 1840, 2201, 2376, 23

Question:http://poj.org/problem?id=1014 问题点:抽屉原理.dfs.多重背包. Memory: 248K Time: 16MS Language: C++ Result: Accepted #include <iostream> using namespace std; ]; bool dfs(int v,int c) { ) return true; ||v<) return false; ;i<=arr_i[c-];i++) { )) re

Question:http://poj.org/problem?id=1013 问题点:排除+验证. Memory: 244K Time: 16MS Language: C++ Result: Accepted #include <iostream> #include <string> using namespace std; ];//0:未出现 1:even 2:up/down ]; int main() { int k,weight; cin>>k; ) { wei

Question:http://poj.org/problem?id=1012 问题点:约瑟夫环. Memory: 220K Time: 329MS Language: C++ Result: Accepted #include <iostream> using namespace std; bool calc(int k,int m) { ; *k; bool flag=true; while(sum>k) { pos=(m+pos-)%sum; if(pos<k) flag=f

Question:http://poj.org/problem?id=1010问题点:DFS.剪枝. Memory: 220K Time: 32MS Language: C++ Result: Accepted #include <iostream> using namespace std; #define MAX_STAMP_TYPE 100 int stamp[MAX_STAMP_TYPE]; bool tie,none; ],ans[];//记录stamp的index int max_s

Question:http://poj.org/problem?id=1009问题点:RLE编码. Memory: 648K Time: 547MS Language: C++ Result: Accepted #include <iostream> #include <cstdlib> #include <map> #include <vector> using namespace std; map<int,int> mp; map<in

Question:http://poj.org/problem?id=1008 问题点:日历转换. Memory: 280K Time: 16MS Language: C++ Result: Accepted #include <iostream> #include <string.h> #include <malloc.h> using namespace std; ]={ "pop", "no", "zip"

Question:http://poj.org/problem?id=1003问题点:水题. Memory: 220K Time: 0MS Language: C++ Result: Accepted #include <iostream> using namespace std; int calcCard(float f) { ; ; for(;sum<f;i++) { sum+=1.0f/i; } ; } int main() { ]={}; ,j=; do{ cin>>

Question:http://poj.org/problem?id=1007 问题点:逆序数及快排. Memory: 248K Time: 0MS Language: C++ Result: Accepted #include <iostream> #include <string> #include <stdlib.h> using namespace std; struct nm { ]; int cnt; }; int mycmp(const void *a,c

Question:http://poj.org/problem?id=1006 问题点:孙子定理 Memory: 248K Time: 0MS Language: C++ Result: Accepted #include <iostream> using namespace std; int getGCD(int a,int b)//Greatest Common Divisor { if(a<b){a+=b;b=a-b;a=a-b;} ) ; ) return a/b; else r

Question:http://poj.org/problem?id=1005问题点:计算半圆面积及向上取整. Memory: 256K Time: 0MS Language: C++ Result: Accepted #include <iostream> using namespace std; #define pi 3.1415926 #define Num 200 int main() { int N; ]; cin>>N; ;i<N;i++) { cin>&g

Question:http://poj.org/problem?id=1002问题点:字符映射.选重复项及排序. Memory: 1136K Time: 813MS Language: C++ Result: Accepted 4 #include <stdio.h> #include <stdlib.h> #include <string.h> #include <iostream> using namespace std; ]={'}; int mycm

Question:http://poj.org/problem?id=1753 问题点:穷举. #include <iostream> using namespace std; ][];//记录输入 ][];//记录操作 ][];//中间变量 bool judge() { ; ;i<;i++) { ;j<;j++) { sum+=c[i][j]; } } ||sum==) return true; else return false; } int inttobools(int k)

Question:http://poj.org/problem?id=1001问题点:大数运算(求幂) #include <iostream> using namespace std; #define max 1000 char a[max]; char b[max]; char c[max]; int main() { memset(a,,*sizeof(char)); memset(b,,*sizeof(char)); memset(c,,*sizeof(char)); *sizeof(c

原题大概意思就是统计输入字符串中,重复的最大个数! import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner sc=new Scanner(System.in); String temp;//用于暂存输入的颜色字符串 String[] ballon; //用于存储至多1000个气球的颜色字符串 int [] count;; // 用于记录每种颜色的个数 int ca

Question:http://poj.org/problem?id=1020 问题点:DFS. Memory: 260K Time: 47MS Language: C++ Result: Accepted #include <iostream> using namespace std; ];//按列记录小块Cake填充状态 ];//小块Cake边长 ];//小块Cake是否已使用 int width,cnt;//大块Cake边长 小块Cake数量 bool flag;//是否能被填充标志 i

Question:http://poj.org/problem?id=1019 问题点:打表. Memory: 392K Time: 16MS Language: C++ Result: Accepted #include <iostream> #include <cmath> using namespace std; #define uint unsigned int ]; ] = {,,,,,};//(1-10^k)/(1-10)的对应结果 ] = {,,,,,};//[1..