sodabeta7

{"name":"embedding-data","document":{"backgroundColor":"#ffffff","slides":[{"id":"1750750129938","elements":[{"id":"frame","type":"rectangle","x":0,"y":0,"width":1080,"height":1080,"angle":0,"strokeColor":"#228be6","backgroundColor":"transparent","fillStyle":"solid","strokeWidth":1,"strokeStyle":"dashed","roughness":0,"opacity":100,"groupIds":[],"frameId":null,"roundness":null,"seed":500058849,"version":4,"versionNonce":1961899861,"isDeleted":false,"boundElements":null,"updated":1750749547702,"link":null,"locked":true},{"type":"rectangle","version":1250,"versionNonce":986797179,"isDeleted":false,"id":"T7FbOwDBX0f33mRrTZ23-","fillStyle":"cross-hatch","strokeWidth":1,"strokeStyle":"solid","roughness":0,"opacity":100,"angle":0,"x":160.5211499436905,"y":667.3469101517945,"strokeColor":"#1e1e1e","backgroundColor":"#40798c","width":77.89873267838472,"height":71.69784813808563,"seed":1618812015,"groupIds":["XFBChi2qESRR0HX4k8UlB"],"roundness":null,"boundElements":[],"updated":1750749547702,"link":null,"locked":false

sodabeta7

test

sodabeta7

#include <bits/stdc++.h>
using namespace std;
#define TR(i,v)       for(__typeof((v).begin())i=(v).begin();i!=(v).end();++i)
#define DEBUG(x)      cout<<#x<<" = "<<x<<endl
#define SIZE(p)       (int)(p).size()
#define MP(a,b)       make_pair((a),(b))
#define ALL(p)        (p).begin(),(p).end()
#define rep(i,n)      for(int i=0;i<(int)(n);++i)
#define REP(i,a,n)    for(int i=(a);i<(int)(n); ++i)
#define FOR(i,a,b)    for(int i=(int)(a);i<=(int)(b);++i)

sodabeta7

//函数式线段树
struct Node {
    int sum;  
    Node *ls,*rs;
}pool[maxn<<5],*null,*pnow;
Node *newNode() {
    pnow->sum=0,pnow->ls=pnow->rs=null;
    return pnow++;
}
void addit(Node *&u,int l,int r,int pos,int v) {

sodabeta7

name: "VGG_ILSVRC_16_layers"

input: "data"
input_shape {
  dim: 1
  dim: 3
  dim: 224
  dim: 224
}

sodabeta7

namespace NT {
    typedef long long LL;
    const int SIEVE_SIZE=(int)1e7;
    const int MOD=(int)1e9+7;

    int minp[SIEVE_SIZE+1],prime[SIEVE_SIZE+1]; //the least prime factor, the prime list    
    //O(n) get all prime numbers <= SIEVE_SIZE, return the number of primes
    int Sieve(int n=SIEVE_SIZE) {
        int c=0;
        for(int i=2;i<=n;++i) {