D2. Submarine in the Rybinsk Sea (hard edition)

 http://codeforces.com/contest/1195/problem/D2

思路:记录长度;判断每个数的贡献;

#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%lld",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))
#include
#include 
using namespace __gnu_pbds;
*/

//gp_hash_tablemp2;
//__gnu_pbds::priority_queueq;//因为放置和std重复,故需要带上命名空间
//__gnu_pbds::priority_queue,pairing_heap_tag> pq;//最快
//----------------------------------------------------------


/*
//----------------------------------------------------------
const int BufferSize = 1 << 16;
char buffer[BufferSize], *_head, *_tail;
inline char Getchar() {
    if (_head == _tail) {
        int l = fread(buffer, 1, BufferSize, stdin);
        _tail = (_head = buffer) + l;
    }
    return *_head++;
 }
inline int read() {
    int x = 0, f = 1;char c = Getchar();
    for (;!isdigit(c);c = Getchar()) if (c == '-') f = -1;
    for (;isdigit(c);c = Getchar()) x = x * 10 + c - '0';
    return x * f;
 }
//----------------------------------------------------------
*/


const int maxn=1e5+9;
const int maxm=4e5+9;
const int mod=998244353;

string s[maxn];

int num[20];
int main()
{
    //FAST_IO;

    //freopen("input.txt","r",stdin);


    ll ans=0;
    int n;
    cin>>n;
    for(int i=0;i>s[i];
        num[s[i].length()]++;
    }

    //for(int i=0;i=0;k--)
                    {
                        tmp=tmp+(s[i][k]-'0')*cnt%mod;
                        tmp%=mod;
                        cnt*=10;
                        cnt%=mod;
                        cnt*=10;
                        cnt%=mod;

                        tmp=tmp+(s[i][k]-'0')*cnt2%mod;
                        tmp%=mod;
                        cnt2*=10;
                        cnt2%=mod;
                        if(len-1-k=0;k--)
                    {
                        if(len-1-k

 

你可能感兴趣的:(D2. Submarine in the Rybinsk Sea (hard edition))