Swapping program in one line

-

Swapping program in one line


#include
#include

void main() {
    clrscr();
    int a=36,b=20;

    a = (a+b) - (b = (a+b)-b);

    printf("%3d %3d",a,b);
    getch();
}

Comments

Post a Comment

Popular posts from this blog

date_diff function in php

-
////////////////////////////////////////////////////////////////////// //PARA: Date Should In YYYY-MM-DD Format //RESULT FORMAT: // '%y Year %m Month %d Day %h Hours %i Minute %s Seconds'        =>  1 Year 3 Month 14 Day 11 Hours 49 Minute 36 Seconds // '%y Year %m Month %d Day'                                    =>  1 Year 3 Month 14 Days // '%m Month %d Day'                                            =>  3 Month 14 Day // '%d Day %h Hours'                                            =>  14 Day 11 Hours // '%d Day'                                 ...
Read more

How to create a custom form in wordpress

-
// create table in database ( must add prefix ) // create page to display form i was wrote code into front-page.php                       Name: Email Selecet Resume: Submit if(isset($_POST['submitted'])) { global $wpdb; //print_r($_FILES['res']); $filename =  basename($_FILES['res']['name']); $path = get_template_directory()."/"."upload/resume/".$filename; //echo " "; $status = false; if(move_uploaded_file($_FILES['res']['tmp_name'], $path)) { $status = ture; } if($status == true) { $tablename=$wpdb->prefix.'resume'; $date = date("Y-m-d H:i:s A"); $data=array('name' => $_POST['contactName'], 'email...
Read more

m Coloring Problem using c or c++

-
m Coloring Problem using c or c++ Given an undirected graph and a number m, determine if the graph can be colored with at most m colors such that no two adjacent vertices of the graph are colored with the same color. Here coloring of a graph means the assignment of colors to all vertices. Input: 1) A 2D array graph[V][V] where V is the number of vertices in graph and graph[V][V] is adjacency matrix representation of the graph. A value graph[i][j] is 1 if there is a direct edge from i to j, otherwise graph[i][j] is 0. 2) An integer m which is a maximum number of colors that can be used. Output: An array color[V] that should have numbers from 1 to m. color[i] should represent the color assigned to the ith vertex. The code should also return false if the graph cannot be colored with m colors. Program: #include <stdio.h> #include <conio.h> #include <math.h> int m,n,x[10]={0},g[10][10]={0}; void main() {        ...
Read more