33 条题解

  • 1
    @ 2025-12-14 20:20:18 
    #include<iostream>
#include<cstdio>
#include<cctype>
#include<string.h>
#include<math.h>
#include<cmath>
#include<algorithm>
#include<iomanip>
using namespace std;
int main()
{
	int n;
	cin>>n;
	if(n>0)
	{
		cout<<"positive";	
	} 
	else if(n==0)
	{
		cout<<"zero";
	}
	else if(n<0)
	{
		cout<<"negative";
	}
	return 0;
}
    • 1
      @ 2025-8-14 16:09:53

      其实头文件没必要那么多~逻辑清晰即可。

      #include <iostream>
using namespace std;
int main()
{
	int n;
	cin >> n;
	if (n > 0)
		cout << "positive";
	if(n==0)
		cout << "zero";
	if(n<0)
		cout << "negative";
	
    return 0;
}
      • 0
        @ 2026-4-26 21:30:32

        #include #include #include #include<string.h> #include<math.h> #include #include #include using namespace std; int main() { int n; cin>>n; if(n>0) { cout<<"positive"; } else if(n==0) { cout<<"zero"; } else if(n<0) { cout<<"negative"; } return 0; }

        • 0
          @ 2026-3-29 19:44:23

          #include #include #include #include<string.h> #include<math.h> #include #include #include using namespace std; int main() { int n; cin>>n; if(n>0) { cout<<"positive"; } else if(n==0) { cout<<"zero"; } else if(n<0) { cout<<"negative"; } return 0; }

          • 0
            @ 2025-5-24 20:15:29

            某题解师题解（引用，无恶意）：

            #pragma GCC optimize(3)
#pragma GCC target("avx")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-fwhole-program")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-fschedule-insns")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("-ftree-tail-merge")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-fstrict-aliasing")
#pragma GCC optimize("-fstrict-overflow")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-fcse-skip-blocks")
#pragma GCC optimize("-fcse-follow-jumps")
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-fpartial-inlining")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("-freorder-functions")
#pragma GCC optimize("-findirect-inlining")
#pragma GCC optimize("-fhoist-adjacent-loads")
#pragma GCC optimize("-frerun-cse-after-loop")
#pragma GCC optimize("inline-small-functions")
#pragma GCC optimize("-finline-small-functions")
#pragma GCC optimize("-ftree-switch-conversion")
#pragma GCC optimize("-foptimize-sibling-calls")
#pragma GCC optimize("-fexpensive-optimizations")
#pragma GCC optimize("-funsafe-loop-optimizations")
#pragma GCC optimize("inline-functions-called-once")
#pragma GCC optimize("-fdelete-null-pointer-checks")
#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 int long long
const int N = 1e5 + 10;
const int INF = 0x3f3f3f3f;
int n;
signed main() {
	scanf("%lld ", &n);
	if(n){//判断n是否不为0 
		if(n > 0)//判断n是否为整数 
			puts("positive");//字符串专属输出方式 
		else
			puts("negative"); 
	}
	else
		puts("zero"); 
	return 0;
}\\ 邓梓昊题解

            我有点想笑。， 有点小题大作（主观感受

            思路： 可改为：

            #include<bits/stdc++.h>
using namespace std;
int n;
signed main() {
	scanf("%lld ", &n);
	if(n){//判断n是否不为0 
		if(n > 0)//判断n是否为整数 
			puts("positive");//字符串专属输出方式 
		else
			puts("negative"); 
	}
	else
		puts("zero"); 
	return 0;
}

            或改为：

            #include <stdio.h>
#define int long long
int n;
signed main() {
	scanf("%lld ", &n);
	if(n){
		if(n > 0)
			puts("positive");
		else
			puts("negative"); 
	}
	else
		puts("zero"); 
	return 0;
}
            • @ 2025-5-24 20:19:44

              题解师已更新纯享版，谢谢采纳！！

          • 0
            @ 2025-4-1 21:09:46

            #include<stdio.h>

            #include

            using namespace std;

            int main()

            {

            int a;

cin>>a;

if(a==0)
{

	cout<<"zero";

}

else if(a>0)

{

	cout<<"positive"; 

}

else

{

	cout<<"negative";

}

            }

            • 0
              @ 2024-11-20 13:32:33 
              #pragma GCC optimize(3)
#pragma GCC target("avx")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-fwhole-program")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-fschedule-insns")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("-ftree-tail-merge")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-fstrict-aliasing")
#pragma GCC optimize("-fstrict-overflow")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-fcse-skip-blocks")
#pragma GCC optimize("-fcse-follow-jumps")
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-fpartial-inlining")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("-freorder-functions")
#pragma GCC optimize("-findirect-inlining")
#pragma GCC optimize("-fhoist-adjacent-loads")
#pragma GCC optimize("-frerun-cse-after-loop")
#pragma GCC optimize("inline-small-functions")
#pragma GCC optimize("-finline-small-functions")
#pragma GCC optimize("-ftree-switch-conversion")
#pragma GCC optimize("-foptimize-sibling-calls")
#pragma GCC optimize("-fexpensive-optimizations")
#pragma GCC optimize("-funsafe-loop-optimizations")
#pragma GCC optimize("inline-functions-called-once")
#pragma GCC optimize("-fdelete-null-pointer-checks")
#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 int long long
const int N = 1e5 + 10;
const int INF = 0x3f3f3f3f;
int n;
signed main() {
	scanf("%lld ", &n);
	if(n){//判断n是否不为0 
		if(n > 0)//判断n是否为整数 
			puts("positive");//字符串专属输出方式 
		else
			puts("negative"); 
	}
	else
		puts("zero"); 
	return 0;
}

              纯享版：

              #include <stdio.h>
#define int long long
int n;
signed main() {
	scanf("%lld ", &n);
	if(n){
		if(n > 0)
			puts("positive");
		else
			puts("negative"); 
	}
	else
		puts("zero"); 
	return 0;
}
              • 0
                @ 2024-4-12 19:55:26 
                #include <iostream>
#include <stdio.h>
#include <iomanip>
#include <math.h>
using namespace std;
int main()
{
	int N;
	cin>>N;
	if(N>0) {
		cout<<"positive";
	}
	if(N==0){
		cout<<"zero";
	}
	if(N<0){
		cout<<"negative";
	}
	return 0;
}
                • 0
                  @ 2023-6-3 12:21:48 
                  #include <bits/stdc++.h>
using namespace std;int main(){int n;cin >> n;if (n == 0){cout << "zero";}else if (n < 0){cout << "negative";}else{cout << "positive";}return 0;}
                  • 0
                    @ 2023-1-26 16:23:08 
                    #include <bits/stdc++.h>
using namespace std;
int main(){
    int n;
    cin >> n;
    if (n == 0){
        cout << "zero";
    }else if (n < 0){
        cout << "negative";
    }else{
        cout << "positive";
	}
    return 0;
}
                    • -1
                      @ 2024-4-12 20:08:39

                      include #include <stdio.h> #include #include <math.h> using namespace std; int main() { int N; cin>>N; if(N>0) { cout<<"positive"; } if(N==0){ cout<<"zero"; } if(N<0){ cout<<"negative"; } return 0; }

                      • -1
                        @ 2024-4-12 20:07:31

                        #include #include <stdio.h> #include #include <math.h> using namespace std; int main() { int N; cin>>N; if(N>0) { cout<<"positive"; } if(N==0){ cout<<"zero"; } if(N<0){ cout<<"negative"; } return 0; }

                        • @ 2024-4-12 20:14:13

                          更多的孤独感客服电话发动机回头看了九月七日jog发挥当前而几乎欧安

                      • -1
                        @ 2024-4-12 20:07:28

                        #include #include <stdio.h> #include #include <math.h> using namespace std; int main() { int N; cin>>N; if(N>0) { cout<<"positive"; } if(N==0){ cout<<"zero"; } if(N<0){ cout<<"negative"; } return 0; }

                        • -1
                          @ 2024-4-12 20:07:24

                          #include #include <stdio.h> #include #include <math.h> using namespace std; int main() { int N; cin>>N; if(N>0) { cout<<"positive"; } if(N==0){ cout<<"zero"; } if(N<0){ cout<<"negative"; } return 0; }

                          • -1
                            @ 2024-4-12 20:07:19

                            #include #include <stdio.h> #include #include <math.h> using namespace std; int main() { int N; cin>>N; if(N>0) { cout<<"positive"; } if(N==0){ cout<<"zero"; } if(N<0){ cout<<"negative"; } return 0; }

                            • -1
                              @ 2024-4-12 20:07:15

                              #include #include <stdio.h> #include #include <math.h> using namespace std; int main() { int N; cin>>N; if(N>0) { cout<<"positive"; } if(N==0){ cout<<"zero"; } if(N<0){ cout<<"negative"; } return 0; }

                              • -1
                                @ 2024-4-12 20:07:12

                                #include #include <stdio.h> #include #include <math.h> using namespace std; int main() { int N; cin>>N; if(N>0) { cout<<"positive"; } if(N==0){ cout<<"zero"; } if(N<0){ cout<<"negative"; } return 0; }

                                • -1
                                  @ 2024-4-12 20:07:08

                                  #include #include <stdio.h> #include #include <math.h> using namespace std; int main() { int N; cin>>N; if(N>0) { cout<<"positive"; } if(N==0){ cout<<"zero"; } if(N<0){ cout<<"negative"; } return 0; }

                                  • -1
                                    @ 2024-4-12 20:07:05

                                    #include #include <stdio.h> #include #include <math.h> using namespace std; int main() { int N; cin>>N; if(N>0) { cout<<"positive"; } if(N==0){ cout<<"zero"; } if(N<0){ cout<<"negative"; } return 0; }

                                    • -1
                                      @ 2024-4-12 20:07:04 
                                      include <iostream>
#include <stdio.h>
#include <iomanip>
#include <math.h>
using namespace std;
int main()
{
	int N;
	cin>>N;
	if(N>0) {
		cout<<"positive";
	}
	if(N==0){
		cout<<"zero";
	}
	if(N<0){
		cout<<"negative";
	}
	return 0;

                                      判断数正负

                                      信息

                                      ID
                                      868
                                      时间
                                      1000ms
                                      内存
                                      128MiB
                                      难度
                                      4
                                      标签
                                      递交数
                                      988
                                      已通过
                                      469
                                      上传者
                                      1. Language
                                      2. 兼容模式
                                      3. 主题
                                      3. Worker 0, 38ms
                                      4. Powered by Hydro v5.0.0-beta.8 Community