Hoping to A,B,C,D at least.... :)

I hope I could solve Task A-D.

Hope it's not rubbish round like abc472.

Another day for ABC

pls let me solve F?

Maybe I can't solve B.

Hoping I can solve E

Hope I can solve A,B,C,D.

Ans good luck to everyone!

D is a little bit difficult,I wonder what is the examiner thinking when he created this problem

Hope I can solve E and F

wth with D problem..

The hell is the C problem i dont understand the language

Was able to solve from A to E.

D was harder than E, i solved E in 0:25 minutes but couldnt solve D

bruhhh i should have focused on problem E instead of D... couldn't finish it :|

Wuwuu.... (crying loudly)

My D TLEd....

Why is my program so slow QwQ...

If the evaluation machine is a supercomputer, it should be able to pass

My Code:

#include<bits/stdc++.h>
using namespace std;

int n,k;

inline void write(int x){
	if(x>9) write(x/10);
	putchar(x%10+'0');
}

void build(int pos, int val, deque<int> q){
	if(val==0){
		while(!q.empty()){
			write(q.front());
			putchar(' ');
			q.pop_front();
		}
		for(int i=pos; i<=n; i++) putchar('0'),putchar(' ');
		putchar('\n');
		return;
	}
	else if(pos>n||pos>val) return;
	for(int i=0; i*pos<=val; i++){
		q.push_back(i);
		build(pos+1,val-i*pos,q);
		q.pop_back();
	}
}
deque<int> q;
int main(){
	cin>>n>>k;
	build(1,k,q);
	return 0;
}

A-F is quite easy, I think F is only *1800，only segment tree is used. But G probably needs NTT, it's a big difficulty gap.

upset,D is so difficult!!!

I can tell that F is about a Fenwick tree,but I forgot the template.what a pity!

I AK ABC473.

A<B<C<E<F<G<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<D

D is not a problem!!!

E,F,G are BORING!!!

I cannot figured out the combinatorics formula for the final problem. Guess my math skill isnt good enough. Can anyone show me the idea and walkthrough about how you figured out and solved it?

Here is my solution for E. No idea what went wrong Link

No idea what case I am actually missing on

I passed G... but at 21:40:22. :(

Easy round

I don't know why he likes eating cards:(

I think that D is more difficult than other quetions!!! Since I've had so many TLEs... My Code:

#include<bits/stdc++.h>
#define int long long
using namespace std;
const int mod=1e9+7;
const int N=3e5+5;
int n,a[20],k,len; 
int ans[N][20];
void solve();
void dfs(int x,int cnt){
	if(cnt>k) return ;
	if(x>n){
		if(cnt==k){
			len++;
			for(int i=1;i<=n;i++){
				ans[len][i]=a[i];
			}
		}
		return ;
	}
	if(cnt==k){
		dfs(n+1,cnt);
		return;
	}
	if(cnt<k&&cnt+x>k) return ;
	for(int i=0;i*x+cnt<=k;i++){
		a[x]=i;
		dfs(x+1,x*i+cnt);
		a[x]=0;
	}
} 
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int _=1;
//	cin>>_;
	while(_--){
		solve();
	}
	return 0;
}
void solve(){
	cin>>n>>k;
	dfs(1,0);
	for(int i=1;i<=len;i++){
		for(int j=1;j<=n;j++){
			cout<<ans[i][j]<<' ';
		}
		cout<<'\n';
	}
	return ;
}

D is VERY terrible.The others are not tooooooooooo bad.

In the editorial for problem G — Wipeout, en_translator cleverly utilizes #include<atcoder/all> to implement the NTT function. I find this quite impressive. Would someone kindly explain how to correctly use the atcoder namespace?

I solved D with DFS:)

But I spent too much time on D, so my pref is low, MY RANTING IS ABOUT MY SCORE GOING STRAIGHT INTO THE TOILET!!!

My code of D get AC*37 and TLE*1,why???Doesn't AtCoder Judge run fast?

#include<bits/stdc++.h>
using namespace std;
using ll=long long;
ll cnt;
vector<vector<ll>> ans(300005,vector<ll>(15));
ll vec[15];
ll n,k;
void dfs(ll dep,ll rem){
	if(dep==0){
		if(rem==0){
			++cnt;
			for(ll i=1;i<=n;++i) ans[cnt][i]=vec[i];
		} 
		return;
	}
	if(rem<0) return;
	if(dep>rem){
		vec[dep]=0;
		dfs(dep-1,rem);
		return;
	}
	for(ll i=0;i<=rem/dep;++i){
		vec[dep]=i;
		dfs(dep-1,rem-i*dep);
		vec[dep]=0;
	}
}
int main(){
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	cin>>n>>k;
	dfs(n,k);
	sort(ans.begin()+1,ans.begin()+cnt+1);
	for(int i=1;i<=cnt;++i){
		for(int j=1;j<=n;++j){
			cout<<ans[i][j]<<" ";
		}
		cout<<"\n";
	}
	return 0;
}

Why SO many NTT?

I ask this problem in LAST LAST week too.

In my opinion, A = B = C < E < F << D << G. What's so terrible about problem D is that you'd never figure out from pure thinking during the contest that a slightly optimized brute force could pass, and it takes way too much courage to actually write that kind of brute force in an ABC.

Why does the editorial for problem G use the atcoder namespace? I fucking wrote NTT by hand!I hate NTT.

BORING CONTEST! Why do u let me put so much time(nearly half an hour) on making my code run faster and faster on problem D? Why do u put NTT for problem G? Why is problem F almost a template for segment tree?

who can teach me how to solve G, please!!!

This is my first time solving problem F.

I got a TLE on D at least. :(

First F!!!

Regret not having watched E

AtCoder is shamelessly promoting their ACL.The just put an NTT in problem G.

This is my first pb , try to solve atleast 3 pb

this will be my first contest , try to solve atleast 3