Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int a[100005],cnt[100005];
- int main()
- {
- int n,m,cur=0;
- scanf("%d%d",&n,&m);
- int p=m+1;
- cnt[0]=1;
- for (int i=1;i<n;i++)
- {
- scanf("%d",&a[i]);
- cur=(cur+a[i])%(m+1);
- cnt[cur]++;
- }
- for (int i=m;i>=0;i--)
- {
- cnt[i]+=cnt[i+1];
- if (cnt[i]>=p-i)
- {
- p=i;
- cnt[i]=0;
- }
- }
- p=m+1-p;
- for (int i=0;i<n;i++)
- {
- p=(p+a[i])%(m+1);
- printf("%d%c",p+1," \n"[i==n-1]);
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement