1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 | #include<stdio.h> int main() { int n,i,j; long long int su; scanf("%d",&i); if(i>=1&&i<=1000){ for(j = 0;j<i;j++){ scanf("%d",&n); if(n>=1&&n<=1000000){ su = (3*n*n-n)/2; } else{ break;} printf("%lld",su); getchar(); // printf("\n"); } } return 0 ; } |
I2luY2x1ZGU8c3RkaW8uaD4KaW50IG1haW4oKQp7CglpbnQgbixpLGo7IAoJbG9uZyBsb25nIGludCBzdTsKCXNjYW5mKCIlZCIsJmkpOwoJaWYoaT49MSYmaTw9MTAwMCl7Cglmb3IoaiA9IDA7ajxpO2orKyl7CgkJc2NhbmYoIiVkIiwmbik7CgkJaWYobj49MSYmbjw9MTAwMDAwMCl7CgkJc3UgPSAoMypuKm4tbikvMjsKCQl9CgkJZWxzZXsKCQkJYnJlYWs7fQoKCXByaW50ZigiJWxsZCIsc3UpOwoJZ2V0Y2hhcigpOwovLwlwcmludGYoIlxuIik7Cgl9Cgl9CglyZXR1cm4gMCA7Cn0=
-
upload with new input
-
result: Success time: 0.01s memory: 1724 kB returned value: 0
2 3 5
1235
-
result: Success time: 0.01s memory: 1720 kB returned value: 0



