第十三届题目

九进制转十进制#include stdio.h #include math.h int main(int argc, char *argv[]) { printf(%d,2*12*92*9*9*9); return 0; }顺子日期#include stdio.h #include stdlib.h int main(int argc, char *argv[]) { printf(14); return 0; }刷题统计#include stdio.h #include stdlib.h typedef long long ll; int main(int argc, char *argv[]) { ll a,b,n; scanf(%lld %lld %lld,a,b,n); ll weeka*5b*2; ll tn%week; ll xn/week*7; if(t!0) { ll sum0,k0; for(int i1;i5;i) { suma; if(sumt) { printf(%lld,xi); return 0; } } for(int i1;i2;i) { sumb; if(sumt) { printf(%lld,xi5); return 0; } } } printf(%lld,x); return 0; }修剪灌木#includestdio.h int main() { int n; scanf(%d,n); for(int i1;in/2;i) { printf(%d\n,2*n-2*i); } if(n%2!0) printf(%d\n,n-1); for(int in/2;i0;i--) { printf(%d\n,n*2-i*2); } return 0; }X 进制减法#include stdio.h int max2(int a,int b) { return ab?a:b; } int max3(int a,int b,int c) { int tmax2(a,b); return tc?t:c; } int main(int argc, char *argv[]) { int n; scanf(%d,n); int ma; scanf(%d,ma); int a[100005]; for(int ima-1;i0;i--) { scanf(%d,a[i]); } int mb; scanf(%d,mb); int b[100005]; for(int imb-1;i0;i--) { scanf(%d,b[i]); } int tmax2(ma,mb); long long ans0; for(int it-1;i0;i--) { int m1(ima)?a[i]:0; int m2(imb)?b[i]:0; int xmax3(m11,m21,2); ans(ans*(long long)x(long long)(m1-m2))%1000000007; if(ans0) ans1000000007; } printf(%lld,ans); return 0; }统计子矩阵#include stdio.h #include stdlib.h int main(int argc, char *argv[]) { int n,m; long long k; int a[1000][1000]; scanf(%d %d %lld,n,m,k); for(int i0;in;i) { for(int j0;jm;j) { scanf(%d,a[i][j]); } } long long cnt0; long long col_sum[1000]; for(int top0;topn;top) { for(int j0;jm;j) { col_sum[j]0; } for(int bottomtop;bottomn;bottom) { for(int j0;jm;j) { col_sum[j]a[bottom][j]; } int left0; long long current_sum0; for(int right0;rightm;right) { current_sumcol_sum[right]; while(current_sumkleftright) { current_sum-col_sum[left]; left; } if(current_sumk) { cnt(long long)(right-left1); } } } } printf(%lld,cnt); return 0; }积木画#include stdio.h #include stdlib.h typedef long long ll; const mod1000000007; int dp[10000010][3]; int main(int argc, char *argv[]) { dp[0][2]1; dp[1][2]1; int n; scanf(%d,n); for(int i2;in;i) { dp[i][0]((ll)dp[i-1][1]dp[i-2][2])%mod; dp[i][1]((ll)dp[i-1][0]dp[i-2][2])%mod; dp[i][2]((ll)dp[i-1][2]dp[i-1][0]dp[i-1][1]dp[i-2][2])%mod; } printf(%d,dp[n][2]); return 0; }扫雷#include stdio.h #include stdlib.h int main(int argc, char *argv[]) { int n,m; scanf(%d %d,n,m); int a[1005][1005],b[1005][1005]; for(int i0;in;i) { for(int j0;jm;j) { scanf(%d,a[i][j]); } } int dx[]{1,1,1,-1,-1,-1,0,0}; int dy[]{1,-1,0,1,-1,0,1,-1}; for(int i0;in;i) { for(int j0;jm;j) { if(a[i][j]1) { b[i][j]9; continue; } int cnt0; for(int k0;k8;k) { int xidx[k],yjdy[k]; if(x0y0xnym) { if(a[x][y]1) cnt; } } b[i][j]cnt; } } for(int i0;in;i) { for(int j0;jm;j) { printf(%d ,b[i][j]); } printf(\n); } return 0; }砍竹子#include stdio.h #include math.h typedef long long ll; ll h[200005][8]; ll sum(ll n) { ll ressqrtl(n/21); return res; } int main(int argc, char *argv[]) { ll n,res0; scanf(%lld,n); for(int i0;in;i) { scanf(%lld,h[i][0]); for(int j1;h[i][j-1]1;j) { h[i][j]sum(h[i][j-1]); res; } } for(int i0;in-1;i) { for(int j0;h[i][j]!1;j) { for(int k0;h[i1][k]!1;k) { if(h[i][j]h[i1][k]) { res--; break; } } } } printf(%lld,res); return 0; }