-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmain.c
108 lines (91 loc) · 1.75 KB
/
main.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
/* Sine Computation program */
#include <stdio.h>
#include <math.h>
#include <unistd.h>
#include <errno.h>
#include <limits.h>
#include <stdlib.h>
int main ( int argc, char *argv[] )
{
int degree, answer, increment, maximum;
double radian, pi, value;
pi = atan2 ( 0, -1 );
// BREAKS
if ( argc > 3 )
{
printf( "Your arguments are too many\n" );
return -1;
}
// if ( strcmp(argv[1], "integer" ) !=
printf( "argc: %d\n", argc );
printf ( "Enter 0 for csv list, or 1 for a console formatted list: " );
scanf ( "%d", &answer );
if ( argc == 2 )
{
maximum = atoi(argv[1]);
degree = atoi(argv[1]);
}
else if ( argc == 1 )
{
degree = 0;
maximum = 360;
printf ( "Enter an increment value >= 1, < 360: " );
scanf ( "%d", &increment );
if ( increment <= 0.999999 )
{
printf ( "\nInvalid Entry\n" );
return 1;
}
}
else
{
printf ( "Enter an increment value >= 1, < 360: " );
scanf ( "%d", &increment );
if ( increment <= 0.999999 )
{
printf ( "\nInvalid Entry\n" );
return 1;
}
if ( strcmp(argv[1], "integer" ) == 0 )
{
degree=0;
}
else
{
degree = atoi(argv[1]);
}
if ( strcmp(argv[2], "integer") == 0 )
{
maximum=360;
}
else
{
maximum= atoi(argv[2]);
}
}
while ( degree <= maximum )
{
if ( degree == 0 && answer == 0 )
{
printf ( "PI = %f \n\n", pi );
printf ( "\"Degree\",\"Sine\"\n\n" );
}
else if ( degree == 0 && answer == 1 )
{
printf ( "PI = %f \n\n", pi );
printf ( "Degree\tSine\n\n" );
}
radian = pi * degree/180.0 ;
value = sin ( radian );
if ( answer == 0 )
{
printf ( "\"%d\",\"%f\"\n", degree, value );
}
else
{
printf ( "%6d\t%f\n", degree, value );
}
degree = degree +increment;
}
return 0;
}