2017上-WA大全
RainyNeko
这个作者很懒,什么都没留下…
展开
-
WA卡关之uva202(解决问题后已AC)
#include using namespace std;int main(){ int m,n,i; while ((cin>>m>>n)) { int a[10000]= {0},b[10000]= {0}; int k,cycle,k1,flag=0; k=m%n; k1=m/n原创 2017-03-08 13:51:38 · 742 阅读 · 0 评论 -
WA之codeforces之144B
显性运行结果是对的,但一直RuntimeError。。。题目Problem B : MeetingSubmit Time Limit (per test): 2 seconds Memory Limit (per test): 256 MBThe Super Duper Secret Meeting of t原创 2017-03-19 21:01:15 · 411 阅读 · 0 评论 -
显性测试数据全对的WA之uva355(已AC)
题目:Write a program to convert a whole number specified in any base (2..16) to a whole number in anyother base (2..16). “Digits” above 9 are represented by single capital letters; e.g. 10 by A, 15原创 2017-03-07 16:06:55 · 938 阅读 · 0 评论 -
奇葩的uva102(多次WA后已AC)
暴力算法如果打草稿的话,推荐利用矩阵,形象生动。(注:max应改为min意思上更接近,懒得改了)---------------------------------------------------多次WA不知原因/* W A*/#include #include using namespace std;int main(){ int a,b[原创 2017-03-26 01:34:24 · 491 阅读 · 0 评论