|
|
1.1 root 1: c subroutine tst1
2: parameter(ntest=1)
3: c Arithmetic on constants
4: parameter( ONE=1, TWO=2, TEN=10, FIFTY=50, MINONE=-1)
5: if( 1+1 .ne. 2 ) call e(1,ntest)
6: if( ONE+ONE .ne. TWO ) call e(2,ntest)
7: if( ONE+MINONE .ne. 0 ) call e(3,ntest)
8: if( ONE-TWO .ne. MINONE ) call e(4,ntest)
9: if( TWO-MINONE .ne. 3 ) call e(5,ntest)
10: if( TWO*TWO .ne. 4 ) call e(6,ntest)
11: if( 100*MINONE .ne. -100 ) call e(7,ntest)
12: if( 50*ONE .ne. 50 ) call e(8,ntest)
13: if( 50*9 .ne. 450 ) call e(9,ntest)
14: if( 50*TEN .ne. 500 ) call e(10,ntest)
15: if( 60 / TWO .ne. 30 ) call e(11,ntest)
16: if( FIFTY / TWO .ne. 25 ) call e(12,ntest)
17: if( -2 / 1 .ne. -2 ) call e(13,ntest)
18: if( -3 / 1 .ne. -3 ) call e(14,ntest)
19: if( -3 / 2 .ne. -1 ) call e(15,ntest)
20: if( ((1+2+3) * (2+3+4) * (3+5+5)) / 2 .ne. ((3 * ((5+3+2)*10)+51)*6) / 6
21: & ) call e(16,ntest)
22: if( (1000*2 + 5*7 + 13) / 8 .ne. 2*2*2*2*4*4 ) call e(17,ntest)
23: if( (1 * 2 * 3 * 4 * 5 * 6 * 7) / 5040 .ne.
24: & 5040 / 7 / 6 / 5 / 4 / 3 / 2 ) call e(18,ntest)
25: if( -(-(-(-(-(-(-(-(-(1))))))))) .ne. -1 ) call e(19,ntest)
26: if( -1 -1 -1 -1 -1 .ne. -5 ) call e(20,ntest)
27: if( - 1 .ne. -(((((((((((((1))))))))))))) ) call e(21,ntest)
28: if( -4 * (-5) .ne. 20 ) call e(22,ntest)
29: if( 2.lt.1 ) call e(24,ntest)
30: if( 2 .le. 1 ) call e(25,ntest)
31: if( 2 .eq. 3 ) call e(26,ntest)
32: if( 2 .ne. 2 ) call e(27,ntest)
33: if( 2 .ge. 3 ) call e(28,ntest)
34: if( 2 .gt. 3 ) call e(29,ntest)
35: if( 2+0 .ne. 2 ) call e(30,ntest)
36: if( 2-0 .ne. 2 ) call e(31,ntest)
37: if( 2*0 .ne. 0 ) call e(32,ntest)
38: if( 0+2 .ne. 2 ) call e(33,ntest)
39: if( 0-2 .ne. -2 ) call e(34,ntest)
40: if( 0*2 .ne. 0 ) call e(35,ntest)
41: if( 0 / 1 .ne. 0 ) call e(36,ntest)
42: if( -0 .ne. 0 ) call e(37,ntest)
43: if( 0 - 0 .ne. 0 ) call e(38,ntest)
44: if( 0 * 0 .ne. 0 ) call e(39,ntest)
45: end
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.