a ==code(c) | i=i+1; == na
== code(c) |
#defin JEG(a, b) ( (a) < (b) ? (a) : (b) )
 
int main (void) {
    double f = -1.3e6;
    int a;
    char *s = "ma\\\"ma";
    printf("hai cu sorcova\n");
    scanf("%d", &a);
 
    return 0;
}
==
 
== code(c) |
  return 0;
==
 
== code(java) |
  //class PrimeNumbersSieve1
  final int MAXSIZE = 1000001;
  char[] p = new char[MAXSIZE];
  //p[i] == 0 if i is prime
  public int getTheNumber(int n) {
    int i, j, nr = 0;
    for (i = 2; i <= n; ++i) {
      if (p[i] == 0) {
        nr++;
        for (j = i + i; j <= n; j += i) {
          p[j] = 1;
        }
      }
    }
==

|{background-color:gold}. Mircea Pasoi |{background-color:gold}. aur |
|{background-color:gold}. Codrut Grosu |{background-color:gold}. aur |
|{background-color:silver}. Tiberiu Florea |{background-color:silver}. argint |
|{background-color:bronze}. Adrian Vladu |{background-color:bronze}. bronz |

== Gallery(page="%" file="%.jpg") ==