费尽千辛万苦完成的代码

#include<cstdio>

#include<iostream>

using namespace std;

#define mod 20123;

int a[10010][110],b[10010][110],cnt[10010];

int main(){

    int n,m,adit,ans=0;

    scanf("%d%d",&n,&m);

    for(int i=1;i<=n;i++){

        for(int j=0;j<m;j++){

            scanf("%d %d\n",&b[i][j],&a[i][j]);

            if(b[i][j]) cnt[i]++;  
        }  

    }

    scanf("%d",&adit);

    for(int floor=1;floor<=n;floor++){

        ans+=a[floor][adit];

        ans%=mod;

        a[floor][adit]--;

        a[floor][adit]%=cnt[floor];

        a[floor][adit]++;

        for(int i=adit;;i++){

            if(i==m) i=0;

            if(b[floor][i]) a[floor][adit]--;

            if(!a[floor][adit]){

                adit=i;

                break;
            }

        }

    }

    printf("%d\n",ans); 

    return 0;
    
}