Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <sstream>
- #include <bitset>
- #include <cstdio>
- #include <string>
- #include <cstring>
- #include <vector>
- #include <queue>
- #include <stack>
- #include <set>
- #include <map>
- #include <algorithm>
- #include <cmath>
- #include <cstdlib>
- #include <cctype>
- #include <numeric>
- #define FOR(i,A) for(typeof (A).begin() i = (A).begin() ; i != (A).end() ; i++)
- #define mp make_pair
- #define debug( x ) cout << #x << " = " << x << endl
- #define clr(v,x) memset( v, x , sizeof v )
- #define all(x) (x).begin() , (x).end()
- #define rall(x) (x).rbegin() , (x).rend()
- #define TAM 10010
- using namespace std;
- typedef pair<int,int> ii ;
- typedef long long ll ;
- typedef long double ld ;
- typedef pair<int,ii> pii ;
- int n ;
- int v[ TAM ] ;
- int s[ TAM ] ;
- int sum ;
- bool calc( int x ){
- if( x == n ) return true ;
- bool resp = false ;
- for(int i = x ; i < n ; i++){
- int aux = s[ i ] - s[ x - 1 ] ;
- if( aux - sum == 0 )
- resp |= calc( i + 1 ) ;
- }
- return resp ;
- }
- int main(){
- int test ;
- scanf("%d" , &test ) ;
- for(int k = 0 ; k < test ; k++){
- int q ;
- scanf("%d%d" , &q , &n ) ;
- for(int i = 0 ; i < n ; i++) scanf("%d", &v[ i ] ) ;
- s[ 0 ] = v[ 0 ] ;
- for(int i = 1 ; i < n ; i++) s[ i ] = v[ i ] + s[ i - 1 ] ;
- for(int i = 0 ; i < n ; i++){
- sum = s[ i ] ;
- if( calc( i + 1 ) ) break ;
- }
- printf("%d %d\n" , q , sum ) ;
- }
- return 0 ;
- }
Add Comment
Please, Sign In to add comment