6 solutions
-
1
/*#include<bits/stdc++.h> using namespace std; int n,x[100005]={0},k,ans=0; int check(int p){ for(int i=2;i*i<=p;i++)if(p%i==0)return 0; return 1; } void zs(int c,int w,int sum){ if(w==k+1){ if(check(sum))ans++; return ; } for(int i=c+1;i<=n;i++)zs(i,w+1,sum+x[i]); } int main(){ cin>>n>>k; for(int i=1;i<=n;i++)cin>>x[i]; zs(0,1,0); cout<<ans; }*/ #include<bits/stdc++.h> using namespace std; int main(){ cout<<"Hello,World!"; }
- 1
Information
- ID
- 6792
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- 1
- Tags
- # Submissions
- 73
- Accepted
- 36
- Uploaded By