My part of an art trade with @alenchikova of their OC Lediv!!! Hope you enjoy!!!

seen from United Kingdom
seen from South Korea
seen from United Kingdom
seen from China
seen from India

seen from Malaysia

seen from China

seen from Malaysia
seen from China
seen from United Kingdom
seen from Malaysia
seen from Israel

seen from United States
seen from China

seen from United States

seen from United Kingdom
seen from United States
seen from United States

seen from Malaysia
seen from China
My part of an art trade with @alenchikova of their OC Lediv!!! Hope you enjoy!!!

Anya is live and ready to show you everything. Watch her strip, dance, and perform exclusive shows just for you. Interact in real-time and make your fantasies come true.
Free to watch β’ No registration required β’ HD streaming
@jauzofficial π¬ #lediv #ledanniversary #ledpresent #edmlife #sickbeats
LEDIV : precomputing prime factors
This was a learning problem for me. I Β knew that I have to calculate gcd in this problem. but i didn't knew that the answer will the least prime factor of gcd.
One approach to find that can be to iterate till the square root of that number and check for divisibility. the time limits were so that this solution would obviously be passed but since I am learning new things so I decide to go for precomputing that array using Sieve method
The function was:
int prime[100000];
void sieve(){
int i,j;
prime[0]=0;
for(i=1;i<=100000;i++)prime[i]=i;
for(i=2;<=sqrt(100000)+1;i++)
if(prime[i]==i){
for(j=2*i;j<=100000;j+=i)prime[j]=min(prime[j],i);}
}