Codeforces Round #723 (Div. 2）B. I Hate 1111（完全背包）

problem

B. I Hate 1111
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
You are given an integer x. Can you make x by summing up some number of 11,111,1111,11111,…? (You can use any number among them any number of times).

For instance,

33=11+11+11
144=111+11+11+11
Input
The first line of input contains a single integer t (1≤t≤10000) — the number of testcases.

The first and only line of each testcase contains a single integer x (1≤x≤109) — the number you have to make.

Output
For each testcase, you should output a single string. If you can make x, output “YES” (without quotes). Otherwise, output “NO”.

You can print each letter of “YES” and “NO” in any case (upper or lower).

Example
inputCopy
3
33
144
69
outputCopy
YES
YES
NO
Note
Ways to make 33 and 144 were presented in the statement. It can be proved that we can’t present 69 this way.

solution

#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e5+10;
int v[5] = {0,11,111,1111,11111};
int f[maxn];
int main(){
	int T;  cin>>T;
	while(T--){
		int x;  cin>>x;
		if(x>5000){cout<<"YES\n"; continue;}
		memset(f,0,sizeof(f));
		for(int i = 1; i <= 4; i++){
			for(int j = v[i]; j <= x; j++){
				f[j] = max(f[j], f[j-v[i]]+v[i]);
			}
		}
		if(f[x]==x)cout<<"YES\n";
		else cout<<"NO\n";
	}
	return 0;
}


  

 

  
 
 

  
1
  
2
  
3
  
4
  
5
  
6
  
7
  
8
  
9
  
10
  
11
  
12
  
13
  
14
  
15
  
16
  
17
  
18
  
19
  
20
  
21
  
22
 

文章来源: gwj1314.blog.csdn.net，作者：小哈里，版权归原作者所有，如需转载，请联系作者。

原文链接：gwj1314.blog.csdn.net/article/details/117401442