数字游戏

http://wikioi.com/problem/1229/

// File Name: 1229.cpp// Author: bo_jwolf// Created Time: 2013年08月13日 星期二 16时01分49秒#include<vector>#include<list>#include<map>#include<set>#include<deque>#include<stack>#include<bitset>#include<algorithm>#include<functional>#include<numeric>#include<utility>#include<sstream>#include<iostream>#include<iomanip>#include<cstdio>#include<cmath>#include<cstdlib>#include<cstring>#include<ctime>#include<cstdlib>using namespace std;int num , i , j , hash[ 1005 ][ 1005 ];int x , k , n , m; char nums[ 10 ] ;int main(){while( scanf( "%d%d" , &n , &m ) != EOF ){for( i = 0 ; i < 105 ; ++i ){for( j = 0 ; j < 105 ; ++j ){hash[ i ][ j ] = -1 ;}}for( i = 0 ; i < n ; ++i ){scanf( "%s" , &nums[ i ] ) ;}sort( nums , nums + n ) ;do {if( nums[ 0 ] == '0' )continue ;num = atoi( nums ) ;for( j = 1 ; j < 100 ; ++j ){if( hash[ num % j ][ j ] == - 1 )hash[ num % j ][ j ] = num ;}}while( next_permutation( nums , nums + n ) ) ;for( i = 0 ; i < m ;++i ){scanf( "%d%d" , &x , &k ) ;if( hash[ ( k - x % k ) % k ][ k ] == - 1 )cout << "None" << endl ;elsecout << hash[ (k - x % k) % k ][ k ] << endl ;}}return 0;}