72 条题解

  • -3
    @ 2026-4-8 19:18:42
    
    ```#include <bits/stdc++.h>
    using namespace std;
    int main(){
      int a,b,s;
      cin>>a>>b;
      s=a+b;
      cout<<s;
      return 0;
    }
    • -3
      @ 2026-4-7 13:02:50

      #include using namespace std; int main() { int a,b; cin>>a>>b; cout<<a+b; return 0; }

      • -3
        @ 2025-10-25 9:34:12
        #include<iostream>
        using namespace std;
        int main(){
            int a,b;
            cin>>a>>b;
            cout<<a+b;
        return 0;
        }
        
        • -3
          @ 2025-2-21 19:53:22

          最短题解

          #include<iostream>
          int a,b;int main(){std::cin>>a>>b;std::cout<<a+b;}
          
          • -3
            @ 2025-1-23 11:13:08
            #include<iostream>
            using namespace std;
            int main()
            {
            	int a,b;
            	cin>>a>>b;
            	cout<<a+b;
            }
            
            • -3
              @ 2024-11-16 16:21:16
              #include<iostream>
              using namespace std;
              int main(){
              	int a,b,c;
              	cin>>a>>b;
              	c=a+b;
              	cout<<c;
              }
              
              • -4
                @ 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”下边的

              • -4
                @ 2025-12-30 22:23:26
                #include<iostream>
                using namespace std;
                int a,b;
                int main ( ) {
                    cin>>a>>b;
                    cout<<a+b;
                }
                
                • -4
                  @ 2025-12-28 18:10:49

                  #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; }

                  • -4
                    @ 2025-12-21 20:11:01

                    #include using namespace std; int main() { int a,b; cin>>a>>b; cout<<a+b; }

                    • -4
                      @ 2025-12-21 20:09:08

                      #include using namespace std; int main() { int a,b; cin>>a>>b; cout<<a+b;

                      }

                      • -4
                        @ 2025-12-13 19:56:30

                        #include using namespace std; int main() { int a , b;

                        cin>>a>>b;
                        
                        cout<<a+b;
                        
                        return 0;	
                        

                        }

                        • -4
                          @ 2025-11-22 9:41:59
                          #include<iostream>
                          using amespace std;
                          int vera(int x,int y){
                          	return x+y;
                          }
                          int main(){
                          	int a=1,b=2;
                          	cout<<vera(a,b);
                          	return 0;
                          }
                          
                          
                          • -4
                            @ 2025-7-23 22:55:34
                            #include<bits/stdc++.h>
                            /*使用iostream库
                            导入cin和cout函数*/
                            using namespace std;
                            /*获取命名空间*/
                            int main(){//主函数
                                int a,b;//定义整数变量
                                cin>>a>>b;//输入数据
                                cout<<a+b<<endl;//计算并输出数据
                            
                                return 0;//结束主函数
                            }
                            
                            • -4
                              @ 2025-7-7 11:38:39
                              #include<bits/stdc++.h>
                              using namespace std;
                              int main(){
                              	long long a,b;
                              	cin>>a>>b;
                              	cout<<a+b;
                              }
                              
                              
                              • -5
                                @ 2026-1-31 8:59:47

                                1行。

                                int main() { int a,b; __builtin_scanf("%d%d",&a,&b); __builtin_prinf("%d",a+b);
                                
                                • -5
                                  @ 2025-11-22 9:39:27

                                  #include<bits/stdc++.h> using namespace std; const int N=1e3+10; int fx(int x,int y){ return x+y; } int main() { int a=1,b=2; cin>>a>>b; cout<<fx(a,b); return 0; }

                                • -5
                                  @ 2025-11-22 9:38:05

                                  #include<bits/stdc++.h> using namespace std; const int N=1e3+10; int fx(int x,int y){ return x+y; } int main() { int a=1,b=2; cin>>a>>b; cout<<fx(a,b); return 0; }

                                  • -5
                                    @ 2025-11-9 19:01:11

                                    #include <stdio.h> #include using namespace std; int main() { int a,b; cin >> a >> b; cout << a+b << endl; }

                                    • -5
                                      @ 2025-8-18 11:23:58

                                      谁不会这道题??

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

                                      其实是我不会

                                      禁止发疯!!!

                                      信息

                                      ID
                                      1
                                      时间
                                      1000ms
                                      内存
                                      128MiB
                                      难度
                                      1
                                      标签
                                      递交数
                                      5396
                                      已通过
                                      1527
                                      上传者