Waiting for the dawn

CF 46A

#include<iostream>
using namespace std;
int main(){
    int n,I=1,a[100];
    cin>>n;
    for(int i=1;i<=n-1;i++){
        I=I+i;
        if(I>n)
            I=I-n;
        a[i]=I;
    }
    for(int i=1;i<=n-1;i++)
        cout<<a[i]<<' ';
}

CF 1065C

struct fenwick {
  ll PartialSum[MAXN];
  fenwick() {
    for (int i = 0; i < MAXN; i++) PartialSum[i] = 0;
  }
  inline void add(ll index, ll increase) {
    while (index < MAXN) {
      PartialSum[index] += increase;
      index += index & -index;
    }
  }
  inline ll get(int index) {
    ll sum = 0;
    while (index) {
      sum += PartialSum[index];
      index -= index & -index;
    }
    return sum;
  }
};
void solve() {
  int n, k, ans = 0;
  cin >> n >> k;
  fenwick tr;
  vector<int> h(n + 1);
  int maxx = INT_MIN, minx = INT_MAX;
  for (int i = 1; i <= n; ++i) {
    cin >> h[i];
    maxx = max(maxx, h[i]);
    minx = min(minx, h[i]);
    tr.add(1, 1);
    tr.add(h[i] + 1, -1);
  } 
  if (maxx == minx) {
    cout << 0 << '\n';
    return;
  }
  ll sum = 0;
  bool flag = true;
  for (int i = maxx; i >= minx; --i) {
    auto cur = tr.get(i); //how many shits is greater or equal than height i
    if (cur + sum > k) {
      ans++;
      sum = cur;
      flag = false;
    } else {// other wise one shot to make them equal
      sum += cur;
      flag = true;
    }
  }
  if (flag) {
    ++ans;
  }
  cout << ans << '\n';
  return ;
}

daily codeforces

daily codeforces

daily codeforces

daily codeforces

CF 41A

#include<bits/stdc++.h>
using namespace std;
string s1,s2;
bool V()
{
    if(s1.size()!=s2.size())return 0;
    for(int i=0;i<s1.size();i++)
        if(s1[i]!=s2[s1.size()-i-1])return 0;
    return 1;
}
int main()
{
    getline(cin,s1);
    getline(cin,s2);
    if(V())cout<<"YES"<<endl;
    else cout<<"NO"<<endl;
        //在输入后判断，输出相应的答案。
    return 0;
}

daily codeforces

CF 38A

#include<bits/stdc++.h>
using namespace std;
int main(){
    int n,s[101],ans=0;
    cin>>n;
    int a,b;
    for(int i=1;i<n;i++)
    cin>>s[i];
    cin>>a>>b;
    for(int i=a;i<b;i++)
    ans+=s[i];
    cout<<ans<<"\n";
    return 0;
}

daily codeforces