62 条题解

  • 1
    @ 2025-11-22 9:37:06 
    #include<bits/stdc++.h>
using namespace std;
const int N=1e3+10;
int Accepted(int a,int b){//Accepted()
	return a+b; 
}
int main()
{
	int a,b;
	cin >> a >> b;
	cout << Accepted(a,b);
	return 0;
}
//老登布置的作业系列
    • 0
      @ 2026-7-20 19:30:49 
      #include <bits/stdc++.h>
using namespace std;
int n , a , g , s , b , ans;
int main()
{
    cin >> n;
    for ( int i = 1; i <= n; i++ )
    {
    	cin >> a;
    	b = a / 100;
    	s = a % 100 / 10;
    	g = a % 10;
    	if( b == s && b == g)
    	{
//    		break;
    		continue;
		}
    	
    	if ( b == s || b == g || s == g )
    	{
    		ans++;
		}
	}
	cout << ans;
	return 0;
}
      • 0
        @ 2026-7-20 19:15:41 
        #include <bits/stdc++.h>
using namespace std;
int n , a , b , c , s , j , ans;
int main()
{
    cin >> n;
    for ( int i = 1; i <= n; i++ )
    {
        cin >> a >> b >> c;
        s = a + b + c;
        if (j < s )
        {
        	ans++;
		}
        j = s;   
	} 
	cout << ans - 1;
	return 0;
}
        • 0
          @ 2026-7-20 19:02:55 
          #include <bits/stdc++.h>
using namespace std;
int n , a , b , c , d;
int main()
{
    cin >> n;
    for ( int i = 1; i <= n; i++ )
    {
    	cin >> a >> b >> c >> d;
    	//2 40  2 50
    	if ( d - b >= 0 )
    	{
    		cout << c - a << " " << d - b << endl;
		}
		else
		{
			cout << c - 1 - a << " " << d + 60 - b << endl;
		}
	}
	return 0;
}
          • 0
            @ 2026-7-20 18:50:53 
            #include <bits/stdc++.h>
using namespace std;
int n , a , sum;
int main()
{
    cin >> n;
    for ( int i = 1; i <= n; i++ )
    {
        cin >> a;
		sum = sum + a; 
	}
	if ( sum % n < sum / n )
	{
		cout << sum / n - 1 << endl << sum % n + n;
	}
	else
	{
		cout << sum / n << endl << sum % n;
	}
	return 0;
}
            • 0
              @ 2026-7-20 18:31:00 
              #include <bits/stdc++.h>
using namespace std;
int n , a , s , f , j;
int main()
{
    cin >> n;
    for ( int i = 1; i <= n; i++ )
    {
    	cin >> a;//12345
    	s = s + a / 100;
    	f = f + a % 100 / 10 ;
    	j = j + a % 10;
	}
	cout << s << endl << f << endl << j << endl;
	return 0;
}
              • 0
                @ 2026-7-20 18:03:23 
                #include <bits/stdc++.h>
using namespace std;
int k,sum;
int main()
{
	cin >> k;
    for ( int i = 10000; i <= 30000; i++ )
    {
    	int sub1 = i / 100;
    	int sub2 = i / 10 % 1000;
    	int sub3 = i % 1000;
    	if ( sub1 % k == 0 && sub2 % k == 0 && sub3 % k == 0 )
    	{
    		sum++;
    		cout << i << endl;
		}
	}
	if ( sum == 0 )
	{
		cout << "No";
	}
	return 0;
}
                • 0
                  @ 2026-7-20 17:29:24 
                  #include <bits/stdc++.h>
using namespace std;
int n;
int main()
{
    cin >> n;
	for ( int i = 1; i <= n; i++ )
	{
		if ( i % 10 == 8 )
		{
			cout << i << " "  << 2 * i << " " << 4 * i << endl;
		}		
	}
	return 0;
}
                  • 0
                    @ 2026-6-24 11:55:14 
                    #include<bits/stdc++.h>
using namespace std;
int main(){//头文件
	int a,b;//创建变量
	cin>>a>>b;//输入
	cout<<a+b;//输出
	return 0;
}
                    • 0
                      @ 2025-11-8 9:43:09 
                      #include<bits/stdc++.h>

using namespace std;
int main()
{
	string a1,b1;
	int a[10000]={},b[10000]={},c[10000]={};
	cin >> a1 >> b1;
	int lena=a1.size();
	int lenb=b1.size();
	for(int i=1;i<=lena;i++)
	{
		a[i]=a1[lena-i]-'0';
	} 
	for(int i=1;i<=lenb;i++)
	{
		b[i]=b1[lenb-i]-'0';
	}  
	int lenc=1;
	while(lenc<=lena||lenc<=lenb)
	{
		c[lenc]+=a[lenc]+b[lenc];
		if(c[lenc]>9)
		{
			c[lenc]-=10;
			c[lenc+1]++; 
		}
		lenc++;
	} 
	if(c[lenc]==0)
	{
		lenc--;
	}
	for(int i=lenc;i>=1;i--)
	{
		cout << c[i];
	}
	return 0;
}
                      • 0
                        @ 2025-10-25 9:33:33 
                        #include<bits/stdc++.h>
using namespace std;
const int N=1e3+10;
int a,b;
int main()
{
	cin >> a >> b;
	cout << a+b;
	return 0;
}
                        • 0
                          @ 2024-7-26 10:58:29

                          A+B Problem题解

                          新用户强烈建议阅读此帖

                          首先我们要理清思路

                          1.需要用到什么样的头文件？

                          2.用什么样的数据范围？

                          3.思路是什么？

                          首先题目中的数据范围是1≤a,b≤10^6, 而int 的范围是-2147483648-2147483647 正合题意，所以数据类型可以用int

                          话不多说，直接上代码

                          #include<iostream>//导入头文件，iostream里面是标准输入输出流（我说的什么？） 
using namespace std;//使用标准命名空间 
int main(){//主函数，程序的入口 
	int a,b;//创建a,b两个整型变量 
	cin>>a>>b;//输入 a , b 两个变量 
	cout<<a+b; //输出a+b的内容 
	return 0; 
}

                          本蒟蒻发的第一篇题解，请多多支持喵~~

                          • -1
                            @ 2026-6-28 11:32:18

                            #include<bits/stdc++.h> using namespace std; #define int long long const int N=1e6+5; int n,num[N],a[N],c[N],sum,ans; signed main(){ cin>>n; setst; for(int i=1;i<=n;i++){ cin>>a[i]; num[a[i]]++; st.insert(a[i]); }sum=st.size(); for(int i=n;i>=1;i--){ if(c[a[i]]&&a[i]!=a[i-1]&&i!=1){ ans+=sum-1; //cout<<i<<endl; }num[a[i]]--; if(!num[a[i]])sum--; if(!c[a[i]])c[a[i]]++; }cout<<ans; return 0; }

                            • -1
                              @ 2026-4-15 13:26:15 
                              #include<stdio.h>
int main(){
    int a,b;
    scanf("%d%d",&a,&b);
    printf("%d",a+b);
}
                              • -1
                                @ 2026-2-2 12:28:28 
                                #include<bits/stdc++.h>
using namespace std;

const int N=1e5+5;

int n , m , a[N];
int u , v;
vector<int> vc[N];
int dfn[N] , low[N] , cnt;
bool vis[N];
stack<int> st;
int belong_cnt; //强连通分量个数 
vector<int> belong[N];//强连通分量 
int color[N];//color[i]表示第i头牛所处的强连通分量  
vector<int> newvc[N];
int in[N];//入度 
int ans[N];
void tarjan(int u)
{
	dfn[u] = low[u] = ++cnt;
	vis[u] = 1;
	st.push(u);
	for(int i = 0; i < vc[u].size(); i++)
	{
		int v = vc[u][i];
		if(!dfn[v])
		{
			tarjan(v);
			low[u] = min(low[u] , low[v]);
		}
		else if(vis[v])
		{
			low[u] = min(low[u] , low[v]);
		}	
	}
	//强连通分量到头	
	if(dfn[u] == low[u])
	{
		while(!st.empty())
		{
			v = st.top();
			st.pop();
			vis[v] = 0;
			color[v] = u;//当前牛所处的强连通分量 
			if(u == v) break;
			a[u] += a[v];
		}
	}
}

void tupo()
{
	queue<int> q;
	for(int i = 1; i <= n; i++)
	{
		if(color[i] == i && !in[i])
		{
			q.push(i);
			ans[i] = a[i];
		}
	}
	
	while(!q.empty())
	{
		int top = q.front();
		q.pop();
		
		for(int i = 0; i < newvc[top].size(); i++)
		{
			v = newvc[top][i];
			ans[v] = max(ans[v] , ans[top] + a[v]);
			in[v]--;
			if(!in[v])
				q.push(v);
		}
	}
	
	int maxx = 0;
	for(int i = 1; i <= n; i++)
		maxx = max(maxx , ans[i]);
	cout << maxx;
}

int main(){
	cin >> n >> m;
	for(int i = 1; i <= n; i++)
		cin >> a[i];
	while( m-- )
	{
		cin >> u >> v;
		vc[u].push_back(v); 
	}
	for(int i = 1; i <= n; i++)
		if(!dfn[i])
			tarjan(i);
	
	//重新建边
	for(int i = 1; i <= n; i++)
	{
		for(int j = 0; j < vc[i].size(); j++)
		{
			v = vc[i][j];
			if(color[i] != color[v])
			{
				newvc[color[i]].push_back(color[v]);
				in[color[v]]++; 
			}	
		}	
	} 
	
	tupo();
	
	return 0;
                                • @ 2026-5-31 17:30:55

                                  老师，最后的括号没了 应该在“return 0”下边的

                              • -1
                                @ 2025-12-14 12:27:47 
                                #include <iostream>
using namespace std;
int main()
{
	int a,b;
	cin>>a>>b;
	cout<<a+b;
	return 0;
}
                                • -2
                                  @ 2026-6-5 20:32:18

                                  //这是游戏 #include #include <windows.h> #include <conio.h> #include #include using namespace std;

                                  const int WIDTH = 40; const int HEIGHT = 20;

                                  // 蛇身体（最多100节） int snakeX[100]; int snakeY[100]; int len = 3; // 初始长度 int dir = 77; // 初始方向：右

                                  int coinX, coinY; int score = 0; bool exitGame = false;

                                  // 隐藏光标 void HideCursor() { HANDLE h = GetStdHandle(STD_OUTPUT_HANDLE); CONSOLE_CURSOR_INFO ci = {1, FALSE}; SetConsoleCursorInfo(h, &ci); }

                                  // 定位光标 void GotoXY(int x, int y) { COORD pos = {(SHORT)x, (SHORT)y}; SetConsoleCursorPosition(GetStdHandle(STD_OUTPUT_HANDLE), pos); }

                                  // 设置颜色：红色蛇，黄色金币 void SetColor(int color) { SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), color); }

                                  // 生成金币 void NewCoin() { coinX = rand() % (WIDTH - 2) + 1; coinY = rand() % (HEIGHT - 2) + 1; }

                                  // 初始化蛇 void InitSnake() { len = 3; snakeX[0] = WIDTH / 2; snakeY[0] = HEIGHT / 2; snakeX[1] = snakeX[0] - 1; snakeY[1] = snakeY[0]; snakeX[2] = snakeX[0] - 2; snakeY[2] = snakeY[0]; }

                                  // 绘制整个画面 void Draw() { GotoXY(0, 0);

                                  // 上边框
for (int i = 0; i < WIDTH; i++) cout << "-";
cout << endl;

for (int y = 1; y < HEIGHT; y++) {
    cout << "|";
    for (int x = 1; x < WIDTH - 1; x++) {

        bool isSnake = false;
        // 画蛇头
        if (x == snakeX[0] && y == snakeY[0]) {
            SetColor(12); // 亮红
            cout << "O";
            isSnake = true;
        }
        // 画蛇身
        for (int i = 1; i < len; i++) {
            if (x == snakeX[i] && y == snakeY[i]) {
                SetColor(10); // 绿色
                cout << "o";
                isSnake = true;
            }
        }
        // 画金币
        if (x == coinX && y == coinY) {
            SetColor(14); // 黄色
            cout << "$";
            isSnake = true;
        }
        // 空白
        if (!isSnake) {
            SetColor(7); // 白色
            cout << " ";
        }
    }
    SetColor(7);
    cout << "|\n";
}

// 下边框
for (int i = 0; i < WIDTH; i++) cout << "-";
cout << "\n得分：" << score << "    ↑↓←→移动  ESC退出";

                                  }

                                  // 按键控制方向 void KeyControl() { if (_kbhit()) { int key = _getch(); if (key == 27) exitGame = true;

                                      if (key == 224) {
        key = _getch();
        // 防止180度掉头
        if (!((key == 72 && dir == 80) || (key == 80 && dir == 72) ||
              (key == 75 && dir == 77) || (key == 77 && dir == 75))) {
            dir = key;
        }
    }
}

                                  }

                                  // 蛇移动 void MoveSnake() { // 身体跟着头走 for (int i = len - 1; i > 0; i--) { snakeX[i] = snakeX[i - 1]; snakeY[i] = snakeY[i - 1]; }

                                  // 移动头
switch (dir) {
    case 72: snakeY[0]--; break; // 上
    case 80: snakeY[0]++; break; // 下
    case 75: snakeX[0]--; break; // 左
    case 77: snakeX[0]++; break; // 右
}

// 撞墙死亡
if (snakeX[0] <= 0 || snakeX[0] >= WIDTH - 1 || snakeY[0] <= 0 || snakeY[0] >= HEIGHT - 1)
    exitGame = true;

                                  }

                                  // 吃金币 + 变长 void EatCoin() { if (snakeX[0] == coinX && snakeY[0] == coinY) { score += 10; len++; // 身体变长 NewCoin(); // 新金币 } }

                                  int main() { HideCursor(); srand((unsigned)time(NULL)); InitSnake(); NewCoin();

                                  while (!exitGame) {
    Draw();
    KeyControl();
    MoveSnake();
    EatCoin();
    Sleep(120); // 速度
}

system("cls");
cout << "游戏结束！最终得分：" << score << endl;
return 0;

                                  }

                                  • -2
                                    @ 2026-5-29 13:50:47 
                                    var a, b: longint;
begin
    readln(a,b);
    writeln(a+b);
end.
                                    • -2
                                      @ 2026-5-29 13:48:27 
                                      import java.io.*;
import java.util.*;
public class Main {
    public static void main(String args[]) throws Exception {
        Scanner cin=new Scanner(System.in);
        int a = cin.nextInt(), b = cin.nextInt();
        System.out.println(a+b);
    }
}
                                      • -2
                                        @ 2026-5-15 17:25:00

                                        #include <bits/stdc++.h> using namespace std; int main(){ int a; int b; cin>>a>>b; cout<<a+b; return 0; }

                                        A + B Problem

                                        信息

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