Affiliate Disclosure: This post contains Amazon affiliate links. If you purchase through these links, eBlogarithm may earn a commission at no extra cost to you. Prices and availability are subject to change.
#include<stdio.h>
int main(){int n, a[]={6,8,4,2};
scanf("%d",&n);
if(n)
printf("\n%d",a[n%4]);
else
printf("\n1");
return 0; }
📦 Looking for Codeforces Round 383 Div Problem Arpa? Check the best deals on Amazon.
🛒 Shop Codeforces Round 383 Div Problem Arpa on Amazon
As an Amazon Associate, eBlogarithm earns from qualifying purchases. Prices and availability are subject to change.
Affiliate Disclosure: This post contains Amazon affiliate links. If you purchase through these links, eBlogarithm may earn a commission at no extra cost to you. Prices and availability are subject to change.
#include<stdio.h>
int main(){int n, a[]={6,8,4,2};
scanf("%d",&n);
if(n)
printf("\n%d",a[n%4]);
else
printf("\n1");
return 0; }
📦 Looking for Codeforces Round 383 Div Problem Arpa? Check the best deals on Amazon.
🛒 Shop Codeforces Round 383 Div Problem Arpa on Amazon
As an Amazon Associate, eBlogarithm earns from qualifying purchases. Prices and availability are subject to change.