提出 #918410

---

ソースコード 拡げる

#include<bits/stdc++.h>
#define REP(x,y,z) for(int x=y;x<=z;x++)
#define FORD(x,y,z) for(int x=y;x>=z;x--)
#define MSET(x,y) memset(x,y,sizeof(x))
#define FOR(x,y) for(__typeof(y.begin()) x=y.begin();x!=y.end();x++)
#define F first
#define S second
#define MP make_pair
#define PB push_back
#define SZ size()
#define M 100005
void RI(){}
template<typename... T>
void RI( int& head, T&... tail ) {
    scanf("%d",&head);
    RI(tail...);
}
using namespace std;
typedef long long LL;
int n,in[M];
int st[M];
void dfs(int d)
{
	if(d==18)
	{
		REP(i,0,d-1) printf("%d ",st[i]);
		puts("");
		REP(i,1,n) printf("%d ",in[i]);
		puts("");
		puts("--=-")
			;
	}

		
	int mx = 0;
	REP(i,1,n)
	{
		
		if(in[i] > mx+1)
		{
			st[d] = i;
			in[i] -= mx+1;
			dfs(d+1);
			in[i] += mx+1;
		}

		mx = max(mx, in[i]);
	}
}
int main()
{
	while(~scanf("%d",&n))
	{
		REP(i,1,n) RI(in[i]);
		int mn=0, mn2=0;
		LL ans=0;
		REP(i,1,n)
		{
			mn = mn2;
			int can = in[i]-1;
			int ch = mn+1;

			//printf("%d %d %d => %d\n",can,ch,can/ch,in[i]-can/ch*ch);
			ans += can/ch;
			mn = max(mn, in[i]-can/ch*ch);

			if(in[i] == mn2+1) mn2 = in[i];
			if(mn2==0) mn2=1;
		}
		printf("%lld\n",ans);
	}
	return 0;
}

提出情報

コンパイルエラー

./Main.cpp: In function ‘void RI(int&, T& ...) [with T = {}]’:
./Main.cpp:15:5: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&head);
     ^

ジャッジ結果