Pagini recente » Borderou de evaluare (job #826484) | Borderou de evaluare (job #307269) | Borderou de evaluare (job #3222243) | Borderou de evaluare (job #1011060) | Borderou de evaluare (job #2604050)
Borderou de evaluare (job #2604050)
Raport evaluator
Compilare:
main.cpp:1:2: warning: #import is a deprecated GCC extension [-Wdeprecated]
#import<stdio.h>
^~~~~~
main.cpp:2:45: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
int n,K,i,j,a[205],L[205],S[205],M,N,X;main(){freopen("cuvinte.in","r",stdin);freopen("cuvinte.out","w",stdout);scanf("%d%d",&n,&K);for(i=1;i<=n;++i)scanf("%d",&a[i]);for(i=n;i;--i){N=1;X=0;for(j=i+1;j<=n;++j)if(a[i]<a[j])if(L[j]>X)X=L[j],N=S[j];else if(L[j]==X)N+=S[j];L[i]=X+1;S[i]=N;if(L[i]>M)M=L[i];}for(i=1;i<=n;++i)if(L[i]==M)if(S[i]<K)K-=S[i];else printf("%d ",i),M--;}
^
main.cpp: In function 'int main()':
main.cpp:2:212: warning: suggest explicit braces to avoid ambiguous 'else' [-Wparentheses]
int n,K,i,j,a[205],L[205],S[205],M,N,X;main(){freopen("cuvinte.in","r",stdin);freopen("cuvinte.out","w",stdout);scanf("%d%d",&n,&K);for(i=1;i<=n;++i)scanf("%d",&a[i]);for(i=n;i;--i){N=1;X=0;for(j=i+1;j<=n;++j)if(a[i]<a[j])if(L[j]>X)X=L[j],N=S[j];else if(L[j]==X)N+=S[j];L[i]=X+1;S[i]=N;if(L[i]>M)M=L[i];}for(i=1;i<=n;++i)if(L[i]==M)if(S[i]<K)K-=S[i];else printf("%d ",i),M--;}
^
main.cpp:2:324: warning: suggest explicit braces to avoid ambiguous 'else' [-Wparentheses]
int n,K,i,j,a[205],L[205],S[205],M,N,X;main(){freopen("cuvinte.in","r",stdin);freopen("cuvinte.out","w",stdout);scanf("%d%d",&n,&K);for(i=1;i<=n;++i)scanf("%d",&a[i]);for(i=n;i;--i){N=1;X=0;for(j=i+1;j<=n;++j)if(a[i]<a[j])if(L[j]>X)X=L[j],N=S[j];else if(L[j]==X)N+=S[j];L[i]=X+1;S[i]=N;if(L[i]>M)M=L[i];}for(i=1;i<=n;++i)if(L[i]==M)if(S[i]<K)K-=S[i];else printf("%d ",i),M--;}
^
main.cpp:2:78: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
int n,K,i,j,a[205],L[205],S[205],M,N,X;main(){freopen("cuvinte.in","r",stdin);freopen("cuvinte.out","w",stdout);scanf("%d%d",&n,&K);for(i=1;i<=n;++i)scanf("%d",&a[i]);for(i=n;i;--i){N=1;X=0;for(j=i+1;j<=n;++j)if(a[i]<a[j])if(L[j]>X)X=L[j],N=S[j];else if(L[j]==X)N+=S[j];L[i]=X+1;S[i]=N;if(L[i]>M)M=L[i];}for(i=1;i<=n;++i)if(L[i]==M)if(S[i]<K)K-=S[i];else printf("%d ",i),M--;}
^
main.cpp:2:112: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
int n,K,i,j,a[205],L[205],S[205],M,N,X;main(){freopen("cuvinte.in","r",stdin);freopen("cuvinte.out","w",stdout);scanf("%d%d",&n,&K);for(i=1;i<=n;++i)scanf("%d",&a[i]);for(i=n;i;--i){N=1;X=0;for(j=i+1;j<=n;++j)if(a[i]<a[j])if(L[j]>X)X=L[j],N=S[j];else if(L[j]==X)N+=S[j];L[i]=X+1;S[i]=N;if(L[i]>M)M=L[i];}for(i=1;i<=n;++i)if(L[i]==M)if(S[i]<K)K-=S[i];else printf("%d ",i),M--;}
^
main.cpp:2:132: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
int n,K,i,j,a[205],L[205],S[205],M,N,X;main(){freopen("cuvinte.in","r",stdin);freopen("cuvinte.out","w",stdout);scanf("%d%d",&n,&K);for(i=1;i<=n;++i)scanf("%d",&a[i]);for(i=n;i;--i){N=1;X=0;for(j=i+1;j<=n;++j)if(a[i]<a[j])if(L[j]>X)X=L[j],N=S[j];else if(L[j]==X)N+=S[j];L[i]=X+1;S[i]=N;if(L[i]>M)M=L[i];}for(i=1;i<=n;++i)if(L[i]==M)if(S[i]<K)K-=S[i];else printf("%d ",i),M--;}
^
main.cpp:2:167: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
int n,K,i,j,a[205],L[205],S[205],M,N,X;main(){freopen("cuvinte.in","r",stdin);freopen("cuvinte.out","w",stdout);scanf("%d%d",&n,&K);for(i=1;i<=n;++i)scanf("%d",&a[i]);for(i=n;i;--i){N=1;X=0;for(j=i+1;j<=n;++j)if(a[i]<a[j])if(L[j]>X)X=L[j],N=S[j];else if(L[j]==X)N+=S[j];L[i]=X+1;S[i]=N;if(L[i]>M)M=L[i];}for(i=1;i<=n;++i)if(L[i]==M)if(S[i]<K)K-=S[i];else printf("%d ",i),M--;}
^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 2ms | 131kb | OK | 10 |
2 | 2ms | 131kb | OK | 10 |
3 | 2ms | 131kb | OK | 10 |
4 | 2ms | 131kb | OK | 10 |
5 | 2ms | 131kb | OK | 10 |
6 | 2ms | 131kb | OK | 10 |
7 | 2ms | 131kb | OK | 10 |
8 | 2ms | 131kb | OK | 10 |
9 | 2ms | 131kb | OK | 10 |
10 | 2ms | 131kb | OK | 10 |
Punctaj total | 100 |