I need to search in a table a value and reurn the value of the last column of the corresponding row (I can transverse rows and columns if it is going to simplify the functions). For example, I have the following table and when I give as the search value 75, I want to have the value 204 (value of the last column of the same row). The last column can be also moved to be the first one, in case it helps the function. I tried with Index and Match and Lookup but these functions need one column array to search into.
41 42 43 44 61 62 63 64 81 82 83 84 101 102 103 104 201
45 46 47 48 65 66 67 68 85 86 87 88 105 106 107 108 202
49 50 51 52 69 70 71 72 89 90 91 92 109 110 111 112 203
53 54 55 56 73 74 75 76 93 94 95 96 113 114 115 116 204
57 58 59 60 77 78 79 80 97 98 99 100 117 118 119 120 205
121 122 123 124 141 142 143 144 161 162 163 164 181 182 183 184 216
125 126 127 128 145 146 147 148 165 166 167 168 185 186 187 188 217
129 130 131 132 149 150 151 152 169 170 171 172 189 190 191 192 218
133 134 135 136 153 154 155 156 173 174 175 176 193 194 195 196 219
=INDEX($Q$1:$Q$9,AGGREGATE(14,6,1/($A$1:$P$9=R12)*ROW($A$1:$P$9),1))
If first row of table not Row 1, see note below for adjustment
How it works:
($A$1:$P$9=R12) returns a 2D array of FALSE with a TRUE at the point of equality.
1/... returns an array of #DIV/0! and a 1 for the TRUE
Multiply by ROW(...) to get the row number
Use that row number to INDEX into the table.
Note that if the table does not start in Row 1, you need to subtract the first row of the table (-1) from the calculated row number.
If you use a Table or a named range, this can be made dynamic.
Edit: simpler formula
If you will only ever need to have a single result (eg all entries in the table will be unique, you can use:
=INDEX($Q$1:$Q$9,MAX(($A$1:$P$9=R12)*ROW($A$1:$P$9)))
I would use index() with match() like so:
So, used iferror() with match() to check each column and return the position if found, if not then blank.
Then index() with max() to get the position found and return the value from column Q.
Formula in cell A15 dragged to P15 is
IFERROR(MATCH($S$2,A4:A12,0),"")
Formula in cell T2 is
INDEX(Q4:Q12,MAX(A15:P15))
Cell S2 is the value you are looking for.
I need to read from a file different strings that are comma-separated and storage them into an array.
I have the following code, that I developed reading different questions online.
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int main (){
int N = 200; // Number of sequences
int L = 1000; // length of sequences
char Nseq[N][L];
FILE *myfile;
char *token;
const char s[2] = ",";
char line[300];
char* filename = "pathofile.txt";
int n = 0;
myfile = fopen(filename, "r");
if (myfile == NULL) {printf("could not open file %s", filename); exit(0);}
while (fgets(line, sizeof(line), myfile) != NULL){
token = strtok(line, s);
while (token != NULL){
strcpy(Nseq[n], token);
printf("%s\t%u\n", token, n);
token = strtok(NULL, s);
n++;
}
}
fclose(myfile);
for (int n=0; n<100; n++){
printf ("%s\t%u\n", Nseq[n], n);}
}
my file is the following (there are 200 sequences):
AAAGCCGCCAAAGUAGGCGG,AAAGCCGCCAAAGUAGGCGG,AAAGCCGCCAAAGUAGGCGG,AAAGCCGCCAAAGUAGGCGG,AAAGCCGCCAAAGUAGGCGG,AAAGCCGCCAAAGUAGGCGG,AAAGCCCGCCAAAGAAGGCGG,AAAGCCCGCCAAAGAAGGCGG,AAAGCCCGCCAAAGAAGGCGG,AAAGCCCGGCCAAAGAAGGCGG,AAAGCCCGCCAAAGUAGGCGG,AAAGCCCGCCAAAGUAGGCGG,AAAGCCCGCCAGAAGUAGGCGG,AAAGCCCGCCAAAGUAGGCGG,AAAGCCCGCCAAAGUAGGCGG,AAAGCACCGCCAAUGGGCGG,AAAGCACCGCCAAUAGGCGG,AAAGCACCGCCAAUAGGCGG,AUAGCACCGCCAAUAGGCGG,AUAGCACCGCCAAUAGGCGG,AUAGCACCGCCAGUAGGCGG,AUAGCACCGCCAAUAGGCGG,AAAGCACCGCCAAAUAAGGCGGG,AAAGCACCGCCAAAUAAGGCGGG,AAAGCACCGCCAAAUAGGCGGG,AAAGCACCGCCAAAUAAGGCGG,AAAGCACCGCCAAAUAAGGCGG,AAAGCACCGCCAAAUAAGGCGG,AAAGCACCGCCAAAUAAGGCGG,AAAGCACCGCCAAAUAAGGCGG,AAAGCACCGCCAAAUAAGGCGG,AAAGCACCGCCAAAUAAGGCGG,AAAGCACCGCCAAAUAAGGCGG,AAAGCACCGCCAAAUAAGGCGG,AAAGCACCGCCAAAUAAGGCGG,AAAGCACCGCCAAAUAAGGCGG,AAAGCACCGCCAAAUAAGGCGG,AAAGCACCGCCAAAUAAGGCGG,AAAGCACCGCCAAAUAAGGCGG,AAAGCACCGCCAAAUAAGGCGG,AAAGCACCGCCAAAUAAGGCGG,AAAGCACGGCCAAAUAAGGCGG,AAAGCACCGCCAAAUAAGGCGG,AAAGCACCGCCAAUAAGGCGG,AAAGCACCGCCAAAAGUCGAGGCGG,AAAGCACCGCCAAAAUGUGAGGCGG,AAAGCACCGCCAAAUGUGAGGCGG,AAAGCACCGCCAAAAUGGUGAGGCGG,AAAGCACCGCCAAAAGUGAGGCGG,AAAGCACCGCCAAAAGUGAGGCGG,AAAGCACCGCCAAAAGUGAGGCGG,AAAGCACCGCCAAAAGUGAGGCGG,AAAGCACCGCCAAAAGUAAGGCGG,AAAGACCGCCAAAAGUAAGGCGG,AAAGCACCGCCAAAAGUAAGGCGG,AAAGCACCGCCAAAAGUAAGGCGG,AAAGCACCGCCAAAGUUAAGGCGG,AAAGCACCGCCAAAGUAAGGCGG,AAAGCACCGCCAAAGUAAGGCGG,AAAGCACCGCCAAAGUAAGGCGG,UAACGCCGGCCAACUAGGGCGG,AACAGCCCGGCCAAAUAGGGCGG,AAAGCCGCCAAACUGGCGG,AAAGCCGCCAAACUGGCGG,AAACCGCCCAAAUAGGCGG,AAAGCCGCCCAAAUAGGCGG,AAAGCCGCCCAAAUAGGCGG,AAAGCCGCCAAAUAGGCGG,AAAGCCGCCAAAUAGGCGG,AAAGCCGCCCAAAUAGGCGG,AAAUCCGCCCAAAUAGGCGG,UAAAGCCGCCCUAAAUAGGCGG,AAAGCCGCGCAAAUAGGCGG,AAAGCCGCCCCAAAUAGGCGG,AAAGCCGCCCCAAAUAGGCGG,AAAGCCGCCCAAAUAGGCGUG,AAAGCCGCCCAAAUAGGCGG,AAAGCCGCCCAAAUAGGCGG,AAAGCCGCCCAAAUAGGCGG,AAAGCCGCCCAAAUAGGCGG,AAAGCCGCCAAAUAGGCGG,AAAGCCGCCAAAUAGGCGG,AAAGCCGCCAAAUAGGCGG,AAAGCCGCCCAAAUAGGCGG,AAAGCCGCCAAAUGGCGGA,AAAGCCGCCAACCGGCGG,AAAGCCGCCAACCGGCGG,AAAGCCGCCAACCGGCGG,AAAGCCGUCAACCGGCGG,AAAGCCGCCAACCGGCGG,AAAGCCGCCAACCGGCGG,AAAGCGCCAACCGGCGG,AAAGCCGCCAACCGGCGG,AAAGCCGCCAACCGGCGG,AAAGCCGCCAACCGGCGG,CACUGCCGGCCAAGUCGGCGG,CAUUGCCGGCCAAGUCGGCGG,CACUGCCGGCCAAGUCGGCGG,CAUGCCGGCCAAGUCGGCGG,CACUCCGGCCAAGUCGGCGG,CACUGCCGGCCAAGUCGGCGG,CACUGCCGGACCAAGUCGGCGG,CACUGCCGGCCAAGUCGGCGG,UCAAUUGCCGGCCAAGUCGGCGG,UCAAUUGCCGGCCAAGUCGGCGG,UUUAAGGCCGCACAUGCGGCCGUG,UUAAGGCCGGAAACAUUCGGCCGUG,UUAAGGCCGCACAUUCGGCCGGG,UUAAGGCCGCACAUUCGGCCGGG,UUAAGGCCGCACAUUCGGCCGGG,UUAAAAGGCCGACAUUGCGGCCGGG,UUAAAGGCCGACAUUGCGGCCGGG,UUAAGUCCGCACAUUCGGCCGGG,UUAAGGCCGCACAUUCGGCCGGG,UUAAGGCCGCACAUUCGGCCGGG,UUAAGGCCGCACAUUCGGCCGGG,UUAAGGCCGCACAUUCGGCCGGG,UUAAGGCCGCACAUCGGCCGGG,UAAGGCCGCACAUUCGGCCGGG,UAAGGCCGCACAUUCGGCCGGG,UAAGGCCGGCACAUUCGGCCGGG,UAAGGCCGCACAUUCGGCCGGG,UAAGGCCGCACAUUCGGCCGGG,UAAGGCCGCACAUUCGGCCGGG,UAAGGCCGCACAUUCGGCCGGG,UAAGGCCGCACAUUCGGCCGGG,UAAGGCCGCACAUGUCGGCCGGGU,UAAGGCCGCACAUUCGGCCGGG,UAAGGCCGCACAUUCGGCCGGG,UAGGCCGCAAGUCGGCCGGG,UAGGCCGCAAGCGGCCGGG,UAGGCCGCAAGCGGCCGGG,UAGGCCGCAAGCGGCCGGG,UAGGCCGCAAGUCGGCCGGG,UAGGCCGCAAGUCGGCCGGG,UAGGCCGCAAGUCGGCCGGG,UAGGCCGCAAGUCGGCCGGG,GAUCGGCCGGCAGCCUCCCGGCGG,GAUCGGCCGGCAGCCUCCCGGCGG,GAUCGGCCGGCAGCCUCCCGGCGG,GAUCGGCCGGCAGCCUCCCGGCGG,GAUCGGCCCGGCAGCCUCCCGGCGG,GAUCGGCCCGGCAGCCUCCCGGCGG,GAUCGGCCGGCAGCCGUACCGGCGG,AGAUCGGCCGGCAGCCGUACCGGCGG,GAUCGGCCGGCAGCCGUACCGGCGG,UAUCGGCCGGCACCGUACCGGGGG,UAUCGGCCGGCACCGUACCGGCGGG,UAUCGGCGGCACCGUACCGGCGGG,UAUCGGCCGGCACCGUACCGGCGGG,UAUCGCCGGCACCGUACCGGCGGG,AUUAGGGCCGCCAUAACGGCGG,AUUAGGGCCGCCAAUAACGGCGG,AUUAGGGCCGCCUAUAACGGCGG,GUGUUGCGUGCCGCCUUAAGGCG,GUGUUGCGUGCGCCUUAAGGCG,GUGUUGCGUGCCGCCUUAAGGCG,GUGUUGCGUGCCGCCUUAAGGCG,GUGUUGCGUGCCGCCUUAAGGCG,GUGUUGCGUGCCGCCUUAAGGCG,GUGUUGCGUGCCGCCUUAAGGCG,GUGUUGCGUGCCGUCUGAAGGCG,GUGUUGCGUGCCGCCUUAAUGCG,GUGUUGCGUGCCGCCUUAAGGCG,GUGUUGCGUGCCGCCUUAAGGCG,GUGUUGCGUGCCGCCUUAAGGCG,GUGUUGCGUGCCGCCUUAAGGCG,GUGUUGCGUGCCGCCUUAAGGCG,GUGUUGCGUGCCGCCUUAAGGCG,GUGUUGCGUGCCGCCCUUAAGGCG,GUGUUGCGUGCCGCCUUAAGGCG,GUGUUGCGUGCCGCCUUAAGGCG,GUGUUGCGUGCGCCUUAAGGCG,CUGUUGCGUGCCGCCUUAAGGCG,CUGUUGCGUGCCGCCUUAAGGCG,CUGUUGCGUGCCGCCUUAAGGCG,GUGUUGCGUGCCGCCGUUACAGGCG,GUGUUGCGUGCCGCCGUUACAGGCG,GUGUUGCGUGCCGCCUUAAGGCG,GUGUUGCGUGCCGCCUUAAGGCG,GUGUUGCGUGCCGCCUUAAGGCG,UUGGUCCGCCUUACGGCGGG,UUGGUCCGCCUUACGGCGGG,UUGGUCCGCCUUACGGCGGG,UUGGUCCGCCUUACGGCGGG,UUCGUCCGCCUUACGGCGGG,GUUGUAGCCCGCCUUCGGCGGG,GUUGUUGCCGCCUUACGGCGG,GUUGUUGCCGCCUUACGGCGG,GUUGUUGCCGCCUUACGGCGG,GUUGUUGCCGCCUGACGGCGG,GUUGUUGCCGCCUGACGGCGG,GUUGUUGCCGCCUGACGGCGG,GUUGUUGCCGCCUGACGGCGG,GUUGUUUGCCGCCUGACGGCGG,GUUCCUUGCCAGCCUUACGGCGG,CUUGCGCCGCCUUACGGCGUG,CUUGCGCCGCCUUACGGCGUG,CUUGCGCCGCCUUACGGCGUG,CUUGCGCAGCCUUACGGCGUG,
and when I run the code I get:
AAAGCCGCCAAAGUAGGCGG 0
AAAGCCGCCAAAGUAGGCGG 1
AAAGCCGCCAAAGUAGGCGG 2
AAAGCCGCCAAAGUAGGCGG 3
AAAGCCGCCAAAGUAGGCGG 4
AAAGCCGCCAAAGUAGGCGG 5
AAAGCCCGCCAAAGAAGGCGG 6
AAAGCCCGCCAAAGAAGGCGG 7
AAAGCCCGCCAAAGAAGGCGG 8
AAAGCCCGGCCAAAGAAGGCGG 9
AAAGCCCGCCAAAGUAGGCGG 10
AAAGCCCGCCAAAGUAGGCGG 11
AAAGCCCGCCAGAAGUAGGCGG 12
AAAGCCCGCCAAAGUAG 13
GCGG 14
AAAGCCCGCCAAAGUAGGCGG 15
AAAGCACCGCCAAUGGGCGG 16
AAAGCACCGCCAAUAGGCGG 17
AAAGCACCGCCAAUAGGCGG 18
AUAGCACCGCCAAUAGGCGG 19
AUAGCACCGCCAAUAGGCGG 20
AUAGCACCGCCAGUAGGCGG 21
AUAGCACCGCCAAUAGGCGG 22
AAAGCACCGCCAAAUAAGGCGGG 23
AAAGCACCGCCAAAUAAGGCGGG 24
AAAGCACCGCCAAAUAGGCGGG 25
AAAGCACCGCCAAAUAAGGCGG 26
AAAGCACCGCCAAAUAAGGCGG 27
AAAGCACC 28
GCCAAAUAAGGCGG 29
AAAGCACCGCCAAAUAAGGCGG 30
AAAGCACCGCCAAAUAAGGCGG 31
AAAGCACCGCCAAAUAAGGCGG 32
AAAGCACCGCCAAAUAAGGCGG 33
AAAGCACCGCCAAAUAAGGCGG 34
AAAGCACCGCCAAAUAAGGCGG 35
AAAGCACCGCCAAAUAAGGCGG 36
AAAGCACCGCCAAAUAAGGCGG 37
AAAGCACCGCCAAAUAAGGCGG 38
AAAGCACCGCCAAAUAAGGCGG 39
AAAGCACCGCCAAAUAAGGCGG 40
AAAGCACCGCCAAAUAAGGCGG 41
AAAGCACC 42
GCCAAAUAAGGCGG 43
AAAGCACGGCCAAAUAAGGCGG 44
AAAGCACCGCCAAAUAAGGCGG 45
AAAGCACCGCCAAUAAGGCGG 46
AAAGCACCGCCAAAAGUCGAGGCGG 47
AAAGCACCGCCAAAAUGUGAGGCGG 48
AAAGCACCGCCAAAUGUGAGGCGG 49
AAAGCACCGCCAAAAUGGUGAGGCGG 50
AAAGCACCGCCAAAAGUGAGGCGG 51
AAAGCACCGCCAAAAGUGAGGCGG 52
AAAGCACCGCCAAAAGUGAGGCGG 53
AAAGCACCGCCAAAAGUGAGGCGG 54
AAAGCACCGCCA 55
AAAGUAAGGCGG 56
AAAGACCGCCAAAAGUAAGGCGG 57
AAAGCACCGCCAAAAGUAAGGCGG 58
AAAGCACCGCCAAAAGUAAGGCGG 59
AAAGCACCGCCAAAGUUAAGGCGG 60
AAAGCACCGCCAAAGUAAGGCGG 61
AAAGCACCGCCAAAGUAAGGCGG 62
AAAGCACCGCCAAAGUAAGGCGG 63
UAACGCCGGCCAACUAGGGCGG 64
AACAGCCCGGCCAAAUAGGGCGG 65
AAAGCCGCCAAACUGGCGG 66
AAAGCCGCCAAACUGGCGG 67
AAACCGCCCAAAUAGGCGG 68
AAAGCCGC 69
CCAAAUAGGCGG 70
AAAGCCGCCCAAAUAGGCGG 71
AAAGCCGCCAAAUAGGCGG 72
AAAGCCGCCAAAUAGGCGG 73
AAAGCCGCCCAAAUAGGCGG 74
AAAUCCGCCCAAAUAGGCGG 75
UAAAGCCGCCCUAAAUAGGCGG 76
AAAGCCGCGCAAAUAGGCGG 77
AAAGCCGCCCCAAAUAGGCGG 78
AAAGCCGCCCCAAAUAGGCGG 79
AAAGCCGCCCAAAUAGGCGUG 80
AAAGCCGCCCAAAUAGGCGG 81
AAAGCCGCCCAAAUAGGCGG 82
AAAGCCGCCCAAAUAGGCGG 83
AAAGCCGCCC 84
AAAUAGGCGG 85
AAAGCCGCCAAAUAGGCGG 86
AAAGCCGCCAAAUAGGCGG 87
AAAGCCGCCAAAUAGGCGG 88
AAAGCCGCCCAAAUAGGCGG 89
AAAGCCGCCAAAUGGCGGA 90
AAAGCCGCCAACCGGCGG 91
AAAGCCGCCAACCGGCGG 92
AAAGCCGCCAACCGGCGG 93
AAAGCCGUCAACCGGCGG 94
AAAGCCGCCAACCGGCGG 95
AAAGCCGCCAACCGGCGG 96
AAAGCGCCAACCGGCGG 97
AAAGCCGCCAACCGGCGG 98
AAAGCCGCCAACCGGCGG 99
AAAGCCGCCAACCGGCG 100
G 101
CACUGCCGGCCAAGUCGGCGG 102
CAUUGCCGGCCAAGUCGGCGG 103
CACUGCCGGCCAAGUCGGCGG 104
CAUGCCGGCCAAGUCGGCGG 105
CACUCCGGCCAAGUCGGCGG 106
CACUGCCGGCCAAGUCGGCGG 107
CACUGCCGGACCAAGUCGGCGG 108
CACUGCCGGCCAAGUCGGCGG 109
UCAAUUGCCGGCCAAGUCGGCGG 110
UCAAUUGCCGGCCAAGUCGGCGG 111
UUUAAGGCCGCACAUGCGGCCGUG 112
UUAAGGCCGGAAACAUUCGGCCGUG 113
UUAAGGCCGCACAUUCGGCCGGG 114
UUAAGGCCGCACAUUCGGCCGGG 115
UUAAGGCCGCACAUUCGGCCGGG 116
UUAAAAGGCCGACAUUGCGGCCGGG 117
UUAAAGGCCGACAUUGCGGCCGGG 118
UUAAGUCCGCACAUUCGGCCGGG 119
UUAAGGCCGCACAUUCGGCCGGG 120
UUAAGGCCGCACAUUCGGCCGGG 121
UUAAGGCCGCACAUUCGGCCGGG 122
UUAAGGCCGCACAUUCGGCCGGG 123
UUAAGGCCGCACAUCGGCCGGG 124
UAAGGCCGCACAUUCGGCCGGG 125
UAAGGCCGCACAUUCGGCCGGG 126
UAAGGCCGGC 127
ACAUUCGGCCGGG 128
UAAGGCCGCACAUUCGGCCGGG 129
UAAGGCCGCACAUUCGGCCGGG 130
UAAGGCCGCACAUUCGGCCGGG 131
UAAGGCCGCACAUUCGGCCGGG 132
UAAGGCCGCACAUUCGGCCGGG 133
UAAGGCCGCACAUGUCGGCCGGGU 134
UAAGGCCGCACAUUCGGCCGGG 135
UAAGGCCGCACAUUCGGCCGGG 136
UAGGCCGCAAGUCGGCCGGG 137
UAGGCCGCAAGCGGCCGGG 138
UAGGCCGCAAGCGGCCGGG 139
UAGGCCGCAAGCGGCCGGG 140
UAGGCCGCAAGUCGGCCG 141
GG 142
UAGGCCGCAAGUCGGCCGGG 143
UAGGCCGCAAGUCGGCCGGG 144
UAGGCCGCAAGUCGGCCGGG 145
GAUCGGCCGGCAGCCUCCCGGCGG 146
GAUCGGCCGGCAGCCUCCCGGCGG 147
GAUCGGCCGGCAGCCUCCCGGCGG 148
GAUCGGCCGGCAGCCUCCCGGCGG 149
GAUCGGCCCGGCAGCCUCCCGGCGG 150
GAUCGGCCCGGCAGCCUCCCGGCGG 151
GAUCGGCCGGCAGCCGUACCGGCGG 152
AGAUCGGCCGGCAGCCGUACCGGCGG 153
GAUCGGCCGGCAGCCGUACCGGCGG 154
UA 155
UCGGCCGGCACCGUACCGGGGG 156
UAUCGGCCGGCACCGUACCGGCGGG 157
UAUCGGCGGCACCGUACCGGCGGG 158
UAUCGGCCGGCACCGUACCGGCGGG 159
UAUCGCCGGCACCGUACCGGCGGG 160
AUUAGGGCCGCCAUAACGGCGG 161
AUUAGGGCCGCCAAUAACGGCGG 162
AUUAGGGCCGCCUAUAACGGCGG 163
GUGUUGCGUGCCGCCUUAAGGCG 164
GUGUUGCGUGCGCCUUAAGGCG 165
GUGUUGCGUGCCGCCUUAAGGCG 166
GUGUUGCGUGCCGCCUUAAGGCG 167
GUGUUGCG 168
UGCCGCCUUAAGGCG 169
GUGUUGCGUGCCGCCUUAAGGCG 170
GUGUUGCGUGCCGCCUUAAGGCG 171
GUGUUGCGUGCCGUCUGAAGGCG 172
GUGUUGCGUGCCGCCUUAAUGCG 173
GUGUUGCGUGCCGCCUUAAGGCG 174
GUGUUGCGUGCCGCCUUAAGGCG 175
GUGUUGCGUGCCGCCUUAAGGCG 176
GUGUUGCGUGCCGCCUUAAGGCG 177
GUGUUGCGUGCCGCCUUAAGGCG 178
GUGUUGCGUGCCGCCUUAAGGCG 179
GUGUUGCGUGCCGCCCUUAAGGCG 180
GUGUUGCGUGCCGCCUUA 181
AGGCG 182
GUGUUGCGUGCCGCCUUAAGGCG 183
GUGUUGCGUGCGCCUUAAGGCG 184
CUGUUGCGUGCCGCCUUAAGGCG 185
CUGUUGCGUGCCGCCUUAAGGCG 186
CUGUUGCGUGCCGCCUUAAGGCG 187
GUGUUGCGUGCCGCCGUUACAGGCG 188
GUGUUGCGUGCCGCCGUUACAGGCG 189
GUGUUGCGUGCCGCCUUAAGGCG 190
GUGUUGCGUGCCGCCUUAAGGCG 191
GUGUUGCGUGCCGCCUUAAGGCG 192
UUGGUCCGCCUUACGGCGGG 193
UUGGUCCGCCUUACGGCGGG 194
UUGGUCCG 195
CCUUACGGCGGG 196
UUGGUCCGCCUUACGGCGGG 197
UUCGUCCGCCUUACGGCGGG 198
GUUGUAGCCCGCCUUCGGCGGG 199
GUUGUUGCCGCCUUACGGCGG 200
GUUGUUGCCGCCUUACGGCGG 201
GUUGUUGCCGCCUUACGGCGG 202
GUUGUUGCCGCCUGACGGCGG 203
GUUGUUGCCGCCUGACGGCGG 204
GUUGUUGCCGCCUGACGGCGG 205
GUUGUUGCCGCCUGACGGCGG 206
GUUGUUUGCCGCCUGACGGCGG 207
GUUCCUUGCCAGCCUUACGGCGG 208
Segmentation fault (core dumped)
I know I have to solve the new line issue, but I don't know why do I get the segmentation fault. Because it seems to work but I don't get to the end of the file. Any ideas of what is causing this? Thank you
Because of the (arbitrary) size of your read buffer, you are splitting some sequences, so that your program sees more than 200 of them, and thus your array to hold them is too small.
char Nseq[N][L]; // N = 200;
It means that Nseq can store at most 200 sequences. But in your code, the value of n (in while loop) ups to 208 at least. To avoid the problem, you can define N more than 208 (N = 300, for example), or you have to add one condition for n in while loop condition as below:
while (fgets(line, sizeof(line), myfile) && n < 200) {...}
If you want to read all text in the file, you can use double pointer: char **Nseq, then realloc for it after each iteration of while loop:
char **Nseq;
while (fgets(line, sizeof(line), myfile)){
token = strtok(line, s);
while (token != NULL){
Nseq = realloc(Nseq, sizeof(char *) * (n+1));
if(!Nseq) {return -1;}
Nseq[n] = malloc(strlen(token) + 1);
if(!Nseq[n]) {return -1;}
strcpy(Nseq[n], token);
printf("%s\t%u\n", token, n);
n++;
token = strtok(NULL, s);
}
}
In C, I need to print the number pattern in the below manner in right alignment, ie: when the double digit comes the upper single digit should adjust itself to right and so on.
int main() {
long int k = 1;
int i, j, n;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
for (j = 1; j <= i; j++) {
printf("%ld ", k);
k++;
}
printf("\n");
}
return 0;
}
required output:
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 45
46 47 48 49 50 51 52 53 54 55 `
output I get:
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 45
46 47 48 49 50 51 52 53 54 55
output required:
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 45
46 47 48 49 50 51 52 53 54 55
56 57 58 59 60 61 62 63 64 65 66
67 68 69 70 71 72 73 74 75 76 77 78
79 80 81 82 83 84 85 86 87 88 89 90 91
92 93 94 95 96 97 98 99 100 101 102 103 104 105
106 107 108 109 110 111 112 113 114 115 116 117 118 119 120
121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136
137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153
154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171
172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190
191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210
output I get:
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 45
46 47 48 49 50 51 52 53 54 55
56 57 58 59 60 61 62 63 64 65 66
67 68 69 70 71 72 73 74 75 76 77 78
79 80 81 82 83 84 85 86 87 88 89 90 91
92 93 94 95 96 97 98 99 100 101 102 103 104 105
106 107 108 109 110 111 112 113 114 115 116 117 118 119 120
121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136
137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153
154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171
172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190
191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210
You should calculate the length of the last outputted number and use the value as the field width in a printf call..
Here you are.
#include <stdio.h>
int main(void)
{
while ( 1 )
{
printf( "Enter a non-negative number (0 - exit): " );
unsigned int n;
if ( scanf( "%u", &n ) != 1 || n == 0 ) break;
unsigned int upper = n * ( n + 1 ) / 2;
int size = 0;
do { ++size; } while ( upper /= 10 );
putchar( '\n' );
for ( unsigned int i = 0, value = 0; i < n; i++ )
{
do
{
printf( "%*u ", size, ++value );
} while ( value != ( i + 1 ) * ( i + 2 ) / 2 );
putchar( '\n' );
}
putchar( '\n' );
}
return 0;
}
The program output is
Enter a non-negative number (0 - exit): 10
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 45
46 47 48 49 50 51 52 53 54 55
Enter a non-negative number (0 - exit): 20
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 45
46 47 48 49 50 51 52 53 54 55
56 57 58 59 60 61 62 63 64 65 66
67 68 69 70 71 72 73 74 75 76 77 78
79 80 81 82 83 84 85 86 87 88 89 90 91
92 93 94 95 96 97 98 99 100 101 102 103 104 105
106 107 108 109 110 111 112 113 114 115 116 117 118 119 120
121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136
137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153
154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171
172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190
191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210
Enter a non-negative number (0 - exit): 0
I will not help you write a code because zero effort is shown, but I can give hints via a pseudo code.
cin >> n; //desired number of rows
for (int i = 0; i < n; i++){
//generate triangle numbers
}//store the first n triangle numbers, given by n(n-1)/2
for (int i = 0; i < n; i++){
cout << i;
if (i==any triangle number){
cout << "\n"; //note that an endline is printed only at triangle numbers
}
}
Here is a simple solution that handles end of lines correctly too:
#include <stdio.h>
int main(void) {
int i, j, k, n, len;
if (scanf("%d", &n) == 1 && n > 0) {
/* compute the width of the last number */
//len = snprintf(NULL, 0, "%d", n * (n + 1) / 2);
//char buf[48]; /* large enough for 128-bit integers */
//len = sprintf(buf, "%d", n * (n + 1) / 2);
for (len = 1, k = n * (n + 1) / 2; k > 9; k /= 10)
len++;
for (i = k = 1; i <= n; i++) {
for (j = 1; j < i; j++) {
printf("%*d ", len, k++);
}
/* print the last number on the line without a trailing space */
printf("%*d\n", len, k++);
}
}
return 0;
}