always_4ever_5_25__21_SS's blog

327B — Hungry Sequence

By always_4ever_5_25__21_SS, history, 9 years ago, In English

OK, so i didn't get what the tutorial of that really meant, and that tutorial looked long..-_-

Fortunately, I found a better solution. And my solution is mainly like 2 lines!!! :p I think it's better if you see the code rather than me trying to explain it.....

include<bits/stdc++.h>

using namespace std;

int main(){ int n, i; cin>>n; for(i=0;i<n;i++)cout<<i+n*10<<" "; return 0; }

For any question or suggestion, feel free!!!

  • Vote: I like it
  • -14
  • Vote: I do not like it

Comments Comments (6)
| Write comment?
»
9 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by always_4ever_5_25__21_SS (previous revision, new revision, compare).

→ Reply
»
9 years ago, # |
  Vote: I like it 0 Vote: I do not like it

To be very simple You just have to print N Prime Numbers less than 10^7 .

→ Reply
»
9 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Do you seriously concatenate every line and believe that you have written only one line of code? :-/

→ Reply
»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it 
void solve()
{
    int n;cin>>n;
    for(int i=1e6-n;i<1e6;i++)
        cout<<i<<" ";
}

And that's My idea for It...

→ Reply