LOJ #6220. sum

題目連結：​​傳送門​​

#include <bits/stdc++.h>
#define

using namespace std;
typedef long long ll;
int n, l, r; ll a[A], b[A], sum[A], t[A];

int main(int argc, char const *argv[]) {
  cin >> n;
  for (int i = 1; i <= n; i++) scanf("%lld", &a[i]), b[i] = a[i];
  for (int i = 1; i <= n; i++) {
    sum[i] = (sum[i - 1] + a[i] % n) % n;
    if (!t[sum[i]]) t[sum[i]] = i;
    else {l = t[sum[i]] + 1; r = i; break;}
  }
  for (int i = l; i <= r; i++) printf("%lld %lld\n", i, b[i]);
}