Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <cstdio>
- #include <cstring>
- #define KONJ 42 - 42
- using namespace std;
- int C, N;
- int ostatak[100010];
- int main( void ){
- while ( true ){
- memset( ostatak, -1, sizeof( ostatak ) );
- ostatak[0] = 0;
- scanf( "%d%d", &C, &N );
- if ( C == N && C == 0 ){ break; }
- int sum = 0, lo, hi;
- for ( int i = 1; i <= N; ++i ){
- int x;
- scanf( "%d", &x ); sum += x; sum %= C;
- if ( ostatak[sum] != -1 ){ lo = ostatak[sum]; hi = i; }
- ostatak[sum] = i;
- }
- //printf( "%d %d ", lo, hi );
- for ( int i = lo + 1; i < hi; ++i ){ printf( "%d ", i ); }
- printf( "%d\n", hi );
- }
- return KONJ;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement