Channel
@C_Codings
On this record: Topic · Growth · Engagement · Posts · Citations · Cite this entry
48,550subscribers
-477 since we began measuring on 6 August 2026
Risers and fallers across the register · movement among entries of 31,623–100,000.
| Telegram ID | -1001273016961 |
|---|---|
| Type | Channel |
| Username | @C_Codings |
| Description | This channel will serve you programs of C language. Admin : @jeNiShsoNi Useful channels : @c_channels @DeCODE_C @pyGuru |
| Created | Between 1 March 2018 and 28 January 2020— estimated from Telegram’s id allocation, not measured. How this range is calculated. |
| First recorded | 6 August 2026 |
| Last confirmed live | 25 August 2026 |
| Measurements held | 19 |
| Confirmed unchanged | 1 time, most recently 25 August 2026 |
| On Telegram | t.me/C_Codings |
Education — a classification, not a measurement. An on-box language model (Qwen3.6-35B-A3B-UD-Q6_K_XL, prompt version 1) read this channel’s own recent posts on 21 August 2026 and assigned it the closest of 31 fixed categories, at 81% confidence. This is a model’s judgement about what the channel is likely to be about, not a fact this register measured the way a subscriber count or a view count is measured — it can be revised on a later pass, and it carries no weight anywhere else on this page. How this classification works, and why it has no browse page of its own yet.
| Measured (UTC) | Subscribers | Change |
|---|---|---|
| 25 Aug 2026, 06:07 | 48,550 | -38 |
| 24 Aug 2026, 06:58 | 48,588 | -43 |
| 22 Aug 2026, 12:36 | 48,631 | -20 |
| 21 Aug 2026, 00:42 | 48,651 | -21 |
| 19 Aug 2026, 21:51 | 48,672 | -29 |
| 18 Aug 2026, 18:58 | 48,701 | -19 |
| 17 Aug 2026, 21:03 | 48,720 | -38 |
| 16 Aug 2026, 19:26 | 48,758 | -39 |
| 15 Aug 2026, 04:19 | 48,797 | -38 |
| 13 Aug 2026, 18:27 | 48,835 | -15 |
| 12 Aug 2026, 20:34 | 48,850 | -12 |
| 11 Aug 2026, 22:52 | 48,862 | -48 |
| 11 Aug 2026, 01:52 | 48,910 | -35 |
| 10 Aug 2026, 04:02 | 48,945 | -27 |
| 9 Aug 2026, 00:52 | 48,972 | -15 |
| 8 Aug 2026, 01:23 | 48,987 | -20 |
| 7 Aug 2026, 03:16 | 49,007 | -20 |
| 6 Aug 2026, 06:45 | 49,027 | no change |
| 6 Aug 2026, 06:38 | 49,027 | first reading |
20 posts held, back to 28 January 2020 — the reader has not yet reached the start of this channel’s public history, so older posts may sit further back, unread. Read across 41 pagesof Telegram’s post history, 20 posts per page.
Nothing published in the last 30 days. ERR and ER are rolling 30-day measures, so there is nothing to compute — we hold 20 posts for this entry, the most recent from 22 August 2021. An engagement rate over an empty window would be a number about nothing.
144. Circular Link List. #include<stdio.h> #include<stdlib.h> typedef struct Node { int data; struct Node *next; } node; void insert(node *pointer, int data) { node *start = pointer; while (pointer->next != start) { pointer = pointer->next; } pointer->next = (node *) malloc(sizeof(node)); pointer = pointer->next; pointer->data = data; pointer->next = start; …
Signed jeNiSh
143. Program to allocate memory using malloc() and free memory using free(). #include<stdio.h> #include<stdlib.h> int main() { int n, i, *ptr, sum = 0; printf("Enter total number of elements : "); scanf("%d", &n); ptr = (int *) malloc(n * sizeof(int)); if (ptr == NULL) { printf("Error! Memory not allocated."); return 0; } printf("Enter elements of array : \n"); fo…
Signed jeNiSh
142. Program to concatenate two strings using pointer. #include <stdio.h> void concatenator(char *str, char *substr) { while (*str) str++; while (*substr) { *str = *substr; substr++; str++; } *str = '\0'; } int main() { char str[100], substr[100]; printf("Enter the source string : "); gets(str); printf("\nEnter string to concatenate : "); ge…
Signed jeNiSh
141. WAP to multiply and add two complex numbers Input : 5 -4 4 6 Output : Sum is 9 + 2i Product is 44 + 14i #include<stdio.h> #include<conio.h> typedef struct { int real; int imag; } complex; void getdata (complex *); void display (complex); complex sum(complex,complex); complex mult(complex,complex); main() { complex c1,c2,c3,c4; getdata(&c1); getdata(&c2); c3=sum(c1,c2); printf("Sum is "); display…
Signed jeNiSh
140. Program to find day on a particular date #include<stdio.h> int isLeapYear(int year){ if(year%4==0){ if(year%100==0 && year%400!=0){ return 0; } else{ return 1; } } else{ return 0; } } int main() { int year; int refYear=1600, leap=0; int diff, totalDays,day,month, oddDays; int lYear[]={3,1,3,2,3,2,3,3,2,3,2,3}; …
Signed jeNiSh
139. Program to read multiline string using scanf. #include<stdio.h> int main(void) { char str[100]; // reading multline string with '.' as a delimiter scanf("%[^.]",str); printf("%s",str); return 0; } #program_by : @freakyLuffy
Signed jeNiSh
138. Program to split words from a string using strtok function. #include <stdio.h> #include<string.h> int main(void) { char str[]="Welcome to C language"; char *token=strtok(str," "); while(token!=NULL) { printf("%s\n",token); token=strtok(NULL," "); } return 0; } #program_by : @freakyLuffy
Signed jeNiSh
137. Program to check whether the number is palindrome or not using recursion. #include<stdio.h> int checkPalindrome(int); int main() { int n, sum; printf("Enter a number : "); scanf("%d",&n); sum = checkPalindrome(n); if(n == sum) printf("%d is a palindrome", n); else printf("%d is not a palindrome", n); return 0; } int checkPalindrome(int n) { static int s…
Signed jeNiSh
136. Binary search using recursion #include<stdio.h> int binary(int arr[], int n, int search, int l, int u); int main() { int arr[10], i, n, search, c, l, u; printf("Enter the size of an array : "); scanf("%d", &n); for (i = 0; i < n; i++) { printf("Enter the element %d : ", i+1); scanf("%d", &arr[i]); } printf("Enter the number to be search: "); scanf("%d", &sear…
Signed jeNiSh
135. Sieve of Eratosthenes : An algorithm to generate all the prime numbers within an range. #include <stdio.h> #define size 1000 int main (void) { int n; scanf("%d",&n); int arr[size]={0}; for(int i=2;i*i<=n;i++) { for(int j=i;i*j<=n;j++) { arr[i*j]=1; } } for(int i=2;i<=n;i++) { if(!arr[i]) printf("%d ",i); } return 0; } …
Signed jeNiSh
134. Program to delete a node for a given element from linked list. #include <stdio.h> #include<stdlib.h> typedef struct node { int data; struct node *next; }Node; int main(void) { Node*temp; Node*start=NULL; Node* p=NULL; int n; scanf("%d",&n); while(n--) { temp=(Node *)malloc(sizeof(struct node)); scanf("%d",&temp->data); temp->next=NULL; if(start==NULL) { start=te…
Signed jeNiSh
133. Program for creating and displaying a linked list. #include <stdio.h> #include<stdlib.h> typedef struct node { int data; struct node *next; }Node; int main(void) { Node*temp; Node*start=NULL; Node* p=NULL; int n; scanf("%d",&n); while(n--) { temp=(Node *)malloc(sizeof(struct node)); scanf("%d",&temp->data); temp->next=NULL; if(start==NULL) { start=temp; p=…
Signed jeNiSh
Showing the 12 most recent of 20 posts we hold for @C_Codings. View and reaction counts are the latest single reading for each post, not a live figure, and a recent post is still accumulating both. A view count marked ≈ was rounded by Telegram before we ever saw it — t.me prints views in full below 1,000 and to three significant figures above, so ≈1,200,000 means somewhere between 1,150,000 and 1,249,999. Unmarked counts are exact. Text is reproduced from the public post preview and truncated for length.
Citation-graph rank — 1,516,250 of 1,602,868entries in the measured graph. A weighted position computed from the forward and mention edges below — republished posts weigh more than named mentions — and recomputed periodically, over the whole graph. Published only as this ordinal position, never as a score: a position is a fact, and a score printed beside one channel’s name would read as a verdict this register does not make. The two counts beneath stay separate for the same reason mentions are never summed with forwards anywhere else on this page — a named-by count costs nothing to manufacture. The top 100 by this measure, or how it is computed.
Named by 1 registered channel — every channel on the register whose own posts have named this one, by its current username or any other username it currently holds, merged from two separately captured readings of the same fact so a namer caught by only one of them is not missed and a namer both caught is not counted twice. A username this channel has since dropped is not matched — that handle may belong to someone else now, and crediting today’s namer to yesterday’s owner would misattribute it.
Named by
Channels on the register whose posts name this channel's handle.
Names
Channels on the register whose handles appear in this channel's posts.
A mention is a weaker signal than a forward and is counted separately for that reason — naming a channel is not republishing it, and a handle in a post body is easy to place deliberately. The post counts beside each row below are distinct posts in which the handle appeared, from posts we have read on both sides — the “Named by N registered channels” figure above is a different count, of distinct NAMING CHANNELS rather than posts, and is not the sum of the rows under it.
A live page changes as we take new readings, so a citation should name the measurement it is based on, not just the URL. The line below cites the subscriber count as measured 25 August 2026 — this entry's latest reading, not the date you are reading this.
“C Language 👨💻” (@C_Codings), 48,550 subscribers as measured 25 August 2026. Telegram Register, tgregister.com/channel/C_Codings.
Full measurement history, CC BY 4.0. Every reading this register holds for this entry, not just the latest one, as a dated, downloadable record: CSV · JSON. Free to use with attribution to tgregister.com. Each file carries its own generation timestamp, which is the figure to cite for exactly when the data was retrieved.