Submission #6145997


Source Code Expand

#include<bits/stdc++.h>//万能头 
using namespace std;
int a[10000001];//注意数组开大点,坑了我几个点 
inline int read(){//快速读入,比scanf和cin都要快 
    int X=0,w=0; char ch=0;
    while(!isdigit(ch)) {w|=ch=='-';ch=getchar();}
    while(isdigit(ch)) X=(X<<3)+(X<<1)+(ch^48),ch=getchar();
    return w?-X:X;
}
inline void write(int x){//快写,比cout和printf也要快 
     if(x<0) putchar('-'),x=-x;
     if(x>9) write(x/10);
     putchar(x%10+'0');
}
int main(){
    int n=read()/*读入n*/,s=0;
    for(int i=1;i<=n;i++){
        a[i]=i;//将i储存在a数组中 
        s+=i;//将1~n加起来 
        if(s>n)//如果和大于n,就代表要找的数字已经到齐了 ,break 
        break;
    }
    int t=s-n;//将和与n的差算出 
    for(int i=1;i<=n;i++){
        if(a[i]){//以防没有读入的数组变量,相当于a[i]!=0 
            if(a[i]!=t){//在a数组中将t删去  ,剩下的数的和刚好等于n 
                write(a[i]);//输出 
                printf("\n");//AT的题要换行 
            }
        }
    }
    return 0;//养成好习惯 
}

Submission Info

Submission Time
Task B - Exactly N points
User luogu_bot2
Language C++ (GCC 5.4.1)
Score 300
Code Size 1152 Byte
Status AC
Exec Time 8 ms
Memory 256 KB

Judge Result

Set Name sample dataset1 dataset2
Score / Max Score 0 / 0 200 / 200 100 / 100
Status
AC × 3
AC × 13
AC × 24
Set Name Test Cases
sample sample-01.txt, sample-02.txt, sample-03.txt
dataset1 sample-01.txt, sample-02.txt, sample-03.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt
dataset2 sample-01.txt, sample-02.txt, sample-03.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 02-01.txt, 02-02.txt, 02-03.txt, 02-04.txt, 02-05.txt, 02-06.txt, 02-07.txt, 02-08.txt, sample-01.txt, sample-02.txt, sample-03.txt
Case Name Status Exec Time Memory
01-01.txt AC 1 ms 256 KB
01-02.txt AC 1 ms 256 KB
01-03.txt AC 1 ms 256 KB
01-04.txt AC 1 ms 256 KB
01-05.txt AC 1 ms 256 KB
01-06.txt AC 1 ms 256 KB
01-07.txt AC 1 ms 256 KB
01-08.txt AC 1 ms 256 KB
01-09.txt AC 1 ms 256 KB
01-10.txt AC 1 ms 256 KB
02-01.txt AC 8 ms 256 KB
02-02.txt AC 8 ms 256 KB
02-03.txt AC 8 ms 256 KB
02-04.txt AC 8 ms 256 KB
02-05.txt AC 8 ms 256 KB
02-06.txt AC 3 ms 256 KB
02-07.txt AC 2 ms 256 KB
02-08.txt AC 8 ms 256 KB
sample-01.txt AC 1 ms 256 KB
sample-02.txt AC 1 ms 256 KB
sample-03.txt AC 1 ms 256 KB