摘要：
1 #include 2 #include 3 #include 4 using namespace std; 5 6 const int maxn=305; 7 const int INF=0xffffff; 8 9 int G[maxn][maxn];10 int a[maxn];11 i... 阅读全文
摘要：
#include#includeusing namespace std;int a[1005][1005];int main(){ int n; while(cin>>n) { a[n][0]=1; for(int i=0;i>m) cout<<a[n][m]<<endl; }} 阅读全文
摘要：
DescriptionAfter escaping from Figo's chase, Severus falls into a N * M maze designed by Figo.At first, Severus is located on the grid S. Every second he can only move to the four grids that adjacent to the grid he islocated on. The moment he move to any side of the maze, he will get rid of Figo 阅读全文
摘要：
数学题 求2^p-1的位数代码： 1 #include 2 #include 3 #include 4 #include 5 using namespace std; 6 7 int main() 8 { 9 int p;10 while(cin>>p)11 {12 cout<<int(p*log10 (2.0))+1<<endl;13 }14 return 0;15 }View Code 阅读全文
摘要：
new int;//开辟一个存放整数的存储空间，返回一个指向该存储空间的地址(即指针) new int(100);//开辟一个存放整数的空间，并指定该整数的初值为100，返回一个指向该存储空间的地址 new char[10];//开辟一个存放字符数组(包括10个元素)的空间，返回首元素的地址 new int[5][4];//开辟一个存放二维整型数组(大小为5*4)的空间，返回首元素的地址 float *p=new float (3.14159);//开辟一个存放单精度数的空间，并指定该实数的初值为//3.14159，将返回的该空间的地址赋给指针变量p new运算符使用的一般... 阅读全文
摘要：
联系网络Time Limit: 1000 MSMemory Limit: 32768 KTotal Submit: 6(5 users)Total Accepted: 5(5 users)Rating:Special Judge:NoDescriptionTwIStOy要建立一个联系网络，这样可以方... 阅读全文
摘要：
CheerleadersIn most professional sporting events, cheerleaders play a major role in entertaining the spectators. Their roles are substantial during breaks and prior to start of play. The world cup soccer is no exception. Usually the cheerleaders form a group and perform at the centre of the field. I 阅读全文
摘要：
在别人博客找的 帮上大忙了《算法竞赛入门经典——训练指南》第二章相关内容分类：资料2013-01-04 20:541293人阅读评论(4)收藏举报#《算法竞赛入门经典——训练指南》第二章相关内容由于动态规划的高阶比较难，所以伴随这数论一起刷红色为做了黄色不懂的 希望各位大牛能帮帮小弟勘误P112.例题4，LA3516的图画错了，请参考原题：https://icpcarchive.ecs.baylor.edu/external/35/3516.html[第二次印刷改正]p180.表2-8 第一行信息有误，应为：例题14UVa11021Tribbles离散概率；递推以下是《算法竞赛入门经典——训. 阅读全文
摘要：
|A∪B∪C∪D|=|A|+|B|+|C|+|D|-|A∩B|-|A∩C|-|A∩D|-|B∩C|-|B∩D|-|C∩D|+|A∩B∩C |+|A∩B∩D|+|B∩C ∩D|-|A∩B∩C ∩D| 阅读全文
摘要：
You are givennrods of length 1, 2…, n. You have to pick any 3 of them & build a triangle. How many distinct triangles can you make? Note that, two triangles will be considered different if they have at least 1 pair of arms with different length.InputThe input for each case will have only a singl 阅读全文