prodhan

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

int main(){

  int i;
  for(i=1; i<=10; i++)
  {
    printf("%d\n", i);
  }

prodhan

<?php 
include('header.php');
include('connection.php');

if(isset($_POST['submit'])){
    $name=$_POST['name'];
    $roll=$_POST['roll'];
    $phone=$_POST['phone'];
    
$sql="INSERT INTO info (sname, roll, phone) VALUES('$name', '$roll', '$phone')";

prodhan

#mydiv {
    background-color: lightblue;
    width: 200px;
    height: 200px
}

prodhan

<?xml version="1.0" encoding="utf-8"?>
<LinearLayout xmlns:android="http://schemas.android.com/apk/res/android"
    xmlns:app="http://schemas.android.com/apk/res-auto"
    xmlns:tools="http://schemas.android.com/tools"
    android:layout_width="match_parent"
    android:layout_height="match_parent"
    android:orientation="vertical"
    android:background="@drawable/bg"
    android:weightSum="10"
    tools:context=".MainActivity">

prodhan

/*
Created By Ariful Islam
Batch E-64 (DIU)
Roll: 34
*/

#include<iostream>
#include <math.h>

using namespace std;

prodhan

/*
Created By Ariful Islam
Student of Dhaka Internationa University
Learn how does work this sort https://visualgo.net/en/sorting
*/


#include<iostream>

using namespace std;

prodhan

/*
Created By Ariful Islam
Batch E-64 (DIU)
Roll: 34
*/

#include<iostream>
#include <math.h>

using namespace std;

prodhan

/*
Created By Ariful Islam
Batch E-64 (DIU)
Roll: 34
*/

#include<iostream>
#include <math.h>

using namespace std;

prodhan

/*
 * A c++ program to get the maximum total value in the knapsack
 * Created By Ariful Islam
 * Student of Dhaka International University
 * Batch of E-64
 */


#include<iostream>

prodhan

/*
Created By Ariful Islam
Batch E-64 (DIU)
Roll: 34
problem no 22
EQN: x=cubic root (48)
Method: Bisection
Note: Root lies between 3 and 4
*/