1:
2:
3:
4:
5:
6:
7:
8:
9:
10:
11:

while(shift >= 0) 
{                  
//    printf("shift: %d\n", shift);             
if(sum >= mod<<shift)             
{             
//    printf("sum: %d\n", sum);                 
sum-= mod<<shift;             
//    printf("sum: %d\n", sum);             
}         
shift--;         
}

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:

int main()
{
  int konst = 000000001;
  int a = 4;
  int b = 4;
  int mod = 2;
  int i = 0;
  int sum = 0;

  if( mod == 0)
  {
  	printf("Modular must be bigger than 0!\n");
  }
  else
  {
  	//addieren
	  while(i < b) 
	  {
			sum = sum + a;
			i++;
	  }
		//Bitshifting
		//e.g. 8bit 0000 0001
		sum = 32; //soll sum in der zwischenzweit ersetzen
		int zahl1 = 0;
		int zahl2;
		int shift = 7;
		
return 0;
}

1:

int tests = (int)1e6, i;