"2016长城信息杯中国大学生程序设计竞赛中南邀请赛"
Hzy_hzy_hzy
世间万物生生衍息······ 你找到生命的存在了吗?
展开
-
湘潭oj_Rolling Variance1249(直接求)
#include #include #include int a[100001],c[201]; //c数组统计每个数出现的次数 double aver[100001],sum1[100001]; int main(){ int n,m; while(~scanf("%d%d",&n,&m)){ memset(a,0,sizeof(a));原创 2016-06-15 09:38:08 · 535 阅读 · 0 评论 -
湘潭oj_1252 Defense Tower
#includeint a[100001];int main(){ int i,n; while(~scanf("%d",&n)){ for(i=1;i<=n;i++) scanf("%d",&a[i]); int x,y,sum=0; for(i=1;i<=n-1;i++) { scanf("%d%d原创 2016-06-15 11:37:55 · 553 阅读 · 0 评论 -
湘潭oj_1245 Hamiltonian Path
理解清楚题意得水题。#include#includeint abs(int x){ return x>=0?x:-x;}int a[100001];int main(){ int i,n,m; while(~scanf("%d%d",&n,&m)){ memset(a,0,sizeof(a)); int t=m; whi原创 2016-06-28 10:28:57 · 553 阅读 · 0 评论 -
湘潭oj_1243 2016
了解了快速幂和矩阵后开写,取余和2016的规律性亘了下。借鉴了http://www.cnblogs.com/yan-boy/archive/2012/11/29/2795294.html#include#includeint n,i,j,k;char str[100010];int mod(char *str){ int x=0,len=strlen(str); fo原创 2016-06-30 18:01:27 · 362 阅读 · 0 评论 -
湘潭oj_1246 Heartst
有些许想法..尝试:#include#include#includeusing namespace std;const int L=1000000007;int b[3];//b[1],b[2]分别记录怪物 hp%3后 余1和余2的个数int main(){ int i,n,m,x; while(scanf("%d%d",&n,&m)!=EOF){ me原创 2016-07-02 12:46:43 · 459 阅读 · 0 评论 -
湘潭oj_1250 Super Fast Fourier Transform
分析可知a,b数组都有重复的数,然后模拟运算即可。#include#include#includeint a[1000001],b[1000001],a1[100001][2],b1[100001][2];int abs(int x) { return (x>=0?x:-x);}int main(){ int x,n,m,i,j; while(~scanf("%d%d",&原创 2016-07-02 18:10:32 · 622 阅读 · 0 评论