function change(){
   var ok = document.getElementsByClassName("refino-marca")[0];
   var ko = ok.children[1];
   if(ko.style.)
}
    
    window.onload = function(){
        var ok = document.getElementsByClassName("refino-marca")[0];
        var ko = ok.children[0];
        ko.addEventListener( 'click', change);
    }

galahad:/ # getprop  | grep -i model
[ro.product.model]: [M2004J19C]
[ro.product.odm.model]: [M2004J19C]
[ro.product.product.model]: [M2004J19C]
[ro.product.system.model]: [M2004J19C]
[ro.product.vendor.model]: [M2004J19C]

galahad:/ # getprop  | grep -i ro.build.version.
[ro.build.version.base_os]: [Redmi/galahad_eea/galahad:10/QP1A.190711.020/V12.0.0.1.QJCEUXM:user/release-keys]
[ro.build.version.incremental]: [V12.0.1.0.QJCEUXM]
[ro.build.version.security_patch]: [2021-01-05]

galahad:/ # getprop  | grep -i baseband
[gsm.version.baseband]: [MOLY.LR12A.R3.MP.V98.P75,MOLY.LR12A.R3.MP.V98.P75]
[ro.baseband]: [unknown]
[vendor.gsm.project.baseband]: [HUAQIN_Q0MP1_MT6769_SP(LWCTG_CUSTOM)]

$ fastboot getvar all
...
(bootloader) product: lancelot
...
(bootloader) version-baseband: MOLY.LR12A.R3.MP.V98.P75
(bootloader) version-bootloader: lancelot-2b1e22f-20201123162228-2021011
(bootloader) version-preloader:
(bootloader) version: 0.5
...

$ mkdir omni-twrp-10.0/ && cd omni-twrp-10.0/
$ repo init -u git://github.com/minimal-manifest-twrp/platform_manifest_twrp_omni.git -b twrp-10.0 --depth=1
$ repo sync --current-branch --jobs=4
$ mkdir -p device/xiaomi/
$ git clone https://github.com/Redmi-MT6768/omni_device_xiaomi_lancelot lancelot

$ make clobber
$ . ./build/envsetup.sh
$ lunch

You're building on Linux

Lunch menu... pick a combo:
     1. aosp_arm-eng
     2. aosp_arm64-eng
     3. aosp_x86-eng
     4. aosp_x86_64-eng
     5. omni_emulator-userdebug
     6. omni_lancelot-eng
     7. omni_lancelot-userdebug

Which would you like? [aosp_arm-eng] omni_lancelot-userdebug

============================================
PLATFORM_VERSION_CODENAME=REL
PLATFORM_VERSION=16.1.0
TARGET_PRODUCT=omni_lancelot
TARGET_BUILD_VARIANT=userdebug
TARGET_BUILD_TYPE=release
TARGET_ARCH=arm64
TARGET_ARCH_VARIANT=armv8-2a
TARGET_CPU_VARIANT=generic
TARGET_2ND_ARCH=arm
TARGET_2ND_ARCH_VARIANT=armv8-2a
TARGET_2ND_CPU_VARIANT=generic
HOST_ARCH=x86_64
HOST_2ND_ARCH=x86
HOST_OS=linux
HOST_OS_EXTRA=Linux-5.13.11-amd64-x86_64-Debian-GNU/Linux-bookworm/sid
HOST_CROSS_OS=windows
HOST_CROSS_ARCH=x86
HOST_CROSS_2ND_ARCH=x86_64
HOST_BUILD_TYPE=release
BUILD_ID=QQ3A.200805.001
OUT_DIR=/media/Android/omni-twrp-10.0/out
ROM_BUILDTYPE=HOMEMADE
============================================

$ make clean && make -j2 recoveryimage
02:10:56 Entire build directory removed.

#### build completed successfully (6 seconds) ####

============================================
PLATFORM_VERSION_CODENAME=REL
PLATFORM_VERSION=16.1.0
TARGET_PRODUCT=omni_lancelot
TARGET_BUILD_VARIANT=userdebug
TARGET_BUILD_TYPE=release
TARGET_ARCH=arm64
TARGET_ARCH_VARIANT=armv8-2a
TARGET_CPU_VARIANT=generic
TARGET_2ND_ARCH=arm
TARGET_2ND_ARCH_VARIANT=armv8-2a
TARGET_2ND_CPU_VARIANT=generic
HOST_ARCH=x86_64
HOST_2ND_ARCH=x86
HOST_OS=linux
HOST_OS_EXTRA=Linux-5.13.11-amd64-x86_64-Debian-GNU/Linux-bookworm/sid
HOST_CROSS_OS=windows
HOST_CROSS_ARCH=x86
HOST_CROSS_2ND_ARCH=x86_64
HOST_BUILD_TYPE=release
BUILD_ID=QQ3A.200805.001
OUT_DIR=/media/Android/omni-twrp-10.0/out
ROM_BUILDTYPE=HOMEMADE
============================================
...
[100% 20282/20282] ----- Making recovery image ------

#### build completed successfully (18:47 (mm:ss)) ####

$ fastboot flash recovery omni-twrp-10.0/out/target/product/lancelot/recovery.img

$ fastboot reboot recovery

$ adb pull /dev/block/mmcblk0 mmcblk0.img
/dev/block/mmcblk0: 1 file pulled. 14.0 MB/s (62537072640 bytes in 4266.682s)

# gdisk -l mmcblk0.img
GPT fdisk (gdisk) version 1.0.7

Partition table scan:
  MBR: protective
  BSD: not present
  APM: not present
  GPT: present

Found valid GPT with protective MBR; using GPT.
Disk mmcblk0.img: 122142720 sectors, 58.2 GiB
Sector size (logical): 512 bytes
Disk identifier (GUID): 00000000-0000-0000-0000-000000000000
Partition table holds up to 128 entries
Main partition table begins at sector 2 and ends at sector 33
First usable sector is 34, last usable sector is 122142686
Partitions will be aligned on 16-sector boundaries
Total free space is 61 sectors (30.5 KiB)

Number  Start (sector)    End (sector)  Size       Code  Name
   1              64          131135   64.0 MiB    0700  recovery
   2          131136          132159   512.0 KiB   0700  misc
   3          132160          133183   512.0 KiB   0700  para
   4          133184          174143   20.0 MiB    0700  expdb
   5          174144          176191   1024.0 KiB  0700  frp
   6          176192          192575   8.0 MiB     0700  vbmeta
   7          192576          208959   8.0 MiB     0700  vbmeta_system
   8          208960          225343   8.0 MiB     0700  vbmeta_vendor
   9          225344          271631   22.6 MiB    0700  md_udc
  10          271632          337167   32.0 MiB    0700  metadata
  11          337168          402703   32.0 MiB    0700  nvcfg
  12          402704          533775   64.0 MiB    0700  nvdata
  13          533776          632079   48.0 MiB    0700  persist
  14          632080          730383   48.0 MiB    0700  persistbak
  15          730384          746767   8.0 MiB     0700  protect1
  16          746768          770047   11.4 MiB    0700  protect2
  17          770048          786431   8.0 MiB     0700  seccfg
  18          786432          790527   2.0 MiB     0700  sec1
  19          790528          796671   3.0 MiB     0700  proinfo
  20          796672          797695   512.0 KiB   0700  efuse
  21          797696          850943   26.0 MiB    0700  boot_para
  22          850944          982015   64.0 MiB    0700  nvram
  23          982016          998399   8.0 MiB     0700  logo
  24          998400         1260543   128.0 MiB   0700  md1img
  25         1260544         1262591   1024.0 KiB  0700  spmfw
  26         1262592         1274879   6.0 MiB     0700  scp1
  27         1274880         1287167   6.0 MiB     0700  scp2
  28         1287168         1289215   1024.0 KiB  0700  sspm_1
  29         1289216         1291263   1024.0 KiB  0700  sspm_2
  30         1291264         1324031   16.0 MiB    0700  gz1
  31         1324032         1356799   16.0 MiB    0700  gz2
  32         1356800         1360895   2.0 MiB     0700  lk
  33         1360896         1364991   2.0 MiB     0700  lk2
  34         1364992         1496063   64.0 MiB    0700  boot
  35         1496064         1528831   16.0 MiB    0700  dtbo
  36         1528832         1539071   5.0 MiB     0700  tee1
  37         1539072         1549311   5.0 MiB     0700  tee2
  38         1549312         1582079   16.0 MiB    0700  gsort
  39         1582080         1844223   128.0 MiB   0700  minidump
  40         1844224         2630655   384.0 MiB   0700  exaid
  41         2630656         4727807   1024.0 MiB  0700  cust
  42         4727808         4744191   8.0 MiB     0700  devinfo
  43         4744192         4767743   11.5 MiB    0700  ffu
  44         4767744        19447807   7.0 GiB     0700  super
  45        19447808        20332543   432.0 MiB   0700  cache
  46        20332544       122021823   48.5 GiB    0700  userdata
  47       122021824       122109887   43.0 MiB    0700  otp
  48       122109888       122142655   16.0 MiB    0700  flashinfo

# losetup /dev/loop5 /media/Zami/mmcblk0.img
# losetup -a
/dev/loop5: [64769]:12 (/media/Zami/mmcblk0.img)

# ls -al /dev/loop5*
brw-rw---- 1 root disk 7, 320 2021-08-29 02:54:11 /dev/loop5
brw-rw---- 1 root disk 7, 321 2021-08-29 02:54:11 /dev/loop5p1
brw-rw---- 1 root disk 7, 330 2021-08-29 02:54:11 /dev/loop5p10
brw-rw---- 1 root disk 7, 331 2021-08-29 02:54:11 /dev/loop5p11
brw-rw---- 1 root disk 7, 332 2021-08-29 02:54:11 /dev/loop5p12
brw-rw---- 1 root disk 7, 333 2021-08-29 02:54:11 /dev/loop5p13
brw-rw---- 1 root disk 7, 334 2021-08-29 02:54:11 /dev/loop5p14
brw-rw---- 1 root disk 7, 335 2021-08-29 02:54:11 /dev/loop5p15
brw-rw---- 1 root disk 7, 336 2021-08-29 02:54:11 /dev/loop5p16
brw-rw---- 1 root disk 7, 337 2021-08-29 02:54:11 /dev/loop5p17
brw-rw---- 1 root disk 7, 338 2021-08-29 02:54:11 /dev/loop5p18
brw-rw---- 1 root disk 7, 339 2021-08-29 02:54:11 /dev/loop5p19
brw-rw---- 1 root disk 7, 322 2021-08-29 02:54:11 /dev/loop5p2
brw-rw---- 1 root disk 7, 340 2021-08-29 02:54:11 /dev/loop5p20
brw-rw---- 1 root disk 7, 341 2021-08-29 02:54:11 /dev/loop5p21
brw-rw---- 1 root disk 7, 342 2021-08-29 02:54:11 /dev/loop5p22
brw-rw---- 1 root disk 7, 343 2021-08-29 02:54:11 /dev/loop5p23
brw-rw---- 1 root disk 7, 344 2021-08-29 02:54:11 /dev/loop5p24
brw-rw---- 1 root disk 7, 345 2021-08-29 02:54:11 /dev/loop5p25
brw-rw---- 1 root disk 7, 346 2021-08-29 02:54:11 /dev/loop5p26
brw-rw---- 1 root disk 7, 347 2021-08-29 02:54:11 /dev/loop5p27
brw-rw---- 1 root disk 7, 348 2021-08-29 02:54:11 /dev/loop5p28
brw-rw---- 1 root disk 7, 349 2021-08-29 02:54:11 /dev/loop5p29
brw-rw---- 1 root disk 7, 323 2021-08-29 02:54:11 /dev/loop5p3
brw-rw---- 1 root disk 7, 350 2021-08-29 02:54:11 /dev/loop5p30
brw-rw---- 1 root disk 7, 351 2021-08-29 02:54:11 /dev/loop5p31
brw-rw---- 1 root disk 7, 352 2021-08-29 02:54:11 /dev/loop5p32
brw-rw---- 1 root disk 7, 353 2021-08-29 02:54:11 /dev/loop5p33
brw-rw---- 1 root disk 7, 354 2021-08-29 02:54:11 /dev/loop5p34
brw-rw---- 1 root disk 7, 355 2021-08-29 02:54:11 /dev/loop5p35
brw-rw---- 1 root disk 7, 356 2021-08-29 02:54:11 /dev/loop5p36
brw-rw---- 1 root disk 7, 357 2021-08-29 02:54:11 /dev/loop5p37
brw-rw---- 1 root disk 7, 358 2021-08-29 02:54:11 /dev/loop5p38
brw-rw---- 1 root disk 7, 359 2021-08-29 02:54:11 /dev/loop5p39
brw-rw---- 1 root disk 7, 324 2021-08-29 02:54:11 /dev/loop5p4
brw-rw---- 1 root disk 7, 360 2021-08-29 02:54:11 /dev/loop5p40
brw-rw---- 1 root disk 7, 361 2021-08-29 02:54:11 /dev/loop5p41
brw-rw---- 1 root disk 7, 362 2021-08-29 02:54:11 /dev/loop5p42
brw-rw---- 1 root disk 7, 363 2021-08-29 02:54:11 /dev/loop5p43
brw-rw---- 1 root disk 7, 364 2021-08-29 02:54:11 /dev/loop5p44
brw-rw---- 1 root disk 7, 365 2021-08-29 02:54:11 /dev/loop5p45
brw-rw---- 1 root disk 7, 366 2021-08-29 02:54:11 /dev/loop5p46
brw-rw---- 1 root disk 7, 367 2021-08-29 02:54:11 /dev/loop5p47
brw-rw---- 1 root disk 7, 368 2021-08-29 02:54:11 /dev/loop5p48
brw-rw---- 1 root disk 7, 325 2021-08-29 02:54:11 /dev/loop5p5
brw-rw---- 1 root disk 7, 326 2021-08-29 02:54:11 /dev/loop5p6
brw-rw---- 1 root disk 7, 327 2021-08-29 02:54:11 /dev/loop5p7
brw-rw---- 1 root disk 7, 328 2021-08-29 02:54:11 /dev/loop5p8
brw-rw---- 1 root disk 7, 329 2021-08-29 02:54:11 /dev/loop5p9

# dd if=/dev/loop5p34 of=./34-stock-boot.img

# dd if=/dev/loop5p6 of=./6-stock-vbmeta.img

$ fastboot --disable-verity --disable-verification flash vbmeta 6-stock-vbmeta.img

_.isEmpty(object)

pip install Django==4.0.1

//Link to question :- https://practice.geeksforgeeks.org/problems/diagonal-morning-assembly0028/1/
/*
Steps:-
    1.store the upper triangle in a array of vectors at index to difference of their index
    2.do similary for lower triangle
    3.now sort each array in array of vectors
            lower one sort in ascending
            upper one sort in decending
    4.now place the values in correct place in original matrix
    
    
    Time Complexity: O(N*M*log(min(N,M)))
	Space Complexity: O(N*M)
    
*/

void sort_martix_diagonally(vector<vector<int>> &matrix, int n, int m)
{

    vector<int> upper[m + 1]; // array of vectors to store the upper triangle
    vector<int> lower[n + 1]; // array of vectors to store the lower triangle

    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < m; j++)
        {
            if (i == j)
                continue; // if it is diagonal continue
            else if (i < j)
            {
                int ind = abs(i - j);
                upper[ind].push_back(matrix[i][j]); // storing the upper triangle at proper index
            }
            else if (i > j)
            {
                int ind = abs(i - j);
                lower[ind].push_back(matrix[i][j]); // storing the lower triangle at proper index
            }
        }
    }

    // sorting each vector
    for (auto &&v : lower)
    {
        sort(v.begin(), v.end()); // sorting in asceding order the lower triangle
    }

    for (auto &&v : upper)
    {
        sort(v.rbegin(), v.rend()); ////sorting in decending order the upper triangle
    }

    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < m; j++)
        {
            if (i == j)
                continue;
            else if (i < j)
            {
                int ind = abs(i - j);
                matrix[i][j] = upper[ind][i]; // putting the sorted values in proper
            }
            else if (i > j)
            {
                int ind = abs(i - j);
                matrix[i][j] = lower[ind][j]; // putting the sorted values in proper
            }
        }
    }
}

git push origin :refs/tags/<tagname>

/*
(this question is asked in many companies)
the,given matrix is n*n matrix

-->transpose of matrix
    Steps:-
       just swap the lower triangle with the upper triangle of matrix


-->clock-wise rotation by 90 degree
    Steps:-
        1.first find the transpose using above function
        2.the just reverse each row

-->anti-clock-wise rotation  by 90 degree
      Steps:-
        1.first find the transpose using above function
        2.the just reverse each column
        
        
      Time Complexity of all is O(n*n);

*/

vector<vector<int>> transpose(vector<vector<int>> matrix, int n)
{
    for (int i = 0; i < n; i++)
        for (int j = 0; j <= i; j++)
            swap(matrix[i][j], matrix[j][i]);

    return matrix;
}

vector<vector<int>> rotate_clock_wise(vector<vector<int>> matrix, int n)
{
    // getting the transpose of matrix
    matrix = transpose(matrix, n);

    // reversing each row
    for (int i = 0; i < n; i++)
    {
        ll s = 0, l = n - 1;
        while (s <= l)
        {
            swap(matrix[i][s], matrix[i][l]);
            s++;
            l--;
        }
    }

    return matrix;
}
vector<vector<int>> rotate_anti_clock_wise(vector<vector<int>> matrix, int n)
{
    // getting the transpose of matrix
    matrix = transpose(matrix, n);

    // reversing each column
    for (int j = 0; j < n; j++)
    {
        ll s = 0, l = n - 1;
        while (s <= l)
        {
            swap(matrix[s][j], matrix[l][j]);
            s++;
            l--;
        }
    }

    return matrix;
}

conic-gradient() = conic-gradient(
  [ from <angle> ]? [ at <position> ]?,
  <angular-color-stop-list>
)
.conic-gradient {
  background: conic-gradient(#fff, #000);
}
.conic-gradient {
  /* Original example */
  background-image: conic-gradient(#fff, #000);
  /* Explicitly state the location center point */
  background: conic-gradient(at 50% 50%, #fff, #000);
  /* Explicitly state the angle of the start color */
  background: conic-gradient(from 0deg, #fff, #000);
  /* Explicitly state the angle of the start color and center point location */
  background: conic-gradient(from 0deg at center, #fff, #000);
  /* Explicitly state the angles of both colors as percentages instead of degrees */
  background: conic-gradient(#fff 0%, #000 100%);
  /* Explicitly state the angle of the starting color in degrees and the ending color by a full turn of the circle */
  background: conic-gradient(#fff 0deg, #000 1turn);
}

function checkMail(email){
	var filter  = /^([a-zA-Z0-9_\.\-])+\@(([a-zA-Z0-9\-])+\.)+([a-zA-Z0-9]{2,4})+$/;
	if (filter.test(email)) {
		return true;
	}
	return false;
}

@-webkit-keyframes glowPulse {
  from { background-color: #749a02; -webkit-box-shadow: 0 0 10px #b6b6b6; }
  50% { background-color: #91bd09; -webkit-box-shadow: 0 0 20px #fff; }
  to { background-color: #749a02; -webkit-box-shadow: 0 0 10px #b6b6b6; }
}
 
.pulse {
  -webkit-animation-name: glowPulse;
  -webkit-animation-duration: 1s;
  -webkit-animation-iteration-count: infinite;
}

<!-- AR.js by @jerome_etienne - github: https://github.com/jeromeetienne/ar.js - info: https://medium.com/arjs/augmented-reality-in-10-lines-of-html-4e193ea9fdbf -->
<script src="https://aframe.io/releases/0.8.0/aframe.min.js"></script>
<script src="https://cdn.rawgit.com/jeromeetienne/AR.js/1.6.0/aframe/build/aframe-ar.js"></script>
<body style='margin : 0px; overflow: hidden;'>
	<a-scene embedded arjs='sourceType: webcam;'>
		<a-box position='0 0.5 0' material='opacity: 0.5;'></a-box>
		<a-marker-camera preset='hiro'></a-marker-camera>
	</a-scene>
</body>
 
source: https://codepen.io/jeromeetienne/pen/mRqqzb

<!DOCTYPE html>
<html>
 
<head>
    <html lang="en">
    <title>Banner 300x250</title>
    <meta name="author" content="Das Banner">
    <meta http-equiv="Content-Type" content="text/html; charset=utf-8">
    <meta name="viewport" content="width=device-width, initial-scale=1.0">
 
    <!-- Google Enabler --v -->
    <script src="https://s0.2mdn.net/ads/studio/Enabler.js"> </script>
 
    <!-- Animation --v -->
    <script type="text/javascript" src="animation.js"></script>
 
    <!--CDN links for the latest TweenLite, CSSPlugin, and EasePack --v -->
    <script src="http://cdnjs.cloudflare.com/ajax/libs/gsap/latest/plugins/CSSPlugin.min.js">
    </script>
    <script src="http://cdnjs.cloudflare.com/ajax/libs/gsap/latest/easing/EasePack.min.js">
    </script>
    <script src="http://cdnjs.cloudflare.com/ajax/libs/gsap/latest/TweenLite.min.js"></script>
    <script src="http://cdnjs.cloudflare.com/ajax/libs/gsap/latest/TimelineLite.min.js"></script>
 
    <!--LOCAL TweenLite, CSSPlugin, and EasePack --v -->
    <!-- 
    <script type="text/javascript" src="TweenLite.min.js"></script>
    <script type="text/javascript" src="CSSPlugin.min.js"></script>
    <script type="text/javascript" src="EasePack.min.js"></script>
    <script type="text/javascript" src="TimelineLite.min.js"></script>
    -->
 
    <!-- CSS  --v -->
    <link rel="stylesheet" type="text/css" href="style.css">       
</head>
 
<body id="container">
    <div id="banner">
        <img id="bgImage" src="bgImg.jpg">
        <div id="copy1"></div>
        <div id="copy2"></div>
        <div id="copy3"></div>
        <div id="copy4"></div>
        <div id="cta"><div id="ctaTextHolder"></div></div>   
        <div id="bg-exit"></div> <!-- exit for Google -->
    </div>
</body>
 
</html>

1<!DOCTYPE html>
2<html xmlns="http://www.w3.org/1999/xhtml"
3      xmlns:og="http://ogp.me/ns#"
31    <!-- Conflict with pygments for the .mo and .mi -->
32    <!-- http://www.southampton.ac.uk/~fangohr/blog/setting-up-pelican-how-to-make-equations-work.html -->
33    <script type="text/x-mathjax-config">
34        MathJax.Hub.Config({
35            "HTML-CSS": {
36            styles: {
41    </script>
42    <script type="text/javascript" src="http://cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS_HTML">
43    </script>
60            <ul class="nav navbar-nav">
61                    <li><a href="/index.html">Home</a></li>
62                    <li><a href="/research.html">Research</a></li>

adb shell input text "su%sshell%s-c%s\"dumpsys%swindow%swindows%s|%sgrep%s-E%s'mCurrentFocus.*(hulu|dream)'%s>%s/dev/null%s2>&1%s&&%s/system/bin/input%skeyevent%s23\""

<script src="https://code.jquery.com/jquery-3.5.1.slim.min.js" integrity="sha384-DfXdz2htPH0lsSSs5nCTpuj/zy4C+OGpamoFVy38MVBnE+IbbVYUew+OrCXaRkfj" crossorigin="anonymous"></script>
<script src="https://cdn.jsdelivr.net/npm/popper.js@1.16.1/dist/umd/popper.min.js" integrity="sha384-9/reFTGAW83EW2RDu2S0VKaIzap3H66lZH81PoYlFhbGU+6BZp6G7niu735Sk7lN" crossorigin="anonymous"></script>
<script src="https://cdn.rtlcss.com/bootstrap/v4.5.3/js/bootstrap.min.js" integrity="sha384-VmD+lKnI0Y4FPvr6hvZRw6xvdt/QZoNHQ4h5k0RL30aGkR9ylHU56BzrE2UoohWK" crossorigin="anonymous"></script>

(?i)^(who|what|where|when|why|how|was|did|do|is|are|does|if|can|could|should|would|will|did|do|is|are|won’t|were|weren’t|shouldn’t|couldn’t|cannot|can’t|didn’t|did not|does|doesn’t|wouldn’t|aren’t|won’t|wont|were|werent|shouldnt|couldnt|cant|didnt|doesnt|wouldont|arent|wont).(brand|name).

DataSet dataSet = new DataSet();
DataTable dataTable = new DataTable();

dataSet.Tables.Add(dataTable);
// Save to disk
dataSet.WriteXml(@"C:\MyDataset.xml");

// Read from disk
dataSet.ReadXml(@"C:\MyDataset.xml");

foreach(DataRow dr in table.Rows) // search whole table
{
    if(dr["Product_id"] == 2) // if id==2
    {
        dr["Product_name"] = "cde"; //change the name
        //break; break or not depending on you
    }
}

for(int i = dtPerson.Rows.Count-1; i >= 0; i--)
{
    DataRow dr = dtPerson.Rows[i];
    if (dr["name"] == "Joe")
        dr.Delete();
}
dtPerson.AcceptChanges();

p = Path(r'C:\Users\akrio\Desktop\Test').glob('**/*')
files = [x for x in p if x.is_file()]

#include <stdio.h>
#include <conio.h>

float poly(float a[], int, float);

int main()
{
    float x, a[10], y1;
    int deg, i;

    printf("Enter the degree of polynomial equation: ");
    scanf("%d", &deg);

    printf("Ehter the value of x for which the equation is to be evaluated: ");
    scanf("%f", &x);

    for (i = 0; i <= deg; i++) {
        printf("Enter the coefficient of x to the power %d: ", i);
        scanf("%f", &a[i]);
    }

    y1 = poly(a, deg, x);

    printf("The value of polynomial equation for the value of x = %.2f is: %.2f", x, y1);

    return 0;
}

/* function for finding the value of polynomial at some value of x */
float poly(float a[], int deg, float x)
{
    float p;
    int i;

    p = a[deg];

    for (i = deg; i >= 1; i--) {
        p = (a[i - 1] + x * p);
    }

    return p;
}

#include <stdio.h>
#include <conio.h>
#include <math.h>

float poly(float a[], int, float);
float deriv(float a[], int, float);

int main()
{
    float x, a[10], y1, dy1;
    int deg, i;

    printf("Enter the degree of polynomial equation: ");
    scanf("%d", &deg);

    printf("Ehter the value of x for which the equation is to be evaluated: ");
    scanf("%f", &x);

    for (i = 0; i <= deg; i++) {
        printf("Enter the coefficient of x to the power %d: ", i);
        scanf("%f", &a[i]);
    }

    y1 = poly(a, deg, x);
    dy1 = deriv(a, deg, x);

    printf("The value of polynomial equation for the value of x = %.2f is: %.2f", x, y1);
    printf("\nThe value of the derivative of the polynomial equation at x = %.2f is: %.2f", x, dy1);

    return 0;
}

/* function for finding the value of polynomial at some value of x */

float poly(float a[], int deg, float x)
{
    float p;
    int i;

    p = a[deg];

    for (i = deg; i >= 1; i--) {
        p = (a[i - 1] + x * p);
    }

    return p;
}

/* function for finding the derivative at some value of x */
float deriv(float a[], int deg, float x)
{
    float d[10], pd = 0, ps;
    int i;

    for (i = 0; i <= deg; i++) {
        ps = pow(x, deg - (i + 1));
        d[i] = (deg - i) * a[deg - i] * ps;
        pd = pd + d[i];
    }

    return pd;
}

#include <stdio.h>
#include <stdlib.h>

int main()
{
    int* iVar;

    iVar = (int*)malloc(sizeof(int));

    printf("Now, input an integer value: ");
    scanf("%d", iVar);

    printf("Great!!! you entered: %d.\n", *iVar);

    free(iVar);

    return 0;
}

#include <stdio.h>
#include <string.h>
 
/*
Function : extractIpAddress
Arguments : 
1) sourceString - String pointer that contains ip address
2) ipAddress - Target variable short type array pointer that will store ip address octets
*/
void extractIpAddress(unsigned char *sourceString,short *ipAddress)
{
    unsigned short len=0;
    unsigned char  oct[4]={0},cnt=0,cnt1=0,i,buf[5];
 
    len=strlen(sourceString);
    for(i=0;i<len;i++)
    {
        if(sourceString[i]!='.'){
            buf[cnt++] =sourceString[i];
        }
        if(sourceString[i]=='.' || i==len-1){
            buf[cnt]='\0';
            cnt=0;
            oct[cnt1++]=atoi(buf);
        }
    }
    ipAddress[0]=oct[0];
    ipAddress[1]=oct[1];
    ipAddress[2]=oct[2];
    ipAddress[3]=oct[3];
}

int main()
{
    unsigned char ip[20]={0};
    short ipAddress[4];
     
    printf("Enter IP Address (xxx.xxx.xxx.xxx format): ");
    scanf("%s",ip);
     
    extractIpAddress(ip,&ipAddress[0]);
     
    printf("\nIp Address: %03d. %03d. %03d. %03d\n",ipAddress[0],ipAddress[1],ipAddress[2],ipAddress[3]);
    
    if(ipAddress[0]>=0 && ipAddress[0]<=127)
        printf("Class A Ip Address.\n");
    if(ipAddress[0]>127 && ipAddress[0]<191)
        printf("Class B Ip Address.\n");
    if(ipAddress[0]>191 && ipAddress[0]<224)
        printf("Class C Ip Address.\n");
    if(ipAddress[0]>224 && ipAddress[0]<=239)
        printf("Class D Ip Address.\n");
    if(ipAddress[0]>239)
        printf("Class E Ip Address.\n");
     
    return 0;
}

/*
C program to demonstrate example of
Stringizing Operator
*/

#include <stdio.h>

#define getVariableName(x) #x

int main()
{
    int student_age = 21;

    printf("value of %s is = %d\n", getVariableName(student_age), student_age);

    return 0;
}

/*Age Calculator (C program to calculate age).*/
 
#include <stdio.h>
#include <time.h>
 
/*check given year is leap year or not*/
int isLeapYear(int year, int mon) 
{
    int flag = 0;
    if (year % 100 == 0) 
    {
            if (year % 400 == 0) 
            {
                    if (mon == 2) 
                    {
                            flag = 1;
                    }
            }
    } 
    else if (year % 4 == 0) 
    {
            if (mon == 2) 
            {
                    flag = 1;
            }
    }
    return (flag);
}
 
 
int main()
{
 
    int DaysInMon[] = {31, 28, 31, 30, 31, 30,
                       31, 31, 30, 31, 30, 31};
    int days, month, year;
    char dob[100];
    time_t ts;
    struct tm *ct;
 
    /* enter date of birth */
    printf("Enter your date of birth (DD/MM/YYYY): ");
    scanf("%d/%d/%d",&days,&month, &year);
 
    /*get current date.*/
    ts = time(NULL);
    ct = localtime(&ts);
 
    printf("Current Date: %d/%d/%d\n",
            ct->tm_mday, ct->tm_mon + 1, ct->tm_year + 1900);
 
    days = DaysInMon[month - 1] - days + 1;
 
    /* leap year checking*/
    if (isLeapYear(year, month)) 
    {
            days = days + 1;
    }
 
    /* calculating age in no of days, years and months */
    days = days + ct->tm_mday;
    month = (12 - month) + (ct->tm_mon);
    year = (ct->tm_year + 1900) - year - 1;
 
    /* checking for leap year feb - 29 days */
    if (isLeapYear((ct->tm_year + 1900), (ct->tm_mon + 1))) 
    {
            if (days >= (DaysInMon[ct->tm_mon] + 1)) 
            {
                    days = days - (DaysInMon[ct->tm_mon] + 1);
                    month = month + 1;
            }
    } 
    else if (days >= DaysInMon[ct->tm_mon]) 
    {
            days = days - (DaysInMon[ct->tm_mon]);
            month = month + 1;
    }
 
    if (month >= 12) 
    {
            year = year + 1;
            month = month - 12;
    }
 
    /* print age */
    printf("\n## Hey you are  %d years %d months and %d days old. ##\n", year, month, days);
 
    return 0;
}

/*EMI Calculator (C program to calculate EMI).*/

#include <stdio.h>
#include <math.h>

int main()
{
    float principal, rate, time, emi;

    printf("Enter principal: ");
    scanf("%f", &principal);

    printf("Enter rate: ");
    scanf("%f", &rate);

    printf("Enter time in year: ");
    scanf("%f", &time);

    rate = rate / (12 * 100); /*one month interest*/
    time = time * 12; /*one month period*/

    emi = (principal * rate * pow(1 + rate, time)) / (pow(1 + rate, time) - 1);

    printf("Monthly EMI is= %f\n", emi);

    return 0;
}

/*C program to implement substring function.*/

#include <stdio.h>

/*
function : substring
argument list:
1) source - source string
2) from - starting index from where you want to 
get substring.
3) n - number of characters to be copied in substring
4) target - target string in which you want to store
targe string.
Return type - int : 0 on success
*/

int substring(char* source, int from, int n, char* target)
{
    int length, i;
    //get string length
    for (length = 0; source[length] != '\0'; length++)
        ;

    if (from > length) {
        printf("Starting index is invalid.\n");
        return 1;
    }

    if ((from + n) > length) {
        //get substring till end
        n = (length - from);
    }

    //get substring in target
    for (i = 0; i < n; i++) {
        target[i] = source[from + i];
    }
    target[i] = '\0'; //assign null at last

    return 0;
}

int main()
{
    char str[100], targetString[100];
    int from, n;

    printf("Enter any string:");
    gets(str);

    printf("Enter from index (count from 0): ");
    scanf("%d", &from);

    printf("Enter number of characters: ");
    scanf("%d", &n);

    if (substring(str, from, n, targetString) == 0) {
        printf("Substring is: %s\n", targetString);
    }

    return 0;
}

#include <stdio.h>

// function for Binary Addition
int binAddition(int a, int b)
{
    int c; //carry
    while (b != 0) {
        //find carry and shift it left
        c = (a & b) << 1;
        //find the sum
        a = a ^ b;
        b = c;
    }
    return a;
}

// function for Binary Subtraction
int binSubtracton(int a, int b)
{
    int carry;
    //get 2's compliment of b and add in a
    b = binAddition(~b, 1);

    while (b != 0) {
        //find carry and shift it left
        carry = (a & b) << 1;
        //find the sum
        a = a ^ b;
        b = carry;
    }
    return a;
}

int main()
{
    int number1, number2, binAdd, binSub;

    printf("Input first integer value: ");
    scanf("%d", &number1);

    printf("Input second integer value: ");
    scanf("%d", &number2);

    binAdd = binAddition(number1, number2);
    binSub = binSubtracton(number1, number2);

    printf("Binary Addition: %d\n", binAdd);
    printf("Binary Subtraction: %d\n", binSub);

    return 0;
}

const templateString = "Hello ${this.name}!";
const templateVars = {
    name: "world"    
}

const fillTemplate = function(templateString, templateVars){
    return new Function("return `"+templateString +"`;").call(templateVars);
}

console.log(fillTemplate(templateString, templateVars));

// ES6 Modular JavaScript.
// npm install trackjs --save

import { TrackJS } from "trackjs";
TrackJS.install({
    token: "db5ae5c1a7f048329e06d0b83698db34",
    userId: "user@customer.com",
    sessionId: "user+2018-12-07T00:00:00.000Z+1",
    version: "1.2.4"
});

#include<stdio.h>

int main()
{
    printf("\n\n\t\tStudytonight - Best place to learn\n\n\n");
    
    float celsius, fahrenheit;
    printf("\n\nEnter temperature in Celsius: ");
    scanf("%f", &celsius);
    
    fahrenheit = (1.8*celsius) + 32;
    
    printf("\n\n\nTemperature in Fahrenheit is: %f ", fahrenheit);
    printf("\n\n\t\t\tCoding is Fun !\n\n\n");
    return 0;
}

#include<stdio.h>

// function prototype declarations
long factorial(int);
long find_npr(int, int);
long find_ncr(int, int);

int main()
{
    printf("\n\n\t\tStudytonight - Best place to learn\n\n\n");

    int n, r;
    long npr, ncr;

    printf("Enter the value of n and r respectively: \n\n");
    scanf("%d%d", &n, &r);

    // function calls
    npr = find_npr(n, r);
    ncr = find_ncr(n, r);

    printf("\n\n\n\t\t%dC%d = %ld\n", n, r, ncr);
    printf("\n\n\t\t%dP%d = %ld\n", n, r, npr);

    printf("\n\n\t\t\tCoding is Fun !\n\n\n");
    return 0;
}

/*
    function definition for nCr
*/
long find_ncr(int a, int b)
{
    return (factorial(a)/(factorial(b)*factorial(a-b)));
}

/*
    function definition for nPr
*/
long find_npr(int a, int b)
{
    return (factorial(a)/factorial(a-b));
}

/*
    recursive function definition for finding 
    factorial of a number
*/
long factorial(int c)
{
    if(c == 1 || c == 0)
        return 1;
    else
        return c*factorial(c-1);
}

#include <stdio.h>
typedef struct complex {
float real;
float imag;
} complex;

complex add(complex n1, complex n2);

int main() {
complex n1, n2, result;

printf("For 1st complex number \n");
printf("Enter the real and imaginary parts: ");
scanf("%f %f", &n1.real, &n1.imag);
printf("\nFor 2nd complex number \n");
printf("Enter the real and imaginary parts: ");
scanf("%f %f", &n2.real, &n2.imag);

result = add(n1, n2);

printf("Sum = %.1f + %.1fi", result.real, result.imag);
return 0;
}

complex add(complex n1, complex n2) {
complex temp;
temp.real = n1.real + n2.real;
temp.imag = n1.imag + n2.imag;
return (temp);
}

#include <stdio.h>

int main()
{
    int m,n;                 //Matrix Size Declaration
    printf("Enter the number of rows and column: \n");
    scanf("%d %d",&m,&n);   //Matrix Size Initialization
    int arr[10][10];        //Matrix Size Declaration
    printf("\nEnter the elements of the matrix: \n");
    for(int i=0;i<m;i++)    //Matrix Initialization
    {
        for(int j=0;j<n;j++)
        {
            scanf("%d",&arr[i][j]);
        }
    }
    printf("\nThe elements in the matrix are: \n");
    for(int i=0;i<m;i++)     //Print the matrix
    {
        for(int j=0;j<n;j++)
        {
            printf("%d ",arr[i][j]);
        }
        printf("\n");
    }
    int i = 0, j;
    int max = 0;
    int res[m];
    while (i < m)   //Check for the largest element in an array
    {
       for ( j = 0; j < n; j++)
       {
           if (arr[i][j] > max)
           {
              max = arr[i][j];
           }
        }
        res[i] = max;
        max = 0;
        i++;
    }
    for(int i = 0; i < n; i++)      //Print the largest element in an array
    {
       printf("Largest element in row %d is %d \n", i, res[i]);
    }
    
    return 0;
}

#include <stdio.h>

int main()
{
    int m,n;       //Row Column Declaration
    printf("Enter the number of rows and column\n");
    scanf("%d %d",&m,&n);    //Row Column Initialization
    int arr[m][n];   //Matrix Declaration
    printf("Enter the elements of the matrix\n");
    for(int i=0;i<m;i++)     //Matrix Initialization
    {
        for(int j=0;j<n;j++)
        {
            scanf("%d",&arr[i][j]);
        }
    }
    printf("\nElements in the matrix are \n");
    for(int i=0;i<m;i++)     //Print Matrix
   {
        for(int j=0;j<n;j++)
        {
            printf("%d ",arr[i][j]);
        }
        printf("\n");
    }
    printf("\nRow Sum....\n");
    for(int i=0;i<m;i++)   
    {
        int rsum=0;
        for(int j=0;j<n;j++)
        {
            rsum=rsum+arr[i][j];
        }
        printf("\nSum of all the elements in row %d is %d\n",i,rsum);
    }
    printf("\nColumn Sum....\n");
    for(int i=0;i<m;i++)
    {
        int csum=0;
        for(int j=0;j<n;j++)
        {
            csum=csum+arr[j][i];
        }
        printf("\nSum of all the elements in column %d is %d\n",i,csum);
    }
    return 0;
}

#include <stdio.h>
int main()
{
    int m,n;
    printf("Enter the number of rows and column: \n");
    scanf("%d %d",&m,&n);     //Matrix size declaration
    int a[m][n];
    printf("\nEnter the elements of the matrix: \n");
    for(int i=0;i<m;i++)     //Matrix Elements initialization
    {
        for(int j=0;j<n;j++)
        {
            scanf("%d",&a[i][j]);
        }
    }
    printf("\nThe elements in the matrix are: \n");
    for(int i=0;i<m;i++)     //Print the elements in the matrix 
    {
        for(int j=0;j<n;j++)
        {
            printf("%d ",a[i][j]);
        }
        printf("\n");
    }
    int lsum=0;        //Declare a variable to calculate lower triangular sum
    if(m==n)          //Check whether number of rows and column are equal or not
    {
       for(int i=0;i<m;i++)
       {
          for(int j=0;j<n;j++)
          {
               if(i>=j)     //Iterate only through the lower triangular elements
               lsum=lsum+a[i][j];   //Calculate the sum
          }
        }
        printf("\nThe sum of lower triangular matrix is %d",lsum);   //Display the sum
    }
    else
    {
        printf("Not Possible to display lower triangular elements sum");   //if number of rows and column are not equal
    }
    return 0;
}