Submission #56267

#	Time	Username	Problem	Language	Result	Execution time	Memory
56267		hamzqq9	Sažetak (COCI17_sazetak)	C++14	64 / 160	526 ms	66560 KiB

sazetak

#include<bits/stdc++.h>
#define lf double
#define ll long long
#define ull unsigned ll
#define ii pair<int,int>
#define li pair<ll,int>
#define iii pair<ii,int>
#define iiii pair<ii,ii>
#define iiii2 pair<int,iii>
#define lii pair<ll,ii>
#define lolo pair<ll,ll>
#define heap priority_queue
#define mp make_pair
#define st first
#define nd second
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define all(x) x.begin(),x.end()
#define len(x) strlen(x)
#define sz(x) (int) x.size()
#define orta ((bas+son)/2)
#define min3(x,y,z) min(min(x,y),z)
#define max3(x,y,z) max(max(x,y),z)
#define umin(x,y) x=min(x,y)
#define umax(x,y) x=max(x,y)
#define dbgs(x) cerr<<(#x)<<" --> "<<(x)<<" "
#define dbg(x) cerr<<(#x)<<" --> "<<(x)<<endl;getchar()
#define MOD 1000000007
#define inf 1000000001
#define N 50000005
#define LOG 20
#define magic 100
#define MAX 1000005
#define KOK 350
#define EPS 0.000000000001
#define pw(x) (1<<(x))
#define PI 3.1415926535
using namespace std;

int n,m,x,ans;
bool able[N];

int main() {

	#if 0	
	freopen("input.txt","r",stdin);

	#endif

	scanf("%d %d",&n,&m);

	for(int i=1;i<=m;i++) {

		scanf("%d",&x);

		for(int j=x;j<=n;j+=x) able[j]=1;

	}

	able[0]=able[n]=1;

	for(int i=1;i<=n;i++) {

		ans+=able[i]&able[i-1];

	}

	printf("%d",ans);

}

Compilation message (stderr)

sazetak.cpp: In function 'int main()':
sazetak.cpp:52:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d",&n,&m);
  ~~~~~^~~~~~~~~~~~~~~
sazetak.cpp:56:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&x);
   ~~~~~^~~~~~~~~

• Subtask 1: 64 / 160