#include <iostream>
#include <stdio.h>
#include <iomanip>
#include <math.h>
using namespace std;
const int N = 1e6 + 10;
const int INF = 0x3f3f3f3f;
int main()
{
	int n;
	cin >> n;
	printf( "%d\n%d\n%d\n%d" , 1 , 1 , 1 , n-3 );
	return 0;
}

#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n;

    cin >> n;

    cout << 1 << endl << 1 << endl << 1 << endl << n - 3;

    return 0;
}

#include<bits/stdc++.h> #include<algorithm> #include<iostream> #include<string.h> #include<stdio.h> #include<iomanip> #include<cstring> #include<math.h> #include<vector> #include<queue> #include<stack> #include<cstdio> #include<cmath> using namespace std; #define LL long long using namespace std; const int N = 1e5 + 10; const int INF = 0x3f3f3f3f; int n; int main() { cin >> n; printf( "%d\n%d\n%d\n%d" , 1 , 1 , 1 , n-3 ); return 0; }

#include <iostream>
#include <bits/stdc++.h>
using namespace std;
const int N=1e7+10;
const int INF=0x3f3f3f3f;
int main()
{
	int n;
	cin>>n;
	cout<<n-6<<" 2 3 1";
}

我好奇一下，题解是怎么判断的？if吗

#include <iostream>
#include <stack>
#include <cmath>
#include <vector>
#include <string.h>
#include <queue>
#include <stdio.h>
#include <iomanip>
#include <cstdio>
#include <algorithm>
#define int long long
using namespace std;
const int N = 1e5 + 10;
const int INF = 0x3f3f3f3f;
signed main()
{
	int n;
	cin >> n;
	cout << "1" << endl << "1" << endl << "1" << endl << "1" << endl << n - 4 << endl;
	return 0;
}

没想到吧

#include<bits/stdc++.h>

#include <queue>

#include <math.h>

#include <stack>

#include <stdio.h>

#include <iostream>

#include <vector>

#include <iomanip>

#include <string.h>

#include <algorithm>

using namespace std;

#define LL long long

const int N = 1e5 + 10;

const int INF = 0x3f3f3f3f;

using namespace std;

int main()

{

LL n;

cin >>n;

cout << 1 << endl;

cout << 3 << endl;

cout << 5 << endl;

cout << n - 9 << endl; }

#include <iostream> #include <cstdio> #include <cstring> #include <string> #include <iomanip> // #include <cmath> using namespace std; #define long long LL const int N = 1e6+6; const int INF = 0x3f3f3f3f; const int KFC=j8jl; int x1,y1,x2,y2; int ans(int x){ if (x > 0) return x; else return 0 - x; } int manhaton(int a1,int b1,int a2,int b2){ return ans(a1 - a2) + ans(b1 - b2); } int main(){ cin >> x1 >> y1 >> x2 >> y2; cout << manhaton(x1,y1,x2,y2); return 0; }

//用户开启了“完全隐私保护”数据丢失

//

//Oops!

//您在该域中无相应权限 (62fe0a5fda6816364e40ace0)。

//

//技术信息:

//

//类型:

//

//参数:

//

//1.62fe0a5fda6816364e40ace0

//Oops!

//您还没有参加本次比赛。

//

//技术信息:

//

//类型:

//

//参数:

//

//1.system

//2.62e3fcb3eeded82bd76c09d2

/******************************************************

注释 ：

*******************************************************/

#include<bits/stdc++.h>

#include <queue>

#include <math.h>

#include <stack>

#include <stdio.h>

#include <iostream>

#include <vector>

#include <iomanip>

#include <string.h>

#include <algorithm>

using namespace std;

#define LL long long

const int N = 1e5 + 10;

const int INF = 0x3f3f3f3f;

using namespace std;

int main()

{

LL n;

cin >>n;

cout << 1 << endl;

cout << 3 << endl;

cout << 5 << endl;

cout << n - 9 << endl;

}

#include<stdio.h> #include<iostream> using namespace std; int main() { int n; cin>>n; int a=n%10; int b=n/10%1010; int c=n/100%10100; int d=n/1000*1000; cout<<a<<endl; cout<<b<<endl; cout<<c<<endl; cout<<d<<endl; }