| For C/C++ |
| 1 | for(i = 0 ; i < n ; ++i) { |
| 2 | for(i = 0 ; i > n ; ++i) { |
| 3 | while(i < n) { |
| 4 | while(i > n) { |
| 5 | printf(""); |
| 6 | scanf("%d", &n); |
| 7 | int n = 0; |
| 8 | int x = 0; |
| 9 | int first = 0; |
| 10 | int last = 0; |
| 11 | double x = 0; |
| 12 | double n = 0; |
| 13 | double first = 0; |
| 14 | double last = 0; |
| 15 | double ans = 0; |
| 16 | int size = 0; |
| 17 | if(i == 0) { |
| 18 | if(i < 0) { |
| 19 | return 0; |
| 20 | return ans; |
| 21 | #include <stdio.h> |
| 22 | #include <stdlib.h> |
| 23 | #include <string.h> |
| 24 | #include <locale.h> |
| 25 | #include <math.h> |
| 26 | sqrt(a, b); |
| 27 | += |
| 28 | -= |
| 29 | ++i |
| 30 | ++i; |
| 31 | else { |
| 32 | else if( |
| 33 | else if(i < 0) { |
| 34 | tree->left |
| 35 | tree->right |
| 36 | tree->value |
| 37 | left |
| 38 | right |
| 39 | value |
| 40 | size |
| 41 | type |
| 42 | typedef |
| 43 | struct |
| 44 | typedef struct queue { |
| 45 | stack |
| 46 | a * b |
| 47 | w * (d - c) |
| 48 | e * (d + g) |
| 49 | char c = 0; |
| 50 | char* str = ""; |
| 51 | c = getchar(); |
| 52 | while(c != 'a') { |
| 53 | int i = 0; |
| 54 | int main() { |
| 55 | switch a { |
| 56 | case 1: |
| 57 | case 6: |
| 58 | case 'a': |
| 59 | break; |
| 60 | do |
| 61 | enum |
Комментарии