450A - Jzzhu and Children 找规律也可以模拟

#include<iostream>
#include<stdio.h>
using namespace std;
int main(){
//   freopen("in.txt","r",stdin);
int a[105],n,m;
while(~scanf("%d%d",&n,&m)){
int max=0;
for(int i=0;i<n;i++){
scanf("%d",&a[i]);
if(a[i]>max) max=a[i];
}
int t=max/m;
if(max%m==0) t--;
for(int i=0;i<n;i++){
a[i]-=t*m;
}
int ans=-1;
for(int i=n-1;i>=0;i--){
if(a[i]>0){
ans=i;
break;
}
}
if(t==0)
cout<<n<<endl;
else
cout<<ans+1<<endl;
}
}