Anyone competing? Google Code Jam.

yea did problem a+b, was ok

i won't make it past round 1 anyway

File: 1478132388063.png (64KB, 658x901px) Image search: [Google]

64KB, 658x901px

I'm a fucking idiot. I'm struggling with letter c.

>>59794954

So does uploading a fucked up answer give you just a time penalty or does it ruin points as well

>>59796233
Time penalty only. Not that it matters in the qualification round though.

I can't get the first one...

seems like my code works though

What do I have to do to get a t-shirt?? ?

holy FUCK I want a tshirt

>>59797672
Top 1000 on Round 2.

>>59794954
a, b, c1, c2. so /g/ how smart are you?

>code
>coding
>coder
>code code code code
GOD DAMNIT I HATE THIS WORD SO FUCKING MUCH FUCK YOU GOOGLE JUST SAY PROGRAMMING YOU CUNTS

>>59798356
why are you so angry at coders, comrade?

>>59794954
>tfw to intelligent for c2

File: Capture.png (2KB, 429x28px) Image search: [Google]

2KB, 429x28px

JUST

>>59799916
> t. brainlet

>>59798959
feels bad man

File: 1488549606758.jpg (60KB, 444x794px) Image search: [Google]

60KB, 444x794px

>submit input set for pancake problem
>get it correct
>submit large input
>"Error: non ascii characters in output set"
>times out

JUST

>doing it for free

>having a Google account
Dumb goys.

>>59800958
The multiple of goy is goyim you dumb kike

>>59800994
Quiet goy. Give Google all your data.

>tfw 2 hours left on the clock but you're so tired you cant think straight
why the fuck did I start this so late

>>59794954
No point, I'm not a tranny or a woman

No. I already work for Google.

>>59802533
That explains the recent increase in corporate shilling.

Well anyways since it's nearly finished I figured I'd post my solution for the pancake problem. Is there anything inherently wrong with this?

static void Main(string[] args)
{
    var S = 1000;
    var num_cases = int.Parse(Console.ReadLine());
    bool[][] pancake_row = new bool[num_cases][];
    int[] utensil_sizes= new int[num_cases];

    for (var i = 0; i < num_cases; i++)
    {
        var line = Console.ReadLine().Split();
        pancake_row[i] = new bool[line[0].Length];

        //Fill with 'true' on each + pancake
        for (var j = 0; j < pancake_row[i].Length; j++)
            if (line[0][j] == '+') pancake_row[i][j] = true;

        utensil_sizes[i] = int.Parse(line[1]);
    }

    for (var i = 0; i < num_cases; i++)
    {
        var num_flips = GetNumFlips(S, pancake_row[i], 0, utensil_sizes[i]);
        if (num_flips >= 0)
            Console.WriteLine($"Case #{(i + 1)}: {num_flips}");
        else
            Console.WriteLine($"Case #{(i + 1)}: IMPOSSIBLE");
    }
}

public static int GetNumFlips(int limit, bool[] arr, int flips, int utensil_size)
{
    if (flips > limit) return -1;

    for (var i = 0; i < arr.Length; i++)
    {
        if (!arr[i])
        {
            // Get offsets to start flipping from
            for (var j = i; j >= 0; j--)
            {
                if (!((j + utensil_size - 1) >= arr.Length))
                {
                    for (var k = j; k < j + utensil_size; k++)
                        arr[k] = !arr[k];
                    break;
                }
            }
            return GetNumFlips(limit, arr, ++flips, utensil_size);
        }
    }
    return flips;
}

>>59802590
Intel shill here, AMD suxx.

>>59802793
>1hr 20mins remaining
Well fuck, guess there's no real point in me even working on this.

>>59802793
Yes the fact that it's in Java

>>59802793
That's not functional programming fucker

>>59802971
Low quality bait anon.

How do you do big input for A
I know you can just go through every case for A-small, but A-large is just too big.

>>59802793
tbqh looks ugly. rate mine

#include <iostream>
#include <string>
#include <algorithm>
using namespace std;

#define HAPPY '+'
#define SAD '-'
#define MAX_TRIES 1000

void flip(string &pancakes, int pos, int panSize)
{    
    for (int i = pos; i < min(panSize + pos, (signed int) pancakes.length()); i++)
    {
        pancakes[i] = pancakes[i] == HAPPY
            ? SAD : HAPPY;
    }
}

int simpleSolveStep(string &pancakes, int panSize)
{
    // Try flipping one beginning from the left.
    for (int i = 0; i < pancakes.length(); i++)
    {
        if (pancakes[i] == SAD)
            return min(i, pancakes.length() - panSize);
    }

    return -1;
}

int simpleSolve(string pancakes, int panSize)
{
    int pos;
    int tries = 0;
    while ((pos = simpleSolveStep(pancakes, panSize)) != -1)
    {
        tries++;
        flip(pancakes, pos, panSize);

        if (tries > MAX_TRIES) break;
    }

    return tries;
}

void main()
{
    int numberOfCases;
    cin >> numberOfCases;

    for (int i = 1; i <= numberOfCases; i++)
    {
        string pancakes;
        int panSize, tries;

        cin >> pancakes >> panSize;

        tries = simpleSolve(pancakes, panSize);

        if (tries > MAX_TRIES)
            cout << "Case #" << i << ": IMPOSSIBLE\n";
        else
            cout << "Case #" << i << ": " << tries << "\n";
    }
}

>>59803137
it doesn't compile.

>>59803186
Oh yeah, forgot to cast length() to signed int when I was editing. Just change line 25 to

return min(i, (int) pancakes.length() - panSize);

>>59802793
I submitted your solution.

It's wrong.

>>59803089
Same, I just gave up after attempting C because even the test input was going to take several hours for 1 number and they were expecting a response in 8 minutes on 100 numbers up to 10^18 in size.

This is why I'm glad I didn't become an autistic CS major, all the challenges are higher level math problems and they're not even fun.

>>59803239
bruh

>>59803248
What did you become then?

>>59803248
Sounds like a memoisation problem.

>>59803263
A faggot

>>59803219
||=== Build: Debug in csa (compiler: GNU GCC Compiler) ===|
D:\fewfagd\csa\main.cpp||In function 'int simpleSolveStep(std::__cxx11::string&, int)':|
D:\fewfagd\csa\main.cpp|23|warning: comparison between signed and unsigned integer expressions [-Wsign-compare]|
D:\fewfagd\csa\main.cpp|47|error: '::main' must return 'int'|
||=== Build failed: 1 error(s), 1 warning(s) (0 minute(s), 2 second(s)) ===|

>>59794954
Damn. This actually looks interesting. Wish I knew about it sooner.

>>59803347
you can still do the problems without entering, they are public

>>59803274
oh....

>>59803299
Well yeah, forgot main has to explicitly return an int in cpp. My compiler didn't yell at me though

>>59803374
But then I can't win the t-shirt so fuck that

>>59803273
I don't see how memoization could help for this.

File: 1486516483613.gif (803KB, 640x360px) Image search: [Google]

803KB, 640x360px

>>59803248
>write up solution for c-short
>works well
>try short-2
>runtime is approximately two eons because I forgot they were going to give me fuckhuge numbers
I stopped bothering after that. I figured out how to do it fairly efficiently, but the fact that it works without having to explicitly follow their ruleset for determining the next empty cell made me feel like I got tricked.

What problems are they asking?

>>59803481
Sum all the primes under two million.

>>59803248
C is easy
you only have to solve the binary of the number of people
and it can be proved thaat there are only 2 possible size for every level of spaces (power of 2s) between people
So by finding number of people in toilet
and total space
We can find both types of spaces and which space the current person correspond too.

Why the hell have I noticed this just now?

Submitted pancake small and large, is it sufficient for qualification? Did not have time to do anything more.

>>59803589
The max is probably only like
log(N) space

>>59803593
you need 25 points

>>59803617
No, 30

>>59803589
I meant B sorry.

The tidy numbers one

File: 1489983703938.gif (2MB, 270x188px) Image search: [Google]

2MB, 270x188px

>>59803690
>tfw thought it was 25 and stopped there
>1 minute remaining

>ok done this tidy shit
>6 secs to run and subbmit

File: file.png (4KB, 310x42px) Image search: [Google]

4KB, 310x42px

>>59802793
Well I got it correct and it took no time to execute

>>59803690
>>59803707
Qualification Round 2017 - You need at least 25 points to advance to the Round 1s. Remember: the scoreboard assumes that you got all Large datasets right until they are judged at the end of the round, so if you're not sure, consider earning some more points just in case!

this was my pancake

public static int tally = 0;
public static int caseNum = 1;

static void Main(string[] args) {
    TextWriter tmp = Console.Out;
    StreamWriter sw = new StreamWriter(Console.OpenStandardOutput());
    Console.SetOut(sw);
    using (StreamReader stdinput = new StreamReader(Console.OpenStandardInput())) {
        string line;
        while ((line = stdinput.ReadLine()) != null) {
            var liner = line.Split(new[] { ' ' }, StringSplitOptions.RemoveEmptyEntries);
            var K = Convert.ToInt32(liner.ElementAt(liner.Length-1));
            var pancakes = string.Concat(liner.ElementAt(0));
            if (!pancakes.Any(char.IsDigit)) {
                while (pancakes != "IMPOSSIBLE" && pancakes != "END") {
                    pancakes = lineup(pancakes, K);
                }
                Console.WriteLine("Case #{0}: {1}", caseNum, pancakes == "IMPOSSIBLE" ? "IMPOSSIBLE" : tally.ToString());
                tally = 0;
                caseNum += 1;
            }
                   
        }
    }
    sw.Close();
}

static string lineup(string pancakes, int K) {
    if (pancakes.Length <= 0 || pancakes.Where(k => k == '-').Count() == 0) {
        return "END";
    }

    if (pancakes.Length < K) {
        return "IMPOSSIBLE";
    }

    if (pancakes.ElementAt(0) == '+') {
        return pancakes.Substring(1);
    }

    tally += 1;
    return flipup(pancakes.Substring(0, K)) + pancakes.Substring(K);
}

static string flipup(string pancakes) {
    return string.Concat(pancakes.Select(k => k == '+' ? '-' : '+').ToList());
}

Perl master race for pancakes

use strict;
use warnings;
my $T = <STDIN>;
my ($line, $steps, $temp, $K, @S);
for (my $case = 1; $case <= $T; $case++) {
  $steps = 0;
  $line = <STDIN>;
  @S = split(//, (split(/\s/, $line))[0]);
  $K = (split(/\s/, $line))[1];
  for (my $i = 0; $i < scalar(@S); $i++) {
    if ($S[$i] eq '-') {
      if (($i+$K) <= scalar(@S)) {
        $temp = $i+$K;
        for (my $j = $i; $j < $temp; $j++) {
          if ($S[$j] eq '-') {
            $S[$j] = '+';
          } else {
            $S[$j] = '-';
          }
        }
      } else { 
        $steps = "IMPOSSIBLE"; 
        last;
      }
      $steps++;
    }
  }
  printf("Case #%d: %s\n", $case, $steps);
}

>>59804090
The only other that I solved was the tidy numbers. I was too dumb for the rest.

#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>

#define LINE_SIZE 30

int main() {
  char line[LINE_SIZE];
  fgets(line, LINE_SIZE, stdin);
  int T = atoi(line);
  
  for (int nCase = 1; nCase <= T; nCase++) {
    fgets(line, LINE_SIZE, stdin);
    int ld;
    for (ld = 0; line[ld] != '\n' && line[ld] != '\t'; ld++);
    
    for (int h = 0; h < ld; h++) 
      for (int i = ld-1; i >= 0; i--) 
        for (int j = i; j >= 0; j--) 
          if (line[j] > line[i]) {
            line[i] = '9';
            if (h == 0)
              line[i-1] = (line[i-1])-1;
          }

    printf("Case #%d: %lli\n", nCase, atoll(line));
  }

  return 0;
}

>>59804144
but tidy large has int bigger than 32bit

>>59804156
I'm working the number as a string. I'm only converting to a "long long" to display it. Just to get rid of any leading zeroes.

Here are some solutions. I only really did the first 3 problems.

Here's a link to my solution for part A, the Pancakes one. The small data set completes in 0.002 seconds, the large one completes in 0.927 seconds.

https://pastebin.com/dSXDR9fp

Here's for part B, the tidy numbers one. Originally it took about 0.7 seconds for each number around 18 digits, but when I added a little memoization it reduced the time to compute each answer to about a millisecond. The small dataset completes in 0.003 seconds, and the large in 0.04 seconds.

https://pastebin.com/QPdepfUq

And for part C, the bathrooms. This one was actually really easy, I got it in 10 lines of code. I first tried an overly complicated solution involving trees, which was slow and horrible. Really all it is is dividing by 2 and checking if you get an odd or even number. The first small data set finished in 0.001 seconds, the second small set in 0.002 seconds, and the large data set takes 0.005 seconds.

https://pastebin.com/2ZTiLpnW

>>59802793
>Java
bait

>>59804638
It's actually C#

File: 1491582864778.jpg (506KB, 1197x1600px) Image search: [Google]

506KB, 1197x1600px

>>59795913
I wasn't told this would be a feels thread

>>59794954

Fuck can I still participate?

Rate my solution to B (C#)

using System;
using System.IO;
using System.Text;

namespace GoogleCodeJam2017.B
{
    class TidyNumbers
    {
        public static long FindTidy(long n)
        {
            while(IsNotTidy(n) != -1)
            {
                int i = IsNotTidy(n);
                int l = n.ToString("0").Length;
                string x = (long.Parse(n.ToString("0").Substring(0, i)) - 1).ToString("0");
                string y = ((long)(Math.Pow(10, l - i)) - 1).ToString("0");
                n = long.Parse(x + y);
            }
            return n;
        }

        public static int IsNotTidy(long n)
        {
            string s = n.ToString();
            for(int i = 0; i < s.Length-1; ++i)
            {
                if (s[i] > s[i + 1]) return i + 1;
            }
            return -1;
        }

        public static void ReadInput()
        {
            string filePath = @"\B-large-practice.";

            int T;
            long[] N;

            FileStream fileStream = new FileStream(filePath + "in", FileMode.Open);
            using (StreamReader reader = new StreamReader(fileStream))
            {
                T = int.Parse(reader.ReadLine());
                N = new long[T];

                string[] input = reader.ReadToEnd().Split('\n');

                for(int i = 0; i < input.Length-1; ++i)
                {
                    N[i] = long.Parse(input[i]);
                }
            }

            fileStream = new FileStream(filePath + "out", FileMode.Create);
            using (StreamWriter writer = new StreamWriter(fileStream))
            {
                for (int i = 0; i < N.Length; ++i)
                {
                    writer.WriteLine("Case #" + (i + 1) + ": " + FindTidy(N[i]));
                }
            }
                
        }
    }
}

>>59804875
I've noticed in C# you don't need to worry about stream readers. You can just do Console.ReadLines() and execute the program with the file as the args:

program-two.exe < B-large-practice.in > output.txt

>>59805028
Likewise, with console.writeline, if anything goes out to the console (stdout) you can just append it to a file. I never really thought about that but I've been doing it all the time with C and BASH.

>>59804426
I don't understand your tidy numbers solution at all.
How the fuck did you run thru 10^18 numbers in 0.04s?

>>59805249
>How the fuck did you run thru 10^18 numbers in 0.04s?
Not him, but I get an execution time of 0.001s for the large data set with my solution.

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

#define ASCII_ZERO 0x30
#define ASCII_NINE 0x39

int main(int argc, char **argv) {
    FILE *input_f = fopen("data.in", "r");
    FILE *output_f = fopen("data.out", "w");
    char buf[255];

    int t;
    fscanf(input_f, "%i\n", &t);

    for (int i=0; i<t; i++) {
        fscanf(input_f, "%s\n", buf); 
        
        int numlen = strlen(buf);
        char *num = malloc(numlen+1);
        memcpy(num, buf, numlen+1);

        //Search for previous highest tidy number
        for (int j=numlen-1; j>0; j--) {
            if (num[j] >= num[j-1])
                continue;

            num[j-1]--;
            for (int k=j; k<numlen; k++)
                num[k] = ASCII_NINE;
        }

        //Count leading zeros
        int zc = 0;
        for (int j=0; j<numlen-1; j++) {
            if (num[j] == ASCII_ZERO) {
                zc++;
            } else {
                break;
            }
        }
            
        fprintf(output_f, "Case #%i: %s\n", i+1, num+zc);
        free(num);
    }

    fclose(output_f);
    fclose(input_f);

    return 0;
}

>>59805249
It's not 10^18
It's just 18
you just have to solve the digits.
18^3 tops

File: 1483740563226.jpg (104KB, 428x428px) Image search: [Google]

104KB, 428x428px

>tfw scrolling through the leaderboards and checking out random pajeets' code

>>59805052
You can do the same thing in Bash with << > and >>
Piping operators are standard for pretty much all stdin/stdout operations on any language

>>59798356
because pajeets can't spell let alone pronounce something with that many syllables.

Where are the questions listed?

I want to do them but I don't want to enter

>>59805249
I don't run through many numbers at all actually. I just looked at the 3 "types" of tidy numbers that I could find and got them. The 3 types are either it starts out "tidy", the numbers to the left of the rightmost digit can be lowered to make it "tidy", or you subtract enough to make the rightmost number roll over to a 9. So really all my code does is do a little bit of computation for each digit, it doesn't matter that the number itself is something huge.

No, first year in awhile where I haven't participated.

Took on too many client (self-employed) without thinking some things through and working like 80+ hours a week. Money is good but I am stressed to shit. Few more weeks and one project will be done, hopefully.

>>59803516
fuck all that practice payed off. thank you /g

File: 2017-04-08-234501_932x185_scrot.png (12KB, 932x185px) Image search: [Google]

12KB, 932x185px

>tfw my shit takes too long
im pajeet, aren't i

>closed
REEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEE

HOW LONG WAS THE REGISTRATION OPEN

>>59805853
>haskell
no

>>59805962
It's not the registration that is closed, it is the qualification round.

>>59806519
But now I can't qualify so I can't compete, right?

>Participating in Google ScriptCaptcha botnet

You're doing it for free too, you guys are worse than Google's Indian department.

>>59806633
Yes, unfortunately.

File: GUvW23N.png (77KB, 694x801px) Image search: [Google]

77KB, 694x801px

>>59806718
>too dumb to solve any problem
>try to cover up with some senseless bs
It's a game. Calm down, sperggie. They don't give a shit about your code. There's nothing you can do that Google can't do a thousand times better.

>>59807038
Nice try, just like captcha was 'temporary' on 4chan and you had no contact with google at all, right google employee #12031 aka moot?

>doingitforfree.jpg

Even prostitutes have a better nosiness model than freetards.

Does anyone have a solution to D?

I couldn't figure it out because I am dumb.

Rate B solution

#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define ll long long
#define ull unsigned long long
#define FORE(x,val,to) for(auto x=(val);x<=(to);x++)
#define FORR(x,arr) for(auto &x: arr)
#define FORRC(x,arr) for(auto const &x: arr)
#define PRINT(arr) {copy((arr).begin(), (arr).end(), ostream_iterator<int>(cout, " "));cout<<'\n';}
#define REE(s_) {cout<<s_<<'\n';return 0;} //print s_ and terminate program
#define INF 2139062143 //127 in memset -> memset(arr,127,size)
#define SINF 1061109567 //Safe INF, for graphs or 2d arrays 63 in memset(arr,63,size)
#define LL_INF 7234017283807667300 //100 in memset(arr,100,size) !!!must be LL
#define whatis(x) cerr << #x << " is " << x << endl;
typedef std::pair<int,int> pi;
typedef std::vector<int> vi;
typedef std::vector<std::string> vs;
typedef std::vector<long long> vll;
typedef std::vector<std::vector<int> > vvi;
using namespace std;

template<class T> ostream& operator<<(ostream &os, vector<T> V) {
  os<<"[";for(auto const &vv:V)os<<vv<<","; os<<"]";
  return os;
}
template<class L, class R> ostream& operator<<(ostream &os, pair<L, R> P) {
  os<<"("<<P.first<<","<<P.second<<")";
  return os;
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    int t;
    cin >> t;
    FORE(i,1,t){
        string str;
        cin >> str;
        end:
        for(auto it = str.begin()+1; it != str.end(); ++it){
            if(*it < *(it-1)){
                if(it-1 == str.begin()){
                    if(*(it-1) == '1')
                        str = string(str.size()-1,'9');
                    else{
                        --str[0];
                        fill(str.begin()+1,str.end(),'9');
                    }
                }
                else{
                    --*(it-1);
                    fill(it,str.end(),'9');
                }
                goto end;
            }
        }
        cout << "Case #" << i << ": " << str << '\n';
    }
}

>>59807364
readability/10

>>59807038
there's no way anyones that fucking stupid to do sleep instead of just add that to cur date if they alreayd know how to do the math & get cur date

>>59802793
>>59803137
>>59803980
>>59804090
>>59804144
absolutely disgusting

import java.io.*;
import java.util.Scanner;

public class Main {

    public static void main(String[] args) throws IOException {
        Scanner scanner = new Scanner(new File("inputFile.txt"));
        PrintWriter output= new PrintWriter(new FileWriter("outputFile.txt"));
        int t = scanner.nextInt();
        int all = t;
        while(t-- > 0){
            StringBuffer pancakes = new StringBuffer(scanner.next());
            int k = scanner.nextInt(), flips = 0;
            for(int i = 0; i < pancakes.length()-k+1; i++){
                if(pancakes.charAt(i) == '-') {
                    flipCon(pancakes, i, k);
                    flips++;
                }
            }
            boolean good = true;
            for(int i = 0; i < pancakes.length() && good; i++){
                if (pancakes.charAt(i) == '-') good = false;
            }
            System.out.println(good ? flips : "IMPOSSIBLE");
            output.printf("Case #%d: %s\n", (all-t), good ? flips : "IMPOSSIBLE");
        }
        output.flush();
    }

    private static void flipCon(StringBuffer pancakes, int i, int k) {
        for(int j = i; j < i+k; j++)
            pancakes.setCharAt(j, pancakes.charAt(j) == '-' ? '+' : '-');
    }
}

>>59808002
>java
opinion discarded

>>59803422
> participate in code jam / gsoc
> get shirts
> never wear them because then they will fade and shit

Feels bad man.
They should send out like 3-5 shirts so I would use them at least.

>>59808754
post your rust solutions

>>59809366
What does the t-shirt you can win look like?

>>59807324
seems like a pretty basic greedy solution

Oh, registrations closed a month ago.

Any websites which I can follow to keep up with such programming competitors?

>>59805249
ever heard about dynamic programming?

>>59810976
Make an account on Codeforces and/or TopCoder.
These sites host nice 2 hour competitions every week or so

>>59802793
Yeah, you put the curly brackets on the wrong line.

>>59794954
I love how once they start breaking out some problems that require basic algorithm design theory people on /g/ will complain saying it's impossible

>>59813156
>expecting more from an abruzzian truffle collecting forum

>>59812969
Thanks :)