MohamedTaha98

#include <cs50.h>
#include <stdio.h>

typedef struct dllist {
    int n;
    struct dllist* prev;
    struct dllist* next;
}
dllnode;

MohamedTaha98

// recovers jpegs from memory card file
#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include <cs50.h>

#define BLOCK 512

typedef uint8_t  BYTE;

MohamedTaha98

#include <iostream>
#include <algorithm>

using namespace std;

int main () {

    int a, b;
    double c;
    while (true) {

MohamedTaha98

import java.util.Scanner;
public class Taha {
    public static void main(String[] args) {
        Scanner in = new Scanner (System.in);
        String s = in.next();
        if (s.charAt(0) == 'a' || s.charAt(0) == 'h') {
            if (s.charAt(1) == '1' || s.charAt(1) == '8')
                System.out.println("3");
            else
                System.out.println("5");

MohamedTaha98

#include <iostream>

using namespace std;

int main()
{
    long long n, change25 = 0, change50 = 0, remainall = 0, remain25 = 0, remain50 = 0;
    string a = "YES";
    cin >> n;
    long long ar[n];

MohamedTaha98

import java.util.Scanner;
public class Taha {
    public static void main(String[] args) {
        Scanner in = new Scanner (System.in);
        double x1 = in.nextDouble(), min = 0;
        double y1 = in.nextDouble();
        int n = in.nextInt();
        double ar[] = new double [n];
        for (int i = 0; i < n; i++) {
            double x2 = in.nextDouble();

MohamedTaha98

#include <iostream>

using namespace std;

int main()
{
    int n, mishka = 0, chris = 0;
    cin >> n;
    int ar[2];
    for (int rnds = 0; rnds < n; rnds++)

MohamedTaha98

#include <iostream>

using namespace std;

int main() {

    long n, length = 1;
    cin >> n;
    long ar[n];
    for (int i = 0; i < n; i++)

MohamedTaha98

#include <iostream>

using namespace std;

int main () {

    long n, ans;
    cin >> n;
    ans = (n + 1) / 2;
    cout << ans;

MohamedTaha98

#include <iostream>

using namespace std;

int main () {

    long n;
    cin >> n;
    long ar[n];
    bool won = false;