Advertisement
Guest User

Untitled

a guest
Jul 27th, 2017
62
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.80 KB | None | 0 0
  1. #include <cstdio>  
  2. #include <cstring>
  3.  
  4. #define KONJ 42 - 42
  5.  
  6. using namespace std;
  7.  
  8. int C, N;
  9. int ostatak[100010];
  10.  
  11. int main( void ){
  12.  
  13.     while ( true ){
  14.  
  15.           memset( ostatak, -1, sizeof( ostatak ) );
  16.           ostatak[0] = 0;
  17.          
  18.           scanf( "%d%d", &C, &N );
  19.           if ( C == N && C == 0 ){ break; }
  20.    
  21.           int sum = 0, lo, hi;
  22.           for ( int i = 1; i <= N; ++i ){
  23.               int x;
  24.               scanf( "%d", &x ); sum += x; sum %= C;
  25.               if ( ostatak[sum] != -1 ){ lo = ostatak[sum]; hi = i; }
  26.               ostatak[sum] = i;
  27.           }
  28.          
  29.           //printf( "%d %d ", lo, hi );
  30.          
  31.           for ( int i = lo + 1; i < hi; ++i ){ printf( "%d ", i ); }
  32.           printf( "%d\n", hi );
  33.    
  34.     }
  35.     return KONJ;
  36.  
  37. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement