OJ Board

#include<iostream>

using namespace std;

int vis[210][210]={0};
int num,N,R;

void dfs(int v)
{
for(int i=0;i<N;i++)
if((vis[v] /10)&&!(vis[v] %10))
{
vis[v] =vis[v] +1;
num++;
dfs(i);
}
}

int main()
{
int i=0,a,b;
int nod[210];
while(cin>>N>>R)
{
memset(nod,0,sizeof(nod));
memset(vis ...