Pagini recente » Borderou de evaluare (job #2685371) | Borderou de evaluare (job #2100154) | Borderou de evaluare (job #823656) | Borderou de evaluare (job #416880) | Borderou de evaluare (job #1838883)
Borderou de evaluare (job #1838883)
Raport evaluator
Compilare:
user.cpp: In function ‘int main()’:
user.cpp:4:207: warning: ignoring return value of ‘int fscanf(FILE*, const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
struct P{int N,S,z,Q;}v[5];int n=2,T,cur,v1[L+1],v2[L+1],i;bool Y(P a,P b){return a.N<b.N;}bool I(P a,P b){return a.Q<b.Q;}int main(){FILE*F=fopen("aurel.in","r"),*G=fopen("aurel.out","w");fscanf(F,"%d",&T);for(i=0;i<T;i++){fscanf(F,"%d%d",&v[i].N,&v[i].S);v[i].Q=i;}std::sort(v,v+T,Y);for(i=1;i<=L;i++){v1[i]=1;}memcpy(v2,v1,sizeof(v1));while(v[cur].N==1){v[cur].z=1;cur++;}while(cur<T){memset(v1,0,sizeof(v1));v1[(1+n)*n/2]=1;for(i=(1+n)*n/2+1;i<=L;i++)v1[i]=v2[i-n]+v1[i-n],v1[i]%=R;if(n==v[cur].N)while(n==v[cur].N)v[cur].z=v1[v[cur].S],cur++;memcpy(v2,v1,sizeof(v1));n++;}std::sort(v,v+T,I);for(i=0;i<T;i++)fprintf(G,"%d\n",v[i].z);}
^
user.cpp:4:257: warning: ignoring return value of ‘int fscanf(FILE*, const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
struct P{int N,S,z,Q;}v[5];int n=2,T,cur,v1[L+1],v2[L+1],i;bool Y(P a,P b){return a.N<b.N;}bool I(P a,P b){return a.Q<b.Q;}int main(){FILE*F=fopen("aurel.in","r"),*G=fopen("aurel.out","w");fscanf(F,"%d",&T);for(i=0;i<T;i++){fscanf(F,"%d%d",&v[i].N,&v[i].S);v[i].Q=i;}std::sort(v,v+T,Y);for(i=1;i<=L;i++){v1[i]=1;}memcpy(v2,v1,sizeof(v1));while(v[cur].N==1){v[cur].z=1;cur++;}while(cur<T){memset(v1,0,sizeof(v1));v1[(1+n)*n/2]=1;for(i=(1+n)*n/2+1;i<=L;i++)v1[i]=v2[i-n]+v1[i-n],v1[i]%=R;if(n==v[cur].N)while(n==v[cur].N)v[cur].z=v1[v[cur].S],cur++;memcpy(v2,v1,sizeof(v1));n++;}std::sort(v,v+T,I);for(i=0;i<T;i++)fprintf(G,"%d\n",v[i].z);}
^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 52ms | 1220kb | OK | 100 |
Punctaj total | 100 |