第十二届题目

空间1mb1024kb 1kb1024b 1b8位#include stdio.h #include stdlib.h int main(int argc, char *argv[]) { printf(%lld,256LL*1024*1024*8/32); return 0; }卡片#include stdio.h #include stdlib.h int main(int argc, char *argv[]) { long long n; scanf(%lld,n); long long sum0,i1; while(1) { sumi; if(sumn) break; i; } printf(%lld,i); return 0; }直线#include stdio.h #include stdlib.h int n 0; double ab[100000][2]{{0},{0}}; int fun(int x0,int y0,int x1,int y1) { double a (y0-y1)*1.0/(x0-x1); double b (x0*y1-x1*y0)*1.0/(x0-x1); for(int i0;in;i) { if(ab[i][0]aab[i][1]b) return 0; } ab[n][0] a; ab[n][1] b; n; return 1; } int main(int argc, char *argv[]) { for(int x00;x020;x0) for(int y00;y021;y0) { for(int x1 x01;x120;x1) for(int y1 y01;y121;y1) fun(x0,y0,x1,y1); } printf(%d,2*n41); return 0; }货物摆放#include stdio.h #include stdlib.h int main() { long long a[3000],i,n2021041820210418; long long x,z,y; int cnt0,m0; for(i1;i*in;i) { if(n%i0) { a[m]i; if(n/i!i) { a[m]n/i; } } } for(x0;xm;x) { for(y0;ym;y) { for(z0;zm;z) { if(a[x]*a[y]*a[z]n) cnt; } } } printf(%d,cnt); return 0; }路径#include stdio.h #include stdlib.h int gcd(int a,int b) { while(b) { int tb; ba%b; at; } return a; } int lcm(int a,int b) { return a/gcd(a,b)*b; } int main(int argc, char *argv[]) { int f[2022]{0}; for(int i1;i2021;i) { for(int ji1;j2021ji21;j) { if(f[j]0) f[j]f[i]lcm(i,j); else { int new_valf[i]lcm(i,j); if(new_valf[j]) f[j]new_val; } } } printf(%d,f[2021]); return 0; }时间显示#include stdio.h #include stdlib.h int main(int argc, char *argv[]) { unsigned long long t; scanf(%llu,t); long long nt/1000; int h,m,s; hn/3600%24; mn%3600/60; sn%60; printf(%02d:%02d:%02d,h,m,s); return 0; }砝码称重双向排序只过60%#include stdio.h #include stdlib.h int cmp_a(const void *a,const void *b) { return *(int*)a-*(int*)b; } int cmp_b(const void *a,const void *b) { return *(int*)b-*(int*)a; } int main() { int n,m; scanf(%d %d,n,m); int a[100005],b[100005]; for(int i0;in;i) { a[i]i1; } while(m--) { int p,q; scanf(%d %d,p,q); if(p0) { for(int i0;iq;i) { b[i]a[i]; } qsort(b,q,sizeof(int),cmp_b); for(int i0;iq;i) { a[i]b[i]; } } else if(p1) { int startq-1; int lenn-start; for(int i0;ilen;i) { b[i]a[starti]; } qsort(b,len,sizeof(int),cmp_a); for(int i0;ilen;i) { a[starti]b[i]; } } } for(int i0;in;i) { printf(%d ,a[i]); } return 0; }