int main(){ buf[10] = '\n'; int t,i,j,n; scanf("%d",&t); while(t--){ fastRead_int(n); for(i=0;i<n;i++){ for(j=0;j<=i;j++){ fastRead_int(ta[i][j]); } } for(i=n-1;i>0;i--){ for(j=i;j>0;j--){ ta[i-1][j-1]+=std::max(ta[i][j-1],ta[i][j]); } } writeInt(ta[0][0]); } return 0; }
int main() { int n; char s[100]; fastRead_int(n); printf("%d\n", n); fastRead_string(s); printf("%s\n", s); return 0; }
int main(){ int t,n,m,i,cha,level,bal; fastRead_int(t); while(t--){ int ta[101]={0}; bal=0; fastRead_int(n); fastRead_int(m); for(i=1;i<=n;i++){ fastRead_int(cha); fastRead_int(level); ta[level]+=cha; } for(i=1;i<=m;i++){ fastRead_int(cha); fastRead_int(level); ta[level]-=cha; } for(i=1;i<101;i++){ if(ta[i]<0) bal-=ta[i]; } writeInt(bal); } return 0; }
int main() { int i,j,k; int n; //scanf(" %d",&n); fastRead_int(n); int a[301][301]; int dp[301][301][12] = {0}; for(i=0;i<n;i++) { for(j=0;j<n;j++) { //scanf(" %d",&a[i][j]); fastRead_int(a[i][j]); } } dp[0][0][a[0][0]]++; for(j=1;j<n;j++) { for(k=0;k<11;k++) { dp[0][j][k] = dp[0][j-1][k]; } dp[0][j][a[0][j]]++; } for(i=1;i<n;i++) { for(k=0;k<11;k++) { dp[i][0][k] = dp[i-1][0][k]; } dp[i][0][a[i][0]]++; } for(i=1;i<n;i++) { for(j=1;j<n;j++) { for(k=0;k<11;k++) { dp[i][j][k] = dp[i-1][j][k] + dp[i][j-1][k] - dp[i-1][j-1][k]; } dp[i][j][a[i][j]]++; } } // for(i=0;i<11;i++) // { // printf(" %d",dp[2][2][i]); // } int q; //scanf(" %d",&q); fastRead_int(q); while(q--) { int x,y,w,z; //scanf(" %d %d %d %d",&x,&y,&w,&z); fastRead_int(x); fastRead_int(y); fastRead_int(w); fastRead_int(z); x--; y--; w--; z--; int res, t = 0; int tt[11]; if(x != 0 && y != 0) { for(k=0;k<11;k++) { tt[k] = dp[w][z][k] + dp[x-1][y-1][k]; } for(k=0;k<11;k++) { tt[k] = tt[k] - dp[x-1][z][k] - dp[w][y-1][k]; } t = 0; for(k=0;k<11;k++) { if(tt[k] != 0) { t++; } } printf("%d\n",t); //res = res + t; } else if(x != 0) { for(k=0;k<11;k++) { tt[k] = dp[w][z][k] - dp[x-1][z][k]; } t = 0; for(k=0;k<11;k++) { if(tt[k] != 0) { t++; } } printf("%d\n",t); //t = res - t; //printf(" t = %d\n",t); //res = res - t; } else if(y != 0) { for(k=0;k<11;k++) { tt[k] = dp[w][z][k] - dp[w][y-1][k]; } t = 0; for(k=0;k<11;k++) { if(tt[k] != 0) { t++; } } printf("%d\n",t); //t = res - t; //printf(" t = %d\n",t); //res = res - t; } else { for(k=0;k<11;k++) { if(dp[w][z][k] != 0) { t++; } } printf("%d\n",t); } } return 0; }