- Strength to Increase Rep
- +0
- Strength to Decrease Rep
- -0
- Upvotes Received
- 2
- Posts with Upvotes
- 2
- Upvoting Members
- 2
- Downvotes Received
- 1
- Posts with Downvotes
- 1
- Downvoting Members
- 1
Re:
i build these code. it's very cool: in test.h: class test { private: bool blVisible; int x=0,y=0; public: void Show(); bool Visible() { return blVisible; } void Visible(bool value) { blVisible=value; if (value==true) Show();//call the event } }; in main.cpp: include <iostream> #include "test.h" using namespace std; test a; void … |
|
1. #include<stdio.h> #include<conio.h> int main() int a=10; printf("%d%d%d",a,a++,++a); getch(); return 0; } o/p:12 11 11 #include<stdio.h> #include<conio.h> int main() { double a=5.2; if(a==5.2) printf("equal"); else if(a<5.2) printf("less"); else printf("high"); getch(); } o/p: less Can any one give me explanation for the above outputs..... |
|
Re:
Q: Write a program which will print all the pairs of prime numbers whose sum equals the number entered by the user. My program is able to find the prime numbers until an integer value, n, and outputs it correctly. Now how do I find the pairs of prime numbers … |
|
Re:
I'm trying to write this code and having trouble compiling the code I've tried everthing but doesn't seem to want to work right, can you find any thing wrong in my code? {// Overtime Pay Structures.cpp : Defines the entry point for the console application. // #include "stdafx.h" #include <iostream> … |
|
Re:
Hello i implemented this FIFO queue: #include <stdio.h> void enqueue(int *, int); int dequeue(int *); int qempty(void); int head = 0; int tail = 0; int qerror(void); #define N 4 int main(void) { int i = 0; int v[N]; while (i < 10) { enqueue(v, i); i++; } while (!qempty()) … |
|
Re:
1.writte a program that generates output 10 20 30 Generate by using 10 2.write a program that take age from a person and converts into months and days . Please Help Thanxx |