Posts
Showing posts from April, 2015
UVA solution
- Get link
- X
- Other Apps
Prime Numbers UVA 406 : Prime Cuts #include<iostream> #include<cstdio> #include<vector> #include<math.h> using namespace std; int main() { int n;int k=0,c; vector<int>arra(100000,0),prime; arra[0]=1; arra[1]=0; for(long long int i=2;i*i<=100000;i++) { if(arra[i]==0) { for(long long int j=i+i;j<=100000;j+=i) { arra[j]=1; } ...