07 2016 档案
摘要：a^b Time Limit: 1000MS Memory Limit: 65535KB 64bit IO Format: Description 求a的b次方，取模mod(1<=a,b,mod<=1e18) Description 求a的b次方，取模mod(1<=a,b,mod<=1e18) In
阅读全文
摘要：199. Beautiful People 199. Beautiful People time limit per test: 0.25 sec. memory limit per test: 65536 KB input: standard output: standard The most p
阅读全文
摘要：Roads in the North Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%lld & %llu Roads in the North Description Building and maintaining roads am
阅读全文
摘要：Inversion Sequence Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%lld & %llu Inversion Sequence Description For sequence i1, i2, i3, … , iN,
阅读全文
摘要：Problem C Time Limit:1000MS Memory Limit:131072KB 64bit IO Format:%I64d & %I64u Problem C Description 度熊手上有一本神奇的字典，你可以在它里面做如下三个操作： 1、insert : 往神奇字典中插入
阅读全文
摘要：海贼王之伟大航路 Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u 海贼王之伟大航路 Description “我是要成为海贼王的男人！”，路飞一边喊着这样的口号，一边和他的伙伴们一起踏上了伟大航路的艰险历程。
阅读全文
摘要：Runtime Error Bahosain was trying to solve this simple problem, but he got a Runtime Error on one of the test cases, can you help him by solving it? G
阅读全文
摘要：Heavy Coins Bahosain has a lot of coins in his pocket. These coins are really heavy, so he always tries to get rid of some of the coins by using them
阅读全文
摘要：Travelling Salesman After leaving Yemen, Bahosain now works as a salesman in Jordan. He spends most of his time travelling between different cities. H
阅读全文
摘要：Epic Professor Dr. Bahosain works as a professor of Computer Science at HU (Hadramout University). After grading his programming exam, he noticed that
阅读全文
摘要：Bahosain is walking in a street of N blocks. Each block is either empty or has one lamp. If there is a lamp in a block, it will light it’s block and t
阅读全文
摘要：Rock-Paper-Scissors Rock-Paper-Scissors is a two-player game, where each player chooses one of Rock, Paper, or Scissors. Here are the three cases in w
阅读全文
摘要：Pseudoforest Time Limit:5000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u Submit Status Description In graph theory, a pseudoforest is an undirected graph in which every connected c...
阅读全文
摘要：Mr. Kitayuta's Colorful GraphTime Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u Description Mr. Kitayuta has just bought an undirected graph consisting of n vertices and m...
阅读全文
摘要：Travel Time Limit:1000MS Memory Limit:131072KB 64bit IO Format:%I64d & %I64u /*神测试数据。。。。。【 T。T 】 15 5 122 3 63341 5 157243 5 57054 3 123821 3 21726633
阅读全文
摘要：/* 最小生成树，最小环的最大权值按照排序后去构建最小生成树就可以了，注意遇到的第一个根相同的点就记录权值，跳出，生成的环就是最小权值环。 */ //AC代码： #include"iostream" #include"cstdio" #include"cstring" #include"cmath" #include"algorithm" using namespace std; co...
阅读全文
摘要：还是畅通工程 Time Limit:2000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Description 某省调查乡村交通状况，得到的统计表中列出了任意两村庄间的距离。省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通（但不一定有直接的公路相连，只要能间接通过公路可达即可），并要求铺设的公路总长...
阅读全文
摘要：继续畅通工程 Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Submit Status Description 省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通（但不一定有直接的公路相连，只要能间接通过公路可达即可）。现得到城镇道路统计表，表中列出了任意两城镇间修建道路...
阅读全文
摘要：畅通工程 Time Limit:2000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Description 某省调查城镇交通状况，得到现有城镇道路统计表，表中列出了每条道路直接连通的城镇。省政府“畅通工程”的目标是使全省任何两个城镇间都
阅读全文
摘要：Ubiquitous Religions Time Limit:5000MS Memory Limit:65536KB 64bit IO Format:%lld & %llu Description 当今世界有很多不同的宗教,很难通晓他们。你有兴趣找出在你的大学里有多少种不同的宗教信仰。 你知道在你的大学里有n个学生(0 < n <= 50000) 。你无法询问每个学生的宗教信...
阅读全文
摘要：The Suspects Time Limit:1000MS Memory Limit:20000KB 64bit IO Format:%lld & %llu Description 严重急性呼吸系统综合症( SARS), 一种原因不明的非典型性肺炎,从2003年3月中旬开始被认为是全球威胁。为了减少传播给别人的机会, 最好的策略是隔离可能的患者。 在Not-Spreadi...
阅读全文
摘要：Copying Data Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u Description We often have to copy large volumes of information. Such operation can take up many computer r...
阅读全文
摘要：1 #include"iostream" 2 #include"algorithm" 3 #include"cstdio" 4 #include"cmath" 5 #include"cstring" 6 #define MX 1400000 7 #define INF 0x3f3f3f3f 8 #d
阅读全文
摘要：统计难题 Time Limit:2000MS Memory Limit:65535KB 64bit IO Format:%I64d & %I64u Submit Status 统计难题 Submit Status Description Ignatius最近遇到一个难题,老师交给他很多单词(只有小写
阅读全文
摘要：Hotel Time Limit:3000MS Memory Limit:65536KB 64bit IO Format:%lld & %llu Description The cows are journeying north to Thunder Bay in Canada to gain cu
阅读全文
摘要：//用到懒惰标记法。 //Query查询求和，UpData更新数据。 //AC代码： 1 #include"iostream" 2 #include"algorithm" 3 #include"cstdio" 4 #include"cstring" 5 #include"cmath" 6 using
阅读全文
摘要：数学题，直接二分，代码 1 #include"iostream" 2 #include"algorithm" 3 #include"cstdio" 4 #include"cstring" 5 #include"cmath" 6 #define max(a,b) a>b?a:b 7 #define m
阅读全文
摘要：1 #include"iostream" 2 #include"algorithm" 3 #include"cstdio" 4 #include"cstring" 5 #include"cmath" 6 #define max(a,b) a>b?a:b 7 #define min(a,b) a<b?
阅读全文
摘要：1 #include"iostream" 2 #include"algorithm" 3 #include"cstdio" 4 #include"cstring" 5 #include"cmath" 6 #define max(a,b) a>b?a:b 7 #define min(a,b) a<b?
阅读全文
摘要：敌兵布阵 Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Description Lily 特别喜欢养花，但是由于她的花特别多，所以照料这些花就变得不太容易。她把她的花依次排成一行，每盆花都有一个美观值。如果L
阅读全文
摘要：E - Just a Hook Time Limit:2000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Description In the game of DotA, Pudge’s meat hook is actually th
阅读全文
摘要：Billboard Time Limit:8000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Billboard Description 在学校的入口处有一个巨大的矩形广告牌，高为h，宽为w。所有种类的广告都可以贴，比如ACM的广告啊，
阅读全文
摘要：C - Minimum Inversion Number Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u C - Minimum Inversion Number Description The inversi
阅读全文
浙公网安备 33010602011771号