Borderou de evaluare (job #1518660)
Utilizator | Data | 6 noiembrie 2015 07:19:10 | |
---|---|---|---|
Problema | Blis | Status | done |
Runda | Arhiva de probleme | Compilator | cpp | Vezi sursa |
Scor | 0 |
Raport evaluator
Eroare de compilare:
user.cpp:1:19: warning: extra tokens at end of #include directive [enabled by default]
#include <fstream>#include <iostream>#include <vector>#include <queue>#include <algorithm>#include <cstring>#include <string>#include <set>#include <iomanip>#include <utility>#include <cstdio>using namespace std ;const int NMAX = 100010;const int INF = 0x3f3f3f3f;//ifstream fin("blis.in") ;//ofstream fout("blis.out") ;int N, M, k, K, A[NMAX], v, lefta, righta, mijloc, big ;vector < pair <int, int > > V[NMAX] ;//string s ;char s[NMAX] ;inline int min(int a, int b){return (a < b ? a : b);}inline int max(int a, int b){return (a > b ? a : b);}int main(){// fin >> K;//fin >>(s + 1 ) ;freopen("blis.in","r",stdin);freopen("blis.out","w",stdout);scanf("%d%s", &K, (s + 1) ) ;N = strlen(s + 1);memset(A, INF, sizeof(A)) ;A[0] = -1 ;for(int i = 1 ; i <= N ; ++ i){v = 0 ;k = min(N, i + K - 1);for(int j = i ; j <= k ; ++ j){v = (v<<1) | (s[j] - '0');big = max(big, v);for(lefta = 0, righta = i + 1 ; righta - lefta - 1;){mijloc = (lefta + righta) / 2 ;if(A[mijloc] < v) lefta = mijloc ;else righta = mijloc ;}if(A[righta] > v)V[j].push_back(make_pair(righta, v)) ;}for(vector <pair <int, int> >::iterator it = V[i].begin(); it != V[i].end() ; it ++)if(A[it -> first] > it -> second)A[it -> first] = it -> second ;}//fout << big << '\n' ;printf("%d\n", big) ;for(lefta = 0, righta = N + 1 ; righta - lefta - 1; ){mijloc = (lefta + righta) / 2 ;if(A[mijloc] < INF) lefta = mijloc ;else righta = mijloc ;}//fout << lefta << '\n' ;printf("%d\n", lefta) ;// fin.close() ;// fout.close() ;return 0 ;}
^
user.cpp:1:185: warning: invalid suffix on literal; C++11 requires a space between literal and identifier [-Wliteral-suffix]
#include <fstream>#include <iostream>#include <vector>#include <queue>#include <algorithm>#include <cstring>#include <string>#include <set>#include <iomanip>#include <utility>#include <cstdio>using namespace std ;const int NMAX = 100010;const int INF = 0x3f3f3f3f;//ifstream fin("blis.in") ;//ofstream fout("blis.out") ;int N, M, k, K, A[NMAX], v, lefta, righta, mijloc, big ;vector < pair <int, int > > V[NMAX] ;//string s ;char s[NMAX] ;inline int min(int a, int b){return (a < b ? a : b);}inline int max(int a, int b){return (a > b ? a : b);}int main(){// fin >> K;//fin >>(s + 1 ) ;freopen("blis.in","r",stdin);freopen("blis.out","w",stdout);scanf("%d%s", &K, (s + 1) ) ;N = strlen(s + 1);memset(A, INF, sizeof(A)) ;A[0] = -1 ;for(int i = 1 ; i <= N ; ++ i){v = 0 ;k = min(N, i + K - 1);for(int j = i ; j <= k ; ++ j){v = (v<<1) | (s[j] - '0');big = max(big, v);for(lefta = 0, righta = i + 1 ; righta - lefta - 1;){mijloc = (lefta + righta) / 2 ;if(A[mijloc] < v) lefta = mijloc ;else righta = mijloc ;}if(A[righta] > v)V[j].push_back(make_pair(righta, v)) ;}for(vector <pair <int, int> >::iterator it = V[i].begin(); it != V[i].end() ; it ++)if(A[it -> first] > it -> second)A[it -> first] = it -> second ;}//fout << big << '\n' ;printf("%d\n", big) ;for(lefta = 0, righta = N + 1 ; righta - lefta - 1; ){mijloc = (lefta + righta) / 2 ;if(A[mijloc] < INF) lefta = mijloc ;else righta = mijloc ;}//fout << lefta << '\n' ;printf("%d\n", lefta) ;// fin.close() ;// fout.close() ;return 0 ;}
^
/usr/lib/gcc/i686-linux-gnu/4.8/../../../i386-linux-gnu/crt1.o: In function `_start':
(.text+0x18): undefined reference to `main'
collect2: error: ld returned 1 exit status
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !