data-structs-algorithms/induction2.cpp at main · RamDanny/data-structs-algorithms · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
#include <iostream>
#include <conio.h>
#include <stdio.h>
#include <string.h>

using namespace std;
bool search(char s[], int len);

int main()
{
    int t;
    cin >> t;
    char input[20000][200000], s[200000], ss[200000];
    int output[20000]; int len;
    for(int i = 0; i < t; i++)
    {
        gets(s); len = strlen(s);
        for (int j = 0; j < len; j++)
        {
            input[i][j] = s[j];
        }
    }
    bool flag;
    for (int i = 0; i < t; i++)
    {

    }
    return 0;
}

bool search(char s[], int len)
{
    int flag = 1;
    for (int i = 0; i < len; i++)
    {
        if (s[0] == 1)
        {
            if (s[i] == 2)
            {
                flag++;
            }
        }
    }
}