F.A.Q
Hand In Hand
Online Acmers
Problem Archive
Realtime Judge Status
Authors Ranklist
 
     C/C++/Java Exams     
ACM Steps
Go to Job
Contest LiveCast
ICPC@China
Best Coder beta
VIP | STD Contests
    DIY | Web-DIY beta
Author ID 
Password 
 Register new ID

Odd Shops

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 143    Accepted Submission(s): 73


Problem Description
In OddLand, there are many odd shops.
These shops only sell goods weighted from 1 to 10. For every weight i in [1,10], there are $a_i$ kinds of goods weighted i.
The shops are odd because one is only allowed to buy one item or nothing in each shop. And though goods in every shop are different, the array $a$ for each shop is the same.
As you love odd things so much, you wonder for how many total weights, there are odd ways to buy items in n odd shops to achieve this total weight. Since there might be many, output the number mod 998244353.
 

Input
There are multiple test cases, please read till the end of input file.
For each test case, the first line contain a single integer n, the number of odd shops.
The second line contain ten integers separated by spaces, $a_1,a_2...a_{10}$.
$1 \leq n \leq 10^9, 0 \leq a_i \leq 100$. No more than 10 test cases.
 

Output
For every test case, output the number of valid total weights mod 998244353.
 

Sample Input
1 1 2 3 4 5 6 7 8 9 10 2 1 0 0 0 0 0 0 0 0 0 100 1 1 1 1 0 0 0 0 0 0
 

Sample Output
6 2 35
 

Source
 

Statistic | Submit | Discuss | Note
Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2024 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2024-12-11 21:14:46, Gzip enabled