#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define x first
#define y second
#define pii pair<int, int>dazaq
#define p3i pair<pii, int>
#define pll pair<ll, ll>
#define p3l pair<pll, ll>
#define lseg L, (L+R)/2, N*2+1
#define rseg (L+R)/2+1, R, N*2+2
#define ub upper_bound
#define lb lower_bound
#define pq priority_queue
#define MN 1000000007
#define fox(k, x) for (int k=0; k<x; ++k)
#define fox1(k, x) for (int k=1; k<=x; ++k)
#define foxr(k, x) for (int k=x-1; k>=0; --k)
#define fox1r(k, x) for (int k=x; k>0; --k)
#define ms multiset
#define flood(x) memset(x, 0x3f3f3f3f, sizeof x)
#define drain(x) memset(x, 0, sizeof x)
#define rng() ((rand() << 14)+rand())
#define scan(X) do{while((X=getchar())<'0'); for(X-='0'; '0'<=(_=getchar()); X=(X<<3)+(X<<1)+_-'0');}while(0)
char _;
#define pi 3.14159265358979323846
int n, m, a, b;
bool adj[3005][3005], u[3005];
int main(){
scan(n); scan(m);
fox(l, m){
scan(a); scan(b);
adj[a][b]=adj[b][a]=1;
}
fox1(l, n){
if (u[l]) continue;
for(int l2=l+1; l2<n){
if (u[l2]) continue;
if (!adj[l][l2]){
u[l]=1; u[l2]=1;
//cout << l << ' ' << l2 << endl;
break;
}
}
}
int c=0;
fox1(l, n){
if (u[l]) continue;
c++;
printf("%i ", l);
if (c==n/3) break;
}
return 0;
}
Compilation message
imp.cpp: In function 'int main()':
imp.cpp:40:29: error: expected ';' before ')' token
for(int l2=l+1; l2<n){
^
