X-man

导航

2013年5月7日 #

友谊圈(Easy)

摘要: http://ch.vijos.org/Contest/%E3%80%8CAdera%203%E3%80%8D%E6%9D%AF%E7%9C%81%E9%80%89%E6%A8%A1%E6%8B%9F%E8%B5%9B/Problem/Show/%E5%8F%8B%E8%B0%8A%E5%9C%88(Easy)错误的dp初始化代码View Code #include<stdio.h>#include<string.h>int a[20100];int dp[20100];int main(){ int n,max,m; int i,j; while(scanf(&quo 阅读全文

posted @ 2013-05-07 22:52 雨钝风轻 阅读(222) 评论(0) 推荐(0) 编辑

爱情测试

摘要: http://ch.vijos.org/Contest/%E7%99%BD%E8%89%B2%E6%83%85%E4%BA%BA%E8%8A%82%E6%AC%A2%E4%B9%90%E8%B5%9B%20-%20Day1(Easy)/Problem/Show/%E7%88%B1%E6%83%85%E6%B5%8B%E8%AF%95#include<stdio.h>const long long mod=100007;long long multy(long long q, long long n){ long long cnt = n; long long base = q; . 阅读全文

posted @ 2013-05-07 21:52 雨钝风轻 阅读(222) 评论(0) 推荐(0) 编辑